/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 15:26:42,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 15:26:42,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 15:26:42,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 15:26:42,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 15:26:42,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 15:26:42,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 15:26:42,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 15:26:42,933 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 15:26:42,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 15:26:42,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 15:26:42,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 15:26:42,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 15:26:42,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 15:26:42,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 15:26:42,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 15:26:42,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 15:26:42,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 15:26:42,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 15:26:42,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 15:26:42,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 15:26:42,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 15:26:42,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 15:26:42,966 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 15:26:42,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 15:26:42,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 15:26:42,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 15:26:42,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 15:26:42,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 15:26:42,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 15:26:42,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 15:26:42,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 15:26:42,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 15:26:42,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 15:26:42,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 15:26:42,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 15:26:42,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 15:26:42,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 15:26:42,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 15:26:42,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 15:26:42,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 15:26:42,999 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-09 15:26:43,026 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 15:26:43,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 15:26:43,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 15:26:43,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 15:26:43,028 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 15:26:43,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 15:26:43,029 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 15:26:43,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 15:26:43,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 15:26:43,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 15:26:43,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 15:26:43,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 15:26:43,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 15:26:43,030 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 15:26:43,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 15:26:43,030 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 15:26:43,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 15:26:43,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 15:26:43,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 15:26:43,031 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 15:26:43,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 15:26:43,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 15:26:43,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 15:26:43,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 15:26:43,032 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 15:26:43,033 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 15:26:43,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 15:26:43,033 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 15:26:43,033 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 15:26:43,033 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 15:26:43,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 15:26:43,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 15:26:43,366 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 15:26:43,368 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 15:26:43,368 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 15:26:43,369 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i [2020-10-09 15:26:43,442 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24af8b9e5/923168c015254349bc30faf921588c2c/FLAGfb9d9e4ef [2020-10-09 15:26:43,967 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 15:26:43,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i [2020-10-09 15:26:43,982 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24af8b9e5/923168c015254349bc30faf921588c2c/FLAGfb9d9e4ef [2020-10-09 15:26:44,267 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24af8b9e5/923168c015254349bc30faf921588c2c [2020-10-09 15:26:44,276 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 15:26:44,278 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 15:26:44,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 15:26:44,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 15:26:44,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 15:26:44,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 03:26:44" (1/1) ... [2020-10-09 15:26:44,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261a1dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 03:26:44, skipping insertion in model container [2020-10-09 15:26:44,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 03:26:44" (1/1) ... [2020-10-09 15:26:44,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 15:26:44,332 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 15:26:44,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 15:26:44,768 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 15:26:44,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 15:26:44,945 INFO L208 MainTranslator]: Completed translation [2020-10-09 15:26:44,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 03:26:44 WrapperNode [2020-10-09 15:26:44,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 15:26:44,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 15:26:44,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 15:26:44,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 15:26:44,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 03:26:44" (1/1) ... [2020-10-09 15:26:44,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 03:26:44" (1/1) ... [2020-10-09 15:26:45,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 15:26:45,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 15:26:45,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 15:26:45,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 15:26:45,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 03:26:44" (1/1) ... [2020-10-09 15:26:45,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 03:26:44" (1/1) ... [2020-10-09 15:26:45,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 03:26:44" (1/1) ... [2020-10-09 15:26:45,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 03:26:44" (1/1) ... [2020-10-09 15:26:45,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 03:26:44" (1/1) ... [2020-10-09 15:26:45,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 03:26:44" (1/1) ... [2020-10-09 15:26:45,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 03:26:44" (1/1) ... [2020-10-09 15:26:45,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 15:26:45,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 15:26:45,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 15:26:45,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 15:26:45,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 03:26:44" (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 [2020-10-09 15:26:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-10-09 15:26:45,124 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-10-09 15:26:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 15:26:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 15:26:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 15:26:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 15:26:45,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 15:26:45,126 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 15:26:45,527 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 15:26:45,528 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-10-09 15:26:45,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 03:26:45 BoogieIcfgContainer [2020-10-09 15:26:45,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 15:26:45,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 15:26:45,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 15:26:45,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 15:26:45,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 03:26:44" (1/3) ... [2020-10-09 15:26:45,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676ce7a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 03:26:45, skipping insertion in model container [2020-10-09 15:26:45,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 03:26:44" (2/3) ... [2020-10-09 15:26:45,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676ce7a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 03:26:45, skipping insertion in model container [2020-10-09 15:26:45,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 03:26:45" (3/3) ... [2020-10-09 15:26:45,539 INFO L111 eAbstractionObserver]: Analyzing ICFG 29_conditionals_vs.i [2020-10-09 15:26:45,550 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 15:26:45,558 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-09 15:26:45,559 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 15:26:45,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:45,616 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-10-09 15:26:45,636 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:26:45,636 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:26:45,636 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:26:45,637 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:26:45,637 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:26:45,637 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:26:45,637 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:26:45,637 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:26:45,647 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 42 places, 44 transitions, 93 flow [2020-10-09 15:26:45,677 INFO L129 PetriNetUnfolder]: 6/52 cut-off events. [2020-10-09 15:26:45,677 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 15:26:45,682 INFO L80 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 52 events. 6/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 35. Up to 4 conditions per place. [2020-10-09 15:26:45,683 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 44 transitions, 93 flow [2020-10-09 15:26:45,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 44 transitions, 93 flow [2020-10-09 15:26:45,697 INFO L129 PetriNetUnfolder]: 2/25 cut-off events. [2020-10-09 15:26:45,698 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 15:26:45,698 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:45,699 INFO L255 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:45,700 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-09 15:26:45,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:45,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1159639192, now seen corresponding path program 1 times [2020-10-09 15:26:45,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:45,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244296949] [2020-10-09 15:26:45,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:26:45,808 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:26:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:26:45,825 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:26:45,851 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:26:45,852 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:26:46,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 15:26:46,070 WARN L371 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:26:46,070 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-10-09 15:26:46,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,110 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-09 15:26:46,111 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:26:46,111 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:26:46,111 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:26:46,111 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:26:46,111 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:26:46,111 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:26:46,112 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:26:46,112 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:26:46,115 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 67 places, 71 transitions, 154 flow [2020-10-09 15:26:46,141 INFO L129 PetriNetUnfolder]: 11/88 cut-off events. [2020-10-09 15:26:46,142 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-09 15:26:46,143 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 11/88 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 164 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 61. Up to 6 conditions per place. [2020-10-09 15:26:46,144 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 71 transitions, 154 flow [2020-10-09 15:26:46,146 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 71 transitions, 154 flow [2020-10-09 15:26:46,158 INFO L129 PetriNetUnfolder]: 3/45 cut-off events. [2020-10-09 15:26:46,158 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-09 15:26:46,158 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:46,159 INFO L255 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:46,159 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:46,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:46,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1095889988, now seen corresponding path program 1 times [2020-10-09 15:26:46,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:46,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611599625] [2020-10-09 15:26:46,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:26:46,216 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:26:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:26:46,229 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:26:46,243 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:26:46,244 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:26:46,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 15:26:46,458 WARN L371 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:26:46,462 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-10-09 15:26:46,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,478 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,478 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,486 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,488 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,488 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,488 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,489 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,494 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,494 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,494 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,496 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,496 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,496 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,497 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,497 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,497 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,502 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,502 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,516 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-09 15:26:46,517 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:26:46,517 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:26:46,517 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:26:46,517 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:26:46,518 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:26:46,518 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:26:46,518 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:26:46,518 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:26:46,522 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 92 places, 98 transitions, 217 flow [2020-10-09 15:26:46,565 INFO L129 PetriNetUnfolder]: 16/124 cut-off events. [2020-10-09 15:26:46,566 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-09 15:26:46,568 INFO L80 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 124 events. 16/124 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 320 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 92. Up to 8 conditions per place. [2020-10-09 15:26:46,568 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 98 transitions, 217 flow [2020-10-09 15:26:46,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 98 transitions, 217 flow [2020-10-09 15:26:46,584 INFO L129 PetriNetUnfolder]: 5/69 cut-off events. [2020-10-09 15:26:46,584 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-09 15:26:46,584 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:46,585 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:46,585 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:46,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:46,585 INFO L82 PathProgramCache]: Analyzing trace with hash -285346251, now seen corresponding path program 1 times [2020-10-09 15:26:46,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:46,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749317807] [2020-10-09 15:26:46,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:26:46,646 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:26:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:26:46,660 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:26:46,677 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:26:46,677 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:26:46,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-09 15:26:46,889 WARN L371 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:26:46,889 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-10-09 15:26:46,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,915 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,915 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,915 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,926 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,927 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,927 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,929 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,929 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,929 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,929 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,929 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,929 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,930 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,930 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,930 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,930 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,930 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,930 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,931 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,931 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,931 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,931 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,931 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,931 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,931 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,932 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,932 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,932 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,932 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,932 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,932 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,933 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,933 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,933 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,933 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,933 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,940 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,942 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,942 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,943 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,943 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,947 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,947 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,948 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,948 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,949 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,955 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,956 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,956 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,956 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,956 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,958 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,959 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,959 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,960 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:46,966 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-09 15:26:46,967 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:26:46,967 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:26:46,967 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:26:46,967 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:26:46,967 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:26:46,967 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:26:46,967 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:26:46,967 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:26:46,973 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 117 places, 125 transitions, 282 flow [2020-10-09 15:26:47,027 INFO L129 PetriNetUnfolder]: 21/160 cut-off events. [2020-10-09 15:26:47,028 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:26:47,033 INFO L80 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 160 events. 21/160 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 483 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 134. Up to 10 conditions per place. [2020-10-09 15:26:47,034 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 125 transitions, 282 flow [2020-10-09 15:26:47,038 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 125 transitions, 282 flow [2020-10-09 15:26:47,064 INFO L129 PetriNetUnfolder]: 9/96 cut-off events. [2020-10-09 15:26:47,065 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:26:47,065 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:47,065 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:47,066 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-09 15:26:47,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:47,067 INFO L82 PathProgramCache]: Analyzing trace with hash 436446205, now seen corresponding path program 1 times [2020-10-09 15:26:47,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:47,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866935833] [2020-10-09 15:26:47,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:47,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:47,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:47,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:47,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:47,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866935833] [2020-10-09 15:26:47,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:47,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:47,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226146438] [2020-10-09 15:26:47,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:47,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:47,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:47,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:47,244 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 125 [2020-10-09 15:26:47,246 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 125 transitions, 282 flow. Second operand 3 states. [2020-10-09 15:26:47,246 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:47,246 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 125 [2020-10-09 15:26:47,248 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:47,289 INFO L129 PetriNetUnfolder]: 10/131 cut-off events. [2020-10-09 15:26:47,290 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:26:47,292 INFO L80 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 131 events. 10/131 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 367 event pairs, 0 based on Foata normal form. 18/133 useless extension candidates. Maximal degree in co-relation 117. Up to 5 conditions per place. [2020-10-09 15:26:47,294 INFO L132 encePairwiseOnDemand]: 116/125 looper letters, 5 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2020-10-09 15:26:47,295 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 116 transitions, 278 flow [2020-10-09 15:26:47,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:47,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2020-10-09 15:26:47,314 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9573333333333334 [2020-10-09 15:26:47,315 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2020-10-09 15:26:47,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2020-10-09 15:26:47,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:47,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2020-10-09 15:26:47,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:47,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:47,334 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:47,336 INFO L185 Difference]: Start difference. First operand has 117 places, 125 transitions, 282 flow. Second operand 3 states and 359 transitions. [2020-10-09 15:26:47,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 116 transitions, 278 flow [2020-10-09 15:26:47,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 116 transitions, 266 flow, removed 6 selfloop flow, removed 0 redundant places. [2020-10-09 15:26:47,348 INFO L241 Difference]: Finished difference. Result has 116 places, 116 transitions, 264 flow [2020-10-09 15:26:47,351 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=116, PETRI_TRANSITIONS=116} [2020-10-09 15:26:47,353 INFO L341 CegarLoopForPetriNet]: 117 programPoint places, -1 predicate places. [2020-10-09 15:26:47,353 INFO L481 AbstractCegarLoop]: Abstraction has has 116 places, 116 transitions, 264 flow [2020-10-09 15:26:47,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:47,353 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:47,353 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:47,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-09 15:26:47,566 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-09 15:26:47,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:47,567 INFO L82 PathProgramCache]: Analyzing trace with hash -169694013, now seen corresponding path program 1 times [2020-10-09 15:26:47,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:47,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295971176] [2020-10-09 15:26:47,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:26:47,619 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:26:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:26:47,634 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:26:47,654 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:26:47,654 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:26:47,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-09 15:26:47,866 WARN L371 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:26:47,866 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-10-09 15:26:47,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,880 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,888 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,888 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,907 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,907 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,920 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:47,922 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-09 15:26:47,922 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:26:47,922 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:26:47,923 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:26:47,923 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:26:47,923 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:26:47,923 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:26:47,923 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:26:47,923 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:26:47,925 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 142 places, 152 transitions, 349 flow [2020-10-09 15:26:47,953 INFO L129 PetriNetUnfolder]: 26/196 cut-off events. [2020-10-09 15:26:47,954 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:26:47,956 INFO L80 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 196 events. 26/196 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 635 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 177. Up to 12 conditions per place. [2020-10-09 15:26:47,957 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 152 transitions, 349 flow [2020-10-09 15:26:47,960 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 152 transitions, 349 flow [2020-10-09 15:26:47,972 INFO L129 PetriNetUnfolder]: 9/96 cut-off events. [2020-10-09 15:26:47,972 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:26:47,973 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:47,973 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:47,973 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:47,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:47,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1240717559, now seen corresponding path program 1 times [2020-10-09 15:26:47,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:47,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927580680] [2020-10-09 15:26:47,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:48,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:48,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:48,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:48,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:48,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927580680] [2020-10-09 15:26:48,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:48,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:48,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492964471] [2020-10-09 15:26:48,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:48,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:48,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:48,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:48,122 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 152 [2020-10-09 15:26:48,122 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 152 transitions, 349 flow. Second operand 3 states. [2020-10-09 15:26:48,123 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:48,123 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 152 [2020-10-09 15:26:48,123 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:48,160 INFO L129 PetriNetUnfolder]: 14/163 cut-off events. [2020-10-09 15:26:48,160 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:26:48,162 INFO L80 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 163 events. 14/163 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 504 event pairs, 0 based on Foata normal form. 28/170 useless extension candidates. Maximal degree in co-relation 160. Up to 9 conditions per place. [2020-10-09 15:26:48,164 INFO L132 encePairwiseOnDemand]: 140/152 looper letters, 10 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2020-10-09 15:26:48,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 143 transitions, 357 flow [2020-10-09 15:26:48,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:48,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2020-10-09 15:26:48,168 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9451754385964912 [2020-10-09 15:26:48,168 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2020-10-09 15:26:48,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2020-10-09 15:26:48,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:48,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2020-10-09 15:26:48,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:48,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:48,172 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:48,172 INFO L185 Difference]: Start difference. First operand has 142 places, 152 transitions, 349 flow. Second operand 3 states and 431 transitions. [2020-10-09 15:26:48,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 143 transitions, 357 flow [2020-10-09 15:26:48,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 143 transitions, 337 flow, removed 10 selfloop flow, removed 0 redundant places. [2020-10-09 15:26:48,178 INFO L241 Difference]: Finished difference. Result has 141 places, 143 transitions, 331 flow [2020-10-09 15:26:48,178 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=331, PETRI_PLACES=141, PETRI_TRANSITIONS=143} [2020-10-09 15:26:48,178 INFO L341 CegarLoopForPetriNet]: 142 programPoint places, -1 predicate places. [2020-10-09 15:26:48,178 INFO L481 AbstractCegarLoop]: Abstraction has has 141 places, 143 transitions, 331 flow [2020-10-09 15:26:48,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:48,179 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:48,179 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:48,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-09 15:26:48,387 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:48,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:48,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1239763224, now seen corresponding path program 1 times [2020-10-09 15:26:48,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:48,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454782167] [2020-10-09 15:26:48,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:48,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:48,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:48,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:48,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:48,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454782167] [2020-10-09 15:26:48,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:48,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:48,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079928448] [2020-10-09 15:26:48,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:48,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:48,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:48,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:48,483 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 152 [2020-10-09 15:26:48,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 143 transitions, 331 flow. Second operand 3 states. [2020-10-09 15:26:48,483 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:48,483 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 152 [2020-10-09 15:26:48,484 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:48,516 INFO L129 PetriNetUnfolder]: 12/161 cut-off events. [2020-10-09 15:26:48,516 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:26:48,518 INFO L80 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 161 events. 12/161 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 504 event pairs, 0 based on Foata normal form. 2/145 useless extension candidates. Maximal degree in co-relation 176. Up to 9 conditions per place. [2020-10-09 15:26:48,520 INFO L132 encePairwiseOnDemand]: 149/152 looper letters, 10 selfloop transitions, 1 changer transitions 0/141 dead transitions. [2020-10-09 15:26:48,520 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 141 transitions, 341 flow [2020-10-09 15:26:48,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2020-10-09 15:26:48,522 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9100877192982456 [2020-10-09 15:26:48,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2020-10-09 15:26:48,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2020-10-09 15:26:48,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:48,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2020-10-09 15:26:48,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:48,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:48,526 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:48,526 INFO L185 Difference]: Start difference. First operand has 141 places, 143 transitions, 331 flow. Second operand 3 states and 415 transitions. [2020-10-09 15:26:48,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 141 transitions, 341 flow [2020-10-09 15:26:48,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 141 transitions, 340 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:26:48,530 INFO L241 Difference]: Finished difference. Result has 142 places, 141 transitions, 320 flow [2020-10-09 15:26:48,531 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=142, PETRI_TRANSITIONS=141} [2020-10-09 15:26:48,532 INFO L341 CegarLoopForPetriNet]: 142 programPoint places, 0 predicate places. [2020-10-09 15:26:48,532 INFO L481 AbstractCegarLoop]: Abstraction has has 142 places, 141 transitions, 320 flow [2020-10-09 15:26:48,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:48,532 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:48,532 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:48,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-09 15:26:48,744 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:48,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:48,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1240716536, now seen corresponding path program 1 times [2020-10-09 15:26:48,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:48,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643915416] [2020-10-09 15:26:48,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:48,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:26:48,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:48,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:48,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643915416] [2020-10-09 15:26:48,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:48,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:48,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645500358] [2020-10-09 15:26:48,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:48,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:48,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:48,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:48,888 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 152 [2020-10-09 15:26:48,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 141 transitions, 320 flow. Second operand 3 states. [2020-10-09 15:26:48,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:48,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 152 [2020-10-09 15:26:48,889 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:48,921 INFO L129 PetriNetUnfolder]: 12/158 cut-off events. [2020-10-09 15:26:48,921 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2020-10-09 15:26:48,923 INFO L80 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 158 events. 12/158 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 477 event pairs, 0 based on Foata normal form. 1/143 useless extension candidates. Maximal degree in co-relation 169. Up to 6 conditions per place. [2020-10-09 15:26:48,925 INFO L132 encePairwiseOnDemand]: 150/152 looper letters, 4 selfloop transitions, 1 changer transitions 0/140 dead transitions. [2020-10-09 15:26:48,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 140 transitions, 326 flow [2020-10-09 15:26:48,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:48,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:48,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2020-10-09 15:26:48,927 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9342105263157895 [2020-10-09 15:26:48,928 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2020-10-09 15:26:48,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2020-10-09 15:26:48,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:48,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2020-10-09 15:26:48,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:48,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:48,930 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:48,930 INFO L185 Difference]: Start difference. First operand has 142 places, 141 transitions, 320 flow. Second operand 3 states and 426 transitions. [2020-10-09 15:26:48,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 140 transitions, 326 flow [2020-10-09 15:26:48,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 140 transitions, 323 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:26:48,935 INFO L241 Difference]: Finished difference. Result has 144 places, 140 transitions, 318 flow [2020-10-09 15:26:48,935 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=144, PETRI_TRANSITIONS=140} [2020-10-09 15:26:48,935 INFO L341 CegarLoopForPetriNet]: 142 programPoint places, 2 predicate places. [2020-10-09 15:26:48,935 INFO L481 AbstractCegarLoop]: Abstraction has has 144 places, 140 transitions, 318 flow [2020-10-09 15:26:48,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:48,936 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:48,936 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:49,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-09 15:26:49,149 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:49,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:49,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1239764247, now seen corresponding path program 1 times [2020-10-09 15:26:49,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:49,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582825269] [2020-10-09 15:26:49,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:49,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:49,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:49,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:49,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:49,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582825269] [2020-10-09 15:26:49,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:49,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:49,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633819209] [2020-10-09 15:26:49,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:49,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:49,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:49,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:49,248 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 152 [2020-10-09 15:26:49,248 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 140 transitions, 318 flow. Second operand 3 states. [2020-10-09 15:26:49,248 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:49,248 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 152 [2020-10-09 15:26:49,249 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:49,286 INFO L129 PetriNetUnfolder]: 12/155 cut-off events. [2020-10-09 15:26:49,286 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2020-10-09 15:26:49,288 INFO L80 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 155 events. 12/155 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 461 event pairs, 0 based on Foata normal form. 1/140 useless extension candidates. Maximal degree in co-relation 172. Up to 6 conditions per place. [2020-10-09 15:26:49,290 INFO L132 encePairwiseOnDemand]: 150/152 looper letters, 5 selfloop transitions, 1 changer transitions 0/138 dead transitions. [2020-10-09 15:26:49,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 138 transitions, 324 flow [2020-10-09 15:26:49,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2020-10-09 15:26:49,292 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9298245614035088 [2020-10-09 15:26:49,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2020-10-09 15:26:49,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2020-10-09 15:26:49,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:49,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2020-10-09 15:26:49,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:49,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:49,295 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:49,296 INFO L185 Difference]: Start difference. First operand has 144 places, 140 transitions, 318 flow. Second operand 3 states and 424 transitions. [2020-10-09 15:26:49,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 138 transitions, 324 flow [2020-10-09 15:26:49,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 138 transitions, 319 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:26:49,303 INFO L241 Difference]: Finished difference. Result has 142 places, 138 transitions, 312 flow [2020-10-09 15:26:49,303 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=142, PETRI_TRANSITIONS=138} [2020-10-09 15:26:49,304 INFO L341 CegarLoopForPetriNet]: 142 programPoint places, 0 predicate places. [2020-10-09 15:26:49,304 INFO L481 AbstractCegarLoop]: Abstraction has has 142 places, 138 transitions, 312 flow [2020-10-09 15:26:49,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:49,304 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:49,304 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:49,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-09 15:26:49,519 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:49,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:49,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2122476582, now seen corresponding path program 1 times [2020-10-09 15:26:49,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:49,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530682040] [2020-10-09 15:26:49,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:26:49,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:26:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:26:49,593 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:26:49,627 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:26:49,627 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:26:49,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-10-09 15:26:49,839 WARN L371 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:26:49,840 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2020-10-09 15:26:49,851 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,851 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,852 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,852 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,852 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,853 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,853 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,853 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,853 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,853 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,853 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,853 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,856 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,856 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,856 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,856 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,856 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,856 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,856 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,857 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,857 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,858 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,858 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,858 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,858 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,858 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,858 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,858 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,858 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,859 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,859 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,859 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,859 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,859 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,859 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,859 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,861 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,861 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,861 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,861 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,861 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,861 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,862 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,862 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,862 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,862 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,862 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,862 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,862 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,863 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,863 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,863 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,863 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,863 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,866 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,866 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,866 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,866 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,868 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,868 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,868 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,868 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,868 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,871 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,871 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,874 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,874 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,876 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,883 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,883 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,883 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,883 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,888 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,888 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:49,899 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-09 15:26:49,899 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:26:49,900 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:26:49,900 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:26:49,900 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:26:49,900 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:26:49,900 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:26:49,900 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:26:49,900 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:26:49,902 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 167 places, 179 transitions, 418 flow [2020-10-09 15:26:49,945 INFO L129 PetriNetUnfolder]: 31/232 cut-off events. [2020-10-09 15:26:49,945 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-09 15:26:49,949 INFO L80 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 232 events. 31/232 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 798 event pairs, 0 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 221. Up to 14 conditions per place. [2020-10-09 15:26:49,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 179 transitions, 418 flow [2020-10-09 15:26:49,953 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 179 transitions, 418 flow [2020-10-09 15:26:49,965 INFO L129 PetriNetUnfolder]: 9/95 cut-off events. [2020-10-09 15:26:49,965 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:26:49,965 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:49,965 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:49,965 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:49,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:49,966 INFO L82 PathProgramCache]: Analyzing trace with hash -643060719, now seen corresponding path program 1 times [2020-10-09 15:26:49,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:49,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562264756] [2020-10-09 15:26:49,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:50,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:50,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:50,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:50,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:50,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562264756] [2020-10-09 15:26:50,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:50,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:50,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408672955] [2020-10-09 15:26:50,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:50,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:50,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:50,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:50,091 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 179 [2020-10-09 15:26:50,092 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 179 transitions, 418 flow. Second operand 3 states. [2020-10-09 15:26:50,092 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:50,092 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 179 [2020-10-09 15:26:50,092 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:50,149 INFO L129 PetriNetUnfolder]: 16/189 cut-off events. [2020-10-09 15:26:50,150 INFO L130 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2020-10-09 15:26:50,153 INFO L80 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 189 events. 16/189 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 610 event pairs, 0 based on Foata normal form. 26/191 useless extension candidates. Maximal degree in co-relation 189. Up to 7 conditions per place. [2020-10-09 15:26:50,155 INFO L132 encePairwiseOnDemand]: 168/179 looper letters, 5 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2020-10-09 15:26:50,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 168 transitions, 410 flow [2020-10-09 15:26:50,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:50,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2020-10-09 15:26:50,158 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9664804469273743 [2020-10-09 15:26:50,158 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 519 transitions. [2020-10-09 15:26:50,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 519 transitions. [2020-10-09 15:26:50,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:50,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 519 transitions. [2020-10-09 15:26:50,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:50,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:50,161 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:50,162 INFO L185 Difference]: Start difference. First operand has 167 places, 179 transitions, 418 flow. Second operand 3 states and 519 transitions. [2020-10-09 15:26:50,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 168 transitions, 410 flow [2020-10-09 15:26:50,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 168 transitions, 380 flow, removed 15 selfloop flow, removed 0 redundant places. [2020-10-09 15:26:50,167 INFO L241 Difference]: Finished difference. Result has 166 places, 168 transitions, 378 flow [2020-10-09 15:26:50,167 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=378, PETRI_PLACES=166, PETRI_TRANSITIONS=168} [2020-10-09 15:26:50,168 INFO L341 CegarLoopForPetriNet]: 167 programPoint places, -1 predicate places. [2020-10-09 15:26:50,168 INFO L481 AbstractCegarLoop]: Abstraction has has 166 places, 168 transitions, 378 flow [2020-10-09 15:26:50,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:50,168 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:50,168 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:50,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-10-09 15:26:50,389 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:50,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:50,390 INFO L82 PathProgramCache]: Analyzing trace with hash -642107407, now seen corresponding path program 1 times [2020-10-09 15:26:50,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:50,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849002104] [2020-10-09 15:26:50,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:50,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:50,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:50,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:50,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849002104] [2020-10-09 15:26:50,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:50,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:50,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324489431] [2020-10-09 15:26:50,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:50,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:50,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:50,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:50,524 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 179 [2020-10-09 15:26:50,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 168 transitions, 378 flow. Second operand 3 states. [2020-10-09 15:26:50,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:50,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 179 [2020-10-09 15:26:50,526 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:50,559 INFO L129 PetriNetUnfolder]: 16/188 cut-off events. [2020-10-09 15:26:50,559 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2020-10-09 15:26:50,563 INFO L80 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 188 events. 16/188 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 601 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 205. Up to 8 conditions per place. [2020-10-09 15:26:50,565 INFO L132 encePairwiseOnDemand]: 175/179 looper letters, 9 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2020-10-09 15:26:50,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 168 transitions, 400 flow [2020-10-09 15:26:50,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2020-10-09 15:26:50,568 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9180633147113594 [2020-10-09 15:26:50,568 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 493 transitions. [2020-10-09 15:26:50,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions. [2020-10-09 15:26:50,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:50,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions. [2020-10-09 15:26:50,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:50,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:50,571 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:50,571 INFO L185 Difference]: Start difference. First operand has 166 places, 168 transitions, 378 flow. Second operand 3 states and 493 transitions. [2020-10-09 15:26:50,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 168 transitions, 400 flow [2020-10-09 15:26:50,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 168 transitions, 398 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:26:50,575 INFO L241 Difference]: Finished difference. Result has 169 places, 168 transitions, 388 flow [2020-10-09 15:26:50,576 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=169, PETRI_TRANSITIONS=168} [2020-10-09 15:26:50,576 INFO L341 CegarLoopForPetriNet]: 167 programPoint places, 2 predicate places. [2020-10-09 15:26:50,576 INFO L481 AbstractCegarLoop]: Abstraction has has 169 places, 168 transitions, 388 flow [2020-10-09 15:26:50,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:50,576 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:50,576 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:50,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-10-09 15:26:50,791 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:50,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:50,792 INFO L82 PathProgramCache]: Analyzing trace with hash -642108430, now seen corresponding path program 1 times [2020-10-09 15:26:50,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:50,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789472425] [2020-10-09 15:26:50,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:50,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:26:50,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:50,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:50,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:50,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:50,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789472425] [2020-10-09 15:26:50,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:50,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:50,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187844252] [2020-10-09 15:26:50,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:50,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:50,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:50,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:50,909 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 179 [2020-10-09 15:26:50,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 168 transitions, 388 flow. Second operand 3 states. [2020-10-09 15:26:50,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:50,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 179 [2020-10-09 15:26:50,910 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:50,943 INFO L129 PetriNetUnfolder]: 15/186 cut-off events. [2020-10-09 15:26:50,943 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2020-10-09 15:26:50,947 INFO L80 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 186 events. 15/186 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 593 event pairs, 0 based on Foata normal form. 1/167 useless extension candidates. Maximal degree in co-relation 203. Up to 7 conditions per place. [2020-10-09 15:26:50,949 INFO L132 encePairwiseOnDemand]: 177/179 looper letters, 4 selfloop transitions, 1 changer transitions 0/166 dead transitions. [2020-10-09 15:26:50,949 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 166 transitions, 389 flow [2020-10-09 15:26:50,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:50,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:50,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2020-10-09 15:26:50,952 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9385474860335196 [2020-10-09 15:26:50,952 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2020-10-09 15:26:50,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2020-10-09 15:26:50,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:50,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2020-10-09 15:26:50,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:50,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:50,955 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:50,956 INFO L185 Difference]: Start difference. First operand has 169 places, 168 transitions, 388 flow. Second operand 3 states and 504 transitions. [2020-10-09 15:26:50,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 166 transitions, 389 flow [2020-10-09 15:26:50,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 166 transitions, 383 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-09 15:26:50,960 INFO L241 Difference]: Finished difference. Result has 169 places, 166 transitions, 375 flow [2020-10-09 15:26:50,960 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=375, PETRI_PLACES=169, PETRI_TRANSITIONS=166} [2020-10-09 15:26:50,961 INFO L341 CegarLoopForPetriNet]: 167 programPoint places, 2 predicate places. [2020-10-09 15:26:50,961 INFO L481 AbstractCegarLoop]: Abstraction has has 169 places, 166 transitions, 375 flow [2020-10-09 15:26:50,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:50,961 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:50,961 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:51,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-10-09 15:26:51,175 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:51,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:51,175 INFO L82 PathProgramCache]: Analyzing trace with hash -643061742, now seen corresponding path program 1 times [2020-10-09 15:26:51,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:51,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017797706] [2020-10-09 15:26:51,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:51,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:51,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:51,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:51,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017797706] [2020-10-09 15:26:51,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:51,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:51,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20188466] [2020-10-09 15:26:51,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:51,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:51,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:51,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:51,294 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 179 [2020-10-09 15:26:51,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 166 transitions, 375 flow. Second operand 3 states. [2020-10-09 15:26:51,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:51,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 179 [2020-10-09 15:26:51,295 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:51,325 INFO L129 PetriNetUnfolder]: 15/184 cut-off events. [2020-10-09 15:26:51,325 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2020-10-09 15:26:51,328 INFO L80 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 184 events. 15/184 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 579 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 209. Up to 8 conditions per place. [2020-10-09 15:26:51,330 INFO L132 encePairwiseOnDemand]: 177/179 looper letters, 8 selfloop transitions, 1 changer transitions 0/164 dead transitions. [2020-10-09 15:26:51,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 164 transitions, 387 flow [2020-10-09 15:26:51,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2020-10-09 15:26:51,332 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9124767225325885 [2020-10-09 15:26:51,332 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 490 transitions. [2020-10-09 15:26:51,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 490 transitions. [2020-10-09 15:26:51,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:51,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 490 transitions. [2020-10-09 15:26:51,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:51,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:51,335 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:51,335 INFO L185 Difference]: Start difference. First operand has 169 places, 166 transitions, 375 flow. Second operand 3 states and 490 transitions. [2020-10-09 15:26:51,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 164 transitions, 387 flow [2020-10-09 15:26:51,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 164 transitions, 386 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:26:51,339 INFO L241 Difference]: Finished difference. Result has 168 places, 164 transitions, 370 flow [2020-10-09 15:26:51,340 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=370, PETRI_PLACES=168, PETRI_TRANSITIONS=164} [2020-10-09 15:26:51,340 INFO L341 CegarLoopForPetriNet]: 167 programPoint places, 1 predicate places. [2020-10-09 15:26:51,340 INFO L481 AbstractCegarLoop]: Abstraction has has 168 places, 164 transitions, 370 flow [2020-10-09 15:26:51,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:51,340 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:51,341 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:26:51,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-10-09 15:26:51,552 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:51,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:51,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1224011607, now seen corresponding path program 1 times [2020-10-09 15:26:51,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:51,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916750158] [2020-10-09 15:26:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:51,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:51,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:26:51,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:26:51,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916750158] [2020-10-09 15:26:51,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:51,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:51,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575220341] [2020-10-09 15:26:51,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:51,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:51,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:51,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:51,689 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 179 [2020-10-09 15:26:51,689 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 164 transitions, 370 flow. Second operand 3 states. [2020-10-09 15:26:51,689 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:51,689 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 179 [2020-10-09 15:26:51,690 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:51,722 INFO L129 PetriNetUnfolder]: 14/192 cut-off events. [2020-10-09 15:26:51,723 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-09 15:26:51,726 INFO L80 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 192 events. 14/192 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 650 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 220. Up to 9 conditions per place. [2020-10-09 15:26:51,728 INFO L132 encePairwiseOnDemand]: 174/179 looper letters, 10 selfloop transitions, 3 changer transitions 0/166 dead transitions. [2020-10-09 15:26:51,728 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 166 transitions, 400 flow [2020-10-09 15:26:51,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2020-10-09 15:26:51,730 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9217877094972067 [2020-10-09 15:26:51,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 495 transitions. [2020-10-09 15:26:51,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 495 transitions. [2020-10-09 15:26:51,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:51,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 495 transitions. [2020-10-09 15:26:51,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:51,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:51,733 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:51,733 INFO L185 Difference]: Start difference. First operand has 168 places, 164 transitions, 370 flow. Second operand 3 states and 495 transitions. [2020-10-09 15:26:51,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 166 transitions, 400 flow [2020-10-09 15:26:51,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 166 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:26:51,737 INFO L241 Difference]: Finished difference. Result has 171 places, 166 transitions, 393 flow [2020-10-09 15:26:51,738 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=171, PETRI_TRANSITIONS=166} [2020-10-09 15:26:51,739 INFO L341 CegarLoopForPetriNet]: 167 programPoint places, 4 predicate places. [2020-10-09 15:26:51,739 INFO L481 AbstractCegarLoop]: Abstraction has has 171 places, 166 transitions, 393 flow [2020-10-09 15:26:51,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:51,739 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:51,739 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:26:51,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-10-09 15:26:51,951 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:51,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:51,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1224012630, now seen corresponding path program 1 times [2020-10-09 15:26:51,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:51,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686927110] [2020-10-09 15:26:51,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:52,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:26:52,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:26:52,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:26:52,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686927110] [2020-10-09 15:26:52,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:52,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:52,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618174854] [2020-10-09 15:26:52,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:52,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:52,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:52,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:52,064 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 179 [2020-10-09 15:26:52,065 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 166 transitions, 393 flow. Second operand 3 states. [2020-10-09 15:26:52,065 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:52,065 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 179 [2020-10-09 15:26:52,066 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:52,096 INFO L129 PetriNetUnfolder]: 12/193 cut-off events. [2020-10-09 15:26:52,096 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 15:26:52,099 INFO L80 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 193 events. 12/193 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 674 event pairs, 0 based on Foata normal form. 1/177 useless extension candidates. Maximal degree in co-relation 218. Up to 7 conditions per place. [2020-10-09 15:26:52,101 INFO L132 encePairwiseOnDemand]: 177/179 looper letters, 4 selfloop transitions, 1 changer transitions 0/165 dead transitions. [2020-10-09 15:26:52,101 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 165 transitions, 399 flow [2020-10-09 15:26:52,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2020-10-09 15:26:52,103 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9385474860335196 [2020-10-09 15:26:52,103 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2020-10-09 15:26:52,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2020-10-09 15:26:52,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:52,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2020-10-09 15:26:52,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:52,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:52,107 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:52,107 INFO L185 Difference]: Start difference. First operand has 171 places, 166 transitions, 393 flow. Second operand 3 states and 504 transitions. [2020-10-09 15:26:52,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 165 transitions, 399 flow [2020-10-09 15:26:52,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 165 transitions, 394 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:26:52,111 INFO L241 Difference]: Finished difference. Result has 173 places, 165 transitions, 389 flow [2020-10-09 15:26:52,112 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=173, PETRI_TRANSITIONS=165} [2020-10-09 15:26:52,112 INFO L341 CegarLoopForPetriNet]: 167 programPoint places, 6 predicate places. [2020-10-09 15:26:52,112 INFO L481 AbstractCegarLoop]: Abstraction has has 173 places, 165 transitions, 389 flow [2020-10-09 15:26:52,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:52,113 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:52,113 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:26:52,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-10-09 15:26:52,334 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:52,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:52,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1224964919, now seen corresponding path program 1 times [2020-10-09 15:26:52,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:52,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718965729] [2020-10-09 15:26:52,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:52,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:52,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:26:52,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:26:52,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718965729] [2020-10-09 15:26:52,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:52,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:52,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463845079] [2020-10-09 15:26:52,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:52,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:52,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:52,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:52,422 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 179 [2020-10-09 15:26:52,422 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 165 transitions, 389 flow. Second operand 3 states. [2020-10-09 15:26:52,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:52,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 179 [2020-10-09 15:26:52,423 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:52,454 INFO L129 PetriNetUnfolder]: 12/186 cut-off events. [2020-10-09 15:26:52,454 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 15:26:52,457 INFO L80 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 186 events. 12/186 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 614 event pairs, 0 based on Foata normal form. 1/170 useless extension candidates. Maximal degree in co-relation 215. Up to 7 conditions per place. [2020-10-09 15:26:52,459 INFO L132 encePairwiseOnDemand]: 177/179 looper letters, 5 selfloop transitions, 1 changer transitions 0/163 dead transitions. [2020-10-09 15:26:52,459 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 163 transitions, 392 flow [2020-10-09 15:26:52,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2020-10-09 15:26:52,461 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9348230912476723 [2020-10-09 15:26:52,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2020-10-09 15:26:52,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2020-10-09 15:26:52,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:52,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2020-10-09 15:26:52,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:52,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:52,464 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:52,464 INFO L185 Difference]: Start difference. First operand has 173 places, 165 transitions, 389 flow. Second operand 3 states and 502 transitions. [2020-10-09 15:26:52,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 163 transitions, 392 flow [2020-10-09 15:26:52,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 163 transitions, 385 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:26:52,468 INFO L241 Difference]: Finished difference. Result has 173 places, 163 transitions, 378 flow [2020-10-09 15:26:52,468 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=378, PETRI_PLACES=173, PETRI_TRANSITIONS=163} [2020-10-09 15:26:52,468 INFO L341 CegarLoopForPetriNet]: 167 programPoint places, 6 predicate places. [2020-10-09 15:26:52,469 INFO L481 AbstractCegarLoop]: Abstraction has has 173 places, 163 transitions, 378 flow [2020-10-09 15:26:52,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:52,469 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:52,469 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:26:52,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-10-09 15:26:52,679 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:52,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:52,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1224965942, now seen corresponding path program 1 times [2020-10-09 15:26:52,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:52,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535341801] [2020-10-09 15:26:52,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:52,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:52,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:52,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:26:52,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:52,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:26:52,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535341801] [2020-10-09 15:26:52,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:52,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:52,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741766330] [2020-10-09 15:26:52,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:52,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:52,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:52,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:52,787 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 179 [2020-10-09 15:26:52,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 163 transitions, 378 flow. Second operand 3 states. [2020-10-09 15:26:52,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:52,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 179 [2020-10-09 15:26:52,788 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:52,837 INFO L129 PetriNetUnfolder]: 12/184 cut-off events. [2020-10-09 15:26:52,838 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2020-10-09 15:26:52,840 INFO L80 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 184 events. 12/184 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 602 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 215. Up to 8 conditions per place. [2020-10-09 15:26:52,842 INFO L132 encePairwiseOnDemand]: 177/179 looper letters, 8 selfloop transitions, 1 changer transitions 0/161 dead transitions. [2020-10-09 15:26:52,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 161 transitions, 391 flow [2020-10-09 15:26:52,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:52,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:52,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2020-10-09 15:26:52,844 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9124767225325885 [2020-10-09 15:26:52,844 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 490 transitions. [2020-10-09 15:26:52,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 490 transitions. [2020-10-09 15:26:52,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:52,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 490 transitions. [2020-10-09 15:26:52,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:52,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:52,847 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:52,847 INFO L185 Difference]: Start difference. First operand has 173 places, 163 transitions, 378 flow. Second operand 3 states and 490 transitions. [2020-10-09 15:26:52,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 161 transitions, 391 flow [2020-10-09 15:26:52,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 161 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:26:52,851 INFO L241 Difference]: Finished difference. Result has 172 places, 161 transitions, 374 flow [2020-10-09 15:26:52,851 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=172, PETRI_TRANSITIONS=161} [2020-10-09 15:26:52,851 INFO L341 CegarLoopForPetriNet]: 167 programPoint places, 5 predicate places. [2020-10-09 15:26:52,852 INFO L481 AbstractCegarLoop]: Abstraction has has 172 places, 161 transitions, 374 flow [2020-10-09 15:26:52,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:52,852 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:52,852 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:53,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2020-10-09 15:26:53,063 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:53,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:53,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1440051486, now seen corresponding path program 1 times [2020-10-09 15:26:53,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:53,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922987489] [2020-10-09 15:26:53,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:26:53,129 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:26:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:26:53,145 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:26:53,175 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:26:53,175 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:26:53,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2020-10-09 15:26:53,376 WARN L371 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:26:53,377 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2020-10-09 15:26:53,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,399 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,399 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,399 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,399 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,402 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,402 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,402 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,402 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,403 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,403 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,403 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,403 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,403 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,412 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,412 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,412 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,420 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,421 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,421 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,421 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,423 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,423 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,425 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,425 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,425 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,426 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,426 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,426 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,428 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,431 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,431 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,431 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,432 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,432 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,434 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,434 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,434 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,435 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,435 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,435 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,436 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,437 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,437 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,437 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,437 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,441 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,442 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,442 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,442 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,443 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,443 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:53,444 INFO L253 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-10-09 15:26:53,444 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:26:53,444 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:26:53,444 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:26:53,444 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:26:53,444 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:26:53,445 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:26:53,445 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:26:53,445 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:26:53,446 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 192 places, 206 transitions, 489 flow [2020-10-09 15:26:53,480 INFO L129 PetriNetUnfolder]: 36/268 cut-off events. [2020-10-09 15:26:53,480 INFO L130 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2020-10-09 15:26:53,485 INFO L80 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 268 events. 36/268 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 966 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 266. Up to 16 conditions per place. [2020-10-09 15:26:53,485 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 206 transitions, 489 flow [2020-10-09 15:26:53,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 192 places, 206 transitions, 489 flow [2020-10-09 15:26:53,497 INFO L129 PetriNetUnfolder]: 9/96 cut-off events. [2020-10-09 15:26:53,497 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:26:53,497 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:53,497 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:53,497 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:53,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:53,497 INFO L82 PathProgramCache]: Analyzing trace with hash -289312532, now seen corresponding path program 1 times [2020-10-09 15:26:53,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:53,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161043994] [2020-10-09 15:26:53,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:53,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:53,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:53,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:53,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161043994] [2020-10-09 15:26:53,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:53,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:53,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917159095] [2020-10-09 15:26:53,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:53,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:53,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:53,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:53,628 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 206 [2020-10-09 15:26:53,628 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 206 transitions, 489 flow. Second operand 3 states. [2020-10-09 15:26:53,628 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:53,628 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 206 [2020-10-09 15:26:53,628 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:53,667 INFO L129 PetriNetUnfolder]: 20/221 cut-off events. [2020-10-09 15:26:53,667 INFO L130 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2020-10-09 15:26:53,671 INFO L80 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 221 events. 20/221 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 751 event pairs, 0 based on Foata normal form. 36/228 useless extension candidates. Maximal degree in co-relation 231. Up to 9 conditions per place. [2020-10-09 15:26:53,674 INFO L132 encePairwiseOnDemand]: 192/206 looper letters, 10 selfloop transitions, 3 changer transitions 0/195 dead transitions. [2020-10-09 15:26:53,674 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 195 transitions, 493 flow [2020-10-09 15:26:53,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:53,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2020-10-09 15:26:53,677 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9563106796116505 [2020-10-09 15:26:53,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 591 transitions. [2020-10-09 15:26:53,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions. [2020-10-09 15:26:53,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:53,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions. [2020-10-09 15:26:53,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:53,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:53,680 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:53,680 INFO L185 Difference]: Start difference. First operand has 192 places, 206 transitions, 489 flow. Second operand 3 states and 591 transitions. [2020-10-09 15:26:53,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 195 transitions, 493 flow [2020-10-09 15:26:53,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 195 transitions, 451 flow, removed 21 selfloop flow, removed 0 redundant places. [2020-10-09 15:26:53,685 INFO L241 Difference]: Finished difference. Result has 191 places, 195 transitions, 445 flow [2020-10-09 15:26:53,685 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=191, PETRI_TRANSITIONS=195} [2020-10-09 15:26:53,685 INFO L341 CegarLoopForPetriNet]: 192 programPoint places, -1 predicate places. [2020-10-09 15:26:53,685 INFO L481 AbstractCegarLoop]: Abstraction has has 191 places, 195 transitions, 445 flow [2020-10-09 15:26:53,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:53,686 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:53,686 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:53,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2020-10-09 15:26:53,897 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:53,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:53,897 INFO L82 PathProgramCache]: Analyzing trace with hash -288359220, now seen corresponding path program 1 times [2020-10-09 15:26:53,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:53,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505496467] [2020-10-09 15:26:53,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:53,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:26:53,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:53,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:53,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:53,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505496467] [2020-10-09 15:26:53,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:53,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:53,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045167592] [2020-10-09 15:26:53,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:53,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:53,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:53,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:53,997 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 206 [2020-10-09 15:26:53,998 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 195 transitions, 445 flow. Second operand 3 states. [2020-10-09 15:26:53,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:53,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 206 [2020-10-09 15:26:53,999 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:54,025 INFO L129 PetriNetUnfolder]: 18/218 cut-off events. [2020-10-09 15:26:54,026 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2020-10-09 15:26:54,029 INFO L80 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 218 events. 18/218 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 740 event pairs, 0 based on Foata normal form. 1/195 useless extension candidates. Maximal degree in co-relation 231. Up to 8 conditions per place. [2020-10-09 15:26:54,031 INFO L132 encePairwiseOnDemand]: 204/206 looper letters, 4 selfloop transitions, 1 changer transitions 0/193 dead transitions. [2020-10-09 15:26:54,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 193 transitions, 445 flow [2020-10-09 15:26:54,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:54,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2020-10-09 15:26:54,033 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.941747572815534 [2020-10-09 15:26:54,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 582 transitions. [2020-10-09 15:26:54,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 582 transitions. [2020-10-09 15:26:54,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:54,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 582 transitions. [2020-10-09 15:26:54,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:54,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:54,036 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:54,036 INFO L185 Difference]: Start difference. First operand has 191 places, 195 transitions, 445 flow. Second operand 3 states and 582 transitions. [2020-10-09 15:26:54,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 193 transitions, 445 flow [2020-10-09 15:26:54,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 193 transitions, 441 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:26:54,041 INFO L241 Difference]: Finished difference. Result has 193 places, 193 transitions, 436 flow [2020-10-09 15:26:54,042 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=436, PETRI_PLACES=193, PETRI_TRANSITIONS=193} [2020-10-09 15:26:54,042 INFO L341 CegarLoopForPetriNet]: 192 programPoint places, 1 predicate places. [2020-10-09 15:26:54,042 INFO L481 AbstractCegarLoop]: Abstraction has has 193 places, 193 transitions, 436 flow [2020-10-09 15:26:54,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:54,042 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:54,042 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:54,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2020-10-09 15:26:54,253 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:54,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:54,253 INFO L82 PathProgramCache]: Analyzing trace with hash -288358197, now seen corresponding path program 1 times [2020-10-09 15:26:54,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:54,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239957622] [2020-10-09 15:26:54,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:54,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:54,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:54,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:54,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:54,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239957622] [2020-10-09 15:26:54,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:54,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:54,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763316273] [2020-10-09 15:26:54,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:54,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:54,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:54,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:54,385 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 206 [2020-10-09 15:26:54,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 193 transitions, 436 flow. Second operand 3 states. [2020-10-09 15:26:54,386 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:54,386 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 206 [2020-10-09 15:26:54,387 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:54,437 INFO L129 PetriNetUnfolder]: 18/216 cut-off events. [2020-10-09 15:26:54,437 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-09 15:26:54,439 INFO L80 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 216 events. 18/216 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 723 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 244. Up to 9 conditions per place. [2020-10-09 15:26:54,441 INFO L132 encePairwiseOnDemand]: 204/206 looper letters, 9 selfloop transitions, 1 changer transitions 0/192 dead transitions. [2020-10-09 15:26:54,441 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 192 transitions, 451 flow [2020-10-09 15:26:54,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions. [2020-10-09 15:26:54,443 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9207119741100324 [2020-10-09 15:26:54,443 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 569 transitions. [2020-10-09 15:26:54,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 569 transitions. [2020-10-09 15:26:54,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:54,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 569 transitions. [2020-10-09 15:26:54,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:54,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:54,447 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:54,447 INFO L185 Difference]: Start difference. First operand has 193 places, 193 transitions, 436 flow. Second operand 3 states and 569 transitions. [2020-10-09 15:26:54,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 192 transitions, 451 flow [2020-10-09 15:26:54,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 192 transitions, 450 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:26:54,451 INFO L241 Difference]: Finished difference. Result has 194 places, 192 transitions, 432 flow [2020-10-09 15:26:54,451 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=194, PETRI_TRANSITIONS=192} [2020-10-09 15:26:54,452 INFO L341 CegarLoopForPetriNet]: 192 programPoint places, 2 predicate places. [2020-10-09 15:26:54,452 INFO L481 AbstractCegarLoop]: Abstraction has has 194 places, 192 transitions, 432 flow [2020-10-09 15:26:54,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:54,452 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:54,452 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:54,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2020-10-09 15:26:54,658 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:54,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:54,658 INFO L82 PathProgramCache]: Analyzing trace with hash -289311509, now seen corresponding path program 1 times [2020-10-09 15:26:54,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:54,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573890669] [2020-10-09 15:26:54,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:54,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:54,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:54,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:54,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573890669] [2020-10-09 15:26:54,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:54,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:54,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792183399] [2020-10-09 15:26:54,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:54,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:54,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:54,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:54,758 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 206 [2020-10-09 15:26:54,758 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 192 transitions, 432 flow. Second operand 3 states. [2020-10-09 15:26:54,758 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:54,759 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 206 [2020-10-09 15:26:54,759 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:54,788 INFO L129 PetriNetUnfolder]: 18/213 cut-off events. [2020-10-09 15:26:54,788 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2020-10-09 15:26:54,791 INFO L80 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 213 events. 18/213 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 705 event pairs, 0 based on Foata normal form. 1/190 useless extension candidates. Maximal degree in co-relation 234. Up to 8 conditions per place. [2020-10-09 15:26:54,793 INFO L132 encePairwiseOnDemand]: 204/206 looper letters, 5 selfloop transitions, 1 changer transitions 0/190 dead transitions. [2020-10-09 15:26:54,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 190 transitions, 438 flow [2020-10-09 15:26:54,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:54,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2020-10-09 15:26:54,795 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9385113268608414 [2020-10-09 15:26:54,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 580 transitions. [2020-10-09 15:26:54,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions. [2020-10-09 15:26:54,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:54,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions. [2020-10-09 15:26:54,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:54,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:54,798 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:54,798 INFO L185 Difference]: Start difference. First operand has 194 places, 192 transitions, 432 flow. Second operand 3 states and 580 transitions. [2020-10-09 15:26:54,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 190 transitions, 438 flow [2020-10-09 15:26:54,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 190 transitions, 434 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-09 15:26:54,803 INFO L241 Difference]: Finished difference. Result has 193 places, 190 transitions, 427 flow [2020-10-09 15:26:54,803 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=427, PETRI_PLACES=193, PETRI_TRANSITIONS=190} [2020-10-09 15:26:54,803 INFO L341 CegarLoopForPetriNet]: 192 programPoint places, 1 predicate places. [2020-10-09 15:26:54,804 INFO L481 AbstractCegarLoop]: Abstraction has has 193 places, 190 transitions, 427 flow [2020-10-09 15:26:54,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:54,804 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:54,804 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:26:55,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2020-10-09 15:26:55,015 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:55,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:55,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1943630274, now seen corresponding path program 1 times [2020-10-09 15:26:55,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:55,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418732967] [2020-10-09 15:26:55,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:55,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:55,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:26:55,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:26:55,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418732967] [2020-10-09 15:26:55,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:55,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:55,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862906518] [2020-10-09 15:26:55,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:55,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:55,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:55,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:55,146 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 206 [2020-10-09 15:26:55,147 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 190 transitions, 427 flow. Second operand 3 states. [2020-10-09 15:26:55,147 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:55,147 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 206 [2020-10-09 15:26:55,147 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:55,179 INFO L129 PetriNetUnfolder]: 17/221 cut-off events. [2020-10-09 15:26:55,179 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2020-10-09 15:26:55,182 INFO L80 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 221 events. 17/221 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 775 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 254. Up to 9 conditions per place. [2020-10-09 15:26:55,184 INFO L132 encePairwiseOnDemand]: 201/206 looper letters, 10 selfloop transitions, 3 changer transitions 0/192 dead transitions. [2020-10-09 15:26:55,184 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 192 transitions, 457 flow [2020-10-09 15:26:55,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:55,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:55,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2020-10-09 15:26:55,187 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9271844660194175 [2020-10-09 15:26:55,187 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 573 transitions. [2020-10-09 15:26:55,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 573 transitions. [2020-10-09 15:26:55,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:55,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 573 transitions. [2020-10-09 15:26:55,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:55,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:55,190 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:55,190 INFO L185 Difference]: Start difference. First operand has 193 places, 190 transitions, 427 flow. Second operand 3 states and 573 transitions. [2020-10-09 15:26:55,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 192 transitions, 457 flow [2020-10-09 15:26:55,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 192 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:26:55,194 INFO L241 Difference]: Finished difference. Result has 196 places, 192 transitions, 450 flow [2020-10-09 15:26:55,195 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=196, PETRI_TRANSITIONS=192} [2020-10-09 15:26:55,195 INFO L341 CegarLoopForPetriNet]: 192 programPoint places, 4 predicate places. [2020-10-09 15:26:55,195 INFO L481 AbstractCegarLoop]: Abstraction has has 196 places, 192 transitions, 450 flow [2020-10-09 15:26:55,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:55,195 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:55,196 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:26:55,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2020-10-09 15:26:55,406 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:55,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:55,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1943629251, now seen corresponding path program 1 times [2020-10-09 15:26:55,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:55,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78332673] [2020-10-09 15:26:55,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:55,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:55,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:26:55,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:26:55,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78332673] [2020-10-09 15:26:55,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:55,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:55,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108650542] [2020-10-09 15:26:55,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:55,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:55,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:55,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:55,506 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 206 [2020-10-09 15:26:55,506 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 192 transitions, 450 flow. Second operand 3 states. [2020-10-09 15:26:55,507 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:55,507 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 206 [2020-10-09 15:26:55,507 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:55,546 INFO L129 PetriNetUnfolder]: 16/219 cut-off events. [2020-10-09 15:26:55,546 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-09 15:26:55,550 INFO L80 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 219 events. 16/219 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 766 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 249. Up to 8 conditions per place. [2020-10-09 15:26:55,552 INFO L132 encePairwiseOnDemand]: 203/206 looper letters, 5 selfloop transitions, 2 changer transitions 0/192 dead transitions. [2020-10-09 15:26:55,552 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 192 transitions, 462 flow [2020-10-09 15:26:55,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 581 transitions. [2020-10-09 15:26:55,555 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9401294498381877 [2020-10-09 15:26:55,555 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 581 transitions. [2020-10-09 15:26:55,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 581 transitions. [2020-10-09 15:26:55,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:55,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 581 transitions. [2020-10-09 15:26:55,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:55,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:55,558 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:55,558 INFO L185 Difference]: Start difference. First operand has 196 places, 192 transitions, 450 flow. Second operand 3 states and 581 transitions. [2020-10-09 15:26:55,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 192 transitions, 462 flow [2020-10-09 15:26:55,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 192 transitions, 457 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:26:55,563 INFO L241 Difference]: Finished difference. Result has 199 places, 192 transitions, 455 flow [2020-10-09 15:26:55,563 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=199, PETRI_TRANSITIONS=192} [2020-10-09 15:26:55,563 INFO L341 CegarLoopForPetriNet]: 192 programPoint places, 7 predicate places. [2020-10-09 15:26:55,564 INFO L481 AbstractCegarLoop]: Abstraction has has 199 places, 192 transitions, 455 flow [2020-10-09 15:26:55,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:55,564 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:55,564 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:26:55,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2020-10-09 15:26:55,776 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:55,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:55,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1942676962, now seen corresponding path program 1 times [2020-10-09 15:26:55,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:55,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072747606] [2020-10-09 15:26:55,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:55,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:26:55,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:26:55,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:26:55,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072747606] [2020-10-09 15:26:55,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:55,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:55,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247707131] [2020-10-09 15:26:55,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:55,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:55,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:55,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:55,886 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 206 [2020-10-09 15:26:55,886 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 192 transitions, 455 flow. Second operand 3 states. [2020-10-09 15:26:55,887 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:55,887 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 206 [2020-10-09 15:26:55,887 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:55,918 INFO L129 PetriNetUnfolder]: 15/215 cut-off events. [2020-10-09 15:26:55,918 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-09 15:26:55,922 INFO L80 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 215 events. 15/215 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 737 event pairs, 0 based on Foata normal form. 1/195 useless extension candidates. Maximal degree in co-relation 245. Up to 8 conditions per place. [2020-10-09 15:26:55,923 INFO L132 encePairwiseOnDemand]: 204/206 looper letters, 4 selfloop transitions, 1 changer transitions 0/189 dead transitions. [2020-10-09 15:26:55,923 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 189 transitions, 450 flow [2020-10-09 15:26:55,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:55,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:55,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2020-10-09 15:26:55,925 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.941747572815534 [2020-10-09 15:26:55,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 582 transitions. [2020-10-09 15:26:55,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 582 transitions. [2020-10-09 15:26:55,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:55,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 582 transitions. [2020-10-09 15:26:55,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:55,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:55,929 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:55,929 INFO L185 Difference]: Start difference. First operand has 199 places, 192 transitions, 455 flow. Second operand 3 states and 582 transitions. [2020-10-09 15:26:55,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 189 transitions, 450 flow [2020-10-09 15:26:55,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 189 transitions, 443 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:26:55,933 INFO L241 Difference]: Finished difference. Result has 198 places, 189 transitions, 435 flow [2020-10-09 15:26:55,933 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=198, PETRI_TRANSITIONS=189} [2020-10-09 15:26:55,933 INFO L341 CegarLoopForPetriNet]: 192 programPoint places, 6 predicate places. [2020-10-09 15:26:55,934 INFO L481 AbstractCegarLoop]: Abstraction has has 198 places, 189 transitions, 435 flow [2020-10-09 15:26:55,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:55,934 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:55,934 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:26:56,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2020-10-09 15:26:56,145 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:56,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:56,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1942675939, now seen corresponding path program 1 times [2020-10-09 15:26:56,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:56,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296390774] [2020-10-09 15:26:56,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:56,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:56,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:56,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:26:56,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:26:56,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296390774] [2020-10-09 15:26:56,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:56,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:56,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611461222] [2020-10-09 15:26:56,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:56,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:56,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:56,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:56,269 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 206 [2020-10-09 15:26:56,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 189 transitions, 435 flow. Second operand 3 states. [2020-10-09 15:26:56,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:56,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 206 [2020-10-09 15:26:56,270 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:56,307 INFO L129 PetriNetUnfolder]: 15/213 cut-off events. [2020-10-09 15:26:56,307 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2020-10-09 15:26:56,311 INFO L80 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 213 events. 15/213 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 723 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 247. Up to 8 conditions per place. [2020-10-09 15:26:56,312 INFO L132 encePairwiseOnDemand]: 204/206 looper letters, 8 selfloop transitions, 1 changer transitions 0/187 dead transitions. [2020-10-09 15:26:56,313 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 187 transitions, 448 flow [2020-10-09 15:26:56,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2020-10-09 15:26:56,315 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.919093851132686 [2020-10-09 15:26:56,315 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 568 transitions. [2020-10-09 15:26:56,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 568 transitions. [2020-10-09 15:26:56,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:56,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 568 transitions. [2020-10-09 15:26:56,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:56,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:56,318 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:56,318 INFO L185 Difference]: Start difference. First operand has 198 places, 189 transitions, 435 flow. Second operand 3 states and 568 transitions. [2020-10-09 15:26:56,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 187 transitions, 448 flow [2020-10-09 15:26:56,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 187 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:26:56,322 INFO L241 Difference]: Finished difference. Result has 197 places, 187 transitions, 431 flow [2020-10-09 15:26:56,323 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=197, PETRI_TRANSITIONS=187} [2020-10-09 15:26:56,323 INFO L341 CegarLoopForPetriNet]: 192 programPoint places, 5 predicate places. [2020-10-09 15:26:56,323 INFO L481 AbstractCegarLoop]: Abstraction has has 197 places, 187 transitions, 431 flow [2020-10-09 15:26:56,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:56,323 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:56,323 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:26:56,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2020-10-09 15:26:56,534 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:56,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:56,534 INFO L82 PathProgramCache]: Analyzing trace with hash 319688305, now seen corresponding path program 1 times [2020-10-09 15:26:56,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:56,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572624826] [2020-10-09 15:26:56,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:56,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:26:56,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:26:56,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:56,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:26:56,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572624826] [2020-10-09 15:26:56,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:56,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:56,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407529451] [2020-10-09 15:26:56,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:56,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:56,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:56,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:56,640 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 206 [2020-10-09 15:26:56,641 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 187 transitions, 431 flow. Second operand 3 states. [2020-10-09 15:26:56,641 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:56,641 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 206 [2020-10-09 15:26:56,641 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:56,682 INFO L129 PetriNetUnfolder]: 14/220 cut-off events. [2020-10-09 15:26:56,682 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2020-10-09 15:26:56,686 INFO L80 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 220 events. 14/220 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 780 event pairs, 0 based on Foata normal form. 1/200 useless extension candidates. Maximal degree in co-relation 250. Up to 8 conditions per place. [2020-10-09 15:26:56,688 INFO L132 encePairwiseOnDemand]: 204/206 looper letters, 4 selfloop transitions, 1 changer transitions 0/187 dead transitions. [2020-10-09 15:26:56,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 187 transitions, 441 flow [2020-10-09 15:26:56,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2020-10-09 15:26:56,690 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.941747572815534 [2020-10-09 15:26:56,690 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 582 transitions. [2020-10-09 15:26:56,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 582 transitions. [2020-10-09 15:26:56,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:56,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 582 transitions. [2020-10-09 15:26:56,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:56,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:56,693 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:56,694 INFO L185 Difference]: Start difference. First operand has 197 places, 187 transitions, 431 flow. Second operand 3 states and 582 transitions. [2020-10-09 15:26:56,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 187 transitions, 441 flow [2020-10-09 15:26:56,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 187 transitions, 440 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:26:56,698 INFO L241 Difference]: Finished difference. Result has 199 places, 187 transitions, 435 flow [2020-10-09 15:26:56,698 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=199, PETRI_TRANSITIONS=187} [2020-10-09 15:26:56,698 INFO L341 CegarLoopForPetriNet]: 192 programPoint places, 7 predicate places. [2020-10-09 15:26:56,699 INFO L481 AbstractCegarLoop]: Abstraction has has 199 places, 187 transitions, 435 flow [2020-10-09 15:26:56,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:56,699 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:56,699 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:26:56,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2020-10-09 15:26:56,910 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:56,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:56,910 INFO L82 PathProgramCache]: Analyzing trace with hash 319689328, now seen corresponding path program 1 times [2020-10-09 15:26:56,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:56,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147907200] [2020-10-09 15:26:56,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:56,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:56,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:26:56,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:26:56,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147907200] [2020-10-09 15:26:56,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:56,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:56,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111320968] [2020-10-09 15:26:56,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:56,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:56,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:56,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:57,024 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 206 [2020-10-09 15:26:57,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 187 transitions, 435 flow. Second operand 3 states. [2020-10-09 15:26:57,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:57,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 206 [2020-10-09 15:26:57,025 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:57,079 INFO L129 PetriNetUnfolder]: 12/222 cut-off events. [2020-10-09 15:26:57,079 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2020-10-09 15:26:57,084 INFO L80 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 222 events. 12/222 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 816 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 263. Up to 9 conditions per place. [2020-10-09 15:26:57,087 INFO L132 encePairwiseOnDemand]: 202/206 looper letters, 9 selfloop transitions, 3 changer transitions 0/188 dead transitions. [2020-10-09 15:26:57,087 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 188 transitions, 461 flow [2020-10-09 15:26:57,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:57,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions. [2020-10-09 15:26:57,091 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9239482200647249 [2020-10-09 15:26:57,092 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 571 transitions. [2020-10-09 15:26:57,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 571 transitions. [2020-10-09 15:26:57,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:57,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 571 transitions. [2020-10-09 15:26:57,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:57,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:57,097 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:57,097 INFO L185 Difference]: Start difference. First operand has 199 places, 187 transitions, 435 flow. Second operand 3 states and 571 transitions. [2020-10-09 15:26:57,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 188 transitions, 461 flow [2020-10-09 15:26:57,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 188 transitions, 460 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:26:57,102 INFO L241 Difference]: Finished difference. Result has 202 places, 188 transitions, 452 flow [2020-10-09 15:26:57,103 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=202, PETRI_TRANSITIONS=188} [2020-10-09 15:26:57,103 INFO L341 CegarLoopForPetriNet]: 192 programPoint places, 10 predicate places. [2020-10-09 15:26:57,103 INFO L481 AbstractCegarLoop]: Abstraction has has 202 places, 188 transitions, 452 flow [2020-10-09 15:26:57,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:57,104 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:57,104 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:26:57,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2020-10-09 15:26:57,317 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:57,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:57,318 INFO L82 PathProgramCache]: Analyzing trace with hash 318736016, now seen corresponding path program 1 times [2020-10-09 15:26:57,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:57,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086259545] [2020-10-09 15:26:57,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:57,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:57,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:26:57,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:57,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:26:57,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086259545] [2020-10-09 15:26:57,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:57,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:57,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913742579] [2020-10-09 15:26:57,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:57,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:57,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:57,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:57,409 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 206 [2020-10-09 15:26:57,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 188 transitions, 452 flow. Second operand 3 states. [2020-10-09 15:26:57,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:57,410 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 206 [2020-10-09 15:26:57,410 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:57,447 INFO L129 PetriNetUnfolder]: 12/215 cut-off events. [2020-10-09 15:26:57,447 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-09 15:26:57,451 INFO L80 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 215 events. 12/215 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 754 event pairs, 0 based on Foata normal form. 1/198 useless extension candidates. Maximal degree in co-relation 249. Up to 8 conditions per place. [2020-10-09 15:26:57,452 INFO L132 encePairwiseOnDemand]: 204/206 looper letters, 5 selfloop transitions, 1 changer transitions 0/186 dead transitions. [2020-10-09 15:26:57,452 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 186 transitions, 454 flow [2020-10-09 15:26:57,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2020-10-09 15:26:57,454 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9385113268608414 [2020-10-09 15:26:57,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 580 transitions. [2020-10-09 15:26:57,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions. [2020-10-09 15:26:57,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:57,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions. [2020-10-09 15:26:57,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:57,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:57,457 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:57,458 INFO L185 Difference]: Start difference. First operand has 202 places, 188 transitions, 452 flow. Second operand 3 states and 580 transitions. [2020-10-09 15:26:57,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 186 transitions, 454 flow [2020-10-09 15:26:57,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 186 transitions, 446 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:26:57,462 INFO L241 Difference]: Finished difference. Result has 202 places, 186 transitions, 439 flow [2020-10-09 15:26:57,462 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=439, PETRI_PLACES=202, PETRI_TRANSITIONS=186} [2020-10-09 15:26:57,463 INFO L341 CegarLoopForPetriNet]: 192 programPoint places, 10 predicate places. [2020-10-09 15:26:57,463 INFO L481 AbstractCegarLoop]: Abstraction has has 202 places, 186 transitions, 439 flow [2020-10-09 15:26:57,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:57,463 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:57,463 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:26:57,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2020-10-09 15:26:57,674 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:57,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:57,675 INFO L82 PathProgramCache]: Analyzing trace with hash 318734993, now seen corresponding path program 1 times [2020-10-09 15:26:57,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:57,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536612401] [2020-10-09 15:26:57,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:57,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:57,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:26:57,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:26:57,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536612401] [2020-10-09 15:26:57,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:57,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:57,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997756577] [2020-10-09 15:26:57,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:57,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:57,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:57,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:57,771 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 206 [2020-10-09 15:26:57,771 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 186 transitions, 439 flow. Second operand 3 states. [2020-10-09 15:26:57,772 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:57,772 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 206 [2020-10-09 15:26:57,772 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:57,812 INFO L129 PetriNetUnfolder]: 12/213 cut-off events. [2020-10-09 15:26:57,812 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2020-10-09 15:26:57,816 INFO L80 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 213 events. 12/213 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 740 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 253. Up to 8 conditions per place. [2020-10-09 15:26:57,818 INFO L132 encePairwiseOnDemand]: 204/206 looper letters, 8 selfloop transitions, 1 changer transitions 0/184 dead transitions. [2020-10-09 15:26:57,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 184 transitions, 452 flow [2020-10-09 15:26:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2020-10-09 15:26:57,821 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.919093851132686 [2020-10-09 15:26:57,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 568 transitions. [2020-10-09 15:26:57,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 568 transitions. [2020-10-09 15:26:57,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:57,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 568 transitions. [2020-10-09 15:26:57,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:57,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:57,825 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:57,825 INFO L185 Difference]: Start difference. First operand has 202 places, 186 transitions, 439 flow. Second operand 3 states and 568 transitions. [2020-10-09 15:26:57,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 184 transitions, 452 flow [2020-10-09 15:26:57,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 184 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:26:57,830 INFO L241 Difference]: Finished difference. Result has 201 places, 184 transitions, 435 flow [2020-10-09 15:26:57,830 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=201, PETRI_TRANSITIONS=184} [2020-10-09 15:26:57,831 INFO L341 CegarLoopForPetriNet]: 192 programPoint places, 9 predicate places. [2020-10-09 15:26:57,831 INFO L481 AbstractCegarLoop]: Abstraction has has 201 places, 184 transitions, 435 flow [2020-10-09 15:26:57,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:57,831 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:57,831 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:58,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2020-10-09 15:26:58,044 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:58,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:58,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1457129365, now seen corresponding path program 1 times [2020-10-09 15:26:58,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:58,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859252703] [2020-10-09 15:26:58,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:26:58,137 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:26:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:26:58,153 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:26:58,172 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:26:58,173 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:26:58,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2020-10-09 15:26:58,373 WARN L371 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:26:58,374 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2020-10-09 15:26:58,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,400 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,402 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,402 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,402 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,402 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,402 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,403 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,403 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,405 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,405 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,405 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,412 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,412 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,412 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,420 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,420 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,420 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,420 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,420 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,423 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,424 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,424 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,424 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,424 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,425 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,425 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,425 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,425 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,426 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,428 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,428 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,431 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,431 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,431 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,431 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,431 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,433 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,433 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,433 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,433 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,433 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:26:58,435 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-10-09 15:26:58,436 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:26:58,436 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:26:58,436 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:26:58,436 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:26:58,436 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:26:58,436 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:26:58,436 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:26:58,436 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:26:58,439 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 217 places, 233 transitions, 562 flow [2020-10-09 15:26:58,479 INFO L129 PetriNetUnfolder]: 41/304 cut-off events. [2020-10-09 15:26:58,480 INFO L130 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2020-10-09 15:26:58,486 INFO L80 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 304 events. 41/304 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1088 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 312. Up to 18 conditions per place. [2020-10-09 15:26:58,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 217 places, 233 transitions, 562 flow [2020-10-09 15:26:58,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 217 places, 233 transitions, 562 flow [2020-10-09 15:26:58,499 INFO L129 PetriNetUnfolder]: 10/103 cut-off events. [2020-10-09 15:26:58,499 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:26:58,499 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:58,499 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:58,499 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:58,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:58,500 INFO L82 PathProgramCache]: Analyzing trace with hash -209988698, now seen corresponding path program 1 times [2020-10-09 15:26:58,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:58,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852100398] [2020-10-09 15:26:58,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:58,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:58,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:58,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:58,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852100398] [2020-10-09 15:26:58,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:58,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:58,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986483156] [2020-10-09 15:26:58,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:58,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:58,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:58,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:58,616 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 233 [2020-10-09 15:26:58,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 233 transitions, 562 flow. Second operand 3 states. [2020-10-09 15:26:58,617 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:58,617 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 233 [2020-10-09 15:26:58,617 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:58,662 INFO L129 PetriNetUnfolder]: 23/250 cut-off events. [2020-10-09 15:26:58,662 INFO L130 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2020-10-09 15:26:58,668 INFO L80 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 250 events. 23/250 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 873 event pairs, 0 based on Foata normal form. 40/257 useless extension candidates. Maximal degree in co-relation 270. Up to 9 conditions per place. [2020-10-09 15:26:58,671 INFO L132 encePairwiseOnDemand]: 218/233 looper letters, 10 selfloop transitions, 3 changer transitions 0/221 dead transitions. [2020-10-09 15:26:58,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 221 transitions, 564 flow [2020-10-09 15:26:58,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:58,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:58,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 671 transitions. [2020-10-09 15:26:58,673 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9599427753934192 [2020-10-09 15:26:58,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 671 transitions. [2020-10-09 15:26:58,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 671 transitions. [2020-10-09 15:26:58,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:58,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 671 transitions. [2020-10-09 15:26:58,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:58,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:58,677 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:58,677 INFO L185 Difference]: Start difference. First operand has 217 places, 233 transitions, 562 flow. Second operand 3 states and 671 transitions. [2020-10-09 15:26:58,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 221 transitions, 564 flow [2020-10-09 15:26:58,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 221 transitions, 508 flow, removed 28 selfloop flow, removed 0 redundant places. [2020-10-09 15:26:58,682 INFO L241 Difference]: Finished difference. Result has 216 places, 221 transitions, 502 flow [2020-10-09 15:26:58,683 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=216, PETRI_TRANSITIONS=221} [2020-10-09 15:26:58,683 INFO L341 CegarLoopForPetriNet]: 217 programPoint places, -1 predicate places. [2020-10-09 15:26:58,683 INFO L481 AbstractCegarLoop]: Abstraction has has 216 places, 221 transitions, 502 flow [2020-10-09 15:26:58,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:58,683 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:58,683 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:58,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 mathsat -unsat_core_generation=3 [2020-10-09 15:26:58,893 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:58,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:58,893 INFO L82 PathProgramCache]: Analyzing trace with hash -209035386, now seen corresponding path program 1 times [2020-10-09 15:26:58,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:58,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894591887] [2020-10-09 15:26:58,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:58,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:26:58,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:58,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:58,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:58,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894591887] [2020-10-09 15:26:58,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:58,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:58,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279066077] [2020-10-09 15:26:58,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:58,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:58,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:58,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:59,014 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 233 [2020-10-09 15:26:59,015 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 221 transitions, 502 flow. Second operand 3 states. [2020-10-09 15:26:59,015 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:59,015 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 233 [2020-10-09 15:26:59,016 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:59,056 INFO L129 PetriNetUnfolder]: 21/247 cut-off events. [2020-10-09 15:26:59,056 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 15:26:59,061 INFO L80 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 247 events. 21/247 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 864 event pairs, 0 based on Foata normal form. 1/220 useless extension candidates. Maximal degree in co-relation 263. Up to 9 conditions per place. [2020-10-09 15:26:59,064 INFO L132 encePairwiseOnDemand]: 231/233 looper letters, 4 selfloop transitions, 1 changer transitions 0/219 dead transitions. [2020-10-09 15:26:59,064 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 219 transitions, 502 flow [2020-10-09 15:26:59,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:59,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 660 transitions. [2020-10-09 15:26:59,066 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.944206008583691 [2020-10-09 15:26:59,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 660 transitions. [2020-10-09 15:26:59,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 660 transitions. [2020-10-09 15:26:59,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:59,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 660 transitions. [2020-10-09 15:26:59,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:59,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:59,069 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:59,069 INFO L185 Difference]: Start difference. First operand has 216 places, 221 transitions, 502 flow. Second operand 3 states and 660 transitions. [2020-10-09 15:26:59,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 219 transitions, 502 flow [2020-10-09 15:26:59,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 219 transitions, 498 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:26:59,072 INFO L241 Difference]: Finished difference. Result has 218 places, 219 transitions, 493 flow [2020-10-09 15:26:59,073 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=218, PETRI_TRANSITIONS=219} [2020-10-09 15:26:59,073 INFO L341 CegarLoopForPetriNet]: 217 programPoint places, 1 predicate places. [2020-10-09 15:26:59,073 INFO L481 AbstractCegarLoop]: Abstraction has has 218 places, 219 transitions, 493 flow [2020-10-09 15:26:59,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:59,073 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:59,073 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:59,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2020-10-09 15:26:59,274 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:59,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:59,274 INFO L82 PathProgramCache]: Analyzing trace with hash -209034363, now seen corresponding path program 1 times [2020-10-09 15:26:59,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:59,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390394672] [2020-10-09 15:26:59,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:59,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:59,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:59,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:59,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390394672] [2020-10-09 15:26:59,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:59,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:59,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748570941] [2020-10-09 15:26:59,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:59,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:59,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:59,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:59,403 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 233 [2020-10-09 15:26:59,404 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 219 transitions, 493 flow. Second operand 3 states. [2020-10-09 15:26:59,404 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:59,404 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 233 [2020-10-09 15:26:59,404 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:59,449 INFO L129 PetriNetUnfolder]: 21/245 cut-off events. [2020-10-09 15:26:59,449 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-09 15:26:59,454 INFO L80 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 245 events. 21/245 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 847 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 276. Up to 9 conditions per place. [2020-10-09 15:26:59,457 INFO L132 encePairwiseOnDemand]: 231/233 looper letters, 9 selfloop transitions, 1 changer transitions 0/218 dead transitions. [2020-10-09 15:26:59,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 218 transitions, 508 flow [2020-10-09 15:26:59,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:59,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2020-10-09 15:26:59,459 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9256080114449213 [2020-10-09 15:26:59,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 647 transitions. [2020-10-09 15:26:59,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 647 transitions. [2020-10-09 15:26:59,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:59,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 647 transitions. [2020-10-09 15:26:59,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:59,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:59,463 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:59,463 INFO L185 Difference]: Start difference. First operand has 218 places, 219 transitions, 493 flow. Second operand 3 states and 647 transitions. [2020-10-09 15:26:59,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 218 transitions, 508 flow [2020-10-09 15:26:59,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 218 transitions, 507 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:26:59,469 INFO L241 Difference]: Finished difference. Result has 219 places, 218 transitions, 489 flow [2020-10-09 15:26:59,469 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=489, PETRI_PLACES=219, PETRI_TRANSITIONS=218} [2020-10-09 15:26:59,469 INFO L341 CegarLoopForPetriNet]: 217 programPoint places, 2 predicate places. [2020-10-09 15:26:59,469 INFO L481 AbstractCegarLoop]: Abstraction has has 219 places, 218 transitions, 489 flow [2020-10-09 15:26:59,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:59,470 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:59,470 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:26:59,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 mathsat -unsat_core_generation=3 [2020-10-09 15:26:59,682 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:26:59,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:26:59,683 INFO L82 PathProgramCache]: Analyzing trace with hash -209987675, now seen corresponding path program 1 times [2020-10-09 15:26:59,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:26:59,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573371876] [2020-10-09 15:26:59,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2020-10-09 15:26:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:26:59,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:26:59,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:26:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:59,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:26:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:26:59,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573371876] [2020-10-09 15:26:59,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:26:59,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:26:59,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269370832] [2020-10-09 15:26:59,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:26:59,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:26:59,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:26:59,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:26:59,804 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 233 [2020-10-09 15:26:59,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 218 transitions, 489 flow. Second operand 3 states. [2020-10-09 15:26:59,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:26:59,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 233 [2020-10-09 15:26:59,805 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:26:59,847 INFO L129 PetriNetUnfolder]: 21/242 cut-off events. [2020-10-09 15:26:59,847 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2020-10-09 15:26:59,853 INFO L80 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 242 events. 21/242 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 825 event pairs, 0 based on Foata normal form. 1/215 useless extension candidates. Maximal degree in co-relation 266. Up to 9 conditions per place. [2020-10-09 15:26:59,855 INFO L132 encePairwiseOnDemand]: 231/233 looper letters, 5 selfloop transitions, 1 changer transitions 0/216 dead transitions. [2020-10-09 15:26:59,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 216 transitions, 495 flow [2020-10-09 15:26:59,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:26:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:26:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2020-10-09 15:26:59,858 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9413447782546495 [2020-10-09 15:26:59,858 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 658 transitions. [2020-10-09 15:26:59,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions. [2020-10-09 15:26:59,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:26:59,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions. [2020-10-09 15:26:59,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:26:59,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:26:59,861 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:26:59,863 INFO L185 Difference]: Start difference. First operand has 219 places, 218 transitions, 489 flow. Second operand 3 states and 658 transitions. [2020-10-09 15:26:59,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 216 transitions, 495 flow [2020-10-09 15:26:59,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 216 transitions, 491 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-09 15:26:59,868 INFO L241 Difference]: Finished difference. Result has 218 places, 216 transitions, 484 flow [2020-10-09 15:26:59,868 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=484, PETRI_PLACES=218, PETRI_TRANSITIONS=216} [2020-10-09 15:26:59,872 INFO L341 CegarLoopForPetriNet]: 217 programPoint places, 1 predicate places. [2020-10-09 15:26:59,872 INFO L481 AbstractCegarLoop]: Abstraction has has 218 places, 216 transitions, 484 flow [2020-10-09 15:26:59,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:26:59,872 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:26:59,873 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:00,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3 [2020-10-09 15:27:00,085 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:00,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:00,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1751092786, now seen corresponding path program 1 times [2020-10-09 15:27:00,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:00,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489108486] [2020-10-09 15:27:00,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 38 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:00,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:00,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:00,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:00,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:00,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489108486] [2020-10-09 15:27:00,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:00,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:00,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822671003] [2020-10-09 15:27:00,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:00,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:00,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:00,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:00,202 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 233 [2020-10-09 15:27:00,202 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 216 transitions, 484 flow. Second operand 3 states. [2020-10-09 15:27:00,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:00,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 233 [2020-10-09 15:27:00,203 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:00,246 INFO L129 PetriNetUnfolder]: 20/249 cut-off events. [2020-10-09 15:27:00,246 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 15:27:00,251 INFO L80 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 249 events. 20/249 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 889 event pairs, 0 based on Foata normal form. 1/221 useless extension candidates. Maximal degree in co-relation 277. Up to 9 conditions per place. [2020-10-09 15:27:00,255 INFO L132 encePairwiseOnDemand]: 231/233 looper letters, 4 selfloop transitions, 1 changer transitions 0/216 dead transitions. [2020-10-09 15:27:00,255 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 216 transitions, 494 flow [2020-10-09 15:27:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 660 transitions. [2020-10-09 15:27:00,257 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.944206008583691 [2020-10-09 15:27:00,257 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 660 transitions. [2020-10-09 15:27:00,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 660 transitions. [2020-10-09 15:27:00,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:00,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 660 transitions. [2020-10-09 15:27:00,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:00,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:00,260 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:00,260 INFO L185 Difference]: Start difference. First operand has 218 places, 216 transitions, 484 flow. Second operand 3 states and 660 transitions. [2020-10-09 15:27:00,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 216 transitions, 494 flow [2020-10-09 15:27:00,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 216 transitions, 493 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:00,266 INFO L241 Difference]: Finished difference. Result has 220 places, 216 transitions, 488 flow [2020-10-09 15:27:00,266 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=220, PETRI_TRANSITIONS=216} [2020-10-09 15:27:00,268 INFO L341 CegarLoopForPetriNet]: 217 programPoint places, 3 predicate places. [2020-10-09 15:27:00,268 INFO L481 AbstractCegarLoop]: Abstraction has has 220 places, 216 transitions, 488 flow [2020-10-09 15:27:00,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:00,268 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:00,268 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:00,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 mathsat -unsat_core_generation=3 [2020-10-09 15:27:00,481 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:00,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:00,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1751093809, now seen corresponding path program 1 times [2020-10-09 15:27:00,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:00,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229595866] [2020-10-09 15:27:00,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:00,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:00,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:00,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:00,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:00,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229595866] [2020-10-09 15:27:00,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:00,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:00,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312217198] [2020-10-09 15:27:00,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:00,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:00,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:00,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:00,599 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 233 [2020-10-09 15:27:00,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 216 transitions, 488 flow. Second operand 3 states. [2020-10-09 15:27:00,599 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:00,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 233 [2020-10-09 15:27:00,600 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:00,640 INFO L129 PetriNetUnfolder]: 18/251 cut-off events. [2020-10-09 15:27:00,640 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 15:27:00,646 INFO L80 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 251 events. 18/251 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 918 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 288. Up to 9 conditions per place. [2020-10-09 15:27:00,649 INFO L132 encePairwiseOnDemand]: 229/233 looper letters, 9 selfloop transitions, 3 changer transitions 0/217 dead transitions. [2020-10-09 15:27:00,649 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 217 transitions, 514 flow [2020-10-09 15:27:00,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 649 transitions. [2020-10-09 15:27:00,658 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9284692417739628 [2020-10-09 15:27:00,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 649 transitions. [2020-10-09 15:27:00,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 649 transitions. [2020-10-09 15:27:00,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:00,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 649 transitions. [2020-10-09 15:27:00,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:00,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:00,661 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:00,661 INFO L185 Difference]: Start difference. First operand has 220 places, 216 transitions, 488 flow. Second operand 3 states and 649 transitions. [2020-10-09 15:27:00,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 217 transitions, 514 flow [2020-10-09 15:27:00,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 217 transitions, 513 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:00,666 INFO L241 Difference]: Finished difference. Result has 223 places, 217 transitions, 505 flow [2020-10-09 15:27:00,667 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=505, PETRI_PLACES=223, PETRI_TRANSITIONS=217} [2020-10-09 15:27:00,667 INFO L341 CegarLoopForPetriNet]: 217 programPoint places, 6 predicate places. [2020-10-09 15:27:00,667 INFO L481 AbstractCegarLoop]: Abstraction has has 223 places, 217 transitions, 505 flow [2020-10-09 15:27:00,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:00,667 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:00,668 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:00,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3 [2020-10-09 15:27:00,880 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:00,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:00,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1750140497, now seen corresponding path program 1 times [2020-10-09 15:27:00,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:00,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855814318] [2020-10-09 15:27:00,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 40 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:00,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:00,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:00,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:00,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855814318] [2020-10-09 15:27:00,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:00,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:00,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512315421] [2020-10-09 15:27:00,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:00,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:00,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:00,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:00,985 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 233 [2020-10-09 15:27:00,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 217 transitions, 505 flow. Second operand 3 states. [2020-10-09 15:27:00,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:00,986 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 233 [2020-10-09 15:27:00,986 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:01,026 INFO L129 PetriNetUnfolder]: 18/244 cut-off events. [2020-10-09 15:27:01,027 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-09 15:27:01,032 INFO L80 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 244 events. 18/244 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 858 event pairs, 0 based on Foata normal form. 1/220 useless extension candidates. Maximal degree in co-relation 274. Up to 9 conditions per place. [2020-10-09 15:27:01,034 INFO L132 encePairwiseOnDemand]: 231/233 looper letters, 5 selfloop transitions, 1 changer transitions 0/215 dead transitions. [2020-10-09 15:27:01,034 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 215 transitions, 507 flow [2020-10-09 15:27:01,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2020-10-09 15:27:01,040 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9413447782546495 [2020-10-09 15:27:01,040 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 658 transitions. [2020-10-09 15:27:01,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions. [2020-10-09 15:27:01,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:01,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions. [2020-10-09 15:27:01,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:01,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:01,044 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:01,044 INFO L185 Difference]: Start difference. First operand has 223 places, 217 transitions, 505 flow. Second operand 3 states and 658 transitions. [2020-10-09 15:27:01,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 215 transitions, 507 flow [2020-10-09 15:27:01,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 215 transitions, 499 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:01,049 INFO L241 Difference]: Finished difference. Result has 223 places, 215 transitions, 492 flow [2020-10-09 15:27:01,050 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=223, PETRI_TRANSITIONS=215} [2020-10-09 15:27:01,051 INFO L341 CegarLoopForPetriNet]: 217 programPoint places, 6 predicate places. [2020-10-09 15:27:01,051 INFO L481 AbstractCegarLoop]: Abstraction has has 223 places, 215 transitions, 492 flow [2020-10-09 15:27:01,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:01,051 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:01,051 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:01,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 mathsat -unsat_core_generation=3 [2020-10-09 15:27:01,263 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:01,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:01,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1750139474, now seen corresponding path program 1 times [2020-10-09 15:27:01,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:01,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916265959] [2020-10-09 15:27:01,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 41 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:01,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:01,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:01,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:01,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:01,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916265959] [2020-10-09 15:27:01,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:01,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:01,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094631605] [2020-10-09 15:27:01,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:01,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:01,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:01,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:01,391 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 233 [2020-10-09 15:27:01,391 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 215 transitions, 492 flow. Second operand 3 states. [2020-10-09 15:27:01,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:01,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 233 [2020-10-09 15:27:01,392 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:01,439 INFO L129 PetriNetUnfolder]: 18/242 cut-off events. [2020-10-09 15:27:01,439 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 15:27:01,444 INFO L80 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 242 events. 18/242 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 843 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 278. Up to 9 conditions per place. [2020-10-09 15:27:01,446 INFO L132 encePairwiseOnDemand]: 231/233 looper letters, 8 selfloop transitions, 1 changer transitions 0/213 dead transitions. [2020-10-09 15:27:01,446 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 213 transitions, 505 flow [2020-10-09 15:27:01,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:01,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2020-10-09 15:27:01,448 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9241773962804005 [2020-10-09 15:27:01,448 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 646 transitions. [2020-10-09 15:27:01,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 646 transitions. [2020-10-09 15:27:01,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:01,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 646 transitions. [2020-10-09 15:27:01,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:01,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:01,451 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:01,452 INFO L185 Difference]: Start difference. First operand has 223 places, 215 transitions, 492 flow. Second operand 3 states and 646 transitions. [2020-10-09 15:27:01,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 213 transitions, 505 flow [2020-10-09 15:27:01,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 213 transitions, 504 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:01,456 INFO L241 Difference]: Finished difference. Result has 222 places, 213 transitions, 488 flow [2020-10-09 15:27:01,457 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=222, PETRI_TRANSITIONS=213} [2020-10-09 15:27:01,457 INFO L341 CegarLoopForPetriNet]: 217 programPoint places, 5 predicate places. [2020-10-09 15:27:01,457 INFO L481 AbstractCegarLoop]: Abstraction has has 222 places, 213 transitions, 488 flow [2020-10-09 15:27:01,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:01,457 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:01,457 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:01,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 mathsat -unsat_core_generation=3 [2020-10-09 15:27:01,668 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:01,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:01,668 INFO L82 PathProgramCache]: Analyzing trace with hash -839698690, now seen corresponding path program 1 times [2020-10-09 15:27:01,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:01,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764441290] [2020-10-09 15:27:01,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 42 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:01,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:01,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:01,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:01,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764441290] [2020-10-09 15:27:01,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:01,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:01,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253383040] [2020-10-09 15:27:01,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:01,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:01,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:01,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:01,771 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 233 [2020-10-09 15:27:01,772 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 213 transitions, 488 flow. Second operand 3 states. [2020-10-09 15:27:01,772 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:01,772 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 233 [2020-10-09 15:27:01,772 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:01,816 INFO L129 PetriNetUnfolder]: 16/247 cut-off events. [2020-10-09 15:27:01,817 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2020-10-09 15:27:01,821 INFO L80 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 247 events. 16/247 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 896 event pairs, 0 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 281. Up to 9 conditions per place. [2020-10-09 15:27:01,823 INFO L132 encePairwiseOnDemand]: 230/233 looper letters, 5 selfloop transitions, 2 changer transitions 0/214 dead transitions. [2020-10-09 15:27:01,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 214 transitions, 504 flow [2020-10-09 15:27:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2020-10-09 15:27:01,825 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9427753934191703 [2020-10-09 15:27:01,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 659 transitions. [2020-10-09 15:27:01,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 659 transitions. [2020-10-09 15:27:01,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:01,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 659 transitions. [2020-10-09 15:27:01,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:01,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:01,828 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:01,828 INFO L185 Difference]: Start difference. First operand has 222 places, 213 transitions, 488 flow. Second operand 3 states and 659 transitions. [2020-10-09 15:27:01,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 214 transitions, 504 flow [2020-10-09 15:27:01,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 214 transitions, 503 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:01,832 INFO L241 Difference]: Finished difference. Result has 225 places, 214 transitions, 501 flow [2020-10-09 15:27:01,833 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=225, PETRI_TRANSITIONS=214} [2020-10-09 15:27:01,833 INFO L341 CegarLoopForPetriNet]: 217 programPoint places, 8 predicate places. [2020-10-09 15:27:01,833 INFO L481 AbstractCegarLoop]: Abstraction has has 225 places, 214 transitions, 501 flow [2020-10-09 15:27:01,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:01,833 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:01,833 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:02,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 mathsat -unsat_core_generation=3 [2020-10-09 15:27:02,040 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:02,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:02,040 INFO L82 PathProgramCache]: Analyzing trace with hash -839699713, now seen corresponding path program 1 times [2020-10-09 15:27:02,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:02,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162962765] [2020-10-09 15:27:02,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 43 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:02,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:02,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:02,130 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:02,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:02,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162962765] [2020-10-09 15:27:02,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:02,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:02,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505470487] [2020-10-09 15:27:02,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:02,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:02,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:02,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:02,171 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 233 [2020-10-09 15:27:02,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 214 transitions, 501 flow. Second operand 3 states. [2020-10-09 15:27:02,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:02,172 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 233 [2020-10-09 15:27:02,172 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:02,206 INFO L129 PetriNetUnfolder]: 16/248 cut-off events. [2020-10-09 15:27:02,206 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-09 15:27:02,209 INFO L80 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 248 events. 16/248 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 905 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 289. Up to 9 conditions per place. [2020-10-09 15:27:02,210 INFO L132 encePairwiseOnDemand]: 229/233 looper letters, 9 selfloop transitions, 3 changer transitions 0/215 dead transitions. [2020-10-09 15:27:02,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 215 transitions, 527 flow [2020-10-09 15:27:02,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 649 transitions. [2020-10-09 15:27:02,212 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9284692417739628 [2020-10-09 15:27:02,212 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 649 transitions. [2020-10-09 15:27:02,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 649 transitions. [2020-10-09 15:27:02,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:02,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 649 transitions. [2020-10-09 15:27:02,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:02,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:02,215 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:02,215 INFO L185 Difference]: Start difference. First operand has 225 places, 214 transitions, 501 flow. Second operand 3 states and 649 transitions. [2020-10-09 15:27:02,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 215 transitions, 527 flow [2020-10-09 15:27:02,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 215 transitions, 525 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:02,220 INFO L241 Difference]: Finished difference. Result has 228 places, 215 transitions, 517 flow [2020-10-09 15:27:02,221 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=517, PETRI_PLACES=228, PETRI_TRANSITIONS=215} [2020-10-09 15:27:02,221 INFO L341 CegarLoopForPetriNet]: 217 programPoint places, 11 predicate places. [2020-10-09 15:27:02,221 INFO L481 AbstractCegarLoop]: Abstraction has has 228 places, 215 transitions, 517 flow [2020-10-09 15:27:02,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:02,221 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:02,221 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:02,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 mathsat -unsat_core_generation=3 [2020-10-09 15:27:02,433 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:02,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:02,433 INFO L82 PathProgramCache]: Analyzing trace with hash -838745378, now seen corresponding path program 1 times [2020-10-09 15:27:02,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:02,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59306665] [2020-10-09 15:27:02,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 44 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:02,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:02,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:02,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:02,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:02,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59306665] [2020-10-09 15:27:02,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:02,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:02,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380159933] [2020-10-09 15:27:02,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:02,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:02,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:02,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:02,553 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 233 [2020-10-09 15:27:02,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 215 transitions, 517 flow. Second operand 3 states. [2020-10-09 15:27:02,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:02,554 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 233 [2020-10-09 15:27:02,554 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:02,604 INFO L129 PetriNetUnfolder]: 15/245 cut-off events. [2020-10-09 15:27:02,605 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:27:02,610 INFO L80 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 245 events. 15/245 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 888 event pairs, 0 based on Foata normal form. 2/224 useless extension candidates. Maximal degree in co-relation 288. Up to 9 conditions per place. [2020-10-09 15:27:02,611 INFO L132 encePairwiseOnDemand]: 230/233 looper letters, 9 selfloop transitions, 1 changer transitions 0/213 dead transitions. [2020-10-09 15:27:02,611 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 213 transitions, 525 flow [2020-10-09 15:27:02,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2020-10-09 15:27:02,612 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.927038626609442 [2020-10-09 15:27:02,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 648 transitions. [2020-10-09 15:27:02,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 648 transitions. [2020-10-09 15:27:02,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:02,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 648 transitions. [2020-10-09 15:27:02,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:02,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:02,616 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:02,616 INFO L185 Difference]: Start difference. First operand has 228 places, 215 transitions, 517 flow. Second operand 3 states and 648 transitions. [2020-10-09 15:27:02,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 213 transitions, 525 flow [2020-10-09 15:27:02,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 213 transitions, 524 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:02,621 INFO L241 Difference]: Finished difference. Result has 229 places, 213 transitions, 506 flow [2020-10-09 15:27:02,622 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=229, PETRI_TRANSITIONS=213} [2020-10-09 15:27:02,622 INFO L341 CegarLoopForPetriNet]: 217 programPoint places, 12 predicate places. [2020-10-09 15:27:02,622 INFO L481 AbstractCegarLoop]: Abstraction has has 229 places, 213 transitions, 506 flow [2020-10-09 15:27:02,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:02,622 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:02,622 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:02,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 mathsat -unsat_core_generation=3 [2020-10-09 15:27:02,835 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:02,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:02,835 INFO L82 PathProgramCache]: Analyzing trace with hash -838746401, now seen corresponding path program 1 times [2020-10-09 15:27:02,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:02,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421499356] [2020-10-09 15:27:02,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 45 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:02,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:02,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:02,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:02,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421499356] [2020-10-09 15:27:02,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:02,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:02,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266399888] [2020-10-09 15:27:02,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:02,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:02,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:02,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:02,954 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 233 [2020-10-09 15:27:02,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 213 transitions, 506 flow. Second operand 3 states. [2020-10-09 15:27:02,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:02,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 233 [2020-10-09 15:27:02,955 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:03,000 INFO L129 PetriNetUnfolder]: 15/242 cut-off events. [2020-10-09 15:27:03,000 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 15:27:03,006 INFO L80 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 242 events. 15/242 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 864 event pairs, 0 based on Foata normal form. 1/221 useless extension candidates. Maximal degree in co-relation 282. Up to 9 conditions per place. [2020-10-09 15:27:03,007 INFO L132 encePairwiseOnDemand]: 231/233 looper letters, 4 selfloop transitions, 1 changer transitions 0/210 dead transitions. [2020-10-09 15:27:03,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 210 transitions, 505 flow [2020-10-09 15:27:03,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 660 transitions. [2020-10-09 15:27:03,009 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.944206008583691 [2020-10-09 15:27:03,009 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 660 transitions. [2020-10-09 15:27:03,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 660 transitions. [2020-10-09 15:27:03,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:03,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 660 transitions. [2020-10-09 15:27:03,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:03,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:03,013 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:03,013 INFO L185 Difference]: Start difference. First operand has 229 places, 213 transitions, 506 flow. Second operand 3 states and 660 transitions. [2020-10-09 15:27:03,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 210 transitions, 505 flow [2020-10-09 15:27:03,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 210 transitions, 500 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:03,018 INFO L241 Difference]: Finished difference. Result has 226 places, 210 transitions, 492 flow [2020-10-09 15:27:03,018 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=226, PETRI_TRANSITIONS=210} [2020-10-09 15:27:03,018 INFO L341 CegarLoopForPetriNet]: 217 programPoint places, 9 predicate places. [2020-10-09 15:27:03,019 INFO L481 AbstractCegarLoop]: Abstraction has has 226 places, 210 transitions, 492 flow [2020-10-09 15:27:03,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:03,019 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:03,019 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:03,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 mathsat -unsat_core_generation=3 [2020-10-09 15:27:03,232 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:03,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:03,233 INFO L82 PathProgramCache]: Analyzing trace with hash -356501235, now seen corresponding path program 1 times [2020-10-09 15:27:03,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:03,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352409738] [2020-10-09 15:27:03,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 46 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:03,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:03,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:03,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:03,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352409738] [2020-10-09 15:27:03,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:03,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:03,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294670375] [2020-10-09 15:27:03,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:03,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:03,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:03,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:03,357 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 233 [2020-10-09 15:27:03,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 210 transitions, 492 flow. Second operand 3 states. [2020-10-09 15:27:03,359 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:03,359 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 233 [2020-10-09 15:27:03,359 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:03,407 INFO L129 PetriNetUnfolder]: 14/249 cut-off events. [2020-10-09 15:27:03,407 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2020-10-09 15:27:03,410 INFO L80 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 249 events. 14/249 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 922 event pairs, 0 based on Foata normal form. 1/227 useless extension candidates. Maximal degree in co-relation 290. Up to 9 conditions per place. [2020-10-09 15:27:03,412 INFO L132 encePairwiseOnDemand]: 231/233 looper letters, 4 selfloop transitions, 1 changer transitions 0/210 dead transitions. [2020-10-09 15:27:03,412 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 210 transitions, 502 flow [2020-10-09 15:27:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 660 transitions. [2020-10-09 15:27:03,414 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.944206008583691 [2020-10-09 15:27:03,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 660 transitions. [2020-10-09 15:27:03,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 660 transitions. [2020-10-09 15:27:03,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:03,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 660 transitions. [2020-10-09 15:27:03,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:03,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:03,416 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:03,416 INFO L185 Difference]: Start difference. First operand has 226 places, 210 transitions, 492 flow. Second operand 3 states and 660 transitions. [2020-10-09 15:27:03,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 210 transitions, 502 flow [2020-10-09 15:27:03,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 210 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:03,421 INFO L241 Difference]: Finished difference. Result has 228 places, 210 transitions, 496 flow [2020-10-09 15:27:03,422 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=228, PETRI_TRANSITIONS=210} [2020-10-09 15:27:03,422 INFO L341 CegarLoopForPetriNet]: 217 programPoint places, 11 predicate places. [2020-10-09 15:27:03,422 INFO L481 AbstractCegarLoop]: Abstraction has has 228 places, 210 transitions, 496 flow [2020-10-09 15:27:03,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:03,422 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:03,422 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:03,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 mathsat -unsat_core_generation=3 [2020-10-09 15:27:03,630 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:03,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:03,630 INFO L82 PathProgramCache]: Analyzing trace with hash -356500212, now seen corresponding path program 1 times [2020-10-09 15:27:03,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:03,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559597666] [2020-10-09 15:27:03,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 47 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:03,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:03,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:03,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:03,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559597666] [2020-10-09 15:27:03,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:03,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:03,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832468759] [2020-10-09 15:27:03,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:03,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:03,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:03,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:03,765 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 233 [2020-10-09 15:27:03,766 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 210 transitions, 496 flow. Second operand 3 states. [2020-10-09 15:27:03,766 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:03,766 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 233 [2020-10-09 15:27:03,766 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:03,824 INFO L129 PetriNetUnfolder]: 12/251 cut-off events. [2020-10-09 15:27:03,824 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 15:27:03,830 INFO L80 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 251 events. 12/251 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 956 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 301. Up to 9 conditions per place. [2020-10-09 15:27:03,831 INFO L132 encePairwiseOnDemand]: 229/233 looper letters, 9 selfloop transitions, 3 changer transitions 0/211 dead transitions. [2020-10-09 15:27:03,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 211 transitions, 522 flow [2020-10-09 15:27:03,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:03,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 649 transitions. [2020-10-09 15:27:03,833 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9284692417739628 [2020-10-09 15:27:03,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 649 transitions. [2020-10-09 15:27:03,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 649 transitions. [2020-10-09 15:27:03,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:03,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 649 transitions. [2020-10-09 15:27:03,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:03,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:03,836 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:03,836 INFO L185 Difference]: Start difference. First operand has 228 places, 210 transitions, 496 flow. Second operand 3 states and 649 transitions. [2020-10-09 15:27:03,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 211 transitions, 522 flow [2020-10-09 15:27:03,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 211 transitions, 521 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:03,842 INFO L241 Difference]: Finished difference. Result has 231 places, 211 transitions, 513 flow [2020-10-09 15:27:03,843 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=513, PETRI_PLACES=231, PETRI_TRANSITIONS=211} [2020-10-09 15:27:03,843 INFO L341 CegarLoopForPetriNet]: 217 programPoint places, 14 predicate places. [2020-10-09 15:27:03,843 INFO L481 AbstractCegarLoop]: Abstraction has has 231 places, 211 transitions, 513 flow [2020-10-09 15:27:03,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:03,843 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:03,844 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:04,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 mathsat -unsat_core_generation=3 [2020-10-09 15:27:04,055 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:04,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:04,055 INFO L82 PathProgramCache]: Analyzing trace with hash -357453524, now seen corresponding path program 1 times [2020-10-09 15:27:04,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:04,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605523282] [2020-10-09 15:27:04,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 48 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:04,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:04,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:04,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:04,158 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:04,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605523282] [2020-10-09 15:27:04,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:04,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:04,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740549157] [2020-10-09 15:27:04,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:04,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:04,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:04,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:04,170 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 233 [2020-10-09 15:27:04,171 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 211 transitions, 513 flow. Second operand 3 states. [2020-10-09 15:27:04,171 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:04,171 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 233 [2020-10-09 15:27:04,171 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:04,212 INFO L129 PetriNetUnfolder]: 12/244 cut-off events. [2020-10-09 15:27:04,212 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-09 15:27:04,217 INFO L80 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 244 events. 12/244 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 894 event pairs, 0 based on Foata normal form. 1/226 useless extension candidates. Maximal degree in co-relation 287. Up to 9 conditions per place. [2020-10-09 15:27:04,218 INFO L132 encePairwiseOnDemand]: 231/233 looper letters, 5 selfloop transitions, 1 changer transitions 0/209 dead transitions. [2020-10-09 15:27:04,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 209 transitions, 515 flow [2020-10-09 15:27:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:04,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2020-10-09 15:27:04,220 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9413447782546495 [2020-10-09 15:27:04,220 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 658 transitions. [2020-10-09 15:27:04,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions. [2020-10-09 15:27:04,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:04,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions. [2020-10-09 15:27:04,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:04,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:04,222 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:04,222 INFO L185 Difference]: Start difference. First operand has 231 places, 211 transitions, 513 flow. Second operand 3 states and 658 transitions. [2020-10-09 15:27:04,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 209 transitions, 515 flow [2020-10-09 15:27:04,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 209 transitions, 507 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:04,227 INFO L241 Difference]: Finished difference. Result has 231 places, 209 transitions, 500 flow [2020-10-09 15:27:04,227 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=231, PETRI_TRANSITIONS=209} [2020-10-09 15:27:04,227 INFO L341 CegarLoopForPetriNet]: 217 programPoint places, 14 predicate places. [2020-10-09 15:27:04,227 INFO L481 AbstractCegarLoop]: Abstraction has has 231 places, 209 transitions, 500 flow [2020-10-09 15:27:04,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:04,228 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:04,228 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:04,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 mathsat -unsat_core_generation=3 [2020-10-09 15:27:04,439 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:04,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:04,439 INFO L82 PathProgramCache]: Analyzing trace with hash -357454547, now seen corresponding path program 1 times [2020-10-09 15:27:04,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:04,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891972962] [2020-10-09 15:27:04,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 49 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:04,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:04,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:04,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:04,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891972962] [2020-10-09 15:27:04,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:04,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:04,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331155410] [2020-10-09 15:27:04,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:04,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:04,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:04,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:04,551 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 233 [2020-10-09 15:27:04,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 209 transitions, 500 flow. Second operand 3 states. [2020-10-09 15:27:04,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:04,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 233 [2020-10-09 15:27:04,552 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:04,599 INFO L129 PetriNetUnfolder]: 12/242 cut-off events. [2020-10-09 15:27:04,599 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 15:27:04,604 INFO L80 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 242 events. 12/242 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 878 event pairs, 0 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 291. Up to 9 conditions per place. [2020-10-09 15:27:04,606 INFO L132 encePairwiseOnDemand]: 231/233 looper letters, 8 selfloop transitions, 1 changer transitions 0/207 dead transitions. [2020-10-09 15:27:04,606 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 207 transitions, 513 flow [2020-10-09 15:27:04,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:04,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2020-10-09 15:27:04,607 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9241773962804005 [2020-10-09 15:27:04,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 646 transitions. [2020-10-09 15:27:04,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 646 transitions. [2020-10-09 15:27:04,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:04,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 646 transitions. [2020-10-09 15:27:04,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:04,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:04,610 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:04,610 INFO L185 Difference]: Start difference. First operand has 231 places, 209 transitions, 500 flow. Second operand 3 states and 646 transitions. [2020-10-09 15:27:04,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 207 transitions, 513 flow [2020-10-09 15:27:04,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 207 transitions, 512 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:04,615 INFO L241 Difference]: Finished difference. Result has 230 places, 207 transitions, 496 flow [2020-10-09 15:27:04,615 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=230, PETRI_TRANSITIONS=207} [2020-10-09 15:27:04,616 INFO L341 CegarLoopForPetriNet]: 217 programPoint places, 13 predicate places. [2020-10-09 15:27:04,616 INFO L481 AbstractCegarLoop]: Abstraction has has 230 places, 207 transitions, 496 flow [2020-10-09 15:27:04,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:04,616 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:04,616 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:04,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 mathsat -unsat_core_generation=3 [2020-10-09 15:27:04,829 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:04,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:04,829 INFO L82 PathProgramCache]: Analyzing trace with hash -326091059, now seen corresponding path program 1 times [2020-10-09 15:27:04,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:04,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747311129] [2020-10-09 15:27:04,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 50 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:27:04,920 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:27:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:27:04,938 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:27:04,962 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:27:04,962 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:27:05,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 mathsat -unsat_core_generation=3 [2020-10-09 15:27:05,163 WARN L371 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:27:05,164 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2020-10-09 15:27:05,181 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,182 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,182 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,182 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,182 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,182 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,182 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,183 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,183 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,183 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,183 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,183 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,183 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,183 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,184 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,184 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,184 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,184 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,184 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,184 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,184 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,184 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,184 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,184 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,185 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,185 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,185 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,185 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,185 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,185 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,185 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,185 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,185 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,185 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,185 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,185 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,185 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,187 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,187 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,187 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,188 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,188 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,190 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,190 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,190 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,193 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,193 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,193 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,215 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,215 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,217 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,217 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,220 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,220 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,222 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,222 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:05,228 INFO L253 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2020-10-09 15:27:05,228 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:27:05,228 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:27:05,229 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:27:05,229 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:27:05,229 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:27:05,229 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:27:05,229 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:27:05,229 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:27:05,231 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 242 places, 260 transitions, 637 flow [2020-10-09 15:27:05,270 INFO L129 PetriNetUnfolder]: 46/340 cut-off events. [2020-10-09 15:27:05,271 INFO L130 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2020-10-09 15:27:05,277 INFO L80 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 340 events. 46/340 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1245 event pairs, 0 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 359. Up to 20 conditions per place. [2020-10-09 15:27:05,277 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 260 transitions, 637 flow [2020-10-09 15:27:05,281 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 242 places, 260 transitions, 637 flow [2020-10-09 15:27:05,301 INFO L129 PetriNetUnfolder]: 10/99 cut-off events. [2020-10-09 15:27:05,301 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:27:05,301 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:05,301 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:05,301 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:05,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:05,302 INFO L82 PathProgramCache]: Analyzing trace with hash -619683264, now seen corresponding path program 1 times [2020-10-09 15:27:05,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:05,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290368919] [2020-10-09 15:27:05,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 51 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:05,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:05,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:05,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:05,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:05,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290368919] [2020-10-09 15:27:05,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:05,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:05,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178709694] [2020-10-09 15:27:05,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:05,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:05,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:05,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:05,431 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 260 [2020-10-09 15:27:05,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 260 transitions, 637 flow. Second operand 3 states. [2020-10-09 15:27:05,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:05,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 260 [2020-10-09 15:27:05,432 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:05,471 INFO L129 PetriNetUnfolder]: 26/279 cut-off events. [2020-10-09 15:27:05,471 INFO L130 PetriNetUnfolder]: For 157/157 co-relation queries the response was YES. [2020-10-09 15:27:05,476 INFO L80 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 279 events. 26/279 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 999 event pairs, 0 based on Foata normal form. 44/286 useless extension candidates. Maximal degree in co-relation 310. Up to 10 conditions per place. [2020-10-09 15:27:05,478 INFO L132 encePairwiseOnDemand]: 244/260 looper letters, 10 selfloop transitions, 3 changer transitions 0/247 dead transitions. [2020-10-09 15:27:05,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 247 transitions, 637 flow [2020-10-09 15:27:05,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:05,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:05,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2020-10-09 15:27:05,480 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9628205128205128 [2020-10-09 15:27:05,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 751 transitions. [2020-10-09 15:27:05,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 751 transitions. [2020-10-09 15:27:05,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:05,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 751 transitions. [2020-10-09 15:27:05,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:05,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:05,483 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:05,483 INFO L185 Difference]: Start difference. First operand has 242 places, 260 transitions, 637 flow. Second operand 3 states and 751 transitions. [2020-10-09 15:27:05,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 247 transitions, 637 flow [2020-10-09 15:27:05,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 247 transitions, 565 flow, removed 36 selfloop flow, removed 0 redundant places. [2020-10-09 15:27:05,488 INFO L241 Difference]: Finished difference. Result has 241 places, 247 transitions, 559 flow [2020-10-09 15:27:05,489 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=559, PETRI_PLACES=241, PETRI_TRANSITIONS=247} [2020-10-09 15:27:05,489 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, -1 predicate places. [2020-10-09 15:27:05,489 INFO L481 AbstractCegarLoop]: Abstraction has has 241 places, 247 transitions, 559 flow [2020-10-09 15:27:05,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:05,489 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:05,490 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:05,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 mathsat -unsat_core_generation=3 [2020-10-09 15:27:05,698 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:05,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:05,698 INFO L82 PathProgramCache]: Analyzing trace with hash -619682241, now seen corresponding path program 1 times [2020-10-09 15:27:05,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:05,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715851223] [2020-10-09 15:27:05,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 52 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:05,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:05,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:05,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:05,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715851223] [2020-10-09 15:27:05,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:05,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:05,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004458242] [2020-10-09 15:27:05,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:05,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:05,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:05,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:05,818 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 260 [2020-10-09 15:27:05,819 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 247 transitions, 559 flow. Second operand 3 states. [2020-10-09 15:27:05,819 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:05,819 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 260 [2020-10-09 15:27:05,819 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:05,857 INFO L129 PetriNetUnfolder]: 25/277 cut-off events. [2020-10-09 15:27:05,857 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-09 15:27:05,862 INFO L80 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 277 events. 25/277 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 993 event pairs, 0 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 301. Up to 10 conditions per place. [2020-10-09 15:27:05,863 INFO L132 encePairwiseOnDemand]: 257/260 looper letters, 5 selfloop transitions, 2 changer transitions 0/247 dead transitions. [2020-10-09 15:27:05,864 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 247 transitions, 571 flow [2020-10-09 15:27:05,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 737 transitions. [2020-10-09 15:27:05,865 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9448717948717948 [2020-10-09 15:27:05,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 737 transitions. [2020-10-09 15:27:05,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 737 transitions. [2020-10-09 15:27:05,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:05,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 737 transitions. [2020-10-09 15:27:05,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:05,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:05,868 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:05,868 INFO L185 Difference]: Start difference. First operand has 241 places, 247 transitions, 559 flow. Second operand 3 states and 737 transitions. [2020-10-09 15:27:05,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 247 transitions, 571 flow [2020-10-09 15:27:05,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 247 transitions, 566 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:05,872 INFO L241 Difference]: Finished difference. Result has 244 places, 247 transitions, 564 flow [2020-10-09 15:27:05,872 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=244, PETRI_TRANSITIONS=247} [2020-10-09 15:27:05,872 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 2 predicate places. [2020-10-09 15:27:05,872 INFO L481 AbstractCegarLoop]: Abstraction has has 244 places, 247 transitions, 564 flow [2020-10-09 15:27:05,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:05,873 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:05,873 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:06,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 mathsat -unsat_core_generation=3 [2020-10-09 15:27:06,079 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:06,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:06,079 INFO L82 PathProgramCache]: Analyzing trace with hash -618728929, now seen corresponding path program 1 times [2020-10-09 15:27:06,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:06,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583142455] [2020-10-09 15:27:06,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 53 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:06,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:06,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:06,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:06,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:06,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583142455] [2020-10-09 15:27:06,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:06,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:06,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886168031] [2020-10-09 15:27:06,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:06,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:06,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:06,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:06,195 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 260 [2020-10-09 15:27:06,196 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 247 transitions, 564 flow. Second operand 3 states. [2020-10-09 15:27:06,196 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:06,196 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 260 [2020-10-09 15:27:06,196 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:06,231 INFO L129 PetriNetUnfolder]: 24/274 cut-off events. [2020-10-09 15:27:06,231 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:27:06,235 INFO L80 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 274 events. 24/274 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 974 event pairs, 0 based on Foata normal form. 1/243 useless extension candidates. Maximal degree in co-relation 303. Up to 10 conditions per place. [2020-10-09 15:27:06,237 INFO L132 encePairwiseOnDemand]: 257/260 looper letters, 9 selfloop transitions, 1 changer transitions 0/245 dead transitions. [2020-10-09 15:27:06,237 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 245 transitions, 574 flow [2020-10-09 15:27:06,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:06,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:06,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2020-10-09 15:27:06,238 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9307692307692308 [2020-10-09 15:27:06,238 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 726 transitions. [2020-10-09 15:27:06,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 726 transitions. [2020-10-09 15:27:06,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:06,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 726 transitions. [2020-10-09 15:27:06,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:06,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:06,241 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:06,241 INFO L185 Difference]: Start difference. First operand has 244 places, 247 transitions, 564 flow. Second operand 3 states and 726 transitions. [2020-10-09 15:27:06,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 245 transitions, 574 flow [2020-10-09 15:27:06,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 245 transitions, 572 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:06,245 INFO L241 Difference]: Finished difference. Result has 245 places, 245 transitions, 554 flow [2020-10-09 15:27:06,245 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=245, PETRI_TRANSITIONS=245} [2020-10-09 15:27:06,245 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 3 predicate places. [2020-10-09 15:27:06,245 INFO L481 AbstractCegarLoop]: Abstraction has has 245 places, 245 transitions, 554 flow [2020-10-09 15:27:06,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:06,245 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:06,245 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:06,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 mathsat -unsat_core_generation=3 [2020-10-09 15:27:06,446 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:06,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:06,447 INFO L82 PathProgramCache]: Analyzing trace with hash -618729952, now seen corresponding path program 1 times [2020-10-09 15:27:06,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:06,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622849214] [2020-10-09 15:27:06,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 54 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:06,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:06,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:06,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:06,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622849214] [2020-10-09 15:27:06,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:06,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:06,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742929118] [2020-10-09 15:27:06,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:06,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:06,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:06,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:06,583 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 260 [2020-10-09 15:27:06,584 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 245 transitions, 554 flow. Second operand 3 states. [2020-10-09 15:27:06,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:06,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 260 [2020-10-09 15:27:06,584 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:06,632 INFO L129 PetriNetUnfolder]: 24/271 cut-off events. [2020-10-09 15:27:06,632 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 15:27:06,639 INFO L80 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 271 events. 24/271 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 954 event pairs, 0 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 301. Up to 10 conditions per place. [2020-10-09 15:27:06,641 INFO L132 encePairwiseOnDemand]: 258/260 looper letters, 4 selfloop transitions, 1 changer transitions 0/242 dead transitions. [2020-10-09 15:27:06,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 242 transitions, 553 flow [2020-10-09 15:27:06,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:06,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 738 transitions. [2020-10-09 15:27:06,642 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9461538461538461 [2020-10-09 15:27:06,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 738 transitions. [2020-10-09 15:27:06,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 738 transitions. [2020-10-09 15:27:06,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:06,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 738 transitions. [2020-10-09 15:27:06,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:06,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:06,645 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:06,645 INFO L185 Difference]: Start difference. First operand has 245 places, 245 transitions, 554 flow. Second operand 3 states and 738 transitions. [2020-10-09 15:27:06,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 242 transitions, 553 flow [2020-10-09 15:27:06,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 242 transitions, 548 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:06,649 INFO L241 Difference]: Finished difference. Result has 242 places, 242 transitions, 540 flow [2020-10-09 15:27:06,649 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=242, PETRI_TRANSITIONS=242} [2020-10-09 15:27:06,649 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 0 predicate places. [2020-10-09 15:27:06,649 INFO L481 AbstractCegarLoop]: Abstraction has has 242 places, 242 transitions, 540 flow [2020-10-09 15:27:06,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:06,649 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:06,650 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:06,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 mathsat -unsat_core_generation=3 [2020-10-09 15:27:06,850 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:06,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:06,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1581236966, now seen corresponding path program 1 times [2020-10-09 15:27:06,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:06,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122752789] [2020-10-09 15:27:06,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 55 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:06,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:06,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:06,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:06,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122752789] [2020-10-09 15:27:06,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:06,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:06,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555912659] [2020-10-09 15:27:06,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:06,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:06,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:06,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:06,992 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 260 [2020-10-09 15:27:06,993 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 242 transitions, 540 flow. Second operand 3 states. [2020-10-09 15:27:06,993 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:06,993 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 260 [2020-10-09 15:27:06,993 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:07,032 INFO L129 PetriNetUnfolder]: 23/278 cut-off events. [2020-10-09 15:27:07,033 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 15:27:07,039 INFO L80 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 278 events. 23/278 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1012 event pairs, 0 based on Foata normal form. 1/246 useless extension candidates. Maximal degree in co-relation 309. Up to 10 conditions per place. [2020-10-09 15:27:07,041 INFO L132 encePairwiseOnDemand]: 258/260 looper letters, 4 selfloop transitions, 1 changer transitions 0/242 dead transitions. [2020-10-09 15:27:07,041 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 242 transitions, 550 flow [2020-10-09 15:27:07,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 738 transitions. [2020-10-09 15:27:07,043 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9461538461538461 [2020-10-09 15:27:07,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 738 transitions. [2020-10-09 15:27:07,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 738 transitions. [2020-10-09 15:27:07,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:07,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 738 transitions. [2020-10-09 15:27:07,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:07,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:07,044 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:07,045 INFO L185 Difference]: Start difference. First operand has 242 places, 242 transitions, 540 flow. Second operand 3 states and 738 transitions. [2020-10-09 15:27:07,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 242 transitions, 550 flow [2020-10-09 15:27:07,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 242 transitions, 549 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:07,048 INFO L241 Difference]: Finished difference. Result has 244 places, 242 transitions, 544 flow [2020-10-09 15:27:07,048 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=244, PETRI_TRANSITIONS=242} [2020-10-09 15:27:07,048 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 2 predicate places. [2020-10-09 15:27:07,049 INFO L481 AbstractCegarLoop]: Abstraction has has 244 places, 242 transitions, 544 flow [2020-10-09 15:27:07,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:07,049 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:07,049 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:07,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 mathsat -unsat_core_generation=3 [2020-10-09 15:27:07,250 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:07,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:07,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1581237989, now seen corresponding path program 1 times [2020-10-09 15:27:07,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:07,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995464689] [2020-10-09 15:27:07,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 56 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:07,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:07,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:07,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:07,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:07,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995464689] [2020-10-09 15:27:07,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:07,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:07,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837095216] [2020-10-09 15:27:07,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:07,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:07,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:07,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:07,381 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 260 [2020-10-09 15:27:07,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 242 transitions, 544 flow. Second operand 3 states. [2020-10-09 15:27:07,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:07,382 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 260 [2020-10-09 15:27:07,382 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:07,418 INFO L129 PetriNetUnfolder]: 21/280 cut-off events. [2020-10-09 15:27:07,418 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-09 15:27:07,423 INFO L80 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 280 events. 21/280 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1049 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 320. Up to 10 conditions per place. [2020-10-09 15:27:07,425 INFO L132 encePairwiseOnDemand]: 256/260 looper letters, 9 selfloop transitions, 3 changer transitions 0/243 dead transitions. [2020-10-09 15:27:07,425 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 243 transitions, 570 flow [2020-10-09 15:27:07,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 727 transitions. [2020-10-09 15:27:07,426 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9320512820512821 [2020-10-09 15:27:07,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 727 transitions. [2020-10-09 15:27:07,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 727 transitions. [2020-10-09 15:27:07,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:07,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 727 transitions. [2020-10-09 15:27:07,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:07,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:07,428 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:07,428 INFO L185 Difference]: Start difference. First operand has 244 places, 242 transitions, 544 flow. Second operand 3 states and 727 transitions. [2020-10-09 15:27:07,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 243 transitions, 570 flow [2020-10-09 15:27:07,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 243 transitions, 569 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:07,432 INFO L241 Difference]: Finished difference. Result has 247 places, 243 transitions, 561 flow [2020-10-09 15:27:07,432 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=561, PETRI_PLACES=247, PETRI_TRANSITIONS=243} [2020-10-09 15:27:07,433 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 5 predicate places. [2020-10-09 15:27:07,433 INFO L481 AbstractCegarLoop]: Abstraction has has 247 places, 243 transitions, 561 flow [2020-10-09 15:27:07,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:07,433 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:07,433 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:07,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 mathsat -unsat_core_generation=3 [2020-10-09 15:27:07,634 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:07,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1580284677, now seen corresponding path program 1 times [2020-10-09 15:27:07,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:07,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654288049] [2020-10-09 15:27:07,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 57 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:07,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:07,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:07,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:07,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654288049] [2020-10-09 15:27:07,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:07,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:07,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324651778] [2020-10-09 15:27:07,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:07,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:07,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:07,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:07,763 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 260 [2020-10-09 15:27:07,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 243 transitions, 561 flow. Second operand 3 states. [2020-10-09 15:27:07,763 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:07,763 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 260 [2020-10-09 15:27:07,764 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:07,810 INFO L129 PetriNetUnfolder]: 21/273 cut-off events. [2020-10-09 15:27:07,810 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:07,815 INFO L80 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 273 events. 21/273 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 986 event pairs, 0 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 305. Up to 10 conditions per place. [2020-10-09 15:27:07,817 INFO L132 encePairwiseOnDemand]: 258/260 looper letters, 5 selfloop transitions, 1 changer transitions 0/241 dead transitions. [2020-10-09 15:27:07,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 241 transitions, 563 flow [2020-10-09 15:27:07,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2020-10-09 15:27:07,819 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9435897435897436 [2020-10-09 15:27:07,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 736 transitions. [2020-10-09 15:27:07,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 736 transitions. [2020-10-09 15:27:07,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:07,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 736 transitions. [2020-10-09 15:27:07,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:07,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:07,822 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:07,822 INFO L185 Difference]: Start difference. First operand has 247 places, 243 transitions, 561 flow. Second operand 3 states and 736 transitions. [2020-10-09 15:27:07,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 241 transitions, 563 flow [2020-10-09 15:27:07,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 241 transitions, 555 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:07,828 INFO L241 Difference]: Finished difference. Result has 247 places, 241 transitions, 548 flow [2020-10-09 15:27:07,829 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=247, PETRI_TRANSITIONS=241} [2020-10-09 15:27:07,829 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 5 predicate places. [2020-10-09 15:27:07,829 INFO L481 AbstractCegarLoop]: Abstraction has has 247 places, 241 transitions, 548 flow [2020-10-09 15:27:07,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:07,829 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:07,829 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:08,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 mathsat -unsat_core_generation=3 [2020-10-09 15:27:08,042 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:08,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:08,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1580283654, now seen corresponding path program 1 times [2020-10-09 15:27:08,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:08,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407939784] [2020-10-09 15:27:08,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 58 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:08,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:08,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:08,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:08,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:08,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407939784] [2020-10-09 15:27:08,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:08,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:08,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897428810] [2020-10-09 15:27:08,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:08,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:08,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:08,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:08,170 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 260 [2020-10-09 15:27:08,171 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 241 transitions, 548 flow. Second operand 3 states. [2020-10-09 15:27:08,171 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:08,171 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 260 [2020-10-09 15:27:08,171 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:08,222 INFO L129 PetriNetUnfolder]: 21/271 cut-off events. [2020-10-09 15:27:08,223 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-09 15:27:08,230 INFO L80 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 271 events. 21/271 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 971 event pairs, 0 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 310. Up to 10 conditions per place. [2020-10-09 15:27:08,232 INFO L132 encePairwiseOnDemand]: 258/260 looper letters, 8 selfloop transitions, 1 changer transitions 0/239 dead transitions. [2020-10-09 15:27:08,232 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 239 transitions, 561 flow [2020-10-09 15:27:08,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2020-10-09 15:27:08,234 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9282051282051282 [2020-10-09 15:27:08,234 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 724 transitions. [2020-10-09 15:27:08,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 724 transitions. [2020-10-09 15:27:08,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:08,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 724 transitions. [2020-10-09 15:27:08,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:08,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:08,236 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:08,237 INFO L185 Difference]: Start difference. First operand has 247 places, 241 transitions, 548 flow. Second operand 3 states and 724 transitions. [2020-10-09 15:27:08,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 239 transitions, 561 flow [2020-10-09 15:27:08,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 239 transitions, 560 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:08,242 INFO L241 Difference]: Finished difference. Result has 246 places, 239 transitions, 544 flow [2020-10-09 15:27:08,242 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=246, PETRI_TRANSITIONS=239} [2020-10-09 15:27:08,242 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 4 predicate places. [2020-10-09 15:27:08,242 INFO L481 AbstractCegarLoop]: Abstraction has has 246 places, 239 transitions, 544 flow [2020-10-09 15:27:08,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:08,243 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:08,243 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:08,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 mathsat -unsat_core_generation=3 [2020-10-09 15:27:08,454 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:08,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:08,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1898001235, now seen corresponding path program 1 times [2020-10-09 15:27:08,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:08,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456076806] [2020-10-09 15:27:08,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 59 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:08,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:08,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:08,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:08,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456076806] [2020-10-09 15:27:08,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:08,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:08,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807362985] [2020-10-09 15:27:08,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:08,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:08,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:08,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:08,576 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 260 [2020-10-09 15:27:08,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 239 transitions, 544 flow. Second operand 3 states. [2020-10-09 15:27:08,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:08,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 260 [2020-10-09 15:27:08,577 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:08,617 INFO L129 PetriNetUnfolder]: 20/278 cut-off events. [2020-10-09 15:27:08,617 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 15:27:08,621 INFO L80 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 278 events. 20/278 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1028 event pairs, 0 based on Foata normal form. 1/250 useless extension candidates. Maximal degree in co-relation 313. Up to 10 conditions per place. [2020-10-09 15:27:08,623 INFO L132 encePairwiseOnDemand]: 258/260 looper letters, 4 selfloop transitions, 1 changer transitions 0/239 dead transitions. [2020-10-09 15:27:08,623 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 239 transitions, 554 flow [2020-10-09 15:27:08,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:08,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 738 transitions. [2020-10-09 15:27:08,624 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9461538461538461 [2020-10-09 15:27:08,624 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 738 transitions. [2020-10-09 15:27:08,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 738 transitions. [2020-10-09 15:27:08,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:08,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 738 transitions. [2020-10-09 15:27:08,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:08,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:08,626 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:08,626 INFO L185 Difference]: Start difference. First operand has 246 places, 239 transitions, 544 flow. Second operand 3 states and 738 transitions. [2020-10-09 15:27:08,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 239 transitions, 554 flow [2020-10-09 15:27:08,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 239 transitions, 553 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:08,630 INFO L241 Difference]: Finished difference. Result has 248 places, 239 transitions, 548 flow [2020-10-09 15:27:08,630 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=248, PETRI_TRANSITIONS=239} [2020-10-09 15:27:08,630 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 6 predicate places. [2020-10-09 15:27:08,630 INFO L481 AbstractCegarLoop]: Abstraction has has 248 places, 239 transitions, 548 flow [2020-10-09 15:27:08,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:08,630 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:08,631 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:08,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 mathsat -unsat_core_generation=3 [2020-10-09 15:27:08,840 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:08,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:08,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1898000212, now seen corresponding path program 1 times [2020-10-09 15:27:08,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:08,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184160293] [2020-10-09 15:27:08,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 60 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:08,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:08,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:08,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:08,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184160293] [2020-10-09 15:27:08,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:08,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:08,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554126983] [2020-10-09 15:27:08,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:08,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:08,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:08,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:08,994 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 260 [2020-10-09 15:27:08,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 239 transitions, 548 flow. Second operand 3 states. [2020-10-09 15:27:08,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:08,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 260 [2020-10-09 15:27:08,995 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:09,038 INFO L129 PetriNetUnfolder]: 18/280 cut-off events. [2020-10-09 15:27:09,038 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-09 15:27:09,043 INFO L80 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 280 events. 18/280 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1063 event pairs, 0 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 326. Up to 10 conditions per place. [2020-10-09 15:27:09,045 INFO L132 encePairwiseOnDemand]: 256/260 looper letters, 9 selfloop transitions, 3 changer transitions 0/240 dead transitions. [2020-10-09 15:27:09,045 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 240 transitions, 574 flow [2020-10-09 15:27:09,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 727 transitions. [2020-10-09 15:27:09,046 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9320512820512821 [2020-10-09 15:27:09,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 727 transitions. [2020-10-09 15:27:09,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 727 transitions. [2020-10-09 15:27:09,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:09,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 727 transitions. [2020-10-09 15:27:09,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:09,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:09,049 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:09,049 INFO L185 Difference]: Start difference. First operand has 248 places, 239 transitions, 548 flow. Second operand 3 states and 727 transitions. [2020-10-09 15:27:09,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 240 transitions, 574 flow [2020-10-09 15:27:09,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 240 transitions, 573 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:09,055 INFO L241 Difference]: Finished difference. Result has 251 places, 240 transitions, 565 flow [2020-10-09 15:27:09,055 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=565, PETRI_PLACES=251, PETRI_TRANSITIONS=240} [2020-10-09 15:27:09,055 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 9 predicate places. [2020-10-09 15:27:09,056 INFO L481 AbstractCegarLoop]: Abstraction has has 251 places, 240 transitions, 565 flow [2020-10-09 15:27:09,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:09,056 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:09,056 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:09,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 mathsat -unsat_core_generation=3 [2020-10-09 15:27:09,267 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:09,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:09,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1898953524, now seen corresponding path program 1 times [2020-10-09 15:27:09,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:09,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045597859] [2020-10-09 15:27:09,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 61 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:09,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:09,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:09,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:09,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045597859] [2020-10-09 15:27:09,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:09,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:09,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912272485] [2020-10-09 15:27:09,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:09,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:09,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:09,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:09,381 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 260 [2020-10-09 15:27:09,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 240 transitions, 565 flow. Second operand 3 states. [2020-10-09 15:27:09,382 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:09,382 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 260 [2020-10-09 15:27:09,382 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:09,418 INFO L129 PetriNetUnfolder]: 18/273 cut-off events. [2020-10-09 15:27:09,418 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:09,422 INFO L80 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 273 events. 18/273 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1001 event pairs, 0 based on Foata normal form. 1/248 useless extension candidates. Maximal degree in co-relation 312. Up to 10 conditions per place. [2020-10-09 15:27:09,424 INFO L132 encePairwiseOnDemand]: 258/260 looper letters, 5 selfloop transitions, 1 changer transitions 0/238 dead transitions. [2020-10-09 15:27:09,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 238 transitions, 567 flow [2020-10-09 15:27:09,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:09,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2020-10-09 15:27:09,425 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9435897435897436 [2020-10-09 15:27:09,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 736 transitions. [2020-10-09 15:27:09,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 736 transitions. [2020-10-09 15:27:09,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:09,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 736 transitions. [2020-10-09 15:27:09,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:09,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:09,428 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:09,428 INFO L185 Difference]: Start difference. First operand has 251 places, 240 transitions, 565 flow. Second operand 3 states and 736 transitions. [2020-10-09 15:27:09,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 238 transitions, 567 flow [2020-10-09 15:27:09,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 238 transitions, 559 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:09,431 INFO L241 Difference]: Finished difference. Result has 251 places, 238 transitions, 552 flow [2020-10-09 15:27:09,431 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=251, PETRI_TRANSITIONS=238} [2020-10-09 15:27:09,431 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 9 predicate places. [2020-10-09 15:27:09,431 INFO L481 AbstractCegarLoop]: Abstraction has has 251 places, 238 transitions, 552 flow [2020-10-09 15:27:09,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:09,432 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:09,432 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:09,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 mathsat -unsat_core_generation=3 [2020-10-09 15:27:09,632 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:09,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:09,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1898954547, now seen corresponding path program 1 times [2020-10-09 15:27:09,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:09,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485319250] [2020-10-09 15:27:09,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 62 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:09,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:09,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:09,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:09,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:09,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485319250] [2020-10-09 15:27:09,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:09,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:09,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69928224] [2020-10-09 15:27:09,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:09,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:09,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:09,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:09,767 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 260 [2020-10-09 15:27:09,767 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 238 transitions, 552 flow. Second operand 3 states. [2020-10-09 15:27:09,767 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:09,768 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 260 [2020-10-09 15:27:09,768 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:09,828 INFO L129 PetriNetUnfolder]: 18/271 cut-off events. [2020-10-09 15:27:09,828 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-09 15:27:09,836 INFO L80 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 271 events. 18/271 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 988 event pairs, 0 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 316. Up to 10 conditions per place. [2020-10-09 15:27:09,839 INFO L132 encePairwiseOnDemand]: 258/260 looper letters, 8 selfloop transitions, 1 changer transitions 0/236 dead transitions. [2020-10-09 15:27:09,839 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 236 transitions, 565 flow [2020-10-09 15:27:09,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2020-10-09 15:27:09,841 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9282051282051282 [2020-10-09 15:27:09,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 724 transitions. [2020-10-09 15:27:09,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 724 transitions. [2020-10-09 15:27:09,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:09,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 724 transitions. [2020-10-09 15:27:09,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:09,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:09,844 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:09,844 INFO L185 Difference]: Start difference. First operand has 251 places, 238 transitions, 552 flow. Second operand 3 states and 724 transitions. [2020-10-09 15:27:09,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 236 transitions, 565 flow [2020-10-09 15:27:09,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 236 transitions, 564 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:09,850 INFO L241 Difference]: Finished difference. Result has 250 places, 236 transitions, 548 flow [2020-10-09 15:27:09,850 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=250, PETRI_TRANSITIONS=236} [2020-10-09 15:27:09,850 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 8 predicate places. [2020-10-09 15:27:09,851 INFO L481 AbstractCegarLoop]: Abstraction has has 250 places, 236 transitions, 548 flow [2020-10-09 15:27:09,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:09,851 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:09,851 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:10,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 mathsat -unsat_core_generation=3 [2020-10-09 15:27:10,063 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:10,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:10,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1599308556, now seen corresponding path program 1 times [2020-10-09 15:27:10,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:10,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115909964] [2020-10-09 15:27:10,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 63 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:10,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:10,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:10,175 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:10,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:10,178 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:10,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115909964] [2020-10-09 15:27:10,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:10,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:10,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284228821] [2020-10-09 15:27:10,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:10,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:10,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:10,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:10,196 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 260 [2020-10-09 15:27:10,196 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 236 transitions, 548 flow. Second operand 3 states. [2020-10-09 15:27:10,197 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:10,197 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 260 [2020-10-09 15:27:10,197 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:10,236 INFO L129 PetriNetUnfolder]: 17/279 cut-off events. [2020-10-09 15:27:10,236 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 15:27:10,241 INFO L80 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 279 events. 17/279 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1057 event pairs, 0 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 328. Up to 10 conditions per place. [2020-10-09 15:27:10,243 INFO L132 encePairwiseOnDemand]: 255/260 looper letters, 10 selfloop transitions, 3 changer transitions 0/238 dead transitions. [2020-10-09 15:27:10,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 238 transitions, 578 flow [2020-10-09 15:27:10,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:10,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2020-10-09 15:27:10,245 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9346153846153846 [2020-10-09 15:27:10,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 729 transitions. [2020-10-09 15:27:10,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 729 transitions. [2020-10-09 15:27:10,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:10,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 729 transitions. [2020-10-09 15:27:10,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:10,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:10,247 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:10,248 INFO L185 Difference]: Start difference. First operand has 250 places, 236 transitions, 548 flow. Second operand 3 states and 729 transitions. [2020-10-09 15:27:10,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 238 transitions, 578 flow [2020-10-09 15:27:10,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 238 transitions, 577 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:10,252 INFO L241 Difference]: Finished difference. Result has 253 places, 238 transitions, 571 flow [2020-10-09 15:27:10,252 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=253, PETRI_TRANSITIONS=238} [2020-10-09 15:27:10,253 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 11 predicate places. [2020-10-09 15:27:10,253 INFO L481 AbstractCegarLoop]: Abstraction has has 253 places, 238 transitions, 571 flow [2020-10-09 15:27:10,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:10,253 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:10,253 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:10,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 mathsat -unsat_core_generation=3 [2020-10-09 15:27:10,464 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:10,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:10,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1599309579, now seen corresponding path program 1 times [2020-10-09 15:27:10,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:10,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257487298] [2020-10-09 15:27:10,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 64 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:10,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:10,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:10,575 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:10,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:10,579 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:10,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257487298] [2020-10-09 15:27:10,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:10,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:10,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740157403] [2020-10-09 15:27:10,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:10,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:10,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:10,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:10,593 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 260 [2020-10-09 15:27:10,594 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 238 transitions, 571 flow. Second operand 3 states. [2020-10-09 15:27:10,594 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:10,594 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 260 [2020-10-09 15:27:10,594 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:10,663 INFO L129 PetriNetUnfolder]: 15/280 cut-off events. [2020-10-09 15:27:10,663 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:10,671 INFO L80 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 280 events. 15/280 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1083 event pairs, 0 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 326. Up to 10 conditions per place. [2020-10-09 15:27:10,673 INFO L132 encePairwiseOnDemand]: 258/260 looper letters, 4 selfloop transitions, 1 changer transitions 0/237 dead transitions. [2020-10-09 15:27:10,673 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 237 transitions, 577 flow [2020-10-09 15:27:10,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:10,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 738 transitions. [2020-10-09 15:27:10,674 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9461538461538461 [2020-10-09 15:27:10,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 738 transitions. [2020-10-09 15:27:10,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 738 transitions. [2020-10-09 15:27:10,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:10,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 738 transitions. [2020-10-09 15:27:10,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:10,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:10,677 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:10,677 INFO L185 Difference]: Start difference. First operand has 253 places, 238 transitions, 571 flow. Second operand 3 states and 738 transitions. [2020-10-09 15:27:10,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 237 transitions, 577 flow [2020-10-09 15:27:10,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 237 transitions, 572 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:10,681 INFO L241 Difference]: Finished difference. Result has 255 places, 237 transitions, 567 flow [2020-10-09 15:27:10,682 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=567, PETRI_PLACES=255, PETRI_TRANSITIONS=237} [2020-10-09 15:27:10,682 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 13 predicate places. [2020-10-09 15:27:10,682 INFO L481 AbstractCegarLoop]: Abstraction has has 255 places, 237 transitions, 567 flow [2020-10-09 15:27:10,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:10,682 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:10,683 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:10,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 mathsat -unsat_core_generation=3 [2020-10-09 15:27:10,892 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:10,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:10,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1600261868, now seen corresponding path program 1 times [2020-10-09 15:27:10,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:10,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635033587] [2020-10-09 15:27:10,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 65 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:11,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:11,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:11,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:11,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635033587] [2020-10-09 15:27:11,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:11,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:11,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434790796] [2020-10-09 15:27:11,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:11,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:11,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:11,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:11,029 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 260 [2020-10-09 15:27:11,030 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 237 transitions, 567 flow. Second operand 3 states. [2020-10-09 15:27:11,030 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:11,030 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 260 [2020-10-09 15:27:11,030 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:11,069 INFO L129 PetriNetUnfolder]: 15/273 cut-off events. [2020-10-09 15:27:11,069 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:11,074 INFO L80 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 273 events. 15/273 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1017 event pairs, 0 based on Foata normal form. 1/251 useless extension candidates. Maximal degree in co-relation 322. Up to 10 conditions per place. [2020-10-09 15:27:11,075 INFO L132 encePairwiseOnDemand]: 258/260 looper letters, 5 selfloop transitions, 1 changer transitions 0/235 dead transitions. [2020-10-09 15:27:11,076 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 235 transitions, 570 flow [2020-10-09 15:27:11,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2020-10-09 15:27:11,077 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9435897435897436 [2020-10-09 15:27:11,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 736 transitions. [2020-10-09 15:27:11,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 736 transitions. [2020-10-09 15:27:11,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:11,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 736 transitions. [2020-10-09 15:27:11,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:11,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:11,078 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:11,078 INFO L185 Difference]: Start difference. First operand has 255 places, 237 transitions, 567 flow. Second operand 3 states and 736 transitions. [2020-10-09 15:27:11,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 235 transitions, 570 flow [2020-10-09 15:27:11,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 235 transitions, 563 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:11,082 INFO L241 Difference]: Finished difference. Result has 255 places, 235 transitions, 556 flow [2020-10-09 15:27:11,082 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=255, PETRI_TRANSITIONS=235} [2020-10-09 15:27:11,082 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 13 predicate places. [2020-10-09 15:27:11,082 INFO L481 AbstractCegarLoop]: Abstraction has has 255 places, 235 transitions, 556 flow [2020-10-09 15:27:11,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:11,082 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:11,082 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:11,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 mathsat -unsat_core_generation=3 [2020-10-09 15:27:11,285 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:11,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:11,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1600262891, now seen corresponding path program 1 times [2020-10-09 15:27:11,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:11,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133326231] [2020-10-09 15:27:11,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 66 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:11,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:11,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:11,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:11,392 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:11,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133326231] [2020-10-09 15:27:11,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:11,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:11,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624349624] [2020-10-09 15:27:11,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:11,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:11,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:11,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:11,428 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 260 [2020-10-09 15:27:11,429 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 235 transitions, 556 flow. Second operand 3 states. [2020-10-09 15:27:11,429 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:11,429 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 260 [2020-10-09 15:27:11,429 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:11,468 INFO L129 PetriNetUnfolder]: 15/271 cut-off events. [2020-10-09 15:27:11,469 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-09 15:27:11,474 INFO L80 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 271 events. 15/271 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1005 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 322. Up to 10 conditions per place. [2020-10-09 15:27:11,475 INFO L132 encePairwiseOnDemand]: 258/260 looper letters, 8 selfloop transitions, 1 changer transitions 0/233 dead transitions. [2020-10-09 15:27:11,475 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 233 transitions, 569 flow [2020-10-09 15:27:11,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:11,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:11,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2020-10-09 15:27:11,476 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9282051282051282 [2020-10-09 15:27:11,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 724 transitions. [2020-10-09 15:27:11,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 724 transitions. [2020-10-09 15:27:11,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:11,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 724 transitions. [2020-10-09 15:27:11,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:11,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:11,478 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:11,478 INFO L185 Difference]: Start difference. First operand has 255 places, 235 transitions, 556 flow. Second operand 3 states and 724 transitions. [2020-10-09 15:27:11,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 233 transitions, 569 flow [2020-10-09 15:27:11,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 233 transitions, 568 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:11,483 INFO L241 Difference]: Finished difference. Result has 254 places, 233 transitions, 552 flow [2020-10-09 15:27:11,483 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=254, PETRI_TRANSITIONS=233} [2020-10-09 15:27:11,483 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 12 predicate places. [2020-10-09 15:27:11,483 INFO L481 AbstractCegarLoop]: Abstraction has has 254 places, 233 transitions, 552 flow [2020-10-09 15:27:11,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:11,484 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:11,484 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:11,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 mathsat -unsat_core_generation=3 [2020-10-09 15:27:11,695 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:11,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:11,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1991450974, now seen corresponding path program 1 times [2020-10-09 15:27:11,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:11,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863766506] [2020-10-09 15:27:11,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 67 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:11,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:11,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:11,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:11,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863766506] [2020-10-09 15:27:11,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:11,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:11,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634786457] [2020-10-09 15:27:11,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:11,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:11,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:11,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:11,839 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 260 [2020-10-09 15:27:11,839 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 233 transitions, 552 flow. Second operand 3 states. [2020-10-09 15:27:11,839 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:11,840 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 260 [2020-10-09 15:27:11,840 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:11,883 INFO L129 PetriNetUnfolder]: 14/279 cut-off events. [2020-10-09 15:27:11,883 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 15:27:11,888 INFO L80 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 279 events. 14/279 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1074 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 334. Up to 10 conditions per place. [2020-10-09 15:27:11,889 INFO L132 encePairwiseOnDemand]: 255/260 looper letters, 10 selfloop transitions, 3 changer transitions 0/235 dead transitions. [2020-10-09 15:27:11,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 235 transitions, 582 flow [2020-10-09 15:27:11,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:11,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2020-10-09 15:27:11,891 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9346153846153846 [2020-10-09 15:27:11,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 729 transitions. [2020-10-09 15:27:11,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 729 transitions. [2020-10-09 15:27:11,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:11,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 729 transitions. [2020-10-09 15:27:11,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:11,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:11,893 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:11,893 INFO L185 Difference]: Start difference. First operand has 254 places, 233 transitions, 552 flow. Second operand 3 states and 729 transitions. [2020-10-09 15:27:11,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 235 transitions, 582 flow [2020-10-09 15:27:11,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 235 transitions, 581 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:11,898 INFO L241 Difference]: Finished difference. Result has 257 places, 235 transitions, 575 flow [2020-10-09 15:27:11,898 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=575, PETRI_PLACES=257, PETRI_TRANSITIONS=235} [2020-10-09 15:27:11,899 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 15 predicate places. [2020-10-09 15:27:11,899 INFO L481 AbstractCegarLoop]: Abstraction has has 257 places, 235 transitions, 575 flow [2020-10-09 15:27:11,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:11,899 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:11,899 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:12,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 mathsat -unsat_core_generation=3 [2020-10-09 15:27:12,110 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:12,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:12,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1991451997, now seen corresponding path program 1 times [2020-10-09 15:27:12,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:12,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868203176] [2020-10-09 15:27:12,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 68 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:12,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:12,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:12,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:12,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868203176] [2020-10-09 15:27:12,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:12,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:12,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266213555] [2020-10-09 15:27:12,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:12,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:12,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:12,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:12,243 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 260 [2020-10-09 15:27:12,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 235 transitions, 575 flow. Second operand 3 states. [2020-10-09 15:27:12,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:12,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 260 [2020-10-09 15:27:12,244 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:12,290 INFO L129 PetriNetUnfolder]: 13/277 cut-off events. [2020-10-09 15:27:12,290 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:12,295 INFO L80 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 277 events. 13/277 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1061 event pairs, 0 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 331. Up to 10 conditions per place. [2020-10-09 15:27:12,296 INFO L132 encePairwiseOnDemand]: 257/260 looper letters, 5 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2020-10-09 15:27:12,296 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 235 transitions, 587 flow [2020-10-09 15:27:12,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 737 transitions. [2020-10-09 15:27:12,298 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9448717948717948 [2020-10-09 15:27:12,298 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 737 transitions. [2020-10-09 15:27:12,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 737 transitions. [2020-10-09 15:27:12,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:12,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 737 transitions. [2020-10-09 15:27:12,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:12,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:12,299 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:12,299 INFO L185 Difference]: Start difference. First operand has 257 places, 235 transitions, 575 flow. Second operand 3 states and 737 transitions. [2020-10-09 15:27:12,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 235 transitions, 587 flow [2020-10-09 15:27:12,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 235 transitions, 582 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:12,303 INFO L241 Difference]: Finished difference. Result has 260 places, 235 transitions, 580 flow [2020-10-09 15:27:12,304 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=260, PETRI_TRANSITIONS=235} [2020-10-09 15:27:12,304 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 18 predicate places. [2020-10-09 15:27:12,304 INFO L481 AbstractCegarLoop]: Abstraction has has 260 places, 235 transitions, 580 flow [2020-10-09 15:27:12,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:12,304 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:12,304 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:12,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 mathsat -unsat_core_generation=3 [2020-10-09 15:27:12,505 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:12,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:12,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1992404286, now seen corresponding path program 1 times [2020-10-09 15:27:12,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:12,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262584387] [2020-10-09 15:27:12,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 69 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:12,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:12,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:12,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:12,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262584387] [2020-10-09 15:27:12,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:12,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:12,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061189524] [2020-10-09 15:27:12,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:12,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:12,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:12,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:12,634 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 260 [2020-10-09 15:27:12,634 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 235 transitions, 580 flow. Second operand 3 states. [2020-10-09 15:27:12,634 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:12,635 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 260 [2020-10-09 15:27:12,635 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:12,679 INFO L129 PetriNetUnfolder]: 12/273 cut-off events. [2020-10-09 15:27:12,680 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:27:12,704 INFO L80 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 273 events. 12/273 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1036 event pairs, 0 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 327. Up to 10 conditions per place. [2020-10-09 15:27:12,705 INFO L132 encePairwiseOnDemand]: 258/260 looper letters, 4 selfloop transitions, 1 changer transitions 0/232 dead transitions. [2020-10-09 15:27:12,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 232 transitions, 575 flow [2020-10-09 15:27:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 738 transitions. [2020-10-09 15:27:12,706 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9461538461538461 [2020-10-09 15:27:12,706 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 738 transitions. [2020-10-09 15:27:12,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 738 transitions. [2020-10-09 15:27:12,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:12,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 738 transitions. [2020-10-09 15:27:12,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:12,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:12,707 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:12,708 INFO L185 Difference]: Start difference. First operand has 260 places, 235 transitions, 580 flow. Second operand 3 states and 738 transitions. [2020-10-09 15:27:12,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 232 transitions, 575 flow [2020-10-09 15:27:12,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 232 transitions, 568 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:12,712 INFO L241 Difference]: Finished difference. Result has 259 places, 232 transitions, 560 flow [2020-10-09 15:27:12,712 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=259, PETRI_TRANSITIONS=232} [2020-10-09 15:27:12,712 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 17 predicate places. [2020-10-09 15:27:12,712 INFO L481 AbstractCegarLoop]: Abstraction has has 259 places, 232 transitions, 560 flow [2020-10-09 15:27:12,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:12,713 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:12,713 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:12,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 mathsat -unsat_core_generation=3 [2020-10-09 15:27:12,923 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:12,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:12,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1992405309, now seen corresponding path program 1 times [2020-10-09 15:27:12,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:12,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874174450] [2020-10-09 15:27:12,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 70 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:13,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:13,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:13,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:13,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874174450] [2020-10-09 15:27:13,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:13,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:13,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758171355] [2020-10-09 15:27:13,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:13,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:13,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:13,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:13,067 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 260 [2020-10-09 15:27:13,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 232 transitions, 560 flow. Second operand 3 states. [2020-10-09 15:27:13,068 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:13,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 260 [2020-10-09 15:27:13,068 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:13,119 INFO L129 PetriNetUnfolder]: 12/271 cut-off events. [2020-10-09 15:27:13,120 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 15:27:13,126 INFO L80 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 271 events. 12/271 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1022 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 329. Up to 10 conditions per place. [2020-10-09 15:27:13,127 INFO L132 encePairwiseOnDemand]: 258/260 looper letters, 8 selfloop transitions, 1 changer transitions 0/230 dead transitions. [2020-10-09 15:27:13,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 230 transitions, 573 flow [2020-10-09 15:27:13,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:13,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2020-10-09 15:27:13,129 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9282051282051282 [2020-10-09 15:27:13,129 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 724 transitions. [2020-10-09 15:27:13,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 724 transitions. [2020-10-09 15:27:13,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:13,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 724 transitions. [2020-10-09 15:27:13,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:13,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:13,131 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:13,131 INFO L185 Difference]: Start difference. First operand has 259 places, 232 transitions, 560 flow. Second operand 3 states and 724 transitions. [2020-10-09 15:27:13,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 230 transitions, 573 flow [2020-10-09 15:27:13,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 230 transitions, 572 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:13,134 INFO L241 Difference]: Finished difference. Result has 258 places, 230 transitions, 556 flow [2020-10-09 15:27:13,135 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=258, PETRI_TRANSITIONS=230} [2020-10-09 15:27:13,135 INFO L341 CegarLoopForPetriNet]: 242 programPoint places, 16 predicate places. [2020-10-09 15:27:13,135 INFO L481 AbstractCegarLoop]: Abstraction has has 258 places, 230 transitions, 556 flow [2020-10-09 15:27:13,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:13,135 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:13,135 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:13,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 mathsat -unsat_core_generation=3 [2020-10-09 15:27:13,342 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:13,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:13,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1770160388, now seen corresponding path program 1 times [2020-10-09 15:27:13,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:13,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129536084] [2020-10-09 15:27:13,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 71 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:27:13,450 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:27:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:27:13,470 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:27:13,494 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:27:13,494 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:27:13,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 mathsat -unsat_core_generation=3 [2020-10-09 15:27:13,695 WARN L371 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:27:13,695 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2020-10-09 15:27:13,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,727 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,727 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,727 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,727 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,727 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,727 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,732 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:13,764 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-10-09 15:27:13,764 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:27:13,764 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:27:13,764 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:27:13,764 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:27:13,764 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:27:13,764 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:27:13,764 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:27:13,764 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:27:13,766 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 267 places, 287 transitions, 714 flow [2020-10-09 15:27:13,806 INFO L129 PetriNetUnfolder]: 51/376 cut-off events. [2020-10-09 15:27:13,806 INFO L130 PetriNetUnfolder]: For 210/210 co-relation queries the response was YES. [2020-10-09 15:27:13,813 INFO L80 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 376 events. 51/376 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1394 event pairs, 0 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 407. Up to 22 conditions per place. [2020-10-09 15:27:13,814 INFO L82 GeneralOperation]: Start removeDead. Operand has 267 places, 287 transitions, 714 flow [2020-10-09 15:27:13,817 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 267 places, 287 transitions, 714 flow [2020-10-09 15:27:13,822 INFO L129 PetriNetUnfolder]: 10/99 cut-off events. [2020-10-09 15:27:13,822 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:27:13,822 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:13,822 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:13,822 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:13,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:13,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1930598759, now seen corresponding path program 1 times [2020-10-09 15:27:13,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:13,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376593682] [2020-10-09 15:27:13,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 72 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:13,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:13,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:13,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:13,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:13,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376593682] [2020-10-09 15:27:13,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:13,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:13,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955210024] [2020-10-09 15:27:13,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:13,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:13,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:13,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:13,962 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 287 [2020-10-09 15:27:13,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 287 transitions, 714 flow. Second operand 3 states. [2020-10-09 15:27:13,963 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:13,963 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 287 [2020-10-09 15:27:13,963 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:14,012 INFO L129 PetriNetUnfolder]: 29/308 cut-off events. [2020-10-09 15:27:14,013 INFO L130 PetriNetUnfolder]: For 211/211 co-relation queries the response was YES. [2020-10-09 15:27:14,019 INFO L80 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 308 events. 29/308 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1121 event pairs, 0 based on Foata normal form. 48/315 useless extension candidates. Maximal degree in co-relation 351. Up to 11 conditions per place. [2020-10-09 15:27:14,021 INFO L132 encePairwiseOnDemand]: 270/287 looper letters, 10 selfloop transitions, 3 changer transitions 0/273 dead transitions. [2020-10-09 15:27:14,021 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 273 transitions, 712 flow [2020-10-09 15:27:14,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:14,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:14,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2020-10-09 15:27:14,022 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9651567944250871 [2020-10-09 15:27:14,022 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 831 transitions. [2020-10-09 15:27:14,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 831 transitions. [2020-10-09 15:27:14,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:14,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 831 transitions. [2020-10-09 15:27:14,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:14,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:14,026 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:14,026 INFO L185 Difference]: Start difference. First operand has 267 places, 287 transitions, 714 flow. Second operand 3 states and 831 transitions. [2020-10-09 15:27:14,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 273 transitions, 712 flow [2020-10-09 15:27:14,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 273 transitions, 622 flow, removed 45 selfloop flow, removed 0 redundant places. [2020-10-09 15:27:14,031 INFO L241 Difference]: Finished difference. Result has 266 places, 273 transitions, 616 flow [2020-10-09 15:27:14,032 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=266, PETRI_TRANSITIONS=273} [2020-10-09 15:27:14,032 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, -1 predicate places. [2020-10-09 15:27:14,032 INFO L481 AbstractCegarLoop]: Abstraction has has 266 places, 273 transitions, 616 flow [2020-10-09 15:27:14,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:14,032 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:14,033 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:14,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 mathsat -unsat_core_generation=3 [2020-10-09 15:27:14,244 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:14,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:14,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1931553094, now seen corresponding path program 1 times [2020-10-09 15:27:14,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:14,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138602283] [2020-10-09 15:27:14,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 73 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:14,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:14,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:14,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:14,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138602283] [2020-10-09 15:27:14,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:14,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:14,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221844033] [2020-10-09 15:27:14,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:14,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:14,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:14,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:14,384 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 287 [2020-10-09 15:27:14,385 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 273 transitions, 616 flow. Second operand 3 states. [2020-10-09 15:27:14,385 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:14,385 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 287 [2020-10-09 15:27:14,385 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:14,427 INFO L129 PetriNetUnfolder]: 27/306 cut-off events. [2020-10-09 15:27:14,427 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:27:14,433 INFO L80 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 306 events. 27/306 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1116 event pairs, 0 based on Foata normal form. 2/270 useless extension candidates. Maximal degree in co-relation 336. Up to 11 conditions per place. [2020-10-09 15:27:14,435 INFO L132 encePairwiseOnDemand]: 284/287 looper letters, 10 selfloop transitions, 1 changer transitions 0/271 dead transitions. [2020-10-09 15:27:14,435 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 271 transitions, 626 flow [2020-10-09 15:27:14,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 805 transitions. [2020-10-09 15:27:14,436 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9349593495934959 [2020-10-09 15:27:14,436 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 805 transitions. [2020-10-09 15:27:14,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 805 transitions. [2020-10-09 15:27:14,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:14,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 805 transitions. [2020-10-09 15:27:14,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:14,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:14,438 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:14,438 INFO L185 Difference]: Start difference. First operand has 266 places, 273 transitions, 616 flow. Second operand 3 states and 805 transitions. [2020-10-09 15:27:14,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 271 transitions, 626 flow [2020-10-09 15:27:14,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 271 transitions, 625 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:14,441 INFO L241 Difference]: Finished difference. Result has 267 places, 271 transitions, 605 flow [2020-10-09 15:27:14,442 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=267, PETRI_TRANSITIONS=271} [2020-10-09 15:27:14,442 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 0 predicate places. [2020-10-09 15:27:14,442 INFO L481 AbstractCegarLoop]: Abstraction has has 267 places, 271 transitions, 605 flow [2020-10-09 15:27:14,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:14,442 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:14,442 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:14,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 mathsat -unsat_core_generation=3 [2020-10-09 15:27:14,651 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:14,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:14,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1931552071, now seen corresponding path program 1 times [2020-10-09 15:27:14,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:14,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444994291] [2020-10-09 15:27:14,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 74 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:14,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:14,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:14,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:14,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444994291] [2020-10-09 15:27:14,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:14,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:14,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000494094] [2020-10-09 15:27:14,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:14,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:14,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:14,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:14,795 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 287 [2020-10-09 15:27:14,796 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 271 transitions, 605 flow. Second operand 3 states. [2020-10-09 15:27:14,796 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:14,796 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 287 [2020-10-09 15:27:14,796 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:14,836 INFO L129 PetriNetUnfolder]: 27/303 cut-off events. [2020-10-09 15:27:14,836 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-09 15:27:14,842 INFO L80 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 303 events. 27/303 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1091 event pairs, 0 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 335. Up to 11 conditions per place. [2020-10-09 15:27:14,844 INFO L132 encePairwiseOnDemand]: 284/287 looper letters, 5 selfloop transitions, 2 changer transitions 0/271 dead transitions. [2020-10-09 15:27:14,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 271 transitions, 617 flow [2020-10-09 15:27:14,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 815 transitions. [2020-10-09 15:27:14,845 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9465737514518002 [2020-10-09 15:27:14,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 815 transitions. [2020-10-09 15:27:14,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 815 transitions. [2020-10-09 15:27:14,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:14,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 815 transitions. [2020-10-09 15:27:14,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:14,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:14,848 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:14,848 INFO L185 Difference]: Start difference. First operand has 267 places, 271 transitions, 605 flow. Second operand 3 states and 815 transitions. [2020-10-09 15:27:14,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 271 transitions, 617 flow [2020-10-09 15:27:14,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 271 transitions, 614 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:14,852 INFO L241 Difference]: Finished difference. Result has 270 places, 271 transitions, 612 flow [2020-10-09 15:27:14,852 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=270, PETRI_TRANSITIONS=271} [2020-10-09 15:27:14,852 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 3 predicate places. [2020-10-09 15:27:14,852 INFO L481 AbstractCegarLoop]: Abstraction has has 270 places, 271 transitions, 612 flow [2020-10-09 15:27:14,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:14,853 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:14,853 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:15,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 mathsat -unsat_core_generation=3 [2020-10-09 15:27:15,063 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:15,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:15,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1930599782, now seen corresponding path program 1 times [2020-10-09 15:27:15,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:15,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000251616] [2020-10-09 15:27:15,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 75 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:15,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:15,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:15,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:15,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000251616] [2020-10-09 15:27:15,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:15,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:15,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672473430] [2020-10-09 15:27:15,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:15,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:15,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:15,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:15,199 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 287 [2020-10-09 15:27:15,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 271 transitions, 612 flow. Second operand 3 states. [2020-10-09 15:27:15,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:15,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 287 [2020-10-09 15:27:15,200 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:15,238 INFO L129 PetriNetUnfolder]: 27/300 cut-off events. [2020-10-09 15:27:15,238 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:27:15,243 INFO L80 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 300 events. 27/300 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1075 event pairs, 0 based on Foata normal form. 1/265 useless extension candidates. Maximal degree in co-relation 331. Up to 11 conditions per place. [2020-10-09 15:27:15,245 INFO L132 encePairwiseOnDemand]: 285/287 looper letters, 4 selfloop transitions, 1 changer transitions 0/268 dead transitions. [2020-10-09 15:27:15,245 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 268 transitions, 610 flow [2020-10-09 15:27:15,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2020-10-09 15:27:15,246 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9477351916376306 [2020-10-09 15:27:15,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 816 transitions. [2020-10-09 15:27:15,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 816 transitions. [2020-10-09 15:27:15,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:15,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 816 transitions. [2020-10-09 15:27:15,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:15,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:15,248 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:15,248 INFO L185 Difference]: Start difference. First operand has 270 places, 271 transitions, 612 flow. Second operand 3 states and 816 transitions. [2020-10-09 15:27:15,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 268 transitions, 610 flow [2020-10-09 15:27:15,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 268 transitions, 606 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-09 15:27:15,251 INFO L241 Difference]: Finished difference. Result has 268 places, 268 transitions, 598 flow [2020-10-09 15:27:15,252 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=268, PETRI_TRANSITIONS=268} [2020-10-09 15:27:15,252 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 1 predicate places. [2020-10-09 15:27:15,252 INFO L481 AbstractCegarLoop]: Abstraction has has 268 places, 268 transitions, 598 flow [2020-10-09 15:27:15,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:15,252 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:15,252 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:15,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 mathsat -unsat_core_generation=3 [2020-10-09 15:27:15,453 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:15,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:15,453 INFO L82 PathProgramCache]: Analyzing trace with hash -568994758, now seen corresponding path program 1 times [2020-10-09 15:27:15,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:15,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198166173] [2020-10-09 15:27:15,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 76 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:15,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:15,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:15,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:15,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198166173] [2020-10-09 15:27:15,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:15,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:15,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496771864] [2020-10-09 15:27:15,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:15,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:15,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:15,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:15,594 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 287 [2020-10-09 15:27:15,594 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 268 transitions, 598 flow. Second operand 3 states. [2020-10-09 15:27:15,594 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:15,594 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 287 [2020-10-09 15:27:15,594 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:15,632 INFO L129 PetriNetUnfolder]: 26/307 cut-off events. [2020-10-09 15:27:15,632 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-09 15:27:15,638 INFO L80 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 307 events. 26/307 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1133 event pairs, 0 based on Foata normal form. 1/271 useless extension candidates. Maximal degree in co-relation 342. Up to 11 conditions per place. [2020-10-09 15:27:15,640 INFO L132 encePairwiseOnDemand]: 285/287 looper letters, 4 selfloop transitions, 1 changer transitions 0/268 dead transitions. [2020-10-09 15:27:15,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 268 transitions, 608 flow [2020-10-09 15:27:15,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:15,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2020-10-09 15:27:15,641 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9477351916376306 [2020-10-09 15:27:15,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 816 transitions. [2020-10-09 15:27:15,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 816 transitions. [2020-10-09 15:27:15,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:15,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 816 transitions. [2020-10-09 15:27:15,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:15,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:15,643 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:15,643 INFO L185 Difference]: Start difference. First operand has 268 places, 268 transitions, 598 flow. Second operand 3 states and 816 transitions. [2020-10-09 15:27:15,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 268 transitions, 608 flow [2020-10-09 15:27:15,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 268 transitions, 607 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:15,646 INFO L241 Difference]: Finished difference. Result has 270 places, 268 transitions, 602 flow [2020-10-09 15:27:15,646 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=602, PETRI_PLACES=270, PETRI_TRANSITIONS=268} [2020-10-09 15:27:15,646 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 3 predicate places. [2020-10-09 15:27:15,647 INFO L481 AbstractCegarLoop]: Abstraction has has 270 places, 268 transitions, 602 flow [2020-10-09 15:27:15,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:15,647 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:15,647 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:15,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 mathsat -unsat_core_generation=3 [2020-10-09 15:27:15,847 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:15,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:15,848 INFO L82 PathProgramCache]: Analyzing trace with hash -568993735, now seen corresponding path program 1 times [2020-10-09 15:27:15,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:15,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743416464] [2020-10-09 15:27:15,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 77 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:15,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:15,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:15,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:15,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743416464] [2020-10-09 15:27:15,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:15,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:15,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381813853] [2020-10-09 15:27:15,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:15,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:15,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:15,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:15,984 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 287 [2020-10-09 15:27:15,985 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 268 transitions, 602 flow. Second operand 3 states. [2020-10-09 15:27:15,985 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:15,985 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 287 [2020-10-09 15:27:15,985 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:16,043 INFO L129 PetriNetUnfolder]: 24/309 cut-off events. [2020-10-09 15:27:16,043 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-09 15:27:16,049 INFO L80 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 309 events. 24/309 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1167 event pairs, 0 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 353. Up to 11 conditions per place. [2020-10-09 15:27:16,051 INFO L132 encePairwiseOnDemand]: 283/287 looper letters, 9 selfloop transitions, 3 changer transitions 0/269 dead transitions. [2020-10-09 15:27:16,051 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 269 transitions, 628 flow [2020-10-09 15:27:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:16,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 805 transitions. [2020-10-09 15:27:16,052 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9349593495934959 [2020-10-09 15:27:16,052 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 805 transitions. [2020-10-09 15:27:16,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 805 transitions. [2020-10-09 15:27:16,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:16,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 805 transitions. [2020-10-09 15:27:16,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:16,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:16,054 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:16,054 INFO L185 Difference]: Start difference. First operand has 270 places, 268 transitions, 602 flow. Second operand 3 states and 805 transitions. [2020-10-09 15:27:16,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 269 transitions, 628 flow [2020-10-09 15:27:16,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 269 transitions, 627 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:16,058 INFO L241 Difference]: Finished difference. Result has 273 places, 269 transitions, 619 flow [2020-10-09 15:27:16,058 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=273, PETRI_TRANSITIONS=269} [2020-10-09 15:27:16,058 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 6 predicate places. [2020-10-09 15:27:16,058 INFO L481 AbstractCegarLoop]: Abstraction has has 273 places, 269 transitions, 619 flow [2020-10-09 15:27:16,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:16,058 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:16,058 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:16,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 mathsat -unsat_core_generation=3 [2020-10-09 15:27:16,259 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:16,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:16,260 INFO L82 PathProgramCache]: Analyzing trace with hash -569947047, now seen corresponding path program 1 times [2020-10-09 15:27:16,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:16,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397332464] [2020-10-09 15:27:16,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 78 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:16,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:16,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:16,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:16,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:16,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397332464] [2020-10-09 15:27:16,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:16,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:16,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604356991] [2020-10-09 15:27:16,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:16,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:16,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:16,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:16,392 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 287 [2020-10-09 15:27:16,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 269 transitions, 619 flow. Second operand 3 states. [2020-10-09 15:27:16,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:16,394 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 287 [2020-10-09 15:27:16,394 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:16,452 INFO L129 PetriNetUnfolder]: 24/302 cut-off events. [2020-10-09 15:27:16,452 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:27:16,455 INFO L80 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 302 events. 24/302 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1107 event pairs, 0 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 338. Up to 11 conditions per place. [2020-10-09 15:27:16,457 INFO L132 encePairwiseOnDemand]: 285/287 looper letters, 5 selfloop transitions, 1 changer transitions 0/267 dead transitions. [2020-10-09 15:27:16,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 267 transitions, 621 flow [2020-10-09 15:27:16,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:16,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 814 transitions. [2020-10-09 15:27:16,458 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9454123112659698 [2020-10-09 15:27:16,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 814 transitions. [2020-10-09 15:27:16,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 814 transitions. [2020-10-09 15:27:16,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:16,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 814 transitions. [2020-10-09 15:27:16,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:16,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:16,460 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:16,460 INFO L185 Difference]: Start difference. First operand has 273 places, 269 transitions, 619 flow. Second operand 3 states and 814 transitions. [2020-10-09 15:27:16,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 267 transitions, 621 flow [2020-10-09 15:27:16,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 267 transitions, 613 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:16,464 INFO L241 Difference]: Finished difference. Result has 273 places, 267 transitions, 606 flow [2020-10-09 15:27:16,464 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=273, PETRI_TRANSITIONS=267} [2020-10-09 15:27:16,465 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 6 predicate places. [2020-10-09 15:27:16,465 INFO L481 AbstractCegarLoop]: Abstraction has has 273 places, 267 transitions, 606 flow [2020-10-09 15:27:16,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:16,465 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:16,465 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:16,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 78 mathsat -unsat_core_generation=3 [2020-10-09 15:27:16,666 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:16,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:16,666 INFO L82 PathProgramCache]: Analyzing trace with hash -569948070, now seen corresponding path program 1 times [2020-10-09 15:27:16,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:16,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372636592] [2020-10-09 15:27:16,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 79 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:16,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:16,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:16,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:16,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372636592] [2020-10-09 15:27:16,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:16,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:16,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016510445] [2020-10-09 15:27:16,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:16,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:16,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:16,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:16,813 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 287 [2020-10-09 15:27:16,813 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 267 transitions, 606 flow. Second operand 3 states. [2020-10-09 15:27:16,813 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:16,813 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 287 [2020-10-09 15:27:16,813 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:16,870 INFO L129 PetriNetUnfolder]: 24/300 cut-off events. [2020-10-09 15:27:16,870 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-09 15:27:16,876 INFO L80 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 300 events. 24/300 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1092 event pairs, 0 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 343. Up to 11 conditions per place. [2020-10-09 15:27:16,877 INFO L132 encePairwiseOnDemand]: 285/287 looper letters, 8 selfloop transitions, 1 changer transitions 0/265 dead transitions. [2020-10-09 15:27:16,878 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 265 transitions, 619 flow [2020-10-09 15:27:16,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 802 transitions. [2020-10-09 15:27:16,879 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9314750290360047 [2020-10-09 15:27:16,879 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 802 transitions. [2020-10-09 15:27:16,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 802 transitions. [2020-10-09 15:27:16,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:16,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 802 transitions. [2020-10-09 15:27:16,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:16,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:16,880 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:16,880 INFO L185 Difference]: Start difference. First operand has 273 places, 267 transitions, 606 flow. Second operand 3 states and 802 transitions. [2020-10-09 15:27:16,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 265 transitions, 619 flow [2020-10-09 15:27:16,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 265 transitions, 618 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:16,883 INFO L241 Difference]: Finished difference. Result has 272 places, 265 transitions, 602 flow [2020-10-09 15:27:16,884 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=602, PETRI_PLACES=272, PETRI_TRANSITIONS=265} [2020-10-09 15:27:16,884 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 5 predicate places. [2020-10-09 15:27:16,884 INFO L481 AbstractCegarLoop]: Abstraction has has 272 places, 265 transitions, 602 flow [2020-10-09 15:27:16,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:16,884 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:16,884 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:17,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 79 mathsat -unsat_core_generation=3 [2020-10-09 15:27:17,085 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:17,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:17,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1535220730, now seen corresponding path program 1 times [2020-10-09 15:27:17,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:17,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969068867] [2020-10-09 15:27:17,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 80 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:17,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:17,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:17,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:17,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:17,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969068867] [2020-10-09 15:27:17,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:17,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:17,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110100919] [2020-10-09 15:27:17,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:17,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:17,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:17,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:17,211 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 287 [2020-10-09 15:27:17,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 265 transitions, 602 flow. Second operand 3 states. [2020-10-09 15:27:17,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:17,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 287 [2020-10-09 15:27:17,212 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:17,253 INFO L129 PetriNetUnfolder]: 22/305 cut-off events. [2020-10-09 15:27:17,253 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-09 15:27:17,258 INFO L80 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 305 events. 22/305 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1143 event pairs, 0 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 346. Up to 11 conditions per place. [2020-10-09 15:27:17,260 INFO L132 encePairwiseOnDemand]: 284/287 looper letters, 5 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2020-10-09 15:27:17,260 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 266 transitions, 618 flow [2020-10-09 15:27:17,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 815 transitions. [2020-10-09 15:27:17,261 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9465737514518002 [2020-10-09 15:27:17,261 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 815 transitions. [2020-10-09 15:27:17,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 815 transitions. [2020-10-09 15:27:17,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:17,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 815 transitions. [2020-10-09 15:27:17,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:17,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:17,263 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:17,263 INFO L185 Difference]: Start difference. First operand has 272 places, 265 transitions, 602 flow. Second operand 3 states and 815 transitions. [2020-10-09 15:27:17,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 266 transitions, 618 flow [2020-10-09 15:27:17,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 266 transitions, 617 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:17,266 INFO L241 Difference]: Finished difference. Result has 275 places, 266 transitions, 615 flow [2020-10-09 15:27:17,266 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=615, PETRI_PLACES=275, PETRI_TRANSITIONS=266} [2020-10-09 15:27:17,266 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 8 predicate places. [2020-10-09 15:27:17,266 INFO L481 AbstractCegarLoop]: Abstraction has has 275 places, 266 transitions, 615 flow [2020-10-09 15:27:17,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:17,266 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:17,267 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:17,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 mathsat -unsat_core_generation=3 [2020-10-09 15:27:17,467 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:17,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:17,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1535219707, now seen corresponding path program 1 times [2020-10-09 15:27:17,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:17,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707593323] [2020-10-09 15:27:17,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 81 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:17,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:17,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:17,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:17,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:17,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707593323] [2020-10-09 15:27:17,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:17,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:17,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947736343] [2020-10-09 15:27:17,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:17,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:17,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:17,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:17,617 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 287 [2020-10-09 15:27:17,618 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 266 transitions, 615 flow. Second operand 3 states. [2020-10-09 15:27:17,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:17,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 287 [2020-10-09 15:27:17,618 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:17,664 INFO L129 PetriNetUnfolder]: 22/306 cut-off events. [2020-10-09 15:27:17,664 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:17,670 INFO L80 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 306 events. 22/306 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1149 event pairs, 0 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 354. Up to 11 conditions per place. [2020-10-09 15:27:17,671 INFO L132 encePairwiseOnDemand]: 283/287 looper letters, 9 selfloop transitions, 3 changer transitions 0/267 dead transitions. [2020-10-09 15:27:17,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 267 transitions, 641 flow [2020-10-09 15:27:17,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 805 transitions. [2020-10-09 15:27:17,673 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9349593495934959 [2020-10-09 15:27:17,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 805 transitions. [2020-10-09 15:27:17,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 805 transitions. [2020-10-09 15:27:17,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:17,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 805 transitions. [2020-10-09 15:27:17,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:17,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:17,675 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:17,675 INFO L185 Difference]: Start difference. First operand has 275 places, 266 transitions, 615 flow. Second operand 3 states and 805 transitions. [2020-10-09 15:27:17,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 267 transitions, 641 flow [2020-10-09 15:27:17,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 267 transitions, 639 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:17,680 INFO L241 Difference]: Finished difference. Result has 278 places, 267 transitions, 631 flow [2020-10-09 15:27:17,680 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=278, PETRI_TRANSITIONS=267} [2020-10-09 15:27:17,681 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 11 predicate places. [2020-10-09 15:27:17,681 INFO L481 AbstractCegarLoop]: Abstraction has has 278 places, 267 transitions, 631 flow [2020-10-09 15:27:17,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:17,681 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:17,681 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:17,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 mathsat -unsat_core_generation=3 [2020-10-09 15:27:17,893 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:17,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:17,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1536174042, now seen corresponding path program 1 times [2020-10-09 15:27:17,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:17,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645711889] [2020-10-09 15:27:17,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 82 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:18,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:18,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:18,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:18,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645711889] [2020-10-09 15:27:18,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:18,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:18,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133151209] [2020-10-09 15:27:18,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:18,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:18,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:18,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:18,032 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 287 [2020-10-09 15:27:18,033 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 267 transitions, 631 flow. Second operand 3 states. [2020-10-09 15:27:18,033 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:18,033 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 287 [2020-10-09 15:27:18,033 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:18,078 INFO L129 PetriNetUnfolder]: 21/303 cut-off events. [2020-10-09 15:27:18,078 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:27:18,083 INFO L80 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 303 events. 21/303 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1130 event pairs, 0 based on Foata normal form. 2/274 useless extension candidates. Maximal degree in co-relation 353. Up to 11 conditions per place. [2020-10-09 15:27:18,085 INFO L132 encePairwiseOnDemand]: 284/287 looper letters, 9 selfloop transitions, 1 changer transitions 0/265 dead transitions. [2020-10-09 15:27:18,085 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 265 transitions, 639 flow [2020-10-09 15:27:18,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:18,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2020-10-09 15:27:18,086 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9337979094076655 [2020-10-09 15:27:18,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 804 transitions. [2020-10-09 15:27:18,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 804 transitions. [2020-10-09 15:27:18,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:18,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 804 transitions. [2020-10-09 15:27:18,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:18,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:18,088 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:18,088 INFO L185 Difference]: Start difference. First operand has 278 places, 267 transitions, 631 flow. Second operand 3 states and 804 transitions. [2020-10-09 15:27:18,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 265 transitions, 639 flow [2020-10-09 15:27:18,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 265 transitions, 638 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:18,091 INFO L241 Difference]: Finished difference. Result has 279 places, 265 transitions, 620 flow [2020-10-09 15:27:18,091 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=279, PETRI_TRANSITIONS=265} [2020-10-09 15:27:18,091 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 12 predicate places. [2020-10-09 15:27:18,092 INFO L481 AbstractCegarLoop]: Abstraction has has 279 places, 265 transitions, 620 flow [2020-10-09 15:27:18,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:18,092 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:18,092 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:18,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 mathsat -unsat_core_generation=3 [2020-10-09 15:27:18,292 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:18,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:18,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1536173019, now seen corresponding path program 1 times [2020-10-09 15:27:18,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:18,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618705114] [2020-10-09 15:27:18,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 83 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:18,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:18,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:18,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:18,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618705114] [2020-10-09 15:27:18,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:18,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:18,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267065994] [2020-10-09 15:27:18,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:18,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:18,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:18,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:18,430 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 287 [2020-10-09 15:27:18,430 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 265 transitions, 620 flow. Second operand 3 states. [2020-10-09 15:27:18,430 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:18,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 287 [2020-10-09 15:27:18,431 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:18,491 INFO L129 PetriNetUnfolder]: 21/300 cut-off events. [2020-10-09 15:27:18,491 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-09 15:27:18,499 INFO L80 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 300 events. 21/300 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1109 event pairs, 0 based on Foata normal form. 1/271 useless extension candidates. Maximal degree in co-relation 347. Up to 11 conditions per place. [2020-10-09 15:27:18,500 INFO L132 encePairwiseOnDemand]: 285/287 looper letters, 4 selfloop transitions, 1 changer transitions 0/262 dead transitions. [2020-10-09 15:27:18,500 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 262 transitions, 619 flow [2020-10-09 15:27:18,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:18,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2020-10-09 15:27:18,502 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9477351916376306 [2020-10-09 15:27:18,502 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 816 transitions. [2020-10-09 15:27:18,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 816 transitions. [2020-10-09 15:27:18,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:18,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 816 transitions. [2020-10-09 15:27:18,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:18,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:18,503 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:18,503 INFO L185 Difference]: Start difference. First operand has 279 places, 265 transitions, 620 flow. Second operand 3 states and 816 transitions. [2020-10-09 15:27:18,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 262 transitions, 619 flow [2020-10-09 15:27:18,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 262 transitions, 614 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:18,506 INFO L241 Difference]: Finished difference. Result has 276 places, 262 transitions, 606 flow [2020-10-09 15:27:18,507 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=276, PETRI_TRANSITIONS=262} [2020-10-09 15:27:18,507 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 9 predicate places. [2020-10-09 15:27:18,507 INFO L481 AbstractCegarLoop]: Abstraction has has 276 places, 262 transitions, 606 flow [2020-10-09 15:27:18,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:18,507 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:18,507 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:18,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 mathsat -unsat_core_generation=3 [2020-10-09 15:27:18,713 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:18,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:18,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1679681788, now seen corresponding path program 1 times [2020-10-09 15:27:18,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:18,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755360676] [2020-10-09 15:27:18,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 84 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:18,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:18,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:18,828 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:18,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:18,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755360676] [2020-10-09 15:27:18,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:18,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:18,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465805185] [2020-10-09 15:27:18,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:18,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:18,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:18,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:18,871 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 287 [2020-10-09 15:27:18,871 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 262 transitions, 606 flow. Second operand 3 states. [2020-10-09 15:27:18,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:18,872 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 287 [2020-10-09 15:27:18,872 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:18,915 INFO L129 PetriNetUnfolder]: 20/308 cut-off events. [2020-10-09 15:27:18,916 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-09 15:27:18,921 INFO L80 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 308 events. 20/308 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1178 event pairs, 0 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 364. Up to 11 conditions per place. [2020-10-09 15:27:18,923 INFO L132 encePairwiseOnDemand]: 282/287 looper letters, 10 selfloop transitions, 3 changer transitions 0/264 dead transitions. [2020-10-09 15:27:18,923 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 264 transitions, 636 flow [2020-10-09 15:27:18,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:18,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 807 transitions. [2020-10-09 15:27:18,924 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9372822299651568 [2020-10-09 15:27:18,924 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 807 transitions. [2020-10-09 15:27:18,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 807 transitions. [2020-10-09 15:27:18,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:18,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 807 transitions. [2020-10-09 15:27:18,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:18,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:18,926 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:18,926 INFO L185 Difference]: Start difference. First operand has 276 places, 262 transitions, 606 flow. Second operand 3 states and 807 transitions. [2020-10-09 15:27:18,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 264 transitions, 636 flow [2020-10-09 15:27:18,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 264 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:18,929 INFO L241 Difference]: Finished difference. Result has 279 places, 264 transitions, 629 flow [2020-10-09 15:27:18,929 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=279, PETRI_TRANSITIONS=264} [2020-10-09 15:27:18,930 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 12 predicate places. [2020-10-09 15:27:18,930 INFO L481 AbstractCegarLoop]: Abstraction has has 279 places, 264 transitions, 629 flow [2020-10-09 15:27:18,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:18,930 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:18,930 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:19,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 84 mathsat -unsat_core_generation=3 [2020-10-09 15:27:19,132 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:19,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:19,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1679680765, now seen corresponding path program 1 times [2020-10-09 15:27:19,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:19,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507059327] [2020-10-09 15:27:19,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 85 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:19,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:19,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:19,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:19,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507059327] [2020-10-09 15:27:19,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:19,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:19,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619631330] [2020-10-09 15:27:19,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:19,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:19,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:19,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:19,269 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 287 [2020-10-09 15:27:19,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 264 transitions, 629 flow. Second operand 3 states. [2020-10-09 15:27:19,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:19,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 287 [2020-10-09 15:27:19,270 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:19,313 INFO L129 PetriNetUnfolder]: 18/309 cut-off events. [2020-10-09 15:27:19,313 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:27:19,319 INFO L80 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 309 events. 18/309 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1203 event pairs, 0 based on Foata normal form. 1/283 useless extension candidates. Maximal degree in co-relation 360. Up to 11 conditions per place. [2020-10-09 15:27:19,321 INFO L132 encePairwiseOnDemand]: 285/287 looper letters, 4 selfloop transitions, 1 changer transitions 0/263 dead transitions. [2020-10-09 15:27:19,321 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 263 transitions, 635 flow [2020-10-09 15:27:19,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2020-10-09 15:27:19,322 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9477351916376306 [2020-10-09 15:27:19,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 816 transitions. [2020-10-09 15:27:19,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 816 transitions. [2020-10-09 15:27:19,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:19,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 816 transitions. [2020-10-09 15:27:19,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:19,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:19,324 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:19,324 INFO L185 Difference]: Start difference. First operand has 279 places, 264 transitions, 629 flow. Second operand 3 states and 816 transitions. [2020-10-09 15:27:19,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 263 transitions, 635 flow [2020-10-09 15:27:19,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 263 transitions, 630 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:19,327 INFO L241 Difference]: Finished difference. Result has 281 places, 263 transitions, 625 flow [2020-10-09 15:27:19,327 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=625, PETRI_PLACES=281, PETRI_TRANSITIONS=263} [2020-10-09 15:27:19,327 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 14 predicate places. [2020-10-09 15:27:19,327 INFO L481 AbstractCegarLoop]: Abstraction has has 281 places, 263 transitions, 625 flow [2020-10-09 15:27:19,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:19,327 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:19,328 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:19,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 mathsat -unsat_core_generation=3 [2020-10-09 15:27:19,528 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:19,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:19,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1678728476, now seen corresponding path program 1 times [2020-10-09 15:27:19,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:19,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221596141] [2020-10-09 15:27:19,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 86 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:19,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:19,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:19,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:19,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221596141] [2020-10-09 15:27:19,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:19,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:19,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746569521] [2020-10-09 15:27:19,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:19,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:19,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:19,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:19,664 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 287 [2020-10-09 15:27:19,664 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 263 transitions, 625 flow. Second operand 3 states. [2020-10-09 15:27:19,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:19,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 287 [2020-10-09 15:27:19,665 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:19,708 INFO L129 PetriNetUnfolder]: 18/302 cut-off events. [2020-10-09 15:27:19,708 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:27:19,714 INFO L80 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 302 events. 18/302 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1138 event pairs, 0 based on Foata normal form. 1/276 useless extension candidates. Maximal degree in co-relation 356. Up to 11 conditions per place. [2020-10-09 15:27:19,715 INFO L132 encePairwiseOnDemand]: 285/287 looper letters, 5 selfloop transitions, 1 changer transitions 0/261 dead transitions. [2020-10-09 15:27:19,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 261 transitions, 628 flow [2020-10-09 15:27:19,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 814 transitions. [2020-10-09 15:27:19,717 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9454123112659698 [2020-10-09 15:27:19,717 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 814 transitions. [2020-10-09 15:27:19,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 814 transitions. [2020-10-09 15:27:19,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:19,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 814 transitions. [2020-10-09 15:27:19,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:19,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:19,718 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:19,718 INFO L185 Difference]: Start difference. First operand has 281 places, 263 transitions, 625 flow. Second operand 3 states and 814 transitions. [2020-10-09 15:27:19,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 261 transitions, 628 flow [2020-10-09 15:27:19,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 261 transitions, 621 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:19,721 INFO L241 Difference]: Finished difference. Result has 281 places, 261 transitions, 614 flow [2020-10-09 15:27:19,722 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=281, PETRI_TRANSITIONS=261} [2020-10-09 15:27:19,722 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 14 predicate places. [2020-10-09 15:27:19,722 INFO L481 AbstractCegarLoop]: Abstraction has has 281 places, 261 transitions, 614 flow [2020-10-09 15:27:19,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:19,722 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:19,722 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:19,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 mathsat -unsat_core_generation=3 [2020-10-09 15:27:19,928 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:19,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:19,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1678727453, now seen corresponding path program 1 times [2020-10-09 15:27:19,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:19,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654345418] [2020-10-09 15:27:19,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 87 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:20,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:20,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:20,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:20,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654345418] [2020-10-09 15:27:20,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:20,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:20,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328802631] [2020-10-09 15:27:20,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:20,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:20,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:20,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:20,068 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 287 [2020-10-09 15:27:20,069 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 261 transitions, 614 flow. Second operand 3 states. [2020-10-09 15:27:20,069 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:20,069 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 287 [2020-10-09 15:27:20,069 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:20,114 INFO L129 PetriNetUnfolder]: 18/300 cut-off events. [2020-10-09 15:27:20,115 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-09 15:27:20,120 INFO L80 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 300 events. 18/300 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1126 event pairs, 0 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 356. Up to 11 conditions per place. [2020-10-09 15:27:20,122 INFO L132 encePairwiseOnDemand]: 285/287 looper letters, 8 selfloop transitions, 1 changer transitions 0/259 dead transitions. [2020-10-09 15:27:20,122 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 259 transitions, 627 flow [2020-10-09 15:27:20,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 802 transitions. [2020-10-09 15:27:20,123 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9314750290360047 [2020-10-09 15:27:20,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 802 transitions. [2020-10-09 15:27:20,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 802 transitions. [2020-10-09 15:27:20,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:20,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 802 transitions. [2020-10-09 15:27:20,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:20,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:20,125 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:20,125 INFO L185 Difference]: Start difference. First operand has 281 places, 261 transitions, 614 flow. Second operand 3 states and 802 transitions. [2020-10-09 15:27:20,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 259 transitions, 627 flow [2020-10-09 15:27:20,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 259 transitions, 626 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:20,129 INFO L241 Difference]: Finished difference. Result has 280 places, 259 transitions, 610 flow [2020-10-09 15:27:20,130 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=280, PETRI_TRANSITIONS=259} [2020-10-09 15:27:20,130 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 13 predicate places. [2020-10-09 15:27:20,130 INFO L481 AbstractCegarLoop]: Abstraction has has 280 places, 259 transitions, 610 flow [2020-10-09 15:27:20,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:20,130 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:20,130 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:20,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 87 mathsat -unsat_core_generation=3 [2020-10-09 15:27:20,341 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:20,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:20,342 INFO L82 PathProgramCache]: Analyzing trace with hash -783289025, now seen corresponding path program 1 times [2020-10-09 15:27:20,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:20,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8684267] [2020-10-09 15:27:20,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 88 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:20,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:20,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:20,483 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:20,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:20,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8684267] [2020-10-09 15:27:20,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:20,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:20,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118601305] [2020-10-09 15:27:20,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:20,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:20,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:20,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:20,496 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 287 [2020-10-09 15:27:20,497 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 259 transitions, 610 flow. Second operand 3 states. [2020-10-09 15:27:20,497 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:20,497 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 287 [2020-10-09 15:27:20,497 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:20,544 INFO L129 PetriNetUnfolder]: 16/305 cut-off events. [2020-10-09 15:27:20,545 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-09 15:27:20,550 INFO L80 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 305 events. 16/305 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1176 event pairs, 0 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 359. Up to 11 conditions per place. [2020-10-09 15:27:20,552 INFO L132 encePairwiseOnDemand]: 284/287 looper letters, 5 selfloop transitions, 2 changer transitions 0/260 dead transitions. [2020-10-09 15:27:20,552 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 260 transitions, 626 flow [2020-10-09 15:27:20,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 815 transitions. [2020-10-09 15:27:20,553 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9465737514518002 [2020-10-09 15:27:20,553 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 815 transitions. [2020-10-09 15:27:20,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 815 transitions. [2020-10-09 15:27:20,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:20,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 815 transitions. [2020-10-09 15:27:20,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:20,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:20,555 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:20,555 INFO L185 Difference]: Start difference. First operand has 280 places, 259 transitions, 610 flow. Second operand 3 states and 815 transitions. [2020-10-09 15:27:20,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 260 transitions, 626 flow [2020-10-09 15:27:20,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 260 transitions, 625 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:20,560 INFO L241 Difference]: Finished difference. Result has 283 places, 260 transitions, 623 flow [2020-10-09 15:27:20,560 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=623, PETRI_PLACES=283, PETRI_TRANSITIONS=260} [2020-10-09 15:27:20,560 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 16 predicate places. [2020-10-09 15:27:20,561 INFO L481 AbstractCegarLoop]: Abstraction has has 283 places, 260 transitions, 623 flow [2020-10-09 15:27:20,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:20,561 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:20,561 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:20,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 88 mathsat -unsat_core_generation=3 [2020-10-09 15:27:20,772 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:20,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:20,772 INFO L82 PathProgramCache]: Analyzing trace with hash -783290048, now seen corresponding path program 1 times [2020-10-09 15:27:20,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:20,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647934215] [2020-10-09 15:27:20,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 89 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:20,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:20,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:20,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:20,892 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:20,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647934215] [2020-10-09 15:27:20,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:20,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:20,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967070280] [2020-10-09 15:27:20,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:20,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:20,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:20,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:20,928 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 287 [2020-10-09 15:27:20,928 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 260 transitions, 623 flow. Second operand 3 states. [2020-10-09 15:27:20,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:20,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 287 [2020-10-09 15:27:20,929 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:20,977 INFO L129 PetriNetUnfolder]: 16/306 cut-off events. [2020-10-09 15:27:20,977 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:20,983 INFO L80 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 306 events. 16/306 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1183 event pairs, 0 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 367. Up to 11 conditions per place. [2020-10-09 15:27:20,984 INFO L132 encePairwiseOnDemand]: 283/287 looper letters, 9 selfloop transitions, 3 changer transitions 0/261 dead transitions. [2020-10-09 15:27:20,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 261 transitions, 649 flow [2020-10-09 15:27:20,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:20,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 805 transitions. [2020-10-09 15:27:20,986 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9349593495934959 [2020-10-09 15:27:20,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 805 transitions. [2020-10-09 15:27:20,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 805 transitions. [2020-10-09 15:27:20,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:20,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 805 transitions. [2020-10-09 15:27:20,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:20,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:20,988 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:20,988 INFO L185 Difference]: Start difference. First operand has 283 places, 260 transitions, 623 flow. Second operand 3 states and 805 transitions. [2020-10-09 15:27:20,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 261 transitions, 649 flow [2020-10-09 15:27:20,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 261 transitions, 647 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:20,993 INFO L241 Difference]: Finished difference. Result has 286 places, 261 transitions, 639 flow [2020-10-09 15:27:20,994 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=286, PETRI_TRANSITIONS=261} [2020-10-09 15:27:20,994 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 19 predicate places. [2020-10-09 15:27:20,994 INFO L481 AbstractCegarLoop]: Abstraction has has 286 places, 261 transitions, 639 flow [2020-10-09 15:27:20,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:20,994 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:20,994 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:21,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 mathsat -unsat_core_generation=3 [2020-10-09 15:27:21,205 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:21,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:21,206 INFO L82 PathProgramCache]: Analyzing trace with hash -782336736, now seen corresponding path program 1 times [2020-10-09 15:27:21,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:21,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327880856] [2020-10-09 15:27:21,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 90 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:21,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:21,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:21,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:21,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327880856] [2020-10-09 15:27:21,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:21,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:21,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27091180] [2020-10-09 15:27:21,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:21,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:21,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:21,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:21,347 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 287 [2020-10-09 15:27:21,348 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 261 transitions, 639 flow. Second operand 3 states. [2020-10-09 15:27:21,348 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:21,349 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 287 [2020-10-09 15:27:21,349 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:21,392 INFO L129 PetriNetUnfolder]: 15/302 cut-off events. [2020-10-09 15:27:21,392 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:27:21,397 INFO L80 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 302 events. 15/302 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1159 event pairs, 0 based on Foata normal form. 1/279 useless extension candidates. Maximal degree in co-relation 359. Up to 11 conditions per place. [2020-10-09 15:27:21,399 INFO L132 encePairwiseOnDemand]: 285/287 looper letters, 4 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2020-10-09 15:27:21,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 258 transitions, 634 flow [2020-10-09 15:27:21,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:21,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:21,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2020-10-09 15:27:21,400 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9477351916376306 [2020-10-09 15:27:21,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 816 transitions. [2020-10-09 15:27:21,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 816 transitions. [2020-10-09 15:27:21,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:21,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 816 transitions. [2020-10-09 15:27:21,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:21,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:21,402 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:21,402 INFO L185 Difference]: Start difference. First operand has 286 places, 261 transitions, 639 flow. Second operand 3 states and 816 transitions. [2020-10-09 15:27:21,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 258 transitions, 634 flow [2020-10-09 15:27:21,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 258 transitions, 626 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:21,407 INFO L241 Difference]: Finished difference. Result has 285 places, 258 transitions, 618 flow [2020-10-09 15:27:21,407 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=285, PETRI_TRANSITIONS=258} [2020-10-09 15:27:21,407 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 18 predicate places. [2020-10-09 15:27:21,407 INFO L481 AbstractCegarLoop]: Abstraction has has 285 places, 258 transitions, 618 flow [2020-10-09 15:27:21,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:21,407 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:21,408 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:21,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 mathsat -unsat_core_generation=3 [2020-10-09 15:27:21,619 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:21,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:21,619 INFO L82 PathProgramCache]: Analyzing trace with hash -782335713, now seen corresponding path program 1 times [2020-10-09 15:27:21,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:21,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938672860] [2020-10-09 15:27:21,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 91 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:21,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:21,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:21,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:21,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938672860] [2020-10-09 15:27:21,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:21,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:21,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903667184] [2020-10-09 15:27:21,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:21,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:21,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:21,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:21,775 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 287 [2020-10-09 15:27:21,776 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 258 transitions, 618 flow. Second operand 3 states. [2020-10-09 15:27:21,776 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:21,776 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 287 [2020-10-09 15:27:21,776 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:21,821 INFO L129 PetriNetUnfolder]: 15/300 cut-off events. [2020-10-09 15:27:21,821 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-09 15:27:21,827 INFO L80 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 300 events. 15/300 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1144 event pairs, 0 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 363. Up to 11 conditions per place. [2020-10-09 15:27:21,828 INFO L132 encePairwiseOnDemand]: 285/287 looper letters, 8 selfloop transitions, 1 changer transitions 0/256 dead transitions. [2020-10-09 15:27:21,828 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 256 transitions, 631 flow [2020-10-09 15:27:21,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 802 transitions. [2020-10-09 15:27:21,829 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9314750290360047 [2020-10-09 15:27:21,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 802 transitions. [2020-10-09 15:27:21,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 802 transitions. [2020-10-09 15:27:21,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:21,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 802 transitions. [2020-10-09 15:27:21,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:21,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:21,831 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:21,831 INFO L185 Difference]: Start difference. First operand has 285 places, 258 transitions, 618 flow. Second operand 3 states and 802 transitions. [2020-10-09 15:27:21,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 256 transitions, 631 flow [2020-10-09 15:27:21,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 256 transitions, 630 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:21,835 INFO L241 Difference]: Finished difference. Result has 284 places, 256 transitions, 614 flow [2020-10-09 15:27:21,835 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=284, PETRI_TRANSITIONS=256} [2020-10-09 15:27:21,835 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 17 predicate places. [2020-10-09 15:27:21,835 INFO L481 AbstractCegarLoop]: Abstraction has has 284 places, 256 transitions, 614 flow [2020-10-09 15:27:21,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:21,835 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:21,836 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:22,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 91 mathsat -unsat_core_generation=3 [2020-10-09 15:27:22,036 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:22,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:22,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1465898013, now seen corresponding path program 1 times [2020-10-09 15:27:22,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:22,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593332461] [2020-10-09 15:27:22,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 92 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:22,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:22,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:22,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:22,158 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:22,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593332461] [2020-10-09 15:27:22,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:22,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:22,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92401090] [2020-10-09 15:27:22,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:22,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:22,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:22,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:22,176 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 287 [2020-10-09 15:27:22,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 256 transitions, 614 flow. Second operand 3 states. [2020-10-09 15:27:22,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:22,177 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 287 [2020-10-09 15:27:22,177 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:22,222 INFO L129 PetriNetUnfolder]: 13/305 cut-off events. [2020-10-09 15:27:22,222 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-09 15:27:22,228 INFO L80 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 305 events. 13/305 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1194 event pairs, 0 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 366. Up to 11 conditions per place. [2020-10-09 15:27:22,229 INFO L132 encePairwiseOnDemand]: 284/287 looper letters, 5 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2020-10-09 15:27:22,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 257 transitions, 630 flow [2020-10-09 15:27:22,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:22,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 815 transitions. [2020-10-09 15:27:22,230 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9465737514518002 [2020-10-09 15:27:22,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 815 transitions. [2020-10-09 15:27:22,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 815 transitions. [2020-10-09 15:27:22,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:22,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 815 transitions. [2020-10-09 15:27:22,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:22,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:22,232 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:22,232 INFO L185 Difference]: Start difference. First operand has 284 places, 256 transitions, 614 flow. Second operand 3 states and 815 transitions. [2020-10-09 15:27:22,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 257 transitions, 630 flow [2020-10-09 15:27:22,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 257 transitions, 629 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:22,235 INFO L241 Difference]: Finished difference. Result has 287 places, 257 transitions, 627 flow [2020-10-09 15:27:22,235 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=287, PETRI_TRANSITIONS=257} [2020-10-09 15:27:22,235 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 20 predicate places. [2020-10-09 15:27:22,235 INFO L481 AbstractCegarLoop]: Abstraction has has 287 places, 257 transitions, 627 flow [2020-10-09 15:27:22,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:22,236 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:22,236 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:22,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 mathsat -unsat_core_generation=3 [2020-10-09 15:27:22,436 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:22,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:22,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1465899036, now seen corresponding path program 1 times [2020-10-09 15:27:22,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:22,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767913014] [2020-10-09 15:27:22,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 93 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:22,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:22,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:22,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:22,567 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:22,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767913014] [2020-10-09 15:27:22,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:22,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:22,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036937172] [2020-10-09 15:27:22,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:22,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:22,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:22,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:22,598 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 287 [2020-10-09 15:27:22,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 257 transitions, 627 flow. Second operand 3 states. [2020-10-09 15:27:22,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:22,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 287 [2020-10-09 15:27:22,598 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:22,658 INFO L129 PetriNetUnfolder]: 13/306 cut-off events. [2020-10-09 15:27:22,659 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:22,664 INFO L80 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 306 events. 13/306 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1205 event pairs, 0 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 374. Up to 11 conditions per place. [2020-10-09 15:27:22,665 INFO L132 encePairwiseOnDemand]: 283/287 looper letters, 9 selfloop transitions, 3 changer transitions 0/258 dead transitions. [2020-10-09 15:27:22,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 258 transitions, 653 flow [2020-10-09 15:27:22,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 805 transitions. [2020-10-09 15:27:22,667 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9349593495934959 [2020-10-09 15:27:22,667 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 805 transitions. [2020-10-09 15:27:22,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 805 transitions. [2020-10-09 15:27:22,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:22,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 805 transitions. [2020-10-09 15:27:22,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:22,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:22,669 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:22,669 INFO L185 Difference]: Start difference. First operand has 287 places, 257 transitions, 627 flow. Second operand 3 states and 805 transitions. [2020-10-09 15:27:22,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 258 transitions, 653 flow [2020-10-09 15:27:22,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 258 transitions, 651 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:22,674 INFO L241 Difference]: Finished difference. Result has 290 places, 258 transitions, 643 flow [2020-10-09 15:27:22,674 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=643, PETRI_PLACES=290, PETRI_TRANSITIONS=258} [2020-10-09 15:27:22,674 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 23 predicate places. [2020-10-09 15:27:22,674 INFO L481 AbstractCegarLoop]: Abstraction has has 290 places, 258 transitions, 643 flow [2020-10-09 15:27:22,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:22,675 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:22,675 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:22,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 93 mathsat -unsat_core_generation=3 [2020-10-09 15:27:22,887 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:22,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:22,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1464945724, now seen corresponding path program 1 times [2020-10-09 15:27:22,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:22,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127663863] [2020-10-09 15:27:22,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 94 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:22,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:23,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:23,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:23,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127663863] [2020-10-09 15:27:23,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:23,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:23,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666875393] [2020-10-09 15:27:23,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:23,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:23,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:23,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:23,030 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 287 [2020-10-09 15:27:23,030 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 258 transitions, 643 flow. Second operand 3 states. [2020-10-09 15:27:23,031 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:23,031 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 287 [2020-10-09 15:27:23,031 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:23,073 INFO L129 PetriNetUnfolder]: 12/302 cut-off events. [2020-10-09 15:27:23,073 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:27:23,078 INFO L80 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 302 events. 12/302 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1174 event pairs, 0 based on Foata normal form. 1/282 useless extension candidates. Maximal degree in co-relation 366. Up to 11 conditions per place. [2020-10-09 15:27:23,079 INFO L132 encePairwiseOnDemand]: 285/287 looper letters, 4 selfloop transitions, 1 changer transitions 0/255 dead transitions. [2020-10-09 15:27:23,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 255 transitions, 638 flow [2020-10-09 15:27:23,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2020-10-09 15:27:23,081 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9477351916376306 [2020-10-09 15:27:23,081 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 816 transitions. [2020-10-09 15:27:23,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 816 transitions. [2020-10-09 15:27:23,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:23,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 816 transitions. [2020-10-09 15:27:23,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:23,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:23,083 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:23,083 INFO L185 Difference]: Start difference. First operand has 290 places, 258 transitions, 643 flow. Second operand 3 states and 816 transitions. [2020-10-09 15:27:23,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 255 transitions, 638 flow [2020-10-09 15:27:23,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 255 transitions, 630 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:23,088 INFO L241 Difference]: Finished difference. Result has 289 places, 255 transitions, 622 flow [2020-10-09 15:27:23,088 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=289, PETRI_TRANSITIONS=255} [2020-10-09 15:27:23,089 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 22 predicate places. [2020-10-09 15:27:23,089 INFO L481 AbstractCegarLoop]: Abstraction has has 289 places, 255 transitions, 622 flow [2020-10-09 15:27:23,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:23,089 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:23,089 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:23,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 94 mathsat -unsat_core_generation=3 [2020-10-09 15:27:23,297 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:23,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:23,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1464944701, now seen corresponding path program 1 times [2020-10-09 15:27:23,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:23,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663072810] [2020-10-09 15:27:23,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 95 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:23,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:23,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:23,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:23,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663072810] [2020-10-09 15:27:23,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:23,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:23,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672618009] [2020-10-09 15:27:23,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:23,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:23,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:23,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:23,444 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 287 [2020-10-09 15:27:23,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 255 transitions, 622 flow. Second operand 3 states. [2020-10-09 15:27:23,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:23,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 287 [2020-10-09 15:27:23,445 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:23,516 INFO L129 PetriNetUnfolder]: 12/300 cut-off events. [2020-10-09 15:27:23,516 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-09 15:27:23,524 INFO L80 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 300 events. 12/300 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1162 event pairs, 0 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 370. Up to 11 conditions per place. [2020-10-09 15:27:23,525 INFO L132 encePairwiseOnDemand]: 285/287 looper letters, 8 selfloop transitions, 1 changer transitions 0/253 dead transitions. [2020-10-09 15:27:23,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 253 transitions, 635 flow [2020-10-09 15:27:23,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 802 transitions. [2020-10-09 15:27:23,527 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9314750290360047 [2020-10-09 15:27:23,527 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 802 transitions. [2020-10-09 15:27:23,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 802 transitions. [2020-10-09 15:27:23,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:23,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 802 transitions. [2020-10-09 15:27:23,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:23,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:23,529 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:23,529 INFO L185 Difference]: Start difference. First operand has 289 places, 255 transitions, 622 flow. Second operand 3 states and 802 transitions. [2020-10-09 15:27:23,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 253 transitions, 635 flow [2020-10-09 15:27:23,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 253 transitions, 634 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:23,534 INFO L241 Difference]: Finished difference. Result has 288 places, 253 transitions, 618 flow [2020-10-09 15:27:23,534 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=288, PETRI_TRANSITIONS=253} [2020-10-09 15:27:23,534 INFO L341 CegarLoopForPetriNet]: 267 programPoint places, 21 predicate places. [2020-10-09 15:27:23,535 INFO L481 AbstractCegarLoop]: Abstraction has has 288 places, 253 transitions, 618 flow [2020-10-09 15:27:23,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:23,535 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:23,535 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:23,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 mathsat -unsat_core_generation=3 [2020-10-09 15:27:23,746 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:23,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:23,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1966930896, now seen corresponding path program 1 times [2020-10-09 15:27:23,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:23,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684613626] [2020-10-09 15:27:23,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 96 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:27:23,867 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:27:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:27:23,888 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:27:23,917 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:27:23,917 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:27:24,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 mathsat -unsat_core_generation=3 [2020-10-09 15:27:24,118 WARN L371 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:27:24,118 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2020-10-09 15:27:24,139 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,151 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,151 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,151 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,153 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,153 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,154 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,154 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,154 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,154 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,154 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,157 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,157 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,157 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,157 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,157 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,158 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,158 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,158 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,158 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,158 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,158 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,158 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,160 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,160 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,160 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,160 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,160 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,161 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,161 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,161 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,161 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,161 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,161 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,162 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,164 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,164 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,164 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,164 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,164 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,164 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,166 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,171 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,171 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,171 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,173 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,174 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,174 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,174 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,174 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,174 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,174 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,175 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,175 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,175 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,175 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,175 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,175 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,175 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,176 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,177 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,177 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,177 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,177 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,177 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,177 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,177 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,177 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,178 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,178 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,179 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,179 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,180 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,180 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,180 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,180 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,181 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,181 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,181 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,181 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,181 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,181 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,182 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,182 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,182 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,182 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,182 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,183 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,183 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,183 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,183 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,184 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,184 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,184 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,184 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,184 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,184 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,184 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,185 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,187 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,188 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,188 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,190 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,193 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,193 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,193 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:24,199 INFO L253 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-10-09 15:27:24,199 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:27:24,199 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:27:24,200 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:27:24,200 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:27:24,200 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:27:24,200 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:27:24,200 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:27:24,200 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:27:24,203 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 292 places, 314 transitions, 793 flow [2020-10-09 15:27:24,256 INFO L129 PetriNetUnfolder]: 56/412 cut-off events. [2020-10-09 15:27:24,256 INFO L130 PetriNetUnfolder]: For 275/275 co-relation queries the response was YES. [2020-10-09 15:27:24,265 INFO L80 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 412 events. 56/412 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1542 event pairs, 0 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 456. Up to 24 conditions per place. [2020-10-09 15:27:24,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 292 places, 314 transitions, 793 flow [2020-10-09 15:27:24,269 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 292 places, 314 transitions, 793 flow [2020-10-09 15:27:24,274 INFO L129 PetriNetUnfolder]: 10/99 cut-off events. [2020-10-09 15:27:24,274 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:27:24,274 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:24,274 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:24,274 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:24,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:24,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1404868884, now seen corresponding path program 1 times [2020-10-09 15:27:24,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:24,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086504689] [2020-10-09 15:27:24,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 97 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:24,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:24,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:24,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:24,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:24,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086504689] [2020-10-09 15:27:24,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:24,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:24,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020529323] [2020-10-09 15:27:24,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:24,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:24,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:24,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:24,461 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 314 [2020-10-09 15:27:24,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 314 transitions, 793 flow. Second operand 3 states. [2020-10-09 15:27:24,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:24,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 314 [2020-10-09 15:27:24,462 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:24,518 INFO L129 PetriNetUnfolder]: 32/337 cut-off events. [2020-10-09 15:27:24,518 INFO L130 PetriNetUnfolder]: For 276/276 co-relation queries the response was YES. [2020-10-09 15:27:24,525 INFO L80 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 337 events. 32/337 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1241 event pairs, 0 based on Foata normal form. 52/344 useless extension candidates. Maximal degree in co-relation 393. Up to 12 conditions per place. [2020-10-09 15:27:24,527 INFO L132 encePairwiseOnDemand]: 296/314 looper letters, 10 selfloop transitions, 3 changer transitions 0/299 dead transitions. [2020-10-09 15:27:24,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 299 transitions, 789 flow [2020-10-09 15:27:24,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 911 transitions. [2020-10-09 15:27:24,531 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9670912951167728 [2020-10-09 15:27:24,531 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 911 transitions. [2020-10-09 15:27:24,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 911 transitions. [2020-10-09 15:27:24,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:24,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 911 transitions. [2020-10-09 15:27:24,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:24,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:24,533 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:24,533 INFO L185 Difference]: Start difference. First operand has 292 places, 314 transitions, 793 flow. Second operand 3 states and 911 transitions. [2020-10-09 15:27:24,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 299 transitions, 789 flow [2020-10-09 15:27:24,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 299 transitions, 679 flow, removed 55 selfloop flow, removed 0 redundant places. [2020-10-09 15:27:24,541 INFO L241 Difference]: Finished difference. Result has 291 places, 299 transitions, 673 flow [2020-10-09 15:27:24,541 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=673, PETRI_PLACES=291, PETRI_TRANSITIONS=299} [2020-10-09 15:27:24,541 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, -1 predicate places. [2020-10-09 15:27:24,541 INFO L481 AbstractCegarLoop]: Abstraction has has 291 places, 299 transitions, 673 flow [2020-10-09 15:27:24,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:24,542 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:24,542 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:24,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 mathsat -unsat_core_generation=3 [2020-10-09 15:27:24,753 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:24,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:24,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1405823219, now seen corresponding path program 1 times [2020-10-09 15:27:24,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:24,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735145779] [2020-10-09 15:27:24,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 98 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:24,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:24,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:24,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:24,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735145779] [2020-10-09 15:27:24,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:24,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:24,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541788134] [2020-10-09 15:27:24,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:24,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:24,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:24,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:24,918 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 314 [2020-10-09 15:27:24,918 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 299 transitions, 673 flow. Second operand 3 states. [2020-10-09 15:27:24,919 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:24,919 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 314 [2020-10-09 15:27:24,919 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:25,004 INFO L129 PetriNetUnfolder]: 30/335 cut-off events. [2020-10-09 15:27:25,004 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:27:25,017 INFO L80 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 335 events. 30/335 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1239 event pairs, 0 based on Foata normal form. 2/295 useless extension candidates. Maximal degree in co-relation 368. Up to 12 conditions per place. [2020-10-09 15:27:25,021 INFO L132 encePairwiseOnDemand]: 311/314 looper letters, 10 selfloop transitions, 1 changer transitions 0/297 dead transitions. [2020-10-09 15:27:25,022 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 297 transitions, 683 flow [2020-10-09 15:27:25,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:25,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 883 transitions. [2020-10-09 15:27:25,027 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9373673036093418 [2020-10-09 15:27:25,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 883 transitions. [2020-10-09 15:27:25,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 883 transitions. [2020-10-09 15:27:25,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:25,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 883 transitions. [2020-10-09 15:27:25,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:25,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:25,031 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:25,032 INFO L185 Difference]: Start difference. First operand has 291 places, 299 transitions, 673 flow. Second operand 3 states and 883 transitions. [2020-10-09 15:27:25,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 297 transitions, 683 flow [2020-10-09 15:27:25,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 297 transitions, 682 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:25,040 INFO L241 Difference]: Finished difference. Result has 292 places, 297 transitions, 662 flow [2020-10-09 15:27:25,040 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=292, PETRI_TRANSITIONS=297} [2020-10-09 15:27:25,040 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 0 predicate places. [2020-10-09 15:27:25,041 INFO L481 AbstractCegarLoop]: Abstraction has has 292 places, 297 transitions, 662 flow [2020-10-09 15:27:25,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:25,041 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:25,041 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:25,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 98 mathsat -unsat_core_generation=3 [2020-10-09 15:27:25,255 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:25,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:25,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1404869907, now seen corresponding path program 1 times [2020-10-09 15:27:25,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:25,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192727259] [2020-10-09 15:27:25,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 99 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:25,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:25,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:25,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:25,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:25,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192727259] [2020-10-09 15:27:25,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:25,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:25,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389042506] [2020-10-09 15:27:25,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:25,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:25,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:25,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:25,400 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 314 [2020-10-09 15:27:25,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 297 transitions, 662 flow. Second operand 3 states. [2020-10-09 15:27:25,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:25,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 314 [2020-10-09 15:27:25,401 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:25,468 INFO L129 PetriNetUnfolder]: 30/332 cut-off events. [2020-10-09 15:27:25,468 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-09 15:27:25,477 INFO L80 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 332 events. 30/332 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1213 event pairs, 0 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 362. Up to 12 conditions per place. [2020-10-09 15:27:25,479 INFO L132 encePairwiseOnDemand]: 311/314 looper letters, 5 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2020-10-09 15:27:25,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 297 transitions, 674 flow [2020-10-09 15:27:25,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:25,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2020-10-09 15:27:25,481 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9479830148619958 [2020-10-09 15:27:25,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 893 transitions. [2020-10-09 15:27:25,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 893 transitions. [2020-10-09 15:27:25,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:25,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 893 transitions. [2020-10-09 15:27:25,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:25,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:25,483 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:25,483 INFO L185 Difference]: Start difference. First operand has 292 places, 297 transitions, 662 flow. Second operand 3 states and 893 transitions. [2020-10-09 15:27:25,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 297 transitions, 674 flow [2020-10-09 15:27:25,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 297 transitions, 671 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:25,487 INFO L241 Difference]: Finished difference. Result has 295 places, 297 transitions, 669 flow [2020-10-09 15:27:25,487 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=295, PETRI_TRANSITIONS=297} [2020-10-09 15:27:25,487 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 3 predicate places. [2020-10-09 15:27:25,487 INFO L481 AbstractCegarLoop]: Abstraction has has 295 places, 297 transitions, 669 flow [2020-10-09 15:27:25,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:25,488 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:25,488 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:25,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 mathsat -unsat_core_generation=3 [2020-10-09 15:27:25,689 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:25,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:25,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1405822196, now seen corresponding path program 1 times [2020-10-09 15:27:25,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:25,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139448819] [2020-10-09 15:27:25,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 100 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:25,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:25,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:25,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:25,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:25,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139448819] [2020-10-09 15:27:25,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:25,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:25,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835520036] [2020-10-09 15:27:25,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:25,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:25,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:25,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:25,833 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 314 [2020-10-09 15:27:25,833 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 297 transitions, 669 flow. Second operand 3 states. [2020-10-09 15:27:25,834 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:25,834 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 314 [2020-10-09 15:27:25,834 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:25,883 INFO L129 PetriNetUnfolder]: 30/329 cut-off events. [2020-10-09 15:27:25,883 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:27:25,890 INFO L80 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 329 events. 30/329 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1194 event pairs, 0 based on Foata normal form. 1/290 useless extension candidates. Maximal degree in co-relation 363. Up to 12 conditions per place. [2020-10-09 15:27:25,892 INFO L132 encePairwiseOnDemand]: 312/314 looper letters, 4 selfloop transitions, 1 changer transitions 0/294 dead transitions. [2020-10-09 15:27:25,892 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 294 transitions, 667 flow [2020-10-09 15:27:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 894 transitions. [2020-10-09 15:27:25,893 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9490445859872612 [2020-10-09 15:27:25,894 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 894 transitions. [2020-10-09 15:27:25,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 894 transitions. [2020-10-09 15:27:25,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:25,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 894 transitions. [2020-10-09 15:27:25,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:25,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:25,896 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:25,896 INFO L185 Difference]: Start difference. First operand has 295 places, 297 transitions, 669 flow. Second operand 3 states and 894 transitions. [2020-10-09 15:27:25,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 294 transitions, 667 flow [2020-10-09 15:27:25,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 294 transitions, 662 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:25,901 INFO L241 Difference]: Finished difference. Result has 292 places, 294 transitions, 654 flow [2020-10-09 15:27:25,902 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=654, PETRI_PLACES=292, PETRI_TRANSITIONS=294} [2020-10-09 15:27:25,902 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 0 predicate places. [2020-10-09 15:27:25,902 INFO L481 AbstractCegarLoop]: Abstraction has has 292 places, 294 transitions, 654 flow [2020-10-09 15:27:25,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:25,902 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:25,902 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:26,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 mathsat -unsat_core_generation=3 [2020-10-09 15:27:26,114 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:26,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:26,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1347212211, now seen corresponding path program 1 times [2020-10-09 15:27:26,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:26,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205750191] [2020-10-09 15:27:26,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 101 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:26,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:26,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:26,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:26,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:26,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205750191] [2020-10-09 15:27:26,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:26,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:26,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137042835] [2020-10-09 15:27:26,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:26,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:26,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:26,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:26,262 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 314 [2020-10-09 15:27:26,263 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 294 transitions, 654 flow. Second operand 3 states. [2020-10-09 15:27:26,263 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:26,263 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 314 [2020-10-09 15:27:26,263 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:26,311 INFO L129 PetriNetUnfolder]: 28/334 cut-off events. [2020-10-09 15:27:26,311 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-09 15:27:26,318 INFO L80 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 334 events. 28/334 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1245 event pairs, 0 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 373. Up to 12 conditions per place. [2020-10-09 15:27:26,320 INFO L132 encePairwiseOnDemand]: 311/314 looper letters, 5 selfloop transitions, 2 changer transitions 0/295 dead transitions. [2020-10-09 15:27:26,320 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 295 transitions, 670 flow [2020-10-09 15:27:26,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2020-10-09 15:27:26,322 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9479830148619958 [2020-10-09 15:27:26,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 893 transitions. [2020-10-09 15:27:26,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 893 transitions. [2020-10-09 15:27:26,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:26,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 893 transitions. [2020-10-09 15:27:26,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:26,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:26,323 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:26,323 INFO L185 Difference]: Start difference. First operand has 292 places, 294 transitions, 654 flow. Second operand 3 states and 893 transitions. [2020-10-09 15:27:26,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 295 transitions, 670 flow [2020-10-09 15:27:26,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 295 transitions, 669 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:26,328 INFO L241 Difference]: Finished difference. Result has 295 places, 295 transitions, 667 flow [2020-10-09 15:27:26,329 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=667, PETRI_PLACES=295, PETRI_TRANSITIONS=295} [2020-10-09 15:27:26,329 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 3 predicate places. [2020-10-09 15:27:26,329 INFO L481 AbstractCegarLoop]: Abstraction has has 295 places, 295 transitions, 667 flow [2020-10-09 15:27:26,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:26,329 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:26,329 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:26,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 101 mathsat -unsat_core_generation=3 [2020-10-09 15:27:26,541 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:26,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:26,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1347213234, now seen corresponding path program 1 times [2020-10-09 15:27:26,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:26,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835440089] [2020-10-09 15:27:26,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 102 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:26,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:26,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:26,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:26,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835440089] [2020-10-09 15:27:26,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:26,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:26,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111132564] [2020-10-09 15:27:26,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:26,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:26,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:26,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:26,710 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 314 [2020-10-09 15:27:26,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 295 transitions, 667 flow. Second operand 3 states. [2020-10-09 15:27:26,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:26,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 314 [2020-10-09 15:27:26,712 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:26,762 INFO L129 PetriNetUnfolder]: 28/335 cut-off events. [2020-10-09 15:27:26,762 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:27:26,769 INFO L80 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 335 events. 28/335 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1254 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 378. Up to 12 conditions per place. [2020-10-09 15:27:26,771 INFO L132 encePairwiseOnDemand]: 310/314 looper letters, 9 selfloop transitions, 3 changer transitions 0/296 dead transitions. [2020-10-09 15:27:26,771 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 296 transitions, 693 flow [2020-10-09 15:27:26,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 883 transitions. [2020-10-09 15:27:26,772 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9373673036093418 [2020-10-09 15:27:26,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 883 transitions. [2020-10-09 15:27:26,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 883 transitions. [2020-10-09 15:27:26,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:26,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 883 transitions. [2020-10-09 15:27:26,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:26,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:26,774 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:26,775 INFO L185 Difference]: Start difference. First operand has 295 places, 295 transitions, 667 flow. Second operand 3 states and 883 transitions. [2020-10-09 15:27:26,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 296 transitions, 693 flow [2020-10-09 15:27:26,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 296 transitions, 691 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:26,779 INFO L241 Difference]: Finished difference. Result has 298 places, 296 transitions, 683 flow [2020-10-09 15:27:26,780 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=683, PETRI_PLACES=298, PETRI_TRANSITIONS=296} [2020-10-09 15:27:26,780 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 6 predicate places. [2020-10-09 15:27:26,780 INFO L481 AbstractCegarLoop]: Abstraction has has 298 places, 296 transitions, 683 flow [2020-10-09 15:27:26,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:26,780 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:26,780 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:26,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 mathsat -unsat_core_generation=3 [2020-10-09 15:27:26,981 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:26,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:26,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1346258899, now seen corresponding path program 1 times [2020-10-09 15:27:26,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:26,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885042323] [2020-10-09 15:27:26,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 103 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:27,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:27,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:27,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:27,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885042323] [2020-10-09 15:27:27,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:27,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:27,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822418211] [2020-10-09 15:27:27,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:27,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:27,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:27,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:27,139 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 314 [2020-10-09 15:27:27,140 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 296 transitions, 683 flow. Second operand 3 states. [2020-10-09 15:27:27,140 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:27,141 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 314 [2020-10-09 15:27:27,141 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:27,194 INFO L129 PetriNetUnfolder]: 27/332 cut-off events. [2020-10-09 15:27:27,195 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:27:27,202 INFO L80 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 332 events. 27/332 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1236 event pairs, 0 based on Foata normal form. 2/296 useless extension candidates. Maximal degree in co-relation 377. Up to 12 conditions per place. [2020-10-09 15:27:27,204 INFO L132 encePairwiseOnDemand]: 311/314 looper letters, 9 selfloop transitions, 1 changer transitions 0/294 dead transitions. [2020-10-09 15:27:27,204 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 294 transitions, 691 flow [2020-10-09 15:27:27,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2020-10-09 15:27:27,205 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9363057324840764 [2020-10-09 15:27:27,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 882 transitions. [2020-10-09 15:27:27,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 882 transitions. [2020-10-09 15:27:27,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:27,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 882 transitions. [2020-10-09 15:27:27,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:27,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:27,207 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:27,208 INFO L185 Difference]: Start difference. First operand has 298 places, 296 transitions, 683 flow. Second operand 3 states and 882 transitions. [2020-10-09 15:27:27,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 294 transitions, 691 flow [2020-10-09 15:27:27,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 294 transitions, 690 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:27,213 INFO L241 Difference]: Finished difference. Result has 299 places, 294 transitions, 672 flow [2020-10-09 15:27:27,214 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=672, PETRI_PLACES=299, PETRI_TRANSITIONS=294} [2020-10-09 15:27:27,214 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 7 predicate places. [2020-10-09 15:27:27,214 INFO L481 AbstractCegarLoop]: Abstraction has has 299 places, 294 transitions, 672 flow [2020-10-09 15:27:27,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:27,214 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:27,214 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:27,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 mathsat -unsat_core_generation=3 [2020-10-09 15:27:27,422 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:27,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:27,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1346259922, now seen corresponding path program 1 times [2020-10-09 15:27:27,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:27,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243664684] [2020-10-09 15:27:27,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 104 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:27,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:27,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:27,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:27,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243664684] [2020-10-09 15:27:27,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:27,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:27,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790177125] [2020-10-09 15:27:27,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:27,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:27,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:27,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:27,569 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 314 [2020-10-09 15:27:27,570 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 294 transitions, 672 flow. Second operand 3 states. [2020-10-09 15:27:27,570 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:27,570 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 314 [2020-10-09 15:27:27,570 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:27,619 INFO L129 PetriNetUnfolder]: 27/329 cut-off events. [2020-10-09 15:27:27,619 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:27,626 INFO L80 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 329 events. 27/329 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1211 event pairs, 0 based on Foata normal form. 1/293 useless extension candidates. Maximal degree in co-relation 372. Up to 12 conditions per place. [2020-10-09 15:27:27,628 INFO L132 encePairwiseOnDemand]: 312/314 looper letters, 4 selfloop transitions, 1 changer transitions 0/291 dead transitions. [2020-10-09 15:27:27,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 291 transitions, 671 flow [2020-10-09 15:27:27,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 894 transitions. [2020-10-09 15:27:27,630 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9490445859872612 [2020-10-09 15:27:27,630 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 894 transitions. [2020-10-09 15:27:27,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 894 transitions. [2020-10-09 15:27:27,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:27,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 894 transitions. [2020-10-09 15:27:27,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:27,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:27,631 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:27,631 INFO L185 Difference]: Start difference. First operand has 299 places, 294 transitions, 672 flow. Second operand 3 states and 894 transitions. [2020-10-09 15:27:27,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 291 transitions, 671 flow [2020-10-09 15:27:27,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 291 transitions, 666 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:27,635 INFO L241 Difference]: Finished difference. Result has 296 places, 291 transitions, 658 flow [2020-10-09 15:27:27,635 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=296, PETRI_TRANSITIONS=291} [2020-10-09 15:27:27,635 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 4 predicate places. [2020-10-09 15:27:27,635 INFO L481 AbstractCegarLoop]: Abstraction has has 296 places, 291 transitions, 658 flow [2020-10-09 15:27:27,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:27,635 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:27,635 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:27,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 104 mathsat -unsat_core_generation=3 [2020-10-09 15:27:27,836 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:27,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:27,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1637156760, now seen corresponding path program 1 times [2020-10-09 15:27:27,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:27,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876506872] [2020-10-09 15:27:27,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 105 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:27,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:27,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:27,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:27,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:27,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876506872] [2020-10-09 15:27:27,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:27,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:27,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151942885] [2020-10-09 15:27:27,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:27,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:27,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:27,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:28,005 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 314 [2020-10-09 15:27:28,006 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 291 transitions, 658 flow. Second operand 3 states. [2020-10-09 15:27:28,006 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:28,006 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 314 [2020-10-09 15:27:28,006 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:28,063 INFO L129 PetriNetUnfolder]: 26/337 cut-off events. [2020-10-09 15:27:28,063 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-09 15:27:28,071 INFO L80 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 337 events. 26/337 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1280 event pairs, 0 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 389. Up to 12 conditions per place. [2020-10-09 15:27:28,073 INFO L132 encePairwiseOnDemand]: 309/314 looper letters, 10 selfloop transitions, 3 changer transitions 0/293 dead transitions. [2020-10-09 15:27:28,073 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 293 transitions, 688 flow [2020-10-09 15:27:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 885 transitions. [2020-10-09 15:27:28,074 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9394904458598726 [2020-10-09 15:27:28,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 885 transitions. [2020-10-09 15:27:28,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 885 transitions. [2020-10-09 15:27:28,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:28,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 885 transitions. [2020-10-09 15:27:28,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:28,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:28,076 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:28,078 INFO L185 Difference]: Start difference. First operand has 296 places, 291 transitions, 658 flow. Second operand 3 states and 885 transitions. [2020-10-09 15:27:28,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 293 transitions, 688 flow [2020-10-09 15:27:28,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 293 transitions, 687 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:28,084 INFO L241 Difference]: Finished difference. Result has 299 places, 293 transitions, 681 flow [2020-10-09 15:27:28,084 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=681, PETRI_PLACES=299, PETRI_TRANSITIONS=293} [2020-10-09 15:27:28,084 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 7 predicate places. [2020-10-09 15:27:28,084 INFO L481 AbstractCegarLoop]: Abstraction has has 299 places, 293 transitions, 681 flow [2020-10-09 15:27:28,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:28,085 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:28,085 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:28,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 105 mathsat -unsat_core_generation=3 [2020-10-09 15:27:28,297 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:28,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:28,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1637157783, now seen corresponding path program 1 times [2020-10-09 15:27:28,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:28,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434765696] [2020-10-09 15:27:28,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 106 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:28,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:28,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:28,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:28,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:28,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434765696] [2020-10-09 15:27:28,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:28,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:28,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127528614] [2020-10-09 15:27:28,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:28,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:28,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:28,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:28,451 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 314 [2020-10-09 15:27:28,452 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 293 transitions, 681 flow. Second operand 3 states. [2020-10-09 15:27:28,452 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:28,452 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 314 [2020-10-09 15:27:28,452 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:28,519 INFO L129 PetriNetUnfolder]: 24/338 cut-off events. [2020-10-09 15:27:28,519 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:27:28,526 INFO L80 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 338 events. 24/338 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1302 event pairs, 0 based on Foata normal form. 1/305 useless extension candidates. Maximal degree in co-relation 384. Up to 12 conditions per place. [2020-10-09 15:27:28,528 INFO L132 encePairwiseOnDemand]: 312/314 looper letters, 4 selfloop transitions, 1 changer transitions 0/292 dead transitions. [2020-10-09 15:27:28,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 292 transitions, 687 flow [2020-10-09 15:27:28,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:28,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:28,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 894 transitions. [2020-10-09 15:27:28,529 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9490445859872612 [2020-10-09 15:27:28,529 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 894 transitions. [2020-10-09 15:27:28,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 894 transitions. [2020-10-09 15:27:28,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:28,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 894 transitions. [2020-10-09 15:27:28,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:28,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:28,531 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:28,531 INFO L185 Difference]: Start difference. First operand has 299 places, 293 transitions, 681 flow. Second operand 3 states and 894 transitions. [2020-10-09 15:27:28,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 292 transitions, 687 flow [2020-10-09 15:27:28,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 292 transitions, 682 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:28,534 INFO L241 Difference]: Finished difference. Result has 301 places, 292 transitions, 677 flow [2020-10-09 15:27:28,535 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=677, PETRI_PLACES=301, PETRI_TRANSITIONS=292} [2020-10-09 15:27:28,535 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 9 predicate places. [2020-10-09 15:27:28,535 INFO L481 AbstractCegarLoop]: Abstraction has has 301 places, 292 transitions, 677 flow [2020-10-09 15:27:28,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:28,535 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:28,535 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:28,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 mathsat -unsat_core_generation=3 [2020-10-09 15:27:28,736 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:28,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:28,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1638110072, now seen corresponding path program 1 times [2020-10-09 15:27:28,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:28,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229432642] [2020-10-09 15:27:28,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 107 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:28,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:28,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:28,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:28,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229432642] [2020-10-09 15:27:28,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:28,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:28,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506682723] [2020-10-09 15:27:28,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:28,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:28,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:28,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:28,882 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 314 [2020-10-09 15:27:28,882 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 292 transitions, 677 flow. Second operand 3 states. [2020-10-09 15:27:28,883 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:28,883 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 314 [2020-10-09 15:27:28,883 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:28,933 INFO L129 PetriNetUnfolder]: 24/331 cut-off events. [2020-10-09 15:27:28,933 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:27:28,940 INFO L80 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 331 events. 24/331 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1247 event pairs, 0 based on Foata normal form. 1/298 useless extension candidates. Maximal degree in co-relation 381. Up to 12 conditions per place. [2020-10-09 15:27:28,942 INFO L132 encePairwiseOnDemand]: 312/314 looper letters, 5 selfloop transitions, 1 changer transitions 0/290 dead transitions. [2020-10-09 15:27:28,942 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 290 transitions, 680 flow [2020-10-09 15:27:28,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2020-10-09 15:27:28,943 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9469214437367304 [2020-10-09 15:27:28,943 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 892 transitions. [2020-10-09 15:27:28,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 892 transitions. [2020-10-09 15:27:28,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:28,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 892 transitions. [2020-10-09 15:27:28,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:28,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:28,945 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:28,945 INFO L185 Difference]: Start difference. First operand has 301 places, 292 transitions, 677 flow. Second operand 3 states and 892 transitions. [2020-10-09 15:27:28,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 290 transitions, 680 flow [2020-10-09 15:27:28,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 290 transitions, 673 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:28,949 INFO L241 Difference]: Finished difference. Result has 301 places, 290 transitions, 666 flow [2020-10-09 15:27:28,949 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=301, PETRI_TRANSITIONS=290} [2020-10-09 15:27:28,949 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 9 predicate places. [2020-10-09 15:27:28,949 INFO L481 AbstractCegarLoop]: Abstraction has has 301 places, 290 transitions, 666 flow [2020-10-09 15:27:28,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:28,949 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:28,950 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:29,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 107 mathsat -unsat_core_generation=3 [2020-10-09 15:27:29,150 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:29,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:29,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1638111095, now seen corresponding path program 1 times [2020-10-09 15:27:29,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:29,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612711841] [2020-10-09 15:27:29,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 108 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:29,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:29,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:29,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:29,287 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:29,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612711841] [2020-10-09 15:27:29,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:29,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:29,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133560516] [2020-10-09 15:27:29,287 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:29,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:29,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:29,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:29,323 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 314 [2020-10-09 15:27:29,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 290 transitions, 666 flow. Second operand 3 states. [2020-10-09 15:27:29,324 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:29,324 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 314 [2020-10-09 15:27:29,324 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:29,388 INFO L129 PetriNetUnfolder]: 24/329 cut-off events. [2020-10-09 15:27:29,388 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:29,395 INFO L80 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 329 events. 24/329 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1232 event pairs, 0 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 381. Up to 12 conditions per place. [2020-10-09 15:27:29,397 INFO L132 encePairwiseOnDemand]: 312/314 looper letters, 8 selfloop transitions, 1 changer transitions 0/288 dead transitions. [2020-10-09 15:27:29,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 288 transitions, 679 flow [2020-10-09 15:27:29,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 880 transitions. [2020-10-09 15:27:29,399 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9341825902335457 [2020-10-09 15:27:29,399 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 880 transitions. [2020-10-09 15:27:29,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 880 transitions. [2020-10-09 15:27:29,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:29,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 880 transitions. [2020-10-09 15:27:29,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:29,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:29,400 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:29,400 INFO L185 Difference]: Start difference. First operand has 301 places, 290 transitions, 666 flow. Second operand 3 states and 880 transitions. [2020-10-09 15:27:29,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 288 transitions, 679 flow [2020-10-09 15:27:29,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 288 transitions, 678 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:29,405 INFO L241 Difference]: Finished difference. Result has 300 places, 288 transitions, 662 flow [2020-10-09 15:27:29,406 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=300, PETRI_TRANSITIONS=288} [2020-10-09 15:27:29,406 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 8 predicate places. [2020-10-09 15:27:29,406 INFO L481 AbstractCegarLoop]: Abstraction has has 300 places, 288 transitions, 662 flow [2020-10-09 15:27:29,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:29,406 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:29,407 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:29,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 mathsat -unsat_core_generation=3 [2020-10-09 15:27:29,618 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:29,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:29,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1731924805, now seen corresponding path program 1 times [2020-10-09 15:27:29,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:29,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695709711] [2020-10-09 15:27:29,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 109 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:29,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:29,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:29,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:29,750 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:29,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695709711] [2020-10-09 15:27:29,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:29,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:29,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674986063] [2020-10-09 15:27:29,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:29,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:29,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:29,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:29,770 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 314 [2020-10-09 15:27:29,771 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 288 transitions, 662 flow. Second operand 3 states. [2020-10-09 15:27:29,771 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:29,771 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 314 [2020-10-09 15:27:29,771 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:29,832 INFO L129 PetriNetUnfolder]: 23/337 cut-off events. [2020-10-09 15:27:29,832 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-09 15:27:29,839 INFO L80 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 337 events. 23/337 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1299 event pairs, 0 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 393. Up to 12 conditions per place. [2020-10-09 15:27:29,841 INFO L132 encePairwiseOnDemand]: 309/314 looper letters, 10 selfloop transitions, 3 changer transitions 0/290 dead transitions. [2020-10-09 15:27:29,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 290 transitions, 692 flow [2020-10-09 15:27:29,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:29,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 885 transitions. [2020-10-09 15:27:29,842 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9394904458598726 [2020-10-09 15:27:29,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 885 transitions. [2020-10-09 15:27:29,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 885 transitions. [2020-10-09 15:27:29,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:29,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 885 transitions. [2020-10-09 15:27:29,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:29,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:29,844 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:29,844 INFO L185 Difference]: Start difference. First operand has 300 places, 288 transitions, 662 flow. Second operand 3 states and 885 transitions. [2020-10-09 15:27:29,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 290 transitions, 692 flow [2020-10-09 15:27:29,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 290 transitions, 691 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:29,850 INFO L241 Difference]: Finished difference. Result has 303 places, 290 transitions, 685 flow [2020-10-09 15:27:29,850 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=685, PETRI_PLACES=303, PETRI_TRANSITIONS=290} [2020-10-09 15:27:29,850 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 11 predicate places. [2020-10-09 15:27:29,851 INFO L481 AbstractCegarLoop]: Abstraction has has 303 places, 290 transitions, 685 flow [2020-10-09 15:27:29,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:29,851 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:29,851 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:30,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 109 mathsat -unsat_core_generation=3 [2020-10-09 15:27:30,063 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:30,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:30,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1731925828, now seen corresponding path program 1 times [2020-10-09 15:27:30,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:30,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118781052] [2020-10-09 15:27:30,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 110 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:30,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:30,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:30,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:30,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118781052] [2020-10-09 15:27:30,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:30,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:30,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001159049] [2020-10-09 15:27:30,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:30,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:30,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:30,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:30,215 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 314 [2020-10-09 15:27:30,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 290 transitions, 685 flow. Second operand 3 states. [2020-10-09 15:27:30,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:30,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 314 [2020-10-09 15:27:30,217 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:30,268 INFO L129 PetriNetUnfolder]: 22/335 cut-off events. [2020-10-09 15:27:30,268 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:27:30,275 INFO L80 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 335 events. 22/335 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1287 event pairs, 0 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 390. Up to 12 conditions per place. [2020-10-09 15:27:30,277 INFO L132 encePairwiseOnDemand]: 311/314 looper letters, 5 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2020-10-09 15:27:30,277 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 290 transitions, 697 flow [2020-10-09 15:27:30,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:30,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2020-10-09 15:27:30,278 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9479830148619958 [2020-10-09 15:27:30,279 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 893 transitions. [2020-10-09 15:27:30,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 893 transitions. [2020-10-09 15:27:30,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:30,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 893 transitions. [2020-10-09 15:27:30,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:30,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:30,280 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:30,280 INFO L185 Difference]: Start difference. First operand has 303 places, 290 transitions, 685 flow. Second operand 3 states and 893 transitions. [2020-10-09 15:27:30,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 290 transitions, 697 flow [2020-10-09 15:27:30,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 290 transitions, 692 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:30,284 INFO L241 Difference]: Finished difference. Result has 306 places, 290 transitions, 690 flow [2020-10-09 15:27:30,284 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=306, PETRI_TRANSITIONS=290} [2020-10-09 15:27:30,284 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 14 predicate places. [2020-10-09 15:27:30,285 INFO L481 AbstractCegarLoop]: Abstraction has has 306 places, 290 transitions, 690 flow [2020-10-09 15:27:30,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:30,285 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:30,285 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:30,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 mathsat -unsat_core_generation=3 [2020-10-09 15:27:30,486 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:30,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:30,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1732878117, now seen corresponding path program 1 times [2020-10-09 15:27:30,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:30,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922333955] [2020-10-09 15:27:30,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 111 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:30,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:30,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:30,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:30,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922333955] [2020-10-09 15:27:30,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:30,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:30,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929790322] [2020-10-09 15:27:30,632 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:30,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:30,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:30,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:30,652 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 314 [2020-10-09 15:27:30,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 290 transitions, 690 flow. Second operand 3 states. [2020-10-09 15:27:30,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:30,653 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 314 [2020-10-09 15:27:30,653 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:30,701 INFO L129 PetriNetUnfolder]: 21/331 cut-off events. [2020-10-09 15:27:30,702 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:27:30,708 INFO L80 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 331 events. 21/331 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1262 event pairs, 0 based on Foata normal form. 1/301 useless extension candidates. Maximal degree in co-relation 386. Up to 12 conditions per place. [2020-10-09 15:27:30,710 INFO L132 encePairwiseOnDemand]: 312/314 looper letters, 4 selfloop transitions, 1 changer transitions 0/287 dead transitions. [2020-10-09 15:27:30,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 287 transitions, 685 flow [2020-10-09 15:27:30,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 894 transitions. [2020-10-09 15:27:30,711 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9490445859872612 [2020-10-09 15:27:30,711 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 894 transitions. [2020-10-09 15:27:30,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 894 transitions. [2020-10-09 15:27:30,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:30,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 894 transitions. [2020-10-09 15:27:30,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:30,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:30,712 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:30,712 INFO L185 Difference]: Start difference. First operand has 306 places, 290 transitions, 690 flow. Second operand 3 states and 894 transitions. [2020-10-09 15:27:30,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 287 transitions, 685 flow [2020-10-09 15:27:30,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 287 transitions, 678 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:30,716 INFO L241 Difference]: Finished difference. Result has 305 places, 287 transitions, 670 flow [2020-10-09 15:27:30,716 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=305, PETRI_TRANSITIONS=287} [2020-10-09 15:27:30,716 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 13 predicate places. [2020-10-09 15:27:30,716 INFO L481 AbstractCegarLoop]: Abstraction has has 305 places, 287 transitions, 670 flow [2020-10-09 15:27:30,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:30,716 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:30,717 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:30,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 mathsat -unsat_core_generation=3 [2020-10-09 15:27:30,917 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:30,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:30,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1732879140, now seen corresponding path program 1 times [2020-10-09 15:27:30,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:30,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503643819] [2020-10-09 15:27:30,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 112 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:31,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:31,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:31,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:31,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503643819] [2020-10-09 15:27:31,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:31,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:31,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401525156] [2020-10-09 15:27:31,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:31,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:31,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:31,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:31,086 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 314 [2020-10-09 15:27:31,087 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 287 transitions, 670 flow. Second operand 3 states. [2020-10-09 15:27:31,087 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:31,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 314 [2020-10-09 15:27:31,087 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:31,139 INFO L129 PetriNetUnfolder]: 21/329 cut-off events. [2020-10-09 15:27:31,139 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-09 15:27:31,148 INFO L80 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 329 events. 21/329 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1249 event pairs, 0 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 388. Up to 12 conditions per place. [2020-10-09 15:27:31,150 INFO L132 encePairwiseOnDemand]: 312/314 looper letters, 8 selfloop transitions, 1 changer transitions 0/285 dead transitions. [2020-10-09 15:27:31,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 285 transitions, 683 flow [2020-10-09 15:27:31,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 880 transitions. [2020-10-09 15:27:31,154 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9341825902335457 [2020-10-09 15:27:31,154 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 880 transitions. [2020-10-09 15:27:31,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 880 transitions. [2020-10-09 15:27:31,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:31,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 880 transitions. [2020-10-09 15:27:31,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:31,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:31,156 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:31,156 INFO L185 Difference]: Start difference. First operand has 305 places, 287 transitions, 670 flow. Second operand 3 states and 880 transitions. [2020-10-09 15:27:31,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 285 transitions, 683 flow [2020-10-09 15:27:31,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 285 transitions, 682 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:31,161 INFO L241 Difference]: Finished difference. Result has 304 places, 285 transitions, 666 flow [2020-10-09 15:27:31,161 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=304, PETRI_TRANSITIONS=285} [2020-10-09 15:27:31,161 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 12 predicate places. [2020-10-09 15:27:31,161 INFO L481 AbstractCegarLoop]: Abstraction has has 304 places, 285 transitions, 666 flow [2020-10-09 15:27:31,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:31,162 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:31,162 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:31,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 mathsat -unsat_core_generation=3 [2020-10-09 15:27:31,373 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:31,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:31,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1550139391, now seen corresponding path program 1 times [2020-10-09 15:27:31,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:31,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222472806] [2020-10-09 15:27:31,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 113 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:31,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:31,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:31,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:31,517 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:31,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222472806] [2020-10-09 15:27:31,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:31,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:31,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750436464] [2020-10-09 15:27:31,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:31,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:31,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:31,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:31,540 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 314 [2020-10-09 15:27:31,540 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 285 transitions, 666 flow. Second operand 3 states. [2020-10-09 15:27:31,540 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:31,541 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 314 [2020-10-09 15:27:31,541 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:31,606 INFO L129 PetriNetUnfolder]: 19/334 cut-off events. [2020-10-09 15:27:31,606 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-09 15:27:31,613 INFO L80 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 334 events. 19/334 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1298 event pairs, 0 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 391. Up to 12 conditions per place. [2020-10-09 15:27:31,615 INFO L132 encePairwiseOnDemand]: 311/314 looper letters, 5 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2020-10-09 15:27:31,615 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 286 transitions, 682 flow [2020-10-09 15:27:31,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:31,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2020-10-09 15:27:31,616 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9479830148619958 [2020-10-09 15:27:31,616 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 893 transitions. [2020-10-09 15:27:31,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 893 transitions. [2020-10-09 15:27:31,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:31,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 893 transitions. [2020-10-09 15:27:31,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:31,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:31,617 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:31,617 INFO L185 Difference]: Start difference. First operand has 304 places, 285 transitions, 666 flow. Second operand 3 states and 893 transitions. [2020-10-09 15:27:31,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 286 transitions, 682 flow [2020-10-09 15:27:31,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 286 transitions, 681 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:31,622 INFO L241 Difference]: Finished difference. Result has 307 places, 286 transitions, 679 flow [2020-10-09 15:27:31,623 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=307, PETRI_TRANSITIONS=286} [2020-10-09 15:27:31,623 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 15 predicate places. [2020-10-09 15:27:31,623 INFO L481 AbstractCegarLoop]: Abstraction has has 307 places, 286 transitions, 679 flow [2020-10-09 15:27:31,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:31,623 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:31,623 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:31,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 mathsat -unsat_core_generation=3 [2020-10-09 15:27:31,833 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:31,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:31,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1550140414, now seen corresponding path program 1 times [2020-10-09 15:27:31,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:31,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912064861] [2020-10-09 15:27:31,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 114 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:31,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:31,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:31,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:31,976 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:31,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912064861] [2020-10-09 15:27:31,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:31,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:31,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812021913] [2020-10-09 15:27:31,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:31,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:31,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:31,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:32,012 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 314 [2020-10-09 15:27:32,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 286 transitions, 679 flow. Second operand 3 states. [2020-10-09 15:27:32,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:32,013 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 314 [2020-10-09 15:27:32,014 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:32,066 INFO L129 PetriNetUnfolder]: 19/335 cut-off events. [2020-10-09 15:27:32,066 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:27:32,073 INFO L80 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 335 events. 19/335 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1308 event pairs, 0 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 399. Up to 12 conditions per place. [2020-10-09 15:27:32,074 INFO L132 encePairwiseOnDemand]: 310/314 looper letters, 9 selfloop transitions, 3 changer transitions 0/287 dead transitions. [2020-10-09 15:27:32,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 287 transitions, 705 flow [2020-10-09 15:27:32,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:32,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 883 transitions. [2020-10-09 15:27:32,075 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9373673036093418 [2020-10-09 15:27:32,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 883 transitions. [2020-10-09 15:27:32,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 883 transitions. [2020-10-09 15:27:32,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:32,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 883 transitions. [2020-10-09 15:27:32,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:32,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:32,077 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:32,077 INFO L185 Difference]: Start difference. First operand has 307 places, 286 transitions, 679 flow. Second operand 3 states and 883 transitions. [2020-10-09 15:27:32,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 287 transitions, 705 flow [2020-10-09 15:27:32,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 287 transitions, 703 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:32,080 INFO L241 Difference]: Finished difference. Result has 310 places, 287 transitions, 695 flow [2020-10-09 15:27:32,081 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=310, PETRI_TRANSITIONS=287} [2020-10-09 15:27:32,081 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 18 predicate places. [2020-10-09 15:27:32,081 INFO L481 AbstractCegarLoop]: Abstraction has has 310 places, 287 transitions, 695 flow [2020-10-09 15:27:32,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:32,081 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:32,081 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:32,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 114 mathsat -unsat_core_generation=3 [2020-10-09 15:27:32,282 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:32,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:32,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1549186079, now seen corresponding path program 1 times [2020-10-09 15:27:32,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:32,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710106365] [2020-10-09 15:27:32,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 115 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:32,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:32,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:32,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:32,418 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:32,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710106365] [2020-10-09 15:27:32,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:32,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:32,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021511092] [2020-10-09 15:27:32,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:32,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:32,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:32,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:32,446 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 314 [2020-10-09 15:27:32,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 287 transitions, 695 flow. Second operand 3 states. [2020-10-09 15:27:32,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:32,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 314 [2020-10-09 15:27:32,447 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:32,505 INFO L129 PetriNetUnfolder]: 18/332 cut-off events. [2020-10-09 15:27:32,505 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:27:32,512 INFO L80 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 332 events. 18/332 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1290 event pairs, 0 based on Foata normal form. 2/305 useless extension candidates. Maximal degree in co-relation 398. Up to 12 conditions per place. [2020-10-09 15:27:32,514 INFO L132 encePairwiseOnDemand]: 311/314 looper letters, 9 selfloop transitions, 1 changer transitions 0/285 dead transitions. [2020-10-09 15:27:32,514 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 285 transitions, 703 flow [2020-10-09 15:27:32,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:32,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2020-10-09 15:27:32,515 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9363057324840764 [2020-10-09 15:27:32,515 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 882 transitions. [2020-10-09 15:27:32,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 882 transitions. [2020-10-09 15:27:32,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:32,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 882 transitions. [2020-10-09 15:27:32,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:32,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:32,517 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:32,517 INFO L185 Difference]: Start difference. First operand has 310 places, 287 transitions, 695 flow. Second operand 3 states and 882 transitions. [2020-10-09 15:27:32,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 285 transitions, 703 flow [2020-10-09 15:27:32,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 285 transitions, 702 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:32,542 INFO L241 Difference]: Finished difference. Result has 311 places, 285 transitions, 684 flow [2020-10-09 15:27:32,542 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=311, PETRI_TRANSITIONS=285} [2020-10-09 15:27:32,543 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 19 predicate places. [2020-10-09 15:27:32,543 INFO L481 AbstractCegarLoop]: Abstraction has has 311 places, 285 transitions, 684 flow [2020-10-09 15:27:32,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:32,543 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:32,543 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:32,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 115 mathsat -unsat_core_generation=3 [2020-10-09 15:27:32,754 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:32,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:32,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1549187102, now seen corresponding path program 1 times [2020-10-09 15:27:32,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:32,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6463480] [2020-10-09 15:27:32,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 116 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:32,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:32,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:32,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27: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. [2020-10-09 15:27:32,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6463480] [2020-10-09 15:27:32,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:32,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:32,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036509795] [2020-10-09 15:27:32,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:32,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:32,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:32,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:32,915 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 314 [2020-10-09 15:27:32,915 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 285 transitions, 684 flow. Second operand 3 states. [2020-10-09 15:27:32,915 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:32,915 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 314 [2020-10-09 15:27:32,915 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:32,983 INFO L129 PetriNetUnfolder]: 18/329 cut-off events. [2020-10-09 15:27:32,983 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:32,990 INFO L80 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 329 events. 18/329 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1263 event pairs, 0 based on Foata normal form. 1/302 useless extension candidates. Maximal degree in co-relation 392. Up to 12 conditions per place. [2020-10-09 15:27:32,991 INFO L132 encePairwiseOnDemand]: 312/314 looper letters, 4 selfloop transitions, 1 changer transitions 0/282 dead transitions. [2020-10-09 15:27:32,992 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 282 transitions, 683 flow [2020-10-09 15:27:32,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:32,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 894 transitions. [2020-10-09 15:27:32,993 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9490445859872612 [2020-10-09 15:27:32,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 894 transitions. [2020-10-09 15:27:32,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 894 transitions. [2020-10-09 15:27:32,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:32,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 894 transitions. [2020-10-09 15:27:32,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:32,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:32,994 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:32,994 INFO L185 Difference]: Start difference. First operand has 311 places, 285 transitions, 684 flow. Second operand 3 states and 894 transitions. [2020-10-09 15:27:32,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 282 transitions, 683 flow [2020-10-09 15:27:32,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 282 transitions, 678 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:32,998 INFO L241 Difference]: Finished difference. Result has 308 places, 282 transitions, 670 flow [2020-10-09 15:27:32,998 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=308, PETRI_TRANSITIONS=282} [2020-10-09 15:27:32,998 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 16 predicate places. [2020-10-09 15:27:32,998 INFO L481 AbstractCegarLoop]: Abstraction has has 308 places, 282 transitions, 670 flow [2020-10-09 15:27:32,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:32,998 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:32,998 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:33,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 mathsat -unsat_core_generation=3 [2020-10-09 15:27:33,199 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:33,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:33,200 INFO L82 PathProgramCache]: Analyzing trace with hash 540173856, now seen corresponding path program 1 times [2020-10-09 15:27:33,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:33,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694493341] [2020-10-09 15:27:33,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 117 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:33,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:33,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:33,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:33,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694493341] [2020-10-09 15:27:33,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:33,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:33,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534920592] [2020-10-09 15:27:33,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:33,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:33,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:33,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:33,372 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 314 [2020-10-09 15:27:33,373 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 282 transitions, 670 flow. Second operand 3 states. [2020-10-09 15:27:33,373 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:33,373 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 314 [2020-10-09 15:27:33,373 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:33,462 INFO L129 PetriNetUnfolder]: 17/336 cut-off events. [2020-10-09 15:27:33,463 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-09 15:27:33,477 INFO L80 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 336 events. 17/336 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1328 event pairs, 0 based on Foata normal form. 1/308 useless extension candidates. Maximal degree in co-relation 400. Up to 12 conditions per place. [2020-10-09 15:27:33,480 INFO L132 encePairwiseOnDemand]: 312/314 looper letters, 4 selfloop transitions, 1 changer transitions 0/282 dead transitions. [2020-10-09 15:27:33,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 282 transitions, 680 flow [2020-10-09 15:27:33,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 894 transitions. [2020-10-09 15:27:33,483 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9490445859872612 [2020-10-09 15:27:33,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 894 transitions. [2020-10-09 15:27:33,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 894 transitions. [2020-10-09 15:27:33,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:33,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 894 transitions. [2020-10-09 15:27:33,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:33,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:33,486 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:33,487 INFO L185 Difference]: Start difference. First operand has 308 places, 282 transitions, 670 flow. Second operand 3 states and 894 transitions. [2020-10-09 15:27:33,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 282 transitions, 680 flow [2020-10-09 15:27:33,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 282 transitions, 679 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:33,497 INFO L241 Difference]: Finished difference. Result has 310 places, 282 transitions, 674 flow [2020-10-09 15:27:33,497 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=310, PETRI_TRANSITIONS=282} [2020-10-09 15:27:33,497 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 18 predicate places. [2020-10-09 15:27:33,498 INFO L481 AbstractCegarLoop]: Abstraction has has 310 places, 282 transitions, 674 flow [2020-10-09 15:27:33,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:33,498 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:33,498 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:33,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 117 mathsat -unsat_core_generation=3 [2020-10-09 15:27:33,711 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:33,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:33,712 INFO L82 PathProgramCache]: Analyzing trace with hash 540174879, now seen corresponding path program 1 times [2020-10-09 15:27:33,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:33,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27666042] [2020-10-09 15:27:33,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 118 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:33,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:33,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:33,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:33,895 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:33,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27666042] [2020-10-09 15:27:33,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:33,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:33,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876820964] [2020-10-09 15:27:33,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:33,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:33,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:33,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:33,936 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 314 [2020-10-09 15:27:33,937 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 282 transitions, 674 flow. Second operand 3 states. [2020-10-09 15:27:33,938 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:33,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 314 [2020-10-09 15:27:33,938 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:34,056 INFO L129 PetriNetUnfolder]: 15/338 cut-off events. [2020-10-09 15:27:34,056 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:34,071 INFO L80 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 338 events. 15/338 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1361 event pairs, 0 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 411. Up to 12 conditions per place. [2020-10-09 15:27:34,074 INFO L132 encePairwiseOnDemand]: 310/314 looper letters, 9 selfloop transitions, 3 changer transitions 0/283 dead transitions. [2020-10-09 15:27:34,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 283 transitions, 700 flow [2020-10-09 15:27:34,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 883 transitions. [2020-10-09 15:27:34,076 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9373673036093418 [2020-10-09 15:27:34,076 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 883 transitions. [2020-10-09 15:27:34,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 883 transitions. [2020-10-09 15:27:34,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:34,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 883 transitions. [2020-10-09 15:27:34,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:34,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:34,080 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:34,080 INFO L185 Difference]: Start difference. First operand has 310 places, 282 transitions, 674 flow. Second operand 3 states and 883 transitions. [2020-10-09 15:27:34,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 283 transitions, 700 flow [2020-10-09 15:27:34,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 283 transitions, 699 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:34,087 INFO L241 Difference]: Finished difference. Result has 313 places, 283 transitions, 691 flow [2020-10-09 15:27:34,088 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=313, PETRI_TRANSITIONS=283} [2020-10-09 15:27:34,088 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 21 predicate places. [2020-10-09 15:27:34,088 INFO L481 AbstractCegarLoop]: Abstraction has has 313 places, 283 transitions, 691 flow [2020-10-09 15:27:34,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:34,088 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:34,089 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:34,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 118 mathsat -unsat_core_generation=3 [2020-10-09 15:27:34,302 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:34,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:34,303 INFO L82 PathProgramCache]: Analyzing trace with hash 539221567, now seen corresponding path program 1 times [2020-10-09 15:27:34,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:34,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721121244] [2020-10-09 15:27:34,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 119 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:34,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:34,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:34,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:34,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721121244] [2020-10-09 15:27:34,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:34,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:34,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950378824] [2020-10-09 15:27:34,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:34,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:34,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:34,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:34,457 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 314 [2020-10-09 15:27:34,458 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 283 transitions, 691 flow. Second operand 3 states. [2020-10-09 15:27:34,458 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:34,458 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 314 [2020-10-09 15:27:34,458 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:34,515 INFO L129 PetriNetUnfolder]: 15/331 cut-off events. [2020-10-09 15:27:34,516 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:27:34,523 INFO L80 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 331 events. 15/331 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1299 event pairs, 0 based on Foata normal form. 1/307 useless extension candidates. Maximal degree in co-relation 397. Up to 12 conditions per place. [2020-10-09 15:27:34,524 INFO L132 encePairwiseOnDemand]: 312/314 looper letters, 5 selfloop transitions, 1 changer transitions 0/281 dead transitions. [2020-10-09 15:27:34,524 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 281 transitions, 693 flow [2020-10-09 15:27:34,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2020-10-09 15:27:34,525 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9469214437367304 [2020-10-09 15:27:34,525 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 892 transitions. [2020-10-09 15:27:34,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 892 transitions. [2020-10-09 15:27:34,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:34,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 892 transitions. [2020-10-09 15:27:34,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:34,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:34,527 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:34,527 INFO L185 Difference]: Start difference. First operand has 313 places, 283 transitions, 691 flow. Second operand 3 states and 892 transitions. [2020-10-09 15:27:34,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 281 transitions, 693 flow [2020-10-09 15:27:34,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 281 transitions, 685 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:34,530 INFO L241 Difference]: Finished difference. Result has 313 places, 281 transitions, 678 flow [2020-10-09 15:27:34,530 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=313, PETRI_TRANSITIONS=281} [2020-10-09 15:27:34,530 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 21 predicate places. [2020-10-09 15:27:34,531 INFO L481 AbstractCegarLoop]: Abstraction has has 313 places, 281 transitions, 678 flow [2020-10-09 15:27:34,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:34,531 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:34,531 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:34,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 mathsat -unsat_core_generation=3 [2020-10-09 15:27:34,732 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:34,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:34,732 INFO L82 PathProgramCache]: Analyzing trace with hash 539220544, now seen corresponding path program 1 times [2020-10-09 15:27:34,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:34,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581509273] [2020-10-09 15:27:34,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 120 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:34,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:34,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:34,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:34,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581509273] [2020-10-09 15:27:34,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:34,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:34,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284934941] [2020-10-09 15:27:34,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:34,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:34,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:34,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:34,897 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 314 [2020-10-09 15:27:34,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 281 transitions, 678 flow. Second operand 3 states. [2020-10-09 15:27:34,898 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:34,898 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 314 [2020-10-09 15:27:34,898 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:34,961 INFO L129 PetriNetUnfolder]: 15/329 cut-off events. [2020-10-09 15:27:34,961 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:34,968 INFO L80 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 329 events. 15/329 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1285 event pairs, 0 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 401. Up to 12 conditions per place. [2020-10-09 15:27:34,969 INFO L132 encePairwiseOnDemand]: 312/314 looper letters, 8 selfloop transitions, 1 changer transitions 0/279 dead transitions. [2020-10-09 15:27:34,969 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 279 transitions, 691 flow [2020-10-09 15:27:34,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:34,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 880 transitions. [2020-10-09 15:27:34,970 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9341825902335457 [2020-10-09 15:27:34,970 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 880 transitions. [2020-10-09 15:27:34,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 880 transitions. [2020-10-09 15:27:34,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:34,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 880 transitions. [2020-10-09 15:27:34,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:34,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:34,972 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:34,972 INFO L185 Difference]: Start difference. First operand has 313 places, 281 transitions, 678 flow. Second operand 3 states and 880 transitions. [2020-10-09 15:27:34,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 279 transitions, 691 flow [2020-10-09 15:27:34,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 279 transitions, 690 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:34,974 INFO L241 Difference]: Finished difference. Result has 312 places, 279 transitions, 674 flow [2020-10-09 15:27:34,975 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=312, PETRI_TRANSITIONS=279} [2020-10-09 15:27:34,975 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 20 predicate places. [2020-10-09 15:27:34,975 INFO L481 AbstractCegarLoop]: Abstraction has has 312 places, 279 transitions, 674 flow [2020-10-09 15:27:34,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:34,975 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:34,975 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:35,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 120 mathsat -unsat_core_generation=3 [2020-10-09 15:27:35,176 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:35,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:35,176 INFO L82 PathProgramCache]: Analyzing trace with hash 161287039, now seen corresponding path program 1 times [2020-10-09 15:27:35,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:35,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247160138] [2020-10-09 15:27:35,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 121 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:35,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:35,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:35,314 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:27:35,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:27:35,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247160138] [2020-10-09 15:27:35,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:35,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:35,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651845588] [2020-10-09 15:27:35,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:35,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:35,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:35,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:35,351 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 314 [2020-10-09 15:27:35,352 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 279 transitions, 674 flow. Second operand 3 states. [2020-10-09 15:27:35,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:35,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 314 [2020-10-09 15:27:35,352 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:35,412 INFO L129 PetriNetUnfolder]: 14/337 cut-off events. [2020-10-09 15:27:35,412 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-09 15:27:35,419 INFO L80 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 337 events. 14/337 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1353 event pairs, 0 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 413. Up to 12 conditions per place. [2020-10-09 15:27:35,421 INFO L132 encePairwiseOnDemand]: 309/314 looper letters, 10 selfloop transitions, 3 changer transitions 0/281 dead transitions. [2020-10-09 15:27:35,421 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 281 transitions, 704 flow [2020-10-09 15:27:35,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 885 transitions. [2020-10-09 15:27:35,422 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9394904458598726 [2020-10-09 15:27:35,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 885 transitions. [2020-10-09 15:27:35,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 885 transitions. [2020-10-09 15:27:35,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:35,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 885 transitions. [2020-10-09 15:27:35,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:35,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:35,423 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:35,423 INFO L185 Difference]: Start difference. First operand has 312 places, 279 transitions, 674 flow. Second operand 3 states and 885 transitions. [2020-10-09 15:27:35,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 281 transitions, 704 flow [2020-10-09 15:27:35,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 281 transitions, 703 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:35,426 INFO L241 Difference]: Finished difference. Result has 315 places, 281 transitions, 697 flow [2020-10-09 15:27:35,426 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=315, PETRI_TRANSITIONS=281} [2020-10-09 15:27:35,426 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 23 predicate places. [2020-10-09 15:27:35,426 INFO L481 AbstractCegarLoop]: Abstraction has has 315 places, 281 transitions, 697 flow [2020-10-09 15:27:35,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:35,427 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:35,427 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:35,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 121 mathsat -unsat_core_generation=3 [2020-10-09 15:27:35,629 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:35,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:35,629 INFO L82 PathProgramCache]: Analyzing trace with hash 161288062, now seen corresponding path program 1 times [2020-10-09 15:27:35,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:35,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210129431] [2020-10-09 15:27:35,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 122 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:35,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:35,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:27:35,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:27:35,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210129431] [2020-10-09 15:27:35,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:35,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:35,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142167971] [2020-10-09 15:27:35,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:35,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:35,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:35,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:35,781 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 314 [2020-10-09 15:27:35,782 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 281 transitions, 697 flow. Second operand 3 states. [2020-10-09 15:27:35,782 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:35,782 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 314 [2020-10-09 15:27:35,782 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:35,836 INFO L129 PetriNetUnfolder]: 13/335 cut-off events. [2020-10-09 15:27:35,836 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:27:35,843 INFO L80 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 335 events. 13/335 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1344 event pairs, 0 based on Foata normal form. 0/312 useless extension candidates. Maximal degree in co-relation 410. Up to 12 conditions per place. [2020-10-09 15:27:35,844 INFO L132 encePairwiseOnDemand]: 311/314 looper letters, 5 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2020-10-09 15:27:35,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 281 transitions, 709 flow [2020-10-09 15:27:35,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2020-10-09 15:27:35,846 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9479830148619958 [2020-10-09 15:27:35,846 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 893 transitions. [2020-10-09 15:27:35,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 893 transitions. [2020-10-09 15:27:35,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:35,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 893 transitions. [2020-10-09 15:27:35,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:35,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:35,847 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:35,847 INFO L185 Difference]: Start difference. First operand has 315 places, 281 transitions, 697 flow. Second operand 3 states and 893 transitions. [2020-10-09 15:27:35,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 281 transitions, 709 flow [2020-10-09 15:27:35,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 281 transitions, 704 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:35,851 INFO L241 Difference]: Finished difference. Result has 318 places, 281 transitions, 702 flow [2020-10-09 15:27:35,851 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=702, PETRI_PLACES=318, PETRI_TRANSITIONS=281} [2020-10-09 15:27:35,851 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 26 predicate places. [2020-10-09 15:27:35,851 INFO L481 AbstractCegarLoop]: Abstraction has has 318 places, 281 transitions, 702 flow [2020-10-09 15:27:35,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:35,851 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:35,851 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:36,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 mathsat -unsat_core_generation=3 [2020-10-09 15:27:36,059 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:36,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:36,059 INFO L82 PathProgramCache]: Analyzing trace with hash 162240351, now seen corresponding path program 1 times [2020-10-09 15:27:36,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:36,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014811232] [2020-10-09 15:27:36,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 123 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:36,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:36,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:27:36,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:27:36,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014811232] [2020-10-09 15:27:36,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:36,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:36,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045576894] [2020-10-09 15:27:36,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:36,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:36,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:36,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:36,225 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 314 [2020-10-09 15:27:36,226 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 281 transitions, 702 flow. Second operand 3 states. [2020-10-09 15:27:36,226 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:36,226 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 314 [2020-10-09 15:27:36,226 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:36,286 INFO L129 PetriNetUnfolder]: 12/331 cut-off events. [2020-10-09 15:27:36,286 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:27:36,293 INFO L80 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 331 events. 12/331 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1317 event pairs, 0 based on Foata normal form. 1/310 useless extension candidates. Maximal degree in co-relation 406. Up to 12 conditions per place. [2020-10-09 15:27:36,294 INFO L132 encePairwiseOnDemand]: 312/314 looper letters, 4 selfloop transitions, 1 changer transitions 0/278 dead transitions. [2020-10-09 15:27:36,294 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 278 transitions, 697 flow [2020-10-09 15:27:36,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 894 transitions. [2020-10-09 15:27:36,295 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9490445859872612 [2020-10-09 15:27:36,296 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 894 transitions. [2020-10-09 15:27:36,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 894 transitions. [2020-10-09 15:27:36,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:36,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 894 transitions. [2020-10-09 15:27:36,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:36,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:36,297 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:36,297 INFO L185 Difference]: Start difference. First operand has 318 places, 281 transitions, 702 flow. Second operand 3 states and 894 transitions. [2020-10-09 15:27:36,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 278 transitions, 697 flow [2020-10-09 15:27:36,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 278 transitions, 690 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:36,300 INFO L241 Difference]: Finished difference. Result has 317 places, 278 transitions, 682 flow [2020-10-09 15:27:36,300 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=317, PETRI_TRANSITIONS=278} [2020-10-09 15:27:36,300 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 25 predicate places. [2020-10-09 15:27:36,300 INFO L481 AbstractCegarLoop]: Abstraction has has 317 places, 278 transitions, 682 flow [2020-10-09 15:27:36,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:36,300 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:36,301 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:36,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 123 mathsat -unsat_core_generation=3 [2020-10-09 15:27:36,501 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:36,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:36,502 INFO L82 PathProgramCache]: Analyzing trace with hash 162241374, now seen corresponding path program 1 times [2020-10-09 15:27:36,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:36,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262420628] [2020-10-09 15:27:36,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 124 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:36,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:36,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:27:36,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:27:36,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262420628] [2020-10-09 15:27:36,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:36,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:36,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41221319] [2020-10-09 15:27:36,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:36,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:36,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:36,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:36,677 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 314 [2020-10-09 15:27:36,677 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 278 transitions, 682 flow. Second operand 3 states. [2020-10-09 15:27:36,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:36,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 314 [2020-10-09 15:27:36,678 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:36,733 INFO L129 PetriNetUnfolder]: 12/329 cut-off events. [2020-10-09 15:27:36,733 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-09 15:27:36,743 INFO L80 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 329 events. 12/329 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1303 event pairs, 0 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 408. Up to 12 conditions per place. [2020-10-09 15:27:36,745 INFO L132 encePairwiseOnDemand]: 312/314 looper letters, 8 selfloop transitions, 1 changer transitions 0/276 dead transitions. [2020-10-09 15:27:36,745 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 276 transitions, 695 flow [2020-10-09 15:27:36,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:36,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 880 transitions. [2020-10-09 15:27:36,746 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9341825902335457 [2020-10-09 15:27:36,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 880 transitions. [2020-10-09 15:27:36,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 880 transitions. [2020-10-09 15:27:36,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:36,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 880 transitions. [2020-10-09 15:27:36,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:36,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:36,748 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:36,748 INFO L185 Difference]: Start difference. First operand has 317 places, 278 transitions, 682 flow. Second operand 3 states and 880 transitions. [2020-10-09 15:27:36,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 276 transitions, 695 flow [2020-10-09 15:27:36,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 276 transitions, 694 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:36,753 INFO L241 Difference]: Finished difference. Result has 316 places, 276 transitions, 678 flow [2020-10-09 15:27:36,753 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=316, PETRI_TRANSITIONS=276} [2020-10-09 15:27:36,753 INFO L341 CegarLoopForPetriNet]: 292 programPoint places, 24 predicate places. [2020-10-09 15:27:36,753 INFO L481 AbstractCegarLoop]: Abstraction has has 316 places, 276 transitions, 678 flow [2020-10-09 15:27:36,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:36,753 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:36,754 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:36,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 124 mathsat -unsat_core_generation=3 [2020-10-09 15:27:36,965 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:36,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:36,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1330768881, now seen corresponding path program 1 times [2020-10-09 15:27:36,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:36,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171664732] [2020-10-09 15:27:36,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 125 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:27:37,116 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:27:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:27:37,138 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:27:37,170 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:27:37,170 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:27:37,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 mathsat -unsat_core_generation=3 [2020-10-09 15:27:37,371 WARN L371 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:27:37,371 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2020-10-09 15:27:37,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,400 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,400 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,400 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,400 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,400 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,403 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,403 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,403 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,403 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,403 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,403 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,405 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,412 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,412 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,412 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,415 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,421 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,421 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,421 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,421 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,421 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,423 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,423 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,423 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,423 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,423 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,425 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,426 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,426 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,426 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,426 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,428 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,431 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,431 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,431 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,431 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,432 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,432 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,432 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,434 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,434 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,434 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,435 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,435 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,435 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,435 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,435 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,435 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,435 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,435 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,435 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,436 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,436 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,436 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,436 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,436 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,438 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,438 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,438 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,438 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,438 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,438 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,438 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,438 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,438 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,441 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,441 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,441 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,442 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,442 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,442 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,442 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,443 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,443 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,444 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,444 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,444 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,444 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,444 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,444 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,444 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,444 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,445 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,446 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,446 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,446 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,446 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,446 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,446 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,446 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,447 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,447 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,447 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,447 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,448 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,448 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,448 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,448 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,449 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,449 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,449 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,449 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,449 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,449 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,449 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,450 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,451 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,451 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,451 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,451 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,451 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,451 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,451 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,451 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,452 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,452 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,453 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,453 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,453 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,453 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,453 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,453 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,453 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,453 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,454 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,454 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,454 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,455 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,455 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,455 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,456 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,456 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,456 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,456 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,457 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,457 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,457 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,459 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,459 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,459 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:37,465 INFO L253 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-10-09 15:27:37,465 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:27:37,466 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:27:37,466 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:27:37,466 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:27:37,466 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:27:37,466 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:27:37,466 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:27:37,466 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:27:37,469 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 317 places, 341 transitions, 874 flow [2020-10-09 15:27:37,525 INFO L129 PetriNetUnfolder]: 61/448 cut-off events. [2020-10-09 15:27:37,525 INFO L130 PetriNetUnfolder]: For 352/352 co-relation queries the response was YES. [2020-10-09 15:27:37,535 INFO L80 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 448 events. 61/448 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1743 event pairs, 0 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 506. Up to 26 conditions per place. [2020-10-09 15:27:37,536 INFO L82 GeneralOperation]: Start removeDead. Operand has 317 places, 341 transitions, 874 flow [2020-10-09 15:27:37,541 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 317 places, 341 transitions, 874 flow [2020-10-09 15:27:37,546 INFO L129 PetriNetUnfolder]: 9/97 cut-off events. [2020-10-09 15:27:37,546 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:27:37,546 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:37,546 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:37,546 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:37,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:37,546 INFO L82 PathProgramCache]: Analyzing trace with hash -356568755, now seen corresponding path program 1 times [2020-10-09 15:27:37,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:37,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188836023] [2020-10-09 15:27:37,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 126 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:37,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:37,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:37,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:37,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188836023] [2020-10-09 15:27:37,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:37,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:37,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590884798] [2020-10-09 15:27:37,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:37,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:37,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:37,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:37,706 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 341 [2020-10-09 15:27:37,707 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 341 transitions, 874 flow. Second operand 3 states. [2020-10-09 15:27:37,707 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:37,707 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 341 [2020-10-09 15:27:37,707 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:37,762 INFO L129 PetriNetUnfolder]: 34/363 cut-off events. [2020-10-09 15:27:37,762 INFO L130 PetriNetUnfolder]: For 353/353 co-relation queries the response was YES. [2020-10-09 15:27:37,771 INFO L80 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 363 events. 34/363 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1353 event pairs, 0 based on Foata normal form. 50/365 useless extension candidates. Maximal degree in co-relation 432. Up to 13 conditions per place. [2020-10-09 15:27:37,773 INFO L132 encePairwiseOnDemand]: 324/341 looper letters, 5 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2020-10-09 15:27:37,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 324 transitions, 854 flow [2020-10-09 15:27:37,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:37,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:37,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 999 transitions. [2020-10-09 15:27:37,775 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9765395894428153 [2020-10-09 15:27:37,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 999 transitions. [2020-10-09 15:27:37,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 999 transitions. [2020-10-09 15:27:37,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:37,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 999 transitions. [2020-10-09 15:27:37,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:37,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:37,777 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:37,777 INFO L185 Difference]: Start difference. First operand has 317 places, 341 transitions, 874 flow. Second operand 3 states and 999 transitions. [2020-10-09 15:27:37,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 324 transitions, 854 flow [2020-10-09 15:27:37,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 324 transitions, 722 flow, removed 66 selfloop flow, removed 0 redundant places. [2020-10-09 15:27:37,782 INFO L241 Difference]: Finished difference. Result has 316 places, 324 transitions, 720 flow [2020-10-09 15:27:37,782 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=316, PETRI_TRANSITIONS=324} [2020-10-09 15:27:37,783 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, -1 predicate places. [2020-10-09 15:27:37,783 INFO L481 AbstractCegarLoop]: Abstraction has has 316 places, 324 transitions, 720 flow [2020-10-09 15:27:37,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:37,783 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:37,783 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:37,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 mathsat -unsat_core_generation=3 [2020-10-09 15:27:37,995 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:37,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:37,996 INFO L82 PathProgramCache]: Analyzing trace with hash -356569778, now seen corresponding path program 1 times [2020-10-09 15:27:37,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:37,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346878805] [2020-10-09 15:27:37,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 127 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:38,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:38,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:38,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:38,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346878805] [2020-10-09 15:27:38,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:38,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:38,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908712734] [2020-10-09 15:27:38,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:38,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:38,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:38,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:38,161 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2020-10-09 15:27:38,162 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 324 transitions, 720 flow. Second operand 3 states. [2020-10-09 15:27:38,162 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:38,162 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2020-10-09 15:27:38,162 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:38,216 INFO L129 PetriNetUnfolder]: 34/364 cut-off events. [2020-10-09 15:27:38,216 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:27:38,224 INFO L80 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 364 events. 34/364 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1361 event pairs, 0 based on Foata normal form. 0/317 useless extension candidates. Maximal degree in co-relation 400. Up to 13 conditions per place. [2020-10-09 15:27:38,227 INFO L132 encePairwiseOnDemand]: 337/341 looper letters, 9 selfloop transitions, 3 changer transitions 0/325 dead transitions. [2020-10-09 15:27:38,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 325 transitions, 746 flow [2020-10-09 15:27:38,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 961 transitions. [2020-10-09 15:27:38,228 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2020-10-09 15:27:38,228 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 961 transitions. [2020-10-09 15:27:38,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 961 transitions. [2020-10-09 15:27:38,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:38,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 961 transitions. [2020-10-09 15:27:38,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:38,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:38,229 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:38,229 INFO L185 Difference]: Start difference. First operand has 316 places, 324 transitions, 720 flow. Second operand 3 states and 961 transitions. [2020-10-09 15:27:38,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 325 transitions, 746 flow [2020-10-09 15:27:38,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 325 transitions, 744 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:38,232 INFO L241 Difference]: Finished difference. Result has 319 places, 325 transitions, 736 flow [2020-10-09 15:27:38,233 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=319, PETRI_TRANSITIONS=325} [2020-10-09 15:27:38,233 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 2 predicate places. [2020-10-09 15:27:38,233 INFO L481 AbstractCegarLoop]: Abstraction has has 319 places, 325 transitions, 736 flow [2020-10-09 15:27:38,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:38,233 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:38,233 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:38,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 127 mathsat -unsat_core_generation=3 [2020-10-09 15:27:38,434 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:38,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:38,434 INFO L82 PathProgramCache]: Analyzing trace with hash -355615443, now seen corresponding path program 1 times [2020-10-09 15:27:38,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:38,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911426501] [2020-10-09 15:27:38,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 128 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:38,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:38,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:38,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:38,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911426501] [2020-10-09 15:27:38,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:38,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:38,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776354091] [2020-10-09 15:27:38,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:38,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:38,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:38,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:38,618 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2020-10-09 15:27:38,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 325 transitions, 736 flow. Second operand 3 states. [2020-10-09 15:27:38,619 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:38,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2020-10-09 15:27:38,619 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:38,674 INFO L129 PetriNetUnfolder]: 33/361 cut-off events. [2020-10-09 15:27:38,674 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:27:38,682 INFO L80 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 361 events. 33/361 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1345 event pairs, 0 based on Foata normal form. 2/318 useless extension candidates. Maximal degree in co-relation 402. Up to 13 conditions per place. [2020-10-09 15:27:38,685 INFO L132 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 1 changer transitions 0/323 dead transitions. [2020-10-09 15:27:38,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 323 transitions, 744 flow [2020-10-09 15:27:38,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:38,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2020-10-09 15:27:38,686 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2020-10-09 15:27:38,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 960 transitions. [2020-10-09 15:27:38,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 960 transitions. [2020-10-09 15:27:38,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:38,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 960 transitions. [2020-10-09 15:27:38,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:38,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:38,688 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:38,688 INFO L185 Difference]: Start difference. First operand has 319 places, 325 transitions, 736 flow. Second operand 3 states and 960 transitions. [2020-10-09 15:27:38,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 323 transitions, 744 flow [2020-10-09 15:27:38,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 323 transitions, 743 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:38,691 INFO L241 Difference]: Finished difference. Result has 320 places, 323 transitions, 725 flow [2020-10-09 15:27:38,691 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=725, PETRI_PLACES=320, PETRI_TRANSITIONS=323} [2020-10-09 15:27:38,691 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 3 predicate places. [2020-10-09 15:27:38,691 INFO L481 AbstractCegarLoop]: Abstraction has has 320 places, 323 transitions, 725 flow [2020-10-09 15:27:38,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:38,692 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:38,692 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:38,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 128 mathsat -unsat_core_generation=3 [2020-10-09 15:27:38,894 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:38,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:38,895 INFO L82 PathProgramCache]: Analyzing trace with hash -355616466, now seen corresponding path program 1 times [2020-10-09 15:27:38,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:38,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142799075] [2020-10-09 15:27:38,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 129 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:39,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:39,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:39,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:39,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:39,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142799075] [2020-10-09 15:27:39,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:39,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:39,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416248973] [2020-10-09 15:27:39,058 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:39,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:39,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:39,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:39,079 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 341 [2020-10-09 15:27:39,079 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 323 transitions, 725 flow. Second operand 3 states. [2020-10-09 15:27:39,080 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:39,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 341 [2020-10-09 15:27:39,080 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:39,129 INFO L129 PetriNetUnfolder]: 33/358 cut-off events. [2020-10-09 15:27:39,130 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:39,137 INFO L80 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 358 events. 33/358 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1325 event pairs, 0 based on Foata normal form. 1/315 useless extension candidates. Maximal degree in co-relation 397. Up to 13 conditions per place. [2020-10-09 15:27:39,139 INFO L132 encePairwiseOnDemand]: 339/341 looper letters, 4 selfloop transitions, 1 changer transitions 0/320 dead transitions. [2020-10-09 15:27:39,139 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 320 transitions, 724 flow [2020-10-09 15:27:39,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2020-10-09 15:27:39,141 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9501466275659824 [2020-10-09 15:27:39,141 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 972 transitions. [2020-10-09 15:27:39,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 972 transitions. [2020-10-09 15:27:39,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:39,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 972 transitions. [2020-10-09 15:27:39,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:39,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:39,142 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:39,142 INFO L185 Difference]: Start difference. First operand has 320 places, 323 transitions, 725 flow. Second operand 3 states and 972 transitions. [2020-10-09 15:27:39,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 320 transitions, 724 flow [2020-10-09 15:27:39,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 320 transitions, 719 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:39,145 INFO L241 Difference]: Finished difference. Result has 317 places, 320 transitions, 711 flow [2020-10-09 15:27:39,146 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=711, PETRI_PLACES=317, PETRI_TRANSITIONS=320} [2020-10-09 15:27:39,146 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 0 predicate places. [2020-10-09 15:27:39,146 INFO L481 AbstractCegarLoop]: Abstraction has has 317 places, 320 transitions, 711 flow [2020-10-09 15:27:39,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:39,146 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:39,146 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:39,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 129 mathsat -unsat_core_generation=3 [2020-10-09 15:27:39,349 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:39,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:39,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1379261726, now seen corresponding path program 1 times [2020-10-09 15:27:39,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:39,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103895903] [2020-10-09 15:27:39,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 130 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:39,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:39,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:39,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:39,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103895903] [2020-10-09 15:27:39,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:39,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:39,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525598605] [2020-10-09 15:27:39,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:39,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:39,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:39,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:39,524 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2020-10-09 15:27:39,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 320 transitions, 711 flow. Second operand 3 states. [2020-10-09 15:27:39,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:39,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2020-10-09 15:27:39,525 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:39,602 INFO L129 PetriNetUnfolder]: 32/366 cut-off events. [2020-10-09 15:27:39,602 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:39,613 INFO L80 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 366 events. 32/366 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1395 event pairs, 0 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 414. Up to 13 conditions per place. [2020-10-09 15:27:39,616 INFO L132 encePairwiseOnDemand]: 336/341 looper letters, 10 selfloop transitions, 3 changer transitions 0/322 dead transitions. [2020-10-09 15:27:39,616 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 322 transitions, 741 flow [2020-10-09 15:27:39,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:39,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:39,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 963 transitions. [2020-10-09 15:27:39,618 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9413489736070382 [2020-10-09 15:27:39,618 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 963 transitions. [2020-10-09 15:27:39,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 963 transitions. [2020-10-09 15:27:39,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:39,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 963 transitions. [2020-10-09 15:27:39,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:39,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:39,619 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:39,619 INFO L185 Difference]: Start difference. First operand has 317 places, 320 transitions, 711 flow. Second operand 3 states and 963 transitions. [2020-10-09 15:27:39,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 322 transitions, 741 flow [2020-10-09 15:27:39,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 322 transitions, 740 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:39,622 INFO L241 Difference]: Finished difference. Result has 320 places, 322 transitions, 734 flow [2020-10-09 15:27:39,622 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=320, PETRI_TRANSITIONS=322} [2020-10-09 15:27:39,623 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 3 predicate places. [2020-10-09 15:27:39,623 INFO L481 AbstractCegarLoop]: Abstraction has has 320 places, 322 transitions, 734 flow [2020-10-09 15:27:39,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:39,623 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:39,623 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:39,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 130 mathsat -unsat_core_generation=3 [2020-10-09 15:27:39,824 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:39,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:39,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1379260703, now seen corresponding path program 1 times [2020-10-09 15:27:39,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:39,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897804753] [2020-10-09 15:27:39,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 131 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:39,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:39,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:39,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:39,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897804753] [2020-10-09 15:27:39,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:39,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:39,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045899642] [2020-10-09 15:27:39,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:39,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:39,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:39,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:39,984 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 341 [2020-10-09 15:27:39,985 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 322 transitions, 734 flow. Second operand 3 states. [2020-10-09 15:27:39,985 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:39,985 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 341 [2020-10-09 15:27:39,985 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:40,044 INFO L129 PetriNetUnfolder]: 31/364 cut-off events. [2020-10-09 15:27:40,044 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:27:40,053 INFO L80 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 364 events. 31/364 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1382 event pairs, 0 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 408. Up to 13 conditions per place. [2020-10-09 15:27:40,055 INFO L132 encePairwiseOnDemand]: 338/341 looper letters, 5 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2020-10-09 15:27:40,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 322 transitions, 746 flow [2020-10-09 15:27:40,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2020-10-09 15:27:40,056 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9491691104594331 [2020-10-09 15:27:40,056 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 971 transitions. [2020-10-09 15:27:40,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 971 transitions. [2020-10-09 15:27:40,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:40,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 971 transitions. [2020-10-09 15:27:40,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:40,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:40,058 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:40,058 INFO L185 Difference]: Start difference. First operand has 320 places, 322 transitions, 734 flow. Second operand 3 states and 971 transitions. [2020-10-09 15:27:40,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 322 transitions, 746 flow [2020-10-09 15:27:40,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 322 transitions, 741 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:40,061 INFO L241 Difference]: Finished difference. Result has 323 places, 322 transitions, 739 flow [2020-10-09 15:27:40,062 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=323, PETRI_TRANSITIONS=322} [2020-10-09 15:27:40,062 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 6 predicate places. [2020-10-09 15:27:40,062 INFO L481 AbstractCegarLoop]: Abstraction has has 323 places, 322 transitions, 739 flow [2020-10-09 15:27:40,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:40,062 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:40,062 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:40,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 131 mathsat -unsat_core_generation=3 [2020-10-09 15:27:40,272 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:40,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:40,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1378308414, now seen corresponding path program 1 times [2020-10-09 15:27:40,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:40,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733025343] [2020-10-09 15:27:40,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 132 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:40,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:40,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:40,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:40,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:40,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733025343] [2020-10-09 15:27:40,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:40,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:40,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178526839] [2020-10-09 15:27:40,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:40,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:40,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:40,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:40,442 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 341 [2020-10-09 15:27:40,443 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 322 transitions, 739 flow. Second operand 3 states. [2020-10-09 15:27:40,443 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:40,443 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 341 [2020-10-09 15:27:40,443 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:40,493 INFO L129 PetriNetUnfolder]: 30/360 cut-off events. [2020-10-09 15:27:40,494 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:27:40,501 INFO L80 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 360 events. 30/360 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1357 event pairs, 0 based on Foata normal form. 1/320 useless extension candidates. Maximal degree in co-relation 405. Up to 13 conditions per place. [2020-10-09 15:27:40,503 INFO L132 encePairwiseOnDemand]: 339/341 looper letters, 4 selfloop transitions, 1 changer transitions 0/319 dead transitions. [2020-10-09 15:27:40,503 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 319 transitions, 734 flow [2020-10-09 15:27:40,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2020-10-09 15:27:40,504 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9501466275659824 [2020-10-09 15:27:40,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 972 transitions. [2020-10-09 15:27:40,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 972 transitions. [2020-10-09 15:27:40,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:40,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 972 transitions. [2020-10-09 15:27:40,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:40,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:40,506 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:40,506 INFO L185 Difference]: Start difference. First operand has 323 places, 322 transitions, 739 flow. Second operand 3 states and 972 transitions. [2020-10-09 15:27:40,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 319 transitions, 734 flow [2020-10-09 15:27:40,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 319 transitions, 727 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:40,509 INFO L241 Difference]: Finished difference. Result has 322 places, 319 transitions, 719 flow [2020-10-09 15:27:40,509 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=719, PETRI_PLACES=322, PETRI_TRANSITIONS=319} [2020-10-09 15:27:40,509 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 5 predicate places. [2020-10-09 15:27:40,509 INFO L481 AbstractCegarLoop]: Abstraction has has 322 places, 319 transitions, 719 flow [2020-10-09 15:27:40,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:40,510 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:40,510 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:40,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 132 mathsat -unsat_core_generation=3 [2020-10-09 15:27:40,711 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:40,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:40,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1378307391, now seen corresponding path program 1 times [2020-10-09 15:27:40,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:40,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191676033] [2020-10-09 15:27:40,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 133 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:40,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:40,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:40,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:40,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191676033] [2020-10-09 15:27:40,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:40,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:40,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541297027] [2020-10-09 15:27:40,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:40,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:40,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:40,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:40,892 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2020-10-09 15:27:40,892 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 319 transitions, 719 flow. Second operand 3 states. [2020-10-09 15:27:40,892 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:40,892 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2020-10-09 15:27:40,893 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:40,945 INFO L129 PetriNetUnfolder]: 30/358 cut-off events. [2020-10-09 15:27:40,945 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:40,953 INFO L80 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 358 events. 30/358 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1343 event pairs, 0 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 407. Up to 13 conditions per place. [2020-10-09 15:27:40,955 INFO L132 encePairwiseOnDemand]: 339/341 looper letters, 8 selfloop transitions, 1 changer transitions 0/317 dead transitions. [2020-10-09 15:27:40,955 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 317 transitions, 732 flow [2020-10-09 15:27:40,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2020-10-09 15:27:40,956 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9364613880742912 [2020-10-09 15:27:40,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 958 transitions. [2020-10-09 15:27:40,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 958 transitions. [2020-10-09 15:27:40,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:40,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 958 transitions. [2020-10-09 15:27:40,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:40,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:40,958 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:40,958 INFO L185 Difference]: Start difference. First operand has 322 places, 319 transitions, 719 flow. Second operand 3 states and 958 transitions. [2020-10-09 15:27:40,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 317 transitions, 732 flow [2020-10-09 15:27:40,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 317 transitions, 731 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:40,961 INFO L241 Difference]: Finished difference. Result has 321 places, 317 transitions, 715 flow [2020-10-09 15:27:40,961 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=715, PETRI_PLACES=321, PETRI_TRANSITIONS=317} [2020-10-09 15:27:40,961 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 4 predicate places. [2020-10-09 15:27:40,961 INFO L481 AbstractCegarLoop]: Abstraction has has 321 places, 317 transitions, 715 flow [2020-10-09 15:27:40,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:40,961 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:40,961 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:41,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 mathsat -unsat_core_generation=3 [2020-10-09 15:27:41,162 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:41,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:41,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1994423926, now seen corresponding path program 1 times [2020-10-09 15:27:41,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:41,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192264005] [2020-10-09 15:27:41,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 134 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:41,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:41,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:41,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:41,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:41,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192264005] [2020-10-09 15:27:41,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:41,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:41,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844541932] [2020-10-09 15:27:41,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:41,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:41,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:41,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:41,339 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 341 [2020-10-09 15:27:41,340 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 317 transitions, 715 flow. Second operand 3 states. [2020-10-09 15:27:41,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:41,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 341 [2020-10-09 15:27:41,340 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:41,395 INFO L129 PetriNetUnfolder]: 28/363 cut-off events. [2020-10-09 15:27:41,395 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:41,403 INFO L80 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 363 events. 28/363 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1392 event pairs, 0 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 410. Up to 13 conditions per place. [2020-10-09 15:27:41,405 INFO L132 encePairwiseOnDemand]: 338/341 looper letters, 5 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2020-10-09 15:27:41,405 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 318 transitions, 731 flow [2020-10-09 15:27:41,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:41,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2020-10-09 15:27:41,406 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9491691104594331 [2020-10-09 15:27:41,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 971 transitions. [2020-10-09 15:27:41,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 971 transitions. [2020-10-09 15:27:41,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:41,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 971 transitions. [2020-10-09 15:27:41,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:41,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:41,408 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:41,408 INFO L185 Difference]: Start difference. First operand has 321 places, 317 transitions, 715 flow. Second operand 3 states and 971 transitions. [2020-10-09 15:27:41,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 318 transitions, 731 flow [2020-10-09 15:27:41,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 318 transitions, 730 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:41,411 INFO L241 Difference]: Finished difference. Result has 324 places, 318 transitions, 728 flow [2020-10-09 15:27:41,411 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=324, PETRI_TRANSITIONS=318} [2020-10-09 15:27:41,411 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 7 predicate places. [2020-10-09 15:27:41,411 INFO L481 AbstractCegarLoop]: Abstraction has has 324 places, 318 transitions, 728 flow [2020-10-09 15:27:41,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:41,412 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:41,412 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:41,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 134 mathsat -unsat_core_generation=3 [2020-10-09 15:27:41,614 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:41,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:41,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1994422903, now seen corresponding path program 1 times [2020-10-09 15:27:41,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:41,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469524417] [2020-10-09 15:27:41,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 135 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:41,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:41,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:41,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:41,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469524417] [2020-10-09 15:27:41,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:41,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:41,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794937722] [2020-10-09 15:27:41,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:41,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:41,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:41,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:41,786 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2020-10-09 15:27:41,787 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 318 transitions, 728 flow. Second operand 3 states. [2020-10-09 15:27:41,787 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:41,787 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2020-10-09 15:27:41,787 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:41,849 INFO L129 PetriNetUnfolder]: 28/364 cut-off events. [2020-10-09 15:27:41,850 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:27:41,859 INFO L80 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 364 events. 28/364 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1402 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 417. Up to 13 conditions per place. [2020-10-09 15:27:41,861 INFO L132 encePairwiseOnDemand]: 337/341 looper letters, 9 selfloop transitions, 3 changer transitions 0/319 dead transitions. [2020-10-09 15:27:41,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 319 transitions, 754 flow [2020-10-09 15:27:41,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:41,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 961 transitions. [2020-10-09 15:27:41,863 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2020-10-09 15:27:41,863 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 961 transitions. [2020-10-09 15:27:41,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 961 transitions. [2020-10-09 15:27:41,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:41,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 961 transitions. [2020-10-09 15:27:41,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:41,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:41,864 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:41,864 INFO L185 Difference]: Start difference. First operand has 324 places, 318 transitions, 728 flow. Second operand 3 states and 961 transitions. [2020-10-09 15:27:41,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 319 transitions, 754 flow [2020-10-09 15:27:41,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 319 transitions, 752 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:41,867 INFO L241 Difference]: Finished difference. Result has 327 places, 319 transitions, 744 flow [2020-10-09 15:27:41,867 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=327, PETRI_TRANSITIONS=319} [2020-10-09 15:27:41,867 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 10 predicate places. [2020-10-09 15:27:41,868 INFO L481 AbstractCegarLoop]: Abstraction has has 327 places, 319 transitions, 744 flow [2020-10-09 15:27:41,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:41,868 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:41,868 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:42,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 135 mathsat -unsat_core_generation=3 [2020-10-09 15:27:42,069 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:42,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:42,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1995377238, now seen corresponding path program 1 times [2020-10-09 15:27:42,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:42,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282997839] [2020-10-09 15:27:42,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 136 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:42,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:42,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:42,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:42,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282997839] [2020-10-09 15:27:42,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:42,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:42,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584157918] [2020-10-09 15:27:42,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:42,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:42,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:42,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:42,255 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2020-10-09 15:27:42,256 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 319 transitions, 744 flow. Second operand 3 states. [2020-10-09 15:27:42,256 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:42,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2020-10-09 15:27:42,257 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:42,313 INFO L129 PetriNetUnfolder]: 27/361 cut-off events. [2020-10-09 15:27:42,313 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:27:42,322 INFO L80 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 361 events. 27/361 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1384 event pairs, 0 based on Foata normal form. 2/324 useless extension candidates. Maximal degree in co-relation 416. Up to 13 conditions per place. [2020-10-09 15:27:42,324 INFO L132 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 1 changer transitions 0/317 dead transitions. [2020-10-09 15:27:42,324 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 317 transitions, 752 flow [2020-10-09 15:27:42,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2020-10-09 15:27:42,325 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2020-10-09 15:27:42,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 960 transitions. [2020-10-09 15:27:42,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 960 transitions. [2020-10-09 15:27:42,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:42,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 960 transitions. [2020-10-09 15:27:42,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:42,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:42,327 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:42,327 INFO L185 Difference]: Start difference. First operand has 327 places, 319 transitions, 744 flow. Second operand 3 states and 960 transitions. [2020-10-09 15:27:42,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 317 transitions, 752 flow [2020-10-09 15:27:42,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 317 transitions, 751 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:42,332 INFO L241 Difference]: Finished difference. Result has 328 places, 317 transitions, 733 flow [2020-10-09 15:27:42,332 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=733, PETRI_PLACES=328, PETRI_TRANSITIONS=317} [2020-10-09 15:27:42,332 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 11 predicate places. [2020-10-09 15:27:42,332 INFO L481 AbstractCegarLoop]: Abstraction has has 328 places, 317 transitions, 733 flow [2020-10-09 15:27:42,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:42,332 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:42,333 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:42,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 136 mathsat -unsat_core_generation=3 [2020-10-09 15:27:42,542 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:42,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:42,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1995376215, now seen corresponding path program 1 times [2020-10-09 15:27:42,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:42,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143750821] [2020-10-09 15:27:42,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 137 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:42,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:42,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:42,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:42,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143750821] [2020-10-09 15:27:42,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:42,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:42,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111534862] [2020-10-09 15:27:42,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:42,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:42,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:42,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:42,712 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 341 [2020-10-09 15:27:42,712 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 317 transitions, 733 flow. Second operand 3 states. [2020-10-09 15:27:42,712 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:42,713 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 341 [2020-10-09 15:27:42,713 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:42,767 INFO L129 PetriNetUnfolder]: 27/358 cut-off events. [2020-10-09 15:27:42,767 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:27:42,775 INFO L80 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 358 events. 27/358 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1360 event pairs, 0 based on Foata normal form. 1/321 useless extension candidates. Maximal degree in co-relation 411. Up to 13 conditions per place. [2020-10-09 15:27:42,777 INFO L132 encePairwiseOnDemand]: 339/341 looper letters, 4 selfloop transitions, 1 changer transitions 0/314 dead transitions. [2020-10-09 15:27:42,777 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 314 transitions, 732 flow [2020-10-09 15:27:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:42,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2020-10-09 15:27:42,778 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9501466275659824 [2020-10-09 15:27:42,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 972 transitions. [2020-10-09 15:27:42,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 972 transitions. [2020-10-09 15:27:42,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:42,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 972 transitions. [2020-10-09 15:27:42,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:42,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:42,779 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:42,779 INFO L185 Difference]: Start difference. First operand has 328 places, 317 transitions, 733 flow. Second operand 3 states and 972 transitions. [2020-10-09 15:27:42,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 314 transitions, 732 flow [2020-10-09 15:27:42,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 314 transitions, 727 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:42,783 INFO L241 Difference]: Finished difference. Result has 325 places, 314 transitions, 719 flow [2020-10-09 15:27:42,783 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=719, PETRI_PLACES=325, PETRI_TRANSITIONS=314} [2020-10-09 15:27:42,783 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 8 predicate places. [2020-10-09 15:27:42,783 INFO L481 AbstractCegarLoop]: Abstraction has has 325 places, 314 transitions, 719 flow [2020-10-09 15:27:42,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:42,783 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:42,783 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:42,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 137 mathsat -unsat_core_generation=3 [2020-10-09 15:27:42,984 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:42,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:42,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1654309524, now seen corresponding path program 1 times [2020-10-09 15:27:42,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:42,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496871751] [2020-10-09 15:27:42,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 138 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:43,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:43,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:43,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:43,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496871751] [2020-10-09 15:27:43,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:43,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:43,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570095175] [2020-10-09 15:27:43,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:43,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:43,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:43,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:43,172 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2020-10-09 15:27:43,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 314 transitions, 719 flow. Second operand 3 states. [2020-10-09 15:27:43,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:43,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2020-10-09 15:27:43,173 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:43,235 INFO L129 PetriNetUnfolder]: 26/366 cut-off events. [2020-10-09 15:27:43,235 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:43,244 INFO L80 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 366 events. 26/366 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1429 event pairs, 0 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 428. Up to 13 conditions per place. [2020-10-09 15:27:43,246 INFO L132 encePairwiseOnDemand]: 336/341 looper letters, 10 selfloop transitions, 3 changer transitions 0/316 dead transitions. [2020-10-09 15:27:43,246 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 316 transitions, 749 flow [2020-10-09 15:27:43,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 963 transitions. [2020-10-09 15:27:43,269 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9413489736070382 [2020-10-09 15:27:43,270 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 963 transitions. [2020-10-09 15:27:43,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 963 transitions. [2020-10-09 15:27:43,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:43,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 963 transitions. [2020-10-09 15:27:43,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:43,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:43,271 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:43,271 INFO L185 Difference]: Start difference. First operand has 325 places, 314 transitions, 719 flow. Second operand 3 states and 963 transitions. [2020-10-09 15:27:43,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 316 transitions, 749 flow [2020-10-09 15:27:43,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 316 transitions, 748 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:43,274 INFO L241 Difference]: Finished difference. Result has 328 places, 316 transitions, 742 flow [2020-10-09 15:27:43,274 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=328, PETRI_TRANSITIONS=316} [2020-10-09 15:27:43,274 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 11 predicate places. [2020-10-09 15:27:43,274 INFO L481 AbstractCegarLoop]: Abstraction has has 328 places, 316 transitions, 742 flow [2020-10-09 15:27:43,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:43,274 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:43,274 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:43,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 138 mathsat -unsat_core_generation=3 [2020-10-09 15:27:43,475 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:43,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:43,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1654310547, now seen corresponding path program 1 times [2020-10-09 15:27:43,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:43,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713235247] [2020-10-09 15:27:43,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 139 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:43,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:43,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:43,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:43,645 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:43,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713235247] [2020-10-09 15:27:43,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:43,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:43,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920921664] [2020-10-09 15:27:43,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:43,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:43,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:43,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:43,658 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 341 [2020-10-09 15:27:43,658 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 316 transitions, 742 flow. Second operand 3 states. [2020-10-09 15:27:43,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:43,659 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 341 [2020-10-09 15:27:43,659 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:43,721 INFO L129 PetriNetUnfolder]: 24/367 cut-off events. [2020-10-09 15:27:43,721 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:27:43,730 INFO L80 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 367 events. 24/367 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1451 event pairs, 0 based on Foata normal form. 1/333 useless extension candidates. Maximal degree in co-relation 423. Up to 13 conditions per place. [2020-10-09 15:27:43,732 INFO L132 encePairwiseOnDemand]: 339/341 looper letters, 4 selfloop transitions, 1 changer transitions 0/315 dead transitions. [2020-10-09 15:27:43,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 315 transitions, 748 flow [2020-10-09 15:27:43,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:43,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2020-10-09 15:27:43,733 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9501466275659824 [2020-10-09 15:27:43,733 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 972 transitions. [2020-10-09 15:27:43,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 972 transitions. [2020-10-09 15:27:43,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:43,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 972 transitions. [2020-10-09 15:27:43,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:43,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:43,735 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:43,735 INFO L185 Difference]: Start difference. First operand has 328 places, 316 transitions, 742 flow. Second operand 3 states and 972 transitions. [2020-10-09 15:27:43,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 315 transitions, 748 flow [2020-10-09 15:27:43,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 315 transitions, 743 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:43,739 INFO L241 Difference]: Finished difference. Result has 330 places, 315 transitions, 738 flow [2020-10-09 15:27:43,739 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=330, PETRI_TRANSITIONS=315} [2020-10-09 15:27:43,739 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 13 predicate places. [2020-10-09 15:27:43,739 INFO L481 AbstractCegarLoop]: Abstraction has has 330 places, 315 transitions, 738 flow [2020-10-09 15:27:43,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:43,739 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:43,739 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:43,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 139 mathsat -unsat_core_generation=3 [2020-10-09 15:27:43,940 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:43,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:43,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1655262836, now seen corresponding path program 1 times [2020-10-09 15:27:43,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:43,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306379482] [2020-10-09 15:27:43,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 140 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:44,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:44,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:44,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:44,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306379482] [2020-10-09 15:27:44,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:44,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:44,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013831536] [2020-10-09 15:27:44,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:44,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:44,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:44,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:44,104 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 341 [2020-10-09 15:27:44,105 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 315 transitions, 738 flow. Second operand 3 states. [2020-10-09 15:27:44,105 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:44,105 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 341 [2020-10-09 15:27:44,105 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:44,167 INFO L129 PetriNetUnfolder]: 24/360 cut-off events. [2020-10-09 15:27:44,167 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:27:44,177 INFO L80 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 360 events. 24/360 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1394 event pairs, 0 based on Foata normal form. 1/326 useless extension candidates. Maximal degree in co-relation 420. Up to 13 conditions per place. [2020-10-09 15:27:44,178 INFO L132 encePairwiseOnDemand]: 339/341 looper letters, 5 selfloop transitions, 1 changer transitions 0/313 dead transitions. [2020-10-09 15:27:44,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 313 transitions, 741 flow [2020-10-09 15:27:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2020-10-09 15:27:44,181 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481915933528837 [2020-10-09 15:27:44,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 970 transitions. [2020-10-09 15:27:44,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 970 transitions. [2020-10-09 15:27:44,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:44,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 970 transitions. [2020-10-09 15:27:44,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:44,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:44,183 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:44,183 INFO L185 Difference]: Start difference. First operand has 330 places, 315 transitions, 738 flow. Second operand 3 states and 970 transitions. [2020-10-09 15:27:44,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 313 transitions, 741 flow [2020-10-09 15:27:44,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 313 transitions, 734 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:44,187 INFO L241 Difference]: Finished difference. Result has 330 places, 313 transitions, 727 flow [2020-10-09 15:27:44,187 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=727, PETRI_PLACES=330, PETRI_TRANSITIONS=313} [2020-10-09 15:27:44,188 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 13 predicate places. [2020-10-09 15:27:44,188 INFO L481 AbstractCegarLoop]: Abstraction has has 330 places, 313 transitions, 727 flow [2020-10-09 15:27:44,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:44,188 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:44,188 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:44,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 140 mathsat -unsat_core_generation=3 [2020-10-09 15:27:44,395 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:44,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:44,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1655263859, now seen corresponding path program 1 times [2020-10-09 15:27:44,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:44,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535719584] [2020-10-09 15:27:44,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 141 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:44,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:44,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:44,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:44,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535719584] [2020-10-09 15:27:44,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:44,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:44,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781607737] [2020-10-09 15:27:44,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:44,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:44,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:44,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:44,568 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2020-10-09 15:27:44,568 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 313 transitions, 727 flow. Second operand 3 states. [2020-10-09 15:27:44,569 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:44,569 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2020-10-09 15:27:44,569 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:44,630 INFO L129 PetriNetUnfolder]: 24/358 cut-off events. [2020-10-09 15:27:44,631 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:27:44,640 INFO L80 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 358 events. 24/358 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1376 event pairs, 0 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 420. Up to 13 conditions per place. [2020-10-09 15:27:44,642 INFO L132 encePairwiseOnDemand]: 339/341 looper letters, 8 selfloop transitions, 1 changer transitions 0/311 dead transitions. [2020-10-09 15:27:44,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 311 transitions, 740 flow [2020-10-09 15:27:44,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:44,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2020-10-09 15:27:44,643 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9364613880742912 [2020-10-09 15:27:44,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 958 transitions. [2020-10-09 15:27:44,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 958 transitions. [2020-10-09 15:27:44,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:44,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 958 transitions. [2020-10-09 15:27:44,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:44,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:44,645 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:44,645 INFO L185 Difference]: Start difference. First operand has 330 places, 313 transitions, 727 flow. Second operand 3 states and 958 transitions. [2020-10-09 15:27:44,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 311 transitions, 740 flow [2020-10-09 15:27:44,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 311 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:44,649 INFO L241 Difference]: Finished difference. Result has 329 places, 311 transitions, 723 flow [2020-10-09 15:27:44,649 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=329, PETRI_TRANSITIONS=311} [2020-10-09 15:27:44,650 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 12 predicate places. [2020-10-09 15:27:44,650 INFO L481 AbstractCegarLoop]: Abstraction has has 329 places, 311 transitions, 723 flow [2020-10-09 15:27:44,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:44,650 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:44,650 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:44,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 141 mathsat -unsat_core_generation=3 [2020-10-09 15:27:44,851 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:44,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:44,851 INFO L82 PathProgramCache]: Analyzing trace with hash -2093066845, now seen corresponding path program 1 times [2020-10-09 15:27:44,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:44,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569069656] [2020-10-09 15:27:44,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 142 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:45,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:45,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:45,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:45,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569069656] [2020-10-09 15:27:45,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:45,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:45,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512556780] [2020-10-09 15:27:45,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:45,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:45,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:45,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:45,029 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 341 [2020-10-09 15:27:45,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 311 transitions, 723 flow. Second operand 3 states. [2020-10-09 15:27:45,030 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:45,030 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 341 [2020-10-09 15:27:45,030 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:45,096 INFO L129 PetriNetUnfolder]: 22/363 cut-off events. [2020-10-09 15:27:45,096 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:45,104 INFO L80 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 363 events. 22/363 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1426 event pairs, 0 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 423. Up to 13 conditions per place. [2020-10-09 15:27:45,106 INFO L132 encePairwiseOnDemand]: 338/341 looper letters, 5 selfloop transitions, 2 changer transitions 0/312 dead transitions. [2020-10-09 15:27:45,106 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 312 transitions, 739 flow [2020-10-09 15:27:45,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:45,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2020-10-09 15:27:45,108 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9491691104594331 [2020-10-09 15:27:45,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 971 transitions. [2020-10-09 15:27:45,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 971 transitions. [2020-10-09 15:27:45,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:45,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 971 transitions. [2020-10-09 15:27:45,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:45,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:45,109 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:45,109 INFO L185 Difference]: Start difference. First operand has 329 places, 311 transitions, 723 flow. Second operand 3 states and 971 transitions. [2020-10-09 15:27:45,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 312 transitions, 739 flow [2020-10-09 15:27:45,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 312 transitions, 738 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:45,112 INFO L241 Difference]: Finished difference. Result has 332 places, 312 transitions, 736 flow [2020-10-09 15:27:45,112 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=332, PETRI_TRANSITIONS=312} [2020-10-09 15:27:45,112 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 15 predicate places. [2020-10-09 15:27:45,113 INFO L481 AbstractCegarLoop]: Abstraction has has 332 places, 312 transitions, 736 flow [2020-10-09 15:27:45,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:45,113 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:45,113 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:45,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 142 mathsat -unsat_core_generation=3 [2020-10-09 15:27:45,314 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:45,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:45,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2093067868, now seen corresponding path program 1 times [2020-10-09 15:27:45,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:45,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275521408] [2020-10-09 15:27:45,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 143 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:45,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:45,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:45,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:45,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275521408] [2020-10-09 15:27:45,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:45,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:45,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283208607] [2020-10-09 15:27:45,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:45,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:45,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:45,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:45,486 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2020-10-09 15:27:45,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 312 transitions, 736 flow. Second operand 3 states. [2020-10-09 15:27:45,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:45,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2020-10-09 15:27:45,487 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:45,567 INFO L129 PetriNetUnfolder]: 22/364 cut-off events. [2020-10-09 15:27:45,567 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:27:45,575 INFO L80 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 364 events. 22/364 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1437 event pairs, 0 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 431. Up to 13 conditions per place. [2020-10-09 15:27:45,577 INFO L132 encePairwiseOnDemand]: 337/341 looper letters, 9 selfloop transitions, 3 changer transitions 0/313 dead transitions. [2020-10-09 15:27:45,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 313 transitions, 762 flow [2020-10-09 15:27:45,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 961 transitions. [2020-10-09 15:27:45,578 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2020-10-09 15:27:45,578 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 961 transitions. [2020-10-09 15:27:45,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 961 transitions. [2020-10-09 15:27:45,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:45,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 961 transitions. [2020-10-09 15:27:45,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:45,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:45,579 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:45,579 INFO L185 Difference]: Start difference. First operand has 332 places, 312 transitions, 736 flow. Second operand 3 states and 961 transitions. [2020-10-09 15:27:45,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 313 transitions, 762 flow [2020-10-09 15:27:45,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 313 transitions, 760 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:45,582 INFO L241 Difference]: Finished difference. Result has 335 places, 313 transitions, 752 flow [2020-10-09 15:27:45,583 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=335, PETRI_TRANSITIONS=313} [2020-10-09 15:27:45,583 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 18 predicate places. [2020-10-09 15:27:45,583 INFO L481 AbstractCegarLoop]: Abstraction has has 335 places, 313 transitions, 752 flow [2020-10-09 15:27:45,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:45,583 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:45,583 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:45,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 143 mathsat -unsat_core_generation=3 [2020-10-09 15:27:45,784 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:45,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:45,784 INFO L82 PathProgramCache]: Analyzing trace with hash -2092114556, now seen corresponding path program 1 times [2020-10-09 15:27:45,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:45,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121982407] [2020-10-09 15:27:45,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 144 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:45,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:45,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:45,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:45,941 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:45,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121982407] [2020-10-09 15:27:45,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:45,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:45,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119610306] [2020-10-09 15:27:45,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:45,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:45,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:45,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:45,963 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 341 [2020-10-09 15:27:45,964 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 313 transitions, 752 flow. Second operand 3 states. [2020-10-09 15:27:45,964 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:45,964 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 341 [2020-10-09 15:27:45,964 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:46,022 INFO L129 PetriNetUnfolder]: 21/360 cut-off events. [2020-10-09 15:27:46,023 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:27:46,031 INFO L80 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 360 events. 21/360 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1410 event pairs, 0 based on Foata normal form. 1/329 useless extension candidates. Maximal degree in co-relation 423. Up to 13 conditions per place. [2020-10-09 15:27:46,033 INFO L132 encePairwiseOnDemand]: 339/341 looper letters, 4 selfloop transitions, 1 changer transitions 0/310 dead transitions. [2020-10-09 15:27:46,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 310 transitions, 747 flow [2020-10-09 15:27:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2020-10-09 15:27:46,034 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9501466275659824 [2020-10-09 15:27:46,034 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 972 transitions. [2020-10-09 15:27:46,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 972 transitions. [2020-10-09 15:27:46,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:46,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 972 transitions. [2020-10-09 15:27:46,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:46,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:46,037 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:46,037 INFO L185 Difference]: Start difference. First operand has 335 places, 313 transitions, 752 flow. Second operand 3 states and 972 transitions. [2020-10-09 15:27:46,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 310 transitions, 747 flow [2020-10-09 15:27:46,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 310 transitions, 739 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:46,042 INFO L241 Difference]: Finished difference. Result has 334 places, 310 transitions, 731 flow [2020-10-09 15:27:46,043 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=731, PETRI_PLACES=334, PETRI_TRANSITIONS=310} [2020-10-09 15:27:46,043 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 17 predicate places. [2020-10-09 15:27:46,043 INFO L481 AbstractCegarLoop]: Abstraction has has 334 places, 310 transitions, 731 flow [2020-10-09 15:27:46,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:46,043 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:46,043 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:46,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 144 mathsat -unsat_core_generation=3 [2020-10-09 15:27:46,254 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:46,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:46,254 INFO L82 PathProgramCache]: Analyzing trace with hash -2092113533, now seen corresponding path program 1 times [2020-10-09 15:27:46,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:46,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125705847] [2020-10-09 15:27:46,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 145 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:46,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:46,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:46,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:46,407 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:27:46,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125705847] [2020-10-09 15:27:46,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:46,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:46,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211540138] [2020-10-09 15:27:46,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:46,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:46,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:46,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:46,443 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2020-10-09 15:27:46,443 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 310 transitions, 731 flow. Second operand 3 states. [2020-10-09 15:27:46,444 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:46,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2020-10-09 15:27:46,444 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:46,502 INFO L129 PetriNetUnfolder]: 21/358 cut-off events. [2020-10-09 15:27:46,502 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:46,510 INFO L80 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 358 events. 21/358 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1394 event pairs, 0 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 427. Up to 13 conditions per place. [2020-10-09 15:27:46,512 INFO L132 encePairwiseOnDemand]: 339/341 looper letters, 8 selfloop transitions, 1 changer transitions 0/308 dead transitions. [2020-10-09 15:27:46,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 308 transitions, 744 flow [2020-10-09 15:27:46,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:46,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2020-10-09 15:27:46,513 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9364613880742912 [2020-10-09 15:27:46,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 958 transitions. [2020-10-09 15:27:46,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 958 transitions. [2020-10-09 15:27:46,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:46,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 958 transitions. [2020-10-09 15:27:46,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:46,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:46,515 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:46,516 INFO L185 Difference]: Start difference. First operand has 334 places, 310 transitions, 731 flow. Second operand 3 states and 958 transitions. [2020-10-09 15:27:46,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 308 transitions, 744 flow [2020-10-09 15:27:46,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 308 transitions, 743 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:46,521 INFO L241 Difference]: Finished difference. Result has 333 places, 308 transitions, 727 flow [2020-10-09 15:27:46,521 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=727, PETRI_PLACES=333, PETRI_TRANSITIONS=308} [2020-10-09 15:27:46,521 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 16 predicate places. [2020-10-09 15:27:46,521 INFO L481 AbstractCegarLoop]: Abstraction has has 333 places, 308 transitions, 727 flow [2020-10-09 15:27:46,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:46,521 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:46,522 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:46,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 145 mathsat -unsat_core_generation=3 [2020-10-09 15:27:46,733 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:46,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:46,733 INFO L82 PathProgramCache]: Analyzing trace with hash -703502788, now seen corresponding path program 1 times [2020-10-09 15:27:46,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:46,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192566054] [2020-10-09 15:27:46,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 146 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:46,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:46,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:46,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:46,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192566054] [2020-10-09 15:27:46,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:46,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:46,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595292023] [2020-10-09 15:27:46,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:46,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:46,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:46,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:46,917 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2020-10-09 15:27:46,918 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 308 transitions, 727 flow. Second operand 3 states. [2020-10-09 15:27:46,918 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:46,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2020-10-09 15:27:46,919 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:47,019 INFO L129 PetriNetUnfolder]: 20/366 cut-off events. [2020-10-09 15:27:47,019 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:47,032 INFO L80 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 366 events. 20/366 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1463 event pairs, 0 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 439. Up to 13 conditions per place. [2020-10-09 15:27:47,034 INFO L132 encePairwiseOnDemand]: 336/341 looper letters, 10 selfloop transitions, 3 changer transitions 0/310 dead transitions. [2020-10-09 15:27:47,035 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 310 transitions, 757 flow [2020-10-09 15:27:47,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:47,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 963 transitions. [2020-10-09 15:27:47,036 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9413489736070382 [2020-10-09 15:27:47,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 963 transitions. [2020-10-09 15:27:47,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 963 transitions. [2020-10-09 15:27:47,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:47,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 963 transitions. [2020-10-09 15:27:47,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:47,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:47,038 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:47,038 INFO L185 Difference]: Start difference. First operand has 333 places, 308 transitions, 727 flow. Second operand 3 states and 963 transitions. [2020-10-09 15:27:47,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 310 transitions, 757 flow [2020-10-09 15:27:47,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 310 transitions, 756 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:47,043 INFO L241 Difference]: Finished difference. Result has 336 places, 310 transitions, 750 flow [2020-10-09 15:27:47,043 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=336, PETRI_TRANSITIONS=310} [2020-10-09 15:27:47,043 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 19 predicate places. [2020-10-09 15:27:47,044 INFO L481 AbstractCegarLoop]: Abstraction has has 336 places, 310 transitions, 750 flow [2020-10-09 15:27:47,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:47,044 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:47,044 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:47,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 146 mathsat -unsat_core_generation=3 [2020-10-09 15:27:47,256 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:47,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:47,256 INFO L82 PathProgramCache]: Analyzing trace with hash -703501765, now seen corresponding path program 1 times [2020-10-09 15:27:47,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:47,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061755303] [2020-10-09 15:27:47,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 147 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:47,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:47,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:47,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:47,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061755303] [2020-10-09 15:27:47,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:47,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:47,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84255169] [2020-10-09 15:27:47,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:47,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:47,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:47,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:47,432 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 341 [2020-10-09 15:27:47,433 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 310 transitions, 750 flow. Second operand 3 states. [2020-10-09 15:27:47,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:47,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 341 [2020-10-09 15:27:47,433 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:47,494 INFO L129 PetriNetUnfolder]: 19/364 cut-off events. [2020-10-09 15:27:47,494 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:27:47,503 INFO L80 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 364 events. 19/364 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1453 event pairs, 0 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 436. Up to 13 conditions per place. [2020-10-09 15:27:47,504 INFO L132 encePairwiseOnDemand]: 338/341 looper letters, 5 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2020-10-09 15:27:47,504 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 310 transitions, 762 flow [2020-10-09 15:27:47,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2020-10-09 15:27:47,506 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9491691104594331 [2020-10-09 15:27:47,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 971 transitions. [2020-10-09 15:27:47,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 971 transitions. [2020-10-09 15:27:47,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:47,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 971 transitions. [2020-10-09 15:27:47,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:47,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:47,507 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:47,507 INFO L185 Difference]: Start difference. First operand has 336 places, 310 transitions, 750 flow. Second operand 3 states and 971 transitions. [2020-10-09 15:27:47,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 310 transitions, 762 flow [2020-10-09 15:27:47,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 310 transitions, 757 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:47,510 INFO L241 Difference]: Finished difference. Result has 339 places, 310 transitions, 755 flow [2020-10-09 15:27:47,511 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=339, PETRI_TRANSITIONS=310} [2020-10-09 15:27:47,511 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 22 predicate places. [2020-10-09 15:27:47,511 INFO L481 AbstractCegarLoop]: Abstraction has has 339 places, 310 transitions, 755 flow [2020-10-09 15:27:47,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:47,511 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:47,511 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:47,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 147 mathsat -unsat_core_generation=3 [2020-10-09 15:27:47,712 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:47,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:47,712 INFO L82 PathProgramCache]: Analyzing trace with hash -702549476, now seen corresponding path program 1 times [2020-10-09 15:27:47,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:47,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334414486] [2020-10-09 15:27:47,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 148 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:47,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:47,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:47,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:47,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334414486] [2020-10-09 15:27:47,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:47,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:47,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618514241] [2020-10-09 15:27:47,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:47,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:47,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:47,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:47,902 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 341 [2020-10-09 15:27:47,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 310 transitions, 755 flow. Second operand 3 states. [2020-10-09 15:27:47,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:47,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 341 [2020-10-09 15:27:47,903 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:47,961 INFO L129 PetriNetUnfolder]: 18/360 cut-off events. [2020-10-09 15:27:47,961 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:27:47,969 INFO L80 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 360 events. 18/360 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1430 event pairs, 0 based on Foata normal form. 1/332 useless extension candidates. Maximal degree in co-relation 432. Up to 13 conditions per place. [2020-10-09 15:27:47,971 INFO L132 encePairwiseOnDemand]: 339/341 looper letters, 4 selfloop transitions, 1 changer transitions 0/307 dead transitions. [2020-10-09 15:27:47,971 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 307 transitions, 750 flow [2020-10-09 15:27:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:47,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2020-10-09 15:27:47,972 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9501466275659824 [2020-10-09 15:27:47,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 972 transitions. [2020-10-09 15:27:47,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 972 transitions. [2020-10-09 15:27:47,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:47,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 972 transitions. [2020-10-09 15:27:47,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:47,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:47,973 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:47,974 INFO L185 Difference]: Start difference. First operand has 339 places, 310 transitions, 755 flow. Second operand 3 states and 972 transitions. [2020-10-09 15:27:47,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 307 transitions, 750 flow [2020-10-09 15:27:47,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 307 transitions, 743 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:47,977 INFO L241 Difference]: Finished difference. Result has 338 places, 307 transitions, 735 flow [2020-10-09 15:27:47,977 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=735, PETRI_PLACES=338, PETRI_TRANSITIONS=307} [2020-10-09 15:27:47,978 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 21 predicate places. [2020-10-09 15:27:47,978 INFO L481 AbstractCegarLoop]: Abstraction has has 338 places, 307 transitions, 735 flow [2020-10-09 15:27:47,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:47,978 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:47,978 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:48,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 148 mathsat -unsat_core_generation=3 [2020-10-09 15:27:48,179 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:48,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:48,179 INFO L82 PathProgramCache]: Analyzing trace with hash -702548453, now seen corresponding path program 1 times [2020-10-09 15:27:48,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:48,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703747798] [2020-10-09 15:27:48,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 149 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:48,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:48,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:48,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:48,337 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:27:48,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703747798] [2020-10-09 15:27:48,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:48,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:48,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263826682] [2020-10-09 15:27:48,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:48,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:48,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:48,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:48,366 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2020-10-09 15:27:48,367 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 307 transitions, 735 flow. Second operand 3 states. [2020-10-09 15:27:48,367 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:48,367 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2020-10-09 15:27:48,367 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:48,454 INFO L129 PetriNetUnfolder]: 18/358 cut-off events. [2020-10-09 15:27:48,454 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:48,463 INFO L80 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 358 events. 18/358 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1415 event pairs, 0 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 434. Up to 13 conditions per place. [2020-10-09 15:27:48,464 INFO L132 encePairwiseOnDemand]: 339/341 looper letters, 8 selfloop transitions, 1 changer transitions 0/305 dead transitions. [2020-10-09 15:27:48,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 305 transitions, 748 flow [2020-10-09 15:27:48,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:48,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:48,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2020-10-09 15:27:48,466 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9364613880742912 [2020-10-09 15:27:48,466 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 958 transitions. [2020-10-09 15:27:48,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 958 transitions. [2020-10-09 15:27:48,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:48,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 958 transitions. [2020-10-09 15:27:48,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:48,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:48,468 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:48,468 INFO L185 Difference]: Start difference. First operand has 338 places, 307 transitions, 735 flow. Second operand 3 states and 958 transitions. [2020-10-09 15:27:48,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 305 transitions, 748 flow [2020-10-09 15:27:48,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 305 transitions, 747 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:48,472 INFO L241 Difference]: Finished difference. Result has 337 places, 305 transitions, 731 flow [2020-10-09 15:27:48,473 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=731, PETRI_PLACES=337, PETRI_TRANSITIONS=305} [2020-10-09 15:27:48,473 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 20 predicate places. [2020-10-09 15:27:48,473 INFO L481 AbstractCegarLoop]: Abstraction has has 337 places, 305 transitions, 731 flow [2020-10-09 15:27:48,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:48,473 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:48,473 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:48,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 149 mathsat -unsat_core_generation=3 [2020-10-09 15:27:48,674 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:48,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:48,674 INFO L82 PathProgramCache]: Analyzing trace with hash -416170284, now seen corresponding path program 1 times [2020-10-09 15:27:48,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:48,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380529053] [2020-10-09 15:27:48,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 150 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:48,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:48,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:27:48,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:48,834 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:27:48,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380529053] [2020-10-09 15:27:48,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:48,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:48,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147044613] [2020-10-09 15:27:48,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:48,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:48,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:48,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:48,846 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 341 [2020-10-09 15:27:48,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 305 transitions, 731 flow. Second operand 3 states. [2020-10-09 15:27:48,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:48,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 341 [2020-10-09 15:27:48,847 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:48,911 INFO L129 PetriNetUnfolder]: 16/363 cut-off events. [2020-10-09 15:27:48,912 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:48,921 INFO L80 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 363 events. 16/363 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1463 event pairs, 0 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 437. Up to 13 conditions per place. [2020-10-09 15:27:48,923 INFO L132 encePairwiseOnDemand]: 338/341 looper letters, 5 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2020-10-09 15:27:48,923 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 306 transitions, 747 flow [2020-10-09 15:27:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2020-10-09 15:27:48,924 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9491691104594331 [2020-10-09 15:27:48,924 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 971 transitions. [2020-10-09 15:27:48,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 971 transitions. [2020-10-09 15:27:48,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:48,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 971 transitions. [2020-10-09 15:27:48,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:48,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:48,925 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:48,925 INFO L185 Difference]: Start difference. First operand has 337 places, 305 transitions, 731 flow. Second operand 3 states and 971 transitions. [2020-10-09 15:27:48,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 306 transitions, 747 flow [2020-10-09 15:27:48,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 306 transitions, 746 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:48,929 INFO L241 Difference]: Finished difference. Result has 340 places, 306 transitions, 744 flow [2020-10-09 15:27:48,929 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=340, PETRI_TRANSITIONS=306} [2020-10-09 15:27:48,929 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 23 predicate places. [2020-10-09 15:27:48,929 INFO L481 AbstractCegarLoop]: Abstraction has has 340 places, 306 transitions, 744 flow [2020-10-09 15:27:48,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:48,930 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:48,930 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:49,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 150 mathsat -unsat_core_generation=3 [2020-10-09 15:27:49,131 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:49,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:49,131 INFO L82 PathProgramCache]: Analyzing trace with hash -416171307, now seen corresponding path program 1 times [2020-10-09 15:27:49,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:49,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415338667] [2020-10-09 15:27:49,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 151 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:49,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:49,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:27:49,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:27:49,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415338667] [2020-10-09 15:27:49,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:49,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:49,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165176691] [2020-10-09 15:27:49,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:49,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:49,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:49,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:49,312 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2020-10-09 15:27:49,313 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 306 transitions, 744 flow. Second operand 3 states. [2020-10-09 15:27:49,313 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:49,313 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2020-10-09 15:27:49,313 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:49,382 INFO L129 PetriNetUnfolder]: 16/364 cut-off events. [2020-10-09 15:27:49,382 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:27:49,392 INFO L80 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 364 events. 16/364 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1469 event pairs, 0 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 445. Up to 13 conditions per place. [2020-10-09 15:27:49,394 INFO L132 encePairwiseOnDemand]: 337/341 looper letters, 9 selfloop transitions, 3 changer transitions 0/307 dead transitions. [2020-10-09 15:27:49,394 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 307 transitions, 770 flow [2020-10-09 15:27:49,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 961 transitions. [2020-10-09 15:27:49,395 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2020-10-09 15:27:49,395 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 961 transitions. [2020-10-09 15:27:49,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 961 transitions. [2020-10-09 15:27:49,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:49,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 961 transitions. [2020-10-09 15:27:49,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:49,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:49,397 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:49,397 INFO L185 Difference]: Start difference. First operand has 340 places, 306 transitions, 744 flow. Second operand 3 states and 961 transitions. [2020-10-09 15:27:49,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 307 transitions, 770 flow [2020-10-09 15:27:49,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 307 transitions, 768 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:49,401 INFO L241 Difference]: Finished difference. Result has 343 places, 307 transitions, 760 flow [2020-10-09 15:27:49,401 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=343, PETRI_TRANSITIONS=307} [2020-10-09 15:27:49,401 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 26 predicate places. [2020-10-09 15:27:49,401 INFO L481 AbstractCegarLoop]: Abstraction has has 343 places, 307 transitions, 760 flow [2020-10-09 15:27:49,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:49,402 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:49,402 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:49,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 151 mathsat -unsat_core_generation=3 [2020-10-09 15:27:49,602 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:49,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:49,603 INFO L82 PathProgramCache]: Analyzing trace with hash -415217995, now seen corresponding path program 1 times [2020-10-09 15:27:49,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:49,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111586176] [2020-10-09 15:27:49,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 152 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:49,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:49,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:27:49,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:27:49,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111586176] [2020-10-09 15:27:49,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:49,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:49,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189726517] [2020-10-09 15:27:49,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:49,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:49,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:49,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:49,789 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 341 [2020-10-09 15:27:49,790 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 307 transitions, 760 flow. Second operand 3 states. [2020-10-09 15:27:49,790 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:49,790 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 341 [2020-10-09 15:27:49,790 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:49,881 INFO L129 PetriNetUnfolder]: 15/360 cut-off events. [2020-10-09 15:27:49,882 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:27:49,888 INFO L80 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 360 events. 15/360 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1446 event pairs, 0 based on Foata normal form. 1/335 useless extension candidates. Maximal degree in co-relation 437. Up to 13 conditions per place. [2020-10-09 15:27:49,889 INFO L132 encePairwiseOnDemand]: 339/341 looper letters, 4 selfloop transitions, 1 changer transitions 0/304 dead transitions. [2020-10-09 15:27:49,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 304 transitions, 755 flow [2020-10-09 15:27:49,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:49,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2020-10-09 15:27:49,890 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9501466275659824 [2020-10-09 15:27:49,890 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 972 transitions. [2020-10-09 15:27:49,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 972 transitions. [2020-10-09 15:27:49,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:49,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 972 transitions. [2020-10-09 15:27:49,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:49,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:49,892 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:49,892 INFO L185 Difference]: Start difference. First operand has 343 places, 307 transitions, 760 flow. Second operand 3 states and 972 transitions. [2020-10-09 15:27:49,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 304 transitions, 755 flow [2020-10-09 15:27:49,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 304 transitions, 747 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:49,895 INFO L241 Difference]: Finished difference. Result has 342 places, 304 transitions, 739 flow [2020-10-09 15:27:49,895 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=342, PETRI_TRANSITIONS=304} [2020-10-09 15:27:49,895 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 25 predicate places. [2020-10-09 15:27:49,895 INFO L481 AbstractCegarLoop]: Abstraction has has 342 places, 304 transitions, 739 flow [2020-10-09 15:27:49,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:49,895 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:49,895 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:50,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 152 mathsat -unsat_core_generation=3 [2020-10-09 15:27:50,096 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:50,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:50,097 INFO L82 PathProgramCache]: Analyzing trace with hash -415216972, now seen corresponding path program 1 times [2020-10-09 15:27:50,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:50,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925411280] [2020-10-09 15:27:50,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 153 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:50,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:50,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:27:50,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:27:50,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925411280] [2020-10-09 15:27:50,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:50,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:50,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937996328] [2020-10-09 15:27:50,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:50,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:50,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:50,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:50,275 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2020-10-09 15:27:50,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 304 transitions, 739 flow. Second operand 3 states. [2020-10-09 15:27:50,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:50,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2020-10-09 15:27:50,277 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:50,343 INFO L129 PetriNetUnfolder]: 15/358 cut-off events. [2020-10-09 15:27:50,343 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:50,352 INFO L80 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 358 events. 15/358 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1429 event pairs, 0 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 441. Up to 13 conditions per place. [2020-10-09 15:27:50,354 INFO L132 encePairwiseOnDemand]: 339/341 looper letters, 8 selfloop transitions, 1 changer transitions 0/302 dead transitions. [2020-10-09 15:27:50,354 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 302 transitions, 752 flow [2020-10-09 15:27:50,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2020-10-09 15:27:50,355 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9364613880742912 [2020-10-09 15:27:50,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 958 transitions. [2020-10-09 15:27:50,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 958 transitions. [2020-10-09 15:27:50,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:50,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 958 transitions. [2020-10-09 15:27:50,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:50,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:50,357 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:50,357 INFO L185 Difference]: Start difference. First operand has 342 places, 304 transitions, 739 flow. Second operand 3 states and 958 transitions. [2020-10-09 15:27:50,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 302 transitions, 752 flow [2020-10-09 15:27:50,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 302 transitions, 751 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:50,362 INFO L241 Difference]: Finished difference. Result has 341 places, 302 transitions, 735 flow [2020-10-09 15:27:50,362 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=735, PETRI_PLACES=341, PETRI_TRANSITIONS=302} [2020-10-09 15:27:50,363 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 24 predicate places. [2020-10-09 15:27:50,363 INFO L481 AbstractCegarLoop]: Abstraction has has 341 places, 302 transitions, 735 flow [2020-10-09 15:27:50,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:50,363 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:50,363 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:50,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 153 mathsat -unsat_core_generation=3 [2020-10-09 15:27:50,574 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:50,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:50,574 INFO L82 PathProgramCache]: Analyzing trace with hash -844941105, now seen corresponding path program 1 times [2020-10-09 15:27:50,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:50,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184568393] [2020-10-09 15:27:50,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 154 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:50,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:50,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:27:50,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:50,739 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:27:50,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184568393] [2020-10-09 15:27:50,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:50,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:50,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407688747] [2020-10-09 15:27:50,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:50,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:50,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:50,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:50,761 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 341 [2020-10-09 15:27:50,762 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 302 transitions, 735 flow. Second operand 3 states. [2020-10-09 15:27:50,762 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:50,762 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 341 [2020-10-09 15:27:50,762 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:50,860 INFO L129 PetriNetUnfolder]: 14/365 cut-off events. [2020-10-09 15:27:50,860 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:50,873 INFO L80 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 365 events. 14/365 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1490 event pairs, 0 based on Foata normal form. 1/340 useless extension candidates. Maximal degree in co-relation 444. Up to 13 conditions per place. [2020-10-09 15:27:50,875 INFO L132 encePairwiseOnDemand]: 339/341 looper letters, 4 selfloop transitions, 1 changer transitions 0/302 dead transitions. [2020-10-09 15:27:50,876 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 302 transitions, 745 flow [2020-10-09 15:27:50,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2020-10-09 15:27:50,877 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9501466275659824 [2020-10-09 15:27:50,877 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 972 transitions. [2020-10-09 15:27:50,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 972 transitions. [2020-10-09 15:27:50,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:50,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 972 transitions. [2020-10-09 15:27:50,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:50,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:50,880 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:50,880 INFO L185 Difference]: Start difference. First operand has 341 places, 302 transitions, 735 flow. Second operand 3 states and 972 transitions. [2020-10-09 15:27:50,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 302 transitions, 745 flow [2020-10-09 15:27:50,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 302 transitions, 744 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:50,885 INFO L241 Difference]: Finished difference. Result has 343 places, 302 transitions, 739 flow [2020-10-09 15:27:50,885 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=343, PETRI_TRANSITIONS=302} [2020-10-09 15:27:50,886 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 26 predicate places. [2020-10-09 15:27:50,886 INFO L481 AbstractCegarLoop]: Abstraction has has 343 places, 302 transitions, 739 flow [2020-10-09 15:27:50,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:50,886 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:50,886 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:51,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 154 mathsat -unsat_core_generation=3 [2020-10-09 15:27:51,098 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:51,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:51,098 INFO L82 PathProgramCache]: Analyzing trace with hash -844940082, now seen corresponding path program 1 times [2020-10-09 15:27:51,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:51,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972746739] [2020-10-09 15:27:51,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 155 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:51,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:51,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:51,275 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:27:51,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:51,281 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:27:51,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972746739] [2020-10-09 15:27:51,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:51,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:51,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611048090] [2020-10-09 15:27:51,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:51,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:51,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:51,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:51,316 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2020-10-09 15:27:51,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 302 transitions, 739 flow. Second operand 3 states. [2020-10-09 15:27:51,317 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:51,317 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2020-10-09 15:27:51,317 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:51,383 INFO L129 PetriNetUnfolder]: 12/367 cut-off events. [2020-10-09 15:27:51,383 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:27:51,393 INFO L80 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 367 events. 12/367 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1523 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 457. Up to 13 conditions per place. [2020-10-09 15:27:51,394 INFO L132 encePairwiseOnDemand]: 337/341 looper letters, 9 selfloop transitions, 3 changer transitions 0/303 dead transitions. [2020-10-09 15:27:51,394 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 303 transitions, 765 flow [2020-10-09 15:27:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 961 transitions. [2020-10-09 15:27:51,395 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2020-10-09 15:27:51,395 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 961 transitions. [2020-10-09 15:27:51,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 961 transitions. [2020-10-09 15:27:51,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:51,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 961 transitions. [2020-10-09 15:27:51,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:51,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:51,397 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:51,397 INFO L185 Difference]: Start difference. First operand has 343 places, 302 transitions, 739 flow. Second operand 3 states and 961 transitions. [2020-10-09 15:27:51,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 303 transitions, 765 flow [2020-10-09 15:27:51,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 303 transitions, 764 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:51,401 INFO L241 Difference]: Finished difference. Result has 346 places, 303 transitions, 756 flow [2020-10-09 15:27:51,401 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=346, PETRI_TRANSITIONS=303} [2020-10-09 15:27:51,401 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 29 predicate places. [2020-10-09 15:27:51,402 INFO L481 AbstractCegarLoop]: Abstraction has has 346 places, 303 transitions, 756 flow [2020-10-09 15:27:51,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:51,402 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:51,402 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:51,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 155 mathsat -unsat_core_generation=3 [2020-10-09 15:27:51,604 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:51,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:51,604 INFO L82 PathProgramCache]: Analyzing trace with hash -845893394, now seen corresponding path program 1 times [2020-10-09 15:27:51,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:51,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400731344] [2020-10-09 15:27:51,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 156 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:51,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:51,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:27:51,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:27:51,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400731344] [2020-10-09 15:27:51,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:51,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:51,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535750927] [2020-10-09 15:27:51,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:51,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:51,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:51,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:51,775 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 341 [2020-10-09 15:27:51,775 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 303 transitions, 756 flow. Second operand 3 states. [2020-10-09 15:27:51,775 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:51,776 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 341 [2020-10-09 15:27:51,776 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:51,839 INFO L129 PetriNetUnfolder]: 12/360 cut-off events. [2020-10-09 15:27:51,839 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:27:51,847 INFO L80 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 360 events. 12/360 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1463 event pairs, 0 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 443. Up to 13 conditions per place. [2020-10-09 15:27:51,849 INFO L132 encePairwiseOnDemand]: 339/341 looper letters, 5 selfloop transitions, 1 changer transitions 0/301 dead transitions. [2020-10-09 15:27:51,849 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 301 transitions, 758 flow [2020-10-09 15:27:51,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2020-10-09 15:27:51,850 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481915933528837 [2020-10-09 15:27:51,850 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 970 transitions. [2020-10-09 15:27:51,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 970 transitions. [2020-10-09 15:27:51,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:51,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 970 transitions. [2020-10-09 15:27:51,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:51,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:51,851 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:51,851 INFO L185 Difference]: Start difference. First operand has 346 places, 303 transitions, 756 flow. Second operand 3 states and 970 transitions. [2020-10-09 15:27:51,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 301 transitions, 758 flow [2020-10-09 15:27:51,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 301 transitions, 750 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:51,854 INFO L241 Difference]: Finished difference. Result has 346 places, 301 transitions, 743 flow [2020-10-09 15:27:51,855 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=743, PETRI_PLACES=346, PETRI_TRANSITIONS=301} [2020-10-09 15:27:51,855 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 29 predicate places. [2020-10-09 15:27:51,855 INFO L481 AbstractCegarLoop]: Abstraction has has 346 places, 301 transitions, 743 flow [2020-10-09 15:27:51,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:51,855 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:51,855 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:52,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 156 mathsat -unsat_core_generation=3 [2020-10-09 15:27:52,056 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:52,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:52,056 INFO L82 PathProgramCache]: Analyzing trace with hash -845894417, now seen corresponding path program 1 times [2020-10-09 15:27:52,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:52,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438975854] [2020-10-09 15:27:52,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 157 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:52,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:52,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:27:52,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:27:52,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438975854] [2020-10-09 15:27:52,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:52,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:52,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580297031] [2020-10-09 15:27:52,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:52,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:52,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:52,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:52,250 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2020-10-09 15:27:52,250 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 301 transitions, 743 flow. Second operand 3 states. [2020-10-09 15:27:52,251 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:52,251 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2020-10-09 15:27:52,251 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:52,316 INFO L129 PetriNetUnfolder]: 12/358 cut-off events. [2020-10-09 15:27:52,316 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:27:52,324 INFO L80 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 358 events. 12/358 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1445 event pairs, 0 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 447. Up to 13 conditions per place. [2020-10-09 15:27:52,325 INFO L132 encePairwiseOnDemand]: 339/341 looper letters, 8 selfloop transitions, 1 changer transitions 0/299 dead transitions. [2020-10-09 15:27:52,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 299 transitions, 756 flow [2020-10-09 15:27:52,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:52,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:52,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2020-10-09 15:27:52,326 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9364613880742912 [2020-10-09 15:27:52,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 958 transitions. [2020-10-09 15:27:52,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 958 transitions. [2020-10-09 15:27:52,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:52,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 958 transitions. [2020-10-09 15:27:52,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:52,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:52,328 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:52,328 INFO L185 Difference]: Start difference. First operand has 346 places, 301 transitions, 743 flow. Second operand 3 states and 958 transitions. [2020-10-09 15:27:52,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 299 transitions, 756 flow [2020-10-09 15:27:52,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 299 transitions, 755 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:52,333 INFO L241 Difference]: Finished difference. Result has 345 places, 299 transitions, 739 flow [2020-10-09 15:27:52,333 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=345, PETRI_TRANSITIONS=299} [2020-10-09 15:27:52,333 INFO L341 CegarLoopForPetriNet]: 317 programPoint places, 28 predicate places. [2020-10-09 15:27:52,333 INFO L481 AbstractCegarLoop]: Abstraction has has 345 places, 299 transitions, 739 flow [2020-10-09 15:27:52,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:52,333 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:52,334 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:52,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 157 mathsat -unsat_core_generation=3 [2020-10-09 15:27:52,545 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:52,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:52,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1473933785, now seen corresponding path program 1 times [2020-10-09 15:27:52,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:52,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493537030] [2020-10-09 15:27:52,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 158 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:27:52,703 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:27:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:27:52,726 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:27:52,760 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:27:52,761 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:27:52,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 158 mathsat -unsat_core_generation=3 [2020-10-09 15:27:52,961 WARN L371 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:27:52,962 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2020-10-09 15:27:52,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:52,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,049 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,049 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,051 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,051 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,052 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,052 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,052 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,052 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,052 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,052 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,052 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,053 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,054 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,054 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,054 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,054 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,054 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,055 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,055 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,055 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,055 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,055 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,055 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,057 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,060 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,060 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,062 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,062 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,065 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,065 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:27:53,075 INFO L253 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2020-10-09 15:27:53,076 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:27:53,076 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:27:53,076 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:27:53,076 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:27:53,076 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:27:53,076 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:27:53,076 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:27:53,076 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:27:53,080 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 342 places, 368 transitions, 957 flow [2020-10-09 15:27:53,151 INFO L129 PetriNetUnfolder]: 66/484 cut-off events. [2020-10-09 15:27:53,151 INFO L130 PetriNetUnfolder]: For 442/442 co-relation queries the response was YES. [2020-10-09 15:27:53,165 INFO L80 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 484 events. 66/484 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1912 event pairs, 0 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 557. Up to 28 conditions per place. [2020-10-09 15:27:53,165 INFO L82 GeneralOperation]: Start removeDead. Operand has 342 places, 368 transitions, 957 flow [2020-10-09 15:27:53,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 342 places, 368 transitions, 957 flow [2020-10-09 15:27:53,177 INFO L129 PetriNetUnfolder]: 10/103 cut-off events. [2020-10-09 15:27:53,177 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:27:53,177 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:53,177 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:53,177 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:53,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:53,178 INFO L82 PathProgramCache]: Analyzing trace with hash 118566759, now seen corresponding path program 1 times [2020-10-09 15:27:53,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:53,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078679251] [2020-10-09 15:27:53,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 159 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:53,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:53,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:53,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:53,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:53,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078679251] [2020-10-09 15:27:53,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:53,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:53,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139727260] [2020-10-09 15:27:53,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:53,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:53,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:53,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:53,356 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 368 [2020-10-09 15:27:53,356 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 368 transitions, 957 flow. Second operand 3 states. [2020-10-09 15:27:53,356 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:53,357 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 368 [2020-10-09 15:27:53,357 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:53,423 INFO L129 PetriNetUnfolder]: 37/392 cut-off events. [2020-10-09 15:27:53,423 INFO L130 PetriNetUnfolder]: For 443/443 co-relation queries the response was YES. [2020-10-09 15:27:53,434 INFO L80 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 392 events. 37/392 cut-off events. For 443/443 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1471 event pairs, 0 based on Foata normal form. 54/394 useless extension candidates. Maximal degree in co-relation 476. Up to 14 conditions per place. [2020-10-09 15:27:53,438 INFO L132 encePairwiseOnDemand]: 350/368 looper letters, 5 selfloop transitions, 2 changer transitions 0/350 dead transitions. [2020-10-09 15:27:53,438 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 350 transitions, 935 flow [2020-10-09 15:27:53,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1079 transitions. [2020-10-09 15:27:53,439 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9773550724637681 [2020-10-09 15:27:53,439 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1079 transitions. [2020-10-09 15:27:53,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1079 transitions. [2020-10-09 15:27:53,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:53,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1079 transitions. [2020-10-09 15:27:53,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:53,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:53,441 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:53,441 INFO L185 Difference]: Start difference. First operand has 342 places, 368 transitions, 957 flow. Second operand 3 states and 1079 transitions. [2020-10-09 15:27:53,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 350 transitions, 935 flow [2020-10-09 15:27:53,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 350 transitions, 779 flow, removed 78 selfloop flow, removed 0 redundant places. [2020-10-09 15:27:53,444 INFO L241 Difference]: Finished difference. Result has 341 places, 350 transitions, 777 flow [2020-10-09 15:27:53,445 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=777, PETRI_PLACES=341, PETRI_TRANSITIONS=350} [2020-10-09 15:27:53,445 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, -1 predicate places. [2020-10-09 15:27:53,445 INFO L481 AbstractCegarLoop]: Abstraction has has 341 places, 350 transitions, 777 flow [2020-10-09 15:27:53,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:53,445 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:53,445 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:53,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 159 mathsat -unsat_core_generation=3 [2020-10-09 15:27:53,646 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:53,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:53,646 INFO L82 PathProgramCache]: Analyzing trace with hash 118565736, now seen corresponding path program 1 times [2020-10-09 15:27:53,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:53,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133912314] [2020-10-09 15:27:53,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 160 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:53,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:53,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:53,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:53,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133912314] [2020-10-09 15:27:53,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:53,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:53,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403621799] [2020-10-09 15:27:53,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:53,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:53,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:53,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:53,848 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 368 [2020-10-09 15:27:53,849 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 350 transitions, 777 flow. Second operand 3 states. [2020-10-09 15:27:53,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:53,849 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 368 [2020-10-09 15:27:53,849 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:53,913 INFO L129 PetriNetUnfolder]: 37/393 cut-off events. [2020-10-09 15:27:53,913 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:27:53,923 INFO L80 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 393 events. 37/393 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1477 event pairs, 0 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 432. Up to 14 conditions per place. [2020-10-09 15:27:53,927 INFO L132 encePairwiseOnDemand]: 364/368 looper letters, 9 selfloop transitions, 3 changer transitions 0/351 dead transitions. [2020-10-09 15:27:53,927 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 351 transitions, 803 flow [2020-10-09 15:27:53,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2020-10-09 15:27:53,928 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9411231884057971 [2020-10-09 15:27:53,928 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1039 transitions. [2020-10-09 15:27:53,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1039 transitions. [2020-10-09 15:27:53,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:53,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1039 transitions. [2020-10-09 15:27:53,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:53,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:53,930 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:53,930 INFO L185 Difference]: Start difference. First operand has 341 places, 350 transitions, 777 flow. Second operand 3 states and 1039 transitions. [2020-10-09 15:27:53,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 351 transitions, 803 flow [2020-10-09 15:27:53,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 351 transitions, 801 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:53,934 INFO L241 Difference]: Finished difference. Result has 344 places, 351 transitions, 793 flow [2020-10-09 15:27:53,934 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=344, PETRI_TRANSITIONS=351} [2020-10-09 15:27:53,934 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 2 predicate places. [2020-10-09 15:27:53,934 INFO L481 AbstractCegarLoop]: Abstraction has has 344 places, 351 transitions, 793 flow [2020-10-09 15:27:53,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:53,934 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:53,934 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:54,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 160 mathsat -unsat_core_generation=3 [2020-10-09 15:27:54,135 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:54,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:54,136 INFO L82 PathProgramCache]: Analyzing trace with hash 119519048, now seen corresponding path program 1 times [2020-10-09 15:27:54,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:54,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149346045] [2020-10-09 15:27:54,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 161 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:54,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:54,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:54,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:54,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149346045] [2020-10-09 15:27:54,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:54,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:54,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079049896] [2020-10-09 15:27:54,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:54,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:54,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:54,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:54,327 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 368 [2020-10-09 15:27:54,328 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 351 transitions, 793 flow. Second operand 3 states. [2020-10-09 15:27:54,328 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:54,328 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 368 [2020-10-09 15:27:54,328 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:54,417 INFO L129 PetriNetUnfolder]: 36/389 cut-off events. [2020-10-09 15:27:54,417 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:27:54,424 INFO L80 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 389 events. 36/389 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1456 event pairs, 0 based on Foata normal form. 1/342 useless extension candidates. Maximal degree in co-relation 423. Up to 14 conditions per place. [2020-10-09 15:27:54,427 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 4 selfloop transitions, 1 changer transitions 0/348 dead transitions. [2020-10-09 15:27:54,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 348 transitions, 788 flow [2020-10-09 15:27:54,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1050 transitions. [2020-10-09 15:27:54,428 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510869565217391 [2020-10-09 15:27:54,428 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1050 transitions. [2020-10-09 15:27:54,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1050 transitions. [2020-10-09 15:27:54,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:54,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1050 transitions. [2020-10-09 15:27:54,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:54,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:54,430 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:54,430 INFO L185 Difference]: Start difference. First operand has 344 places, 351 transitions, 793 flow. Second operand 3 states and 1050 transitions. [2020-10-09 15:27:54,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 348 transitions, 788 flow [2020-10-09 15:27:54,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 348 transitions, 780 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:54,433 INFO L241 Difference]: Finished difference. Result has 343 places, 348 transitions, 772 flow [2020-10-09 15:27:54,433 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=343, PETRI_TRANSITIONS=348} [2020-10-09 15:27:54,433 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 1 predicate places. [2020-10-09 15:27:54,433 INFO L481 AbstractCegarLoop]: Abstraction has has 343 places, 348 transitions, 772 flow [2020-10-09 15:27:54,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:54,434 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:54,434 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:27:54,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 161 mathsat -unsat_core_generation=3 [2020-10-09 15:27:54,634 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:54,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:54,635 INFO L82 PathProgramCache]: Analyzing trace with hash 119520071, now seen corresponding path program 1 times [2020-10-09 15:27:54,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:54,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259262727] [2020-10-09 15:27:54,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 162 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:54,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:54,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:54,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:27:54,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259262727] [2020-10-09 15:27:54,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:54,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:54,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161437184] [2020-10-09 15:27:54,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:54,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:54,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:54,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:54,835 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 368 [2020-10-09 15:27:54,836 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 348 transitions, 772 flow. Second operand 3 states. [2020-10-09 15:27:54,836 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:54,836 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 368 [2020-10-09 15:27:54,836 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:54,897 INFO L129 PetriNetUnfolder]: 36/387 cut-off events. [2020-10-09 15:27:54,897 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 15:27:54,907 INFO L80 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 387 events. 36/387 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1441 event pairs, 0 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 432. Up to 14 conditions per place. [2020-10-09 15:27:54,910 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 8 selfloop transitions, 1 changer transitions 0/346 dead transitions. [2020-10-09 15:27:54,910 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 346 transitions, 785 flow [2020-10-09 15:27:54,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1036 transitions. [2020-10-09 15:27:54,912 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9384057971014492 [2020-10-09 15:27:54,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1036 transitions. [2020-10-09 15:27:54,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1036 transitions. [2020-10-09 15:27:54,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:54,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1036 transitions. [2020-10-09 15:27:54,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:54,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:54,913 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:54,913 INFO L185 Difference]: Start difference. First operand has 343 places, 348 transitions, 772 flow. Second operand 3 states and 1036 transitions. [2020-10-09 15:27:54,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 346 transitions, 785 flow [2020-10-09 15:27:54,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 346 transitions, 784 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:54,916 INFO L241 Difference]: Finished difference. Result has 342 places, 346 transitions, 768 flow [2020-10-09 15:27:54,917 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=342, PETRI_TRANSITIONS=346} [2020-10-09 15:27:54,917 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 0 predicate places. [2020-10-09 15:27:54,917 INFO L481 AbstractCegarLoop]: Abstraction has has 342 places, 346 transitions, 768 flow [2020-10-09 15:27:54,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:54,917 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:54,917 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:55,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 162 mathsat -unsat_core_generation=3 [2020-10-09 15:27:55,118 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:55,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:55,119 INFO L82 PathProgramCache]: Analyzing trace with hash -764421131, now seen corresponding path program 1 times [2020-10-09 15:27:55,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:55,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154939629] [2020-10-09 15:27:55,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 163 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:55,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:55,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:55,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:55,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:55,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154939629] [2020-10-09 15:27:55,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:55,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:55,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931665596] [2020-10-09 15:27:55,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:55,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:55,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:55,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:55,314 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 368 [2020-10-09 15:27:55,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 346 transitions, 768 flow. Second operand 3 states. [2020-10-09 15:27:55,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:55,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 368 [2020-10-09 15:27:55,315 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:55,378 INFO L129 PetriNetUnfolder]: 35/395 cut-off events. [2020-10-09 15:27:55,378 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:27:55,388 INFO L80 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 395 events. 35/395 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1514 event pairs, 0 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 444. Up to 14 conditions per place. [2020-10-09 15:27:55,390 INFO L132 encePairwiseOnDemand]: 363/368 looper letters, 10 selfloop transitions, 3 changer transitions 0/348 dead transitions. [2020-10-09 15:27:55,390 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 348 transitions, 798 flow [2020-10-09 15:27:55,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2020-10-09 15:27:55,392 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9429347826086957 [2020-10-09 15:27:55,392 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1041 transitions. [2020-10-09 15:27:55,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1041 transitions. [2020-10-09 15:27:55,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:55,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1041 transitions. [2020-10-09 15:27:55,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:55,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:55,393 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:55,393 INFO L185 Difference]: Start difference. First operand has 342 places, 346 transitions, 768 flow. Second operand 3 states and 1041 transitions. [2020-10-09 15:27:55,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 348 transitions, 798 flow [2020-10-09 15:27:55,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 348 transitions, 797 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:55,397 INFO L241 Difference]: Finished difference. Result has 345 places, 348 transitions, 791 flow [2020-10-09 15:27:55,397 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=791, PETRI_PLACES=345, PETRI_TRANSITIONS=348} [2020-10-09 15:27:55,397 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 3 predicate places. [2020-10-09 15:27:55,397 INFO L481 AbstractCegarLoop]: Abstraction has has 345 places, 348 transitions, 791 flow [2020-10-09 15:27:55,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:55,397 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:55,397 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:55,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 163 mathsat -unsat_core_generation=3 [2020-10-09 15:27:55,598 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:55,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:55,598 INFO L82 PathProgramCache]: Analyzing trace with hash -764422154, now seen corresponding path program 1 times [2020-10-09 15:27:55,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:55,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134006566] [2020-10-09 15:27:55,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 164 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:55,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:55,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:55,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:55,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134006566] [2020-10-09 15:27:55,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:55,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:55,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670652155] [2020-10-09 15:27:55,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:55,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:55,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:55,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:55,787 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 368 [2020-10-09 15:27:55,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 348 transitions, 791 flow. Second operand 3 states. [2020-10-09 15:27:55,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:55,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 368 [2020-10-09 15:27:55,788 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:55,848 INFO L129 PetriNetUnfolder]: 33/396 cut-off events. [2020-10-09 15:27:55,849 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:27:55,858 INFO L80 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 396 events. 33/396 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1537 event pairs, 0 based on Foata normal form. 1/352 useless extension candidates. Maximal degree in co-relation 441. Up to 14 conditions per place. [2020-10-09 15:27:55,861 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 4 selfloop transitions, 1 changer transitions 0/347 dead transitions. [2020-10-09 15:27:55,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 347 transitions, 797 flow [2020-10-09 15:27:55,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1050 transitions. [2020-10-09 15:27:55,862 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510869565217391 [2020-10-09 15:27:55,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1050 transitions. [2020-10-09 15:27:55,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1050 transitions. [2020-10-09 15:27:55,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:55,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1050 transitions. [2020-10-09 15:27:55,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:55,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:55,864 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:55,864 INFO L185 Difference]: Start difference. First operand has 345 places, 348 transitions, 791 flow. Second operand 3 states and 1050 transitions. [2020-10-09 15:27:55,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 347 transitions, 797 flow [2020-10-09 15:27:55,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 347 transitions, 792 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:55,867 INFO L241 Difference]: Finished difference. Result has 347 places, 347 transitions, 787 flow [2020-10-09 15:27:55,867 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=787, PETRI_PLACES=347, PETRI_TRANSITIONS=347} [2020-10-09 15:27:55,867 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 5 predicate places. [2020-10-09 15:27:55,867 INFO L481 AbstractCegarLoop]: Abstraction has has 347 places, 347 transitions, 787 flow [2020-10-09 15:27:55,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:55,868 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:55,868 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:56,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 164 mathsat -unsat_core_generation=3 [2020-10-09 15:27:56,068 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:56,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:56,069 INFO L82 PathProgramCache]: Analyzing trace with hash -765374443, now seen corresponding path program 1 times [2020-10-09 15:27:56,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:56,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014400721] [2020-10-09 15:27:56,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 165 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:56,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:56,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:56,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:56,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014400721] [2020-10-09 15:27:56,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:56,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:56,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874410622] [2020-10-09 15:27:56,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:56,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:56,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:56,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:56,251 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 368 [2020-10-09 15:27:56,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 347 transitions, 787 flow. Second operand 3 states. [2020-10-09 15:27:56,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:56,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 368 [2020-10-09 15:27:56,252 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:56,317 INFO L129 PetriNetUnfolder]: 33/389 cut-off events. [2020-10-09 15:27:56,317 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:27:56,326 INFO L80 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 389 events. 33/389 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1475 event pairs, 0 based on Foata normal form. 1/345 useless extension candidates. Maximal degree in co-relation 438. Up to 14 conditions per place. [2020-10-09 15:27:56,329 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 5 selfloop transitions, 1 changer transitions 0/345 dead transitions. [2020-10-09 15:27:56,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 345 transitions, 790 flow [2020-10-09 15:27:56,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1048 transitions. [2020-10-09 15:27:56,330 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9492753623188406 [2020-10-09 15:27:56,330 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1048 transitions. [2020-10-09 15:27:56,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1048 transitions. [2020-10-09 15:27:56,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:56,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1048 transitions. [2020-10-09 15:27:56,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:56,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:56,331 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:56,331 INFO L185 Difference]: Start difference. First operand has 347 places, 347 transitions, 787 flow. Second operand 3 states and 1048 transitions. [2020-10-09 15:27:56,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 345 transitions, 790 flow [2020-10-09 15:27:56,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 345 transitions, 783 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:56,336 INFO L241 Difference]: Finished difference. Result has 347 places, 345 transitions, 776 flow [2020-10-09 15:27:56,337 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=347, PETRI_TRANSITIONS=345} [2020-10-09 15:27:56,337 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 5 predicate places. [2020-10-09 15:27:56,337 INFO L481 AbstractCegarLoop]: Abstraction has has 347 places, 345 transitions, 776 flow [2020-10-09 15:27:56,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:56,337 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:56,337 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:56,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 165 mathsat -unsat_core_generation=3 [2020-10-09 15:27:56,548 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:56,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:56,549 INFO L82 PathProgramCache]: Analyzing trace with hash -765375466, now seen corresponding path program 1 times [2020-10-09 15:27:56,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:56,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649412012] [2020-10-09 15:27:56,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 166 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:56,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:56,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:56,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:56,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:27:56,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649412012] [2020-10-09 15:27:56,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:56,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:56,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639781704] [2020-10-09 15:27:56,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:56,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:56,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:56,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:56,772 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 368 [2020-10-09 15:27:56,773 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 345 transitions, 776 flow. Second operand 3 states. [2020-10-09 15:27:56,773 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:56,773 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 368 [2020-10-09 15:27:56,773 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:56,834 INFO L129 PetriNetUnfolder]: 33/387 cut-off events. [2020-10-09 15:27:56,834 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:27:56,844 INFO L80 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 387 events. 33/387 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1458 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 438. Up to 14 conditions per place. [2020-10-09 15:27:56,846 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 8 selfloop transitions, 1 changer transitions 0/343 dead transitions. [2020-10-09 15:27:56,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 343 transitions, 789 flow [2020-10-09 15:27:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:56,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1036 transitions. [2020-10-09 15:27:56,848 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9384057971014492 [2020-10-09 15:27:56,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1036 transitions. [2020-10-09 15:27:56,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1036 transitions. [2020-10-09 15:27:56,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:56,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1036 transitions. [2020-10-09 15:27:56,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:56,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:56,849 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:56,849 INFO L185 Difference]: Start difference. First operand has 347 places, 345 transitions, 776 flow. Second operand 3 states and 1036 transitions. [2020-10-09 15:27:56,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 343 transitions, 789 flow [2020-10-09 15:27:56,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 343 transitions, 788 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:56,853 INFO L241 Difference]: Finished difference. Result has 346 places, 343 transitions, 772 flow [2020-10-09 15:27:56,853 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=346, PETRI_TRANSITIONS=343} [2020-10-09 15:27:56,853 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 4 predicate places. [2020-10-09 15:27:56,853 INFO L481 AbstractCegarLoop]: Abstraction has has 346 places, 343 transitions, 772 flow [2020-10-09 15:27:56,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:56,853 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:56,853 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:57,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 166 mathsat -unsat_core_generation=3 [2020-10-09 15:27:57,054 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:57,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:57,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1530451397, now seen corresponding path program 1 times [2020-10-09 15:27:57,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:57,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304855241] [2020-10-09 15:27:57,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 167 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:57,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:57,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:57,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:57,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:57,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304855241] [2020-10-09 15:27:57,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:57,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:57,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61393154] [2020-10-09 15:27:57,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:57,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:57,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:57,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:57,262 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 368 [2020-10-09 15:27:57,263 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 343 transitions, 772 flow. Second operand 3 states. [2020-10-09 15:27:57,263 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:57,263 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 368 [2020-10-09 15:27:57,263 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:57,329 INFO L129 PetriNetUnfolder]: 32/395 cut-off events. [2020-10-09 15:27:57,329 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:27:57,339 INFO L80 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 395 events. 32/395 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1527 event pairs, 0 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 450. Up to 14 conditions per place. [2020-10-09 15:27:57,342 INFO L132 encePairwiseOnDemand]: 363/368 looper letters, 10 selfloop transitions, 3 changer transitions 0/345 dead transitions. [2020-10-09 15:27:57,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 345 transitions, 802 flow [2020-10-09 15:27:57,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2020-10-09 15:27:57,343 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9429347826086957 [2020-10-09 15:27:57,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1041 transitions. [2020-10-09 15:27:57,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1041 transitions. [2020-10-09 15:27:57,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:57,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1041 transitions. [2020-10-09 15:27:57,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:57,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:57,344 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:57,344 INFO L185 Difference]: Start difference. First operand has 346 places, 343 transitions, 772 flow. Second operand 3 states and 1041 transitions. [2020-10-09 15:27:57,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 345 transitions, 802 flow [2020-10-09 15:27:57,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 345 transitions, 801 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:57,348 INFO L241 Difference]: Finished difference. Result has 349 places, 345 transitions, 795 flow [2020-10-09 15:27:57,348 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=349, PETRI_TRANSITIONS=345} [2020-10-09 15:27:57,348 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 7 predicate places. [2020-10-09 15:27:57,348 INFO L481 AbstractCegarLoop]: Abstraction has has 349 places, 345 transitions, 795 flow [2020-10-09 15:27:57,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:57,348 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:57,348 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:57,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 167 mathsat -unsat_core_generation=3 [2020-10-09 15:27:57,549 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:57,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:57,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1530452420, now seen corresponding path program 1 times [2020-10-09 15:27:57,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:57,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201719526] [2020-10-09 15:27:57,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 168 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:57,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:57,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:57,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:57,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:57,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201719526] [2020-10-09 15:27:57,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:57,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:57,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799460596] [2020-10-09 15:27:57,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:57,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:57,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:57,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:57,727 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 368 [2020-10-09 15:27:57,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 345 transitions, 795 flow. Second operand 3 states. [2020-10-09 15:27:57,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:57,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 368 [2020-10-09 15:27:57,729 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:57,793 INFO L129 PetriNetUnfolder]: 31/393 cut-off events. [2020-10-09 15:27:57,793 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:27:57,803 INFO L80 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 393 events. 31/393 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1518 event pairs, 0 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 447. Up to 14 conditions per place. [2020-10-09 15:27:57,805 INFO L132 encePairwiseOnDemand]: 365/368 looper letters, 5 selfloop transitions, 2 changer transitions 0/345 dead transitions. [2020-10-09 15:27:57,806 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 345 transitions, 807 flow [2020-10-09 15:27:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2020-10-09 15:27:57,807 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9501811594202898 [2020-10-09 15:27:57,807 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1049 transitions. [2020-10-09 15:27:57,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1049 transitions. [2020-10-09 15:27:57,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:57,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1049 transitions. [2020-10-09 15:27:57,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:57,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:57,808 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:57,808 INFO L185 Difference]: Start difference. First operand has 349 places, 345 transitions, 795 flow. Second operand 3 states and 1049 transitions. [2020-10-09 15:27:57,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 345 transitions, 807 flow [2020-10-09 15:27:57,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 345 transitions, 802 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:57,812 INFO L241 Difference]: Finished difference. Result has 352 places, 345 transitions, 800 flow [2020-10-09 15:27:57,812 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=352, PETRI_TRANSITIONS=345} [2020-10-09 15:27:57,813 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 10 predicate places. [2020-10-09 15:27:57,813 INFO L481 AbstractCegarLoop]: Abstraction has has 352 places, 345 transitions, 800 flow [2020-10-09 15:27:57,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:57,813 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:57,813 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:58,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 168 mathsat -unsat_core_generation=3 [2020-10-09 15:27:58,014 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:58,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:58,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1531404709, now seen corresponding path program 1 times [2020-10-09 15:27:58,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:58,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345491153] [2020-10-09 15:27:58,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 169 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:58,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:58,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:58,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:58,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:58,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345491153] [2020-10-09 15:27:58,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:58,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:58,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786319379] [2020-10-09 15:27:58,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:58,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:58,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:58,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:58,199 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 368 [2020-10-09 15:27:58,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 345 transitions, 800 flow. Second operand 3 states. [2020-10-09 15:27:58,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:58,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 368 [2020-10-09 15:27:58,201 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:58,263 INFO L129 PetriNetUnfolder]: 30/389 cut-off events. [2020-10-09 15:27:58,264 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:27:58,273 INFO L80 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 389 events. 30/389 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1494 event pairs, 0 based on Foata normal form. 1/348 useless extension candidates. Maximal degree in co-relation 443. Up to 14 conditions per place. [2020-10-09 15:27:58,275 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 4 selfloop transitions, 1 changer transitions 0/342 dead transitions. [2020-10-09 15:27:58,275 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 342 transitions, 795 flow [2020-10-09 15:27:58,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:58,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1050 transitions. [2020-10-09 15:27:58,277 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510869565217391 [2020-10-09 15:27:58,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1050 transitions. [2020-10-09 15:27:58,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1050 transitions. [2020-10-09 15:27:58,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:58,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1050 transitions. [2020-10-09 15:27:58,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:58,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:58,278 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:58,278 INFO L185 Difference]: Start difference. First operand has 352 places, 345 transitions, 800 flow. Second operand 3 states and 1050 transitions. [2020-10-09 15:27:58,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 342 transitions, 795 flow [2020-10-09 15:27:58,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 342 transitions, 788 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:27:58,282 INFO L241 Difference]: Finished difference. Result has 351 places, 342 transitions, 780 flow [2020-10-09 15:27:58,282 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=351, PETRI_TRANSITIONS=342} [2020-10-09 15:27:58,282 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 9 predicate places. [2020-10-09 15:27:58,283 INFO L481 AbstractCegarLoop]: Abstraction has has 351 places, 342 transitions, 780 flow [2020-10-09 15:27:58,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:58,283 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:58,283 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:27:58,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 169 mathsat -unsat_core_generation=3 [2020-10-09 15:27:58,489 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:58,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:58,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1531405732, now seen corresponding path program 1 times [2020-10-09 15:27:58,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:58,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617067860] [2020-10-09 15:27:58,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 170 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:58,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:58,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:58,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:27:58,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617067860] [2020-10-09 15:27:58,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:58,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:58,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193976757] [2020-10-09 15:27:58,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:58,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:58,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:58,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:58,698 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 368 [2020-10-09 15:27:58,699 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 342 transitions, 780 flow. Second operand 3 states. [2020-10-09 15:27:58,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:58,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 368 [2020-10-09 15:27:58,699 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:58,766 INFO L129 PetriNetUnfolder]: 30/387 cut-off events. [2020-10-09 15:27:58,767 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:27:58,777 INFO L80 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 387 events. 30/387 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1479 event pairs, 0 based on Foata normal form. 0/344 useless extension candidates. Maximal degree in co-relation 445. Up to 14 conditions per place. [2020-10-09 15:27:58,780 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 8 selfloop transitions, 1 changer transitions 0/340 dead transitions. [2020-10-09 15:27:58,780 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 340 transitions, 793 flow [2020-10-09 15:27:58,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:58,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1036 transitions. [2020-10-09 15:27:58,781 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9384057971014492 [2020-10-09 15:27:58,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1036 transitions. [2020-10-09 15:27:58,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1036 transitions. [2020-10-09 15:27:58,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:58,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1036 transitions. [2020-10-09 15:27:58,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:58,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:58,783 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:58,783 INFO L185 Difference]: Start difference. First operand has 351 places, 342 transitions, 780 flow. Second operand 3 states and 1036 transitions. [2020-10-09 15:27:58,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 340 transitions, 793 flow [2020-10-09 15:27:58,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 340 transitions, 792 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:58,787 INFO L241 Difference]: Finished difference. Result has 350 places, 340 transitions, 776 flow [2020-10-09 15:27:58,787 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=350, PETRI_TRANSITIONS=340} [2020-10-09 15:27:58,787 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 8 predicate places. [2020-10-09 15:27:58,787 INFO L481 AbstractCegarLoop]: Abstraction has has 350 places, 340 transitions, 776 flow [2020-10-09 15:27:58,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:58,788 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:58,788 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:58,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 170 mathsat -unsat_core_generation=3 [2020-10-09 15:27:58,988 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:58,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:58,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1363549141, now seen corresponding path program 1 times [2020-10-09 15:27:58,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:58,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47681179] [2020-10-09 15:27:58,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 171 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:59,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:27:59,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:59,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:59,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47681179] [2020-10-09 15:27:59,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:59,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:59,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908032905] [2020-10-09 15:27:59,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:59,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:59,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:59,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:59,197 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 368 [2020-10-09 15:27:59,198 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 340 transitions, 776 flow. Second operand 3 states. [2020-10-09 15:27:59,198 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:59,198 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 368 [2020-10-09 15:27:59,199 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:59,267 INFO L129 PetriNetUnfolder]: 29/394 cut-off events. [2020-10-09 15:27:59,267 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:27:59,278 INFO L80 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 394 events. 29/394 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1538 event pairs, 0 based on Foata normal form. 1/353 useless extension candidates. Maximal degree in co-relation 448. Up to 14 conditions per place. [2020-10-09 15:27:59,281 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 4 selfloop transitions, 1 changer transitions 0/340 dead transitions. [2020-10-09 15:27:59,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 340 transitions, 786 flow [2020-10-09 15:27:59,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1050 transitions. [2020-10-09 15:27:59,282 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510869565217391 [2020-10-09 15:27:59,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1050 transitions. [2020-10-09 15:27:59,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1050 transitions. [2020-10-09 15:27:59,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:59,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1050 transitions. [2020-10-09 15:27:59,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:59,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:59,283 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:59,283 INFO L185 Difference]: Start difference. First operand has 350 places, 340 transitions, 776 flow. Second operand 3 states and 1050 transitions. [2020-10-09 15:27:59,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 340 transitions, 786 flow [2020-10-09 15:27:59,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 340 transitions, 785 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:59,287 INFO L241 Difference]: Finished difference. Result has 352 places, 340 transitions, 780 flow [2020-10-09 15:27:59,288 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=352, PETRI_TRANSITIONS=340} [2020-10-09 15:27:59,288 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 10 predicate places. [2020-10-09 15:27:59,288 INFO L481 AbstractCegarLoop]: Abstraction has has 352 places, 340 transitions, 780 flow [2020-10-09 15:27:59,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:59,288 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:59,288 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:27:59,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 171 mathsat -unsat_core_generation=3 [2020-10-09 15:27:59,489 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:27:59,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:27:59,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1363550164, now seen corresponding path program 1 times [2020-10-09 15:27:59,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:27:59,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134627899] [2020-10-09 15:27:59,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 172 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with mathsat -unsat_core_generation=3 [2020-10-09 15:27:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:27:59,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:27:59,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:27:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:59,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:27:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:27:59,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134627899] [2020-10-09 15:27:59,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:27:59,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:27:59,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728599662] [2020-10-09 15:27:59,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:27:59,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:27:59,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:27:59,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:27:59,698 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 368 [2020-10-09 15:27:59,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 340 transitions, 780 flow. Second operand 3 states. [2020-10-09 15:27:59,698 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:27:59,698 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 368 [2020-10-09 15:27:59,699 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:27:59,791 INFO L129 PetriNetUnfolder]: 27/396 cut-off events. [2020-10-09 15:27:59,791 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:27:59,802 INFO L80 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 396 events. 27/396 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1569 event pairs, 0 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 461. Up to 14 conditions per place. [2020-10-09 15:27:59,805 INFO L132 encePairwiseOnDemand]: 364/368 looper letters, 9 selfloop transitions, 3 changer transitions 0/341 dead transitions. [2020-10-09 15:27:59,805 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 341 transitions, 806 flow [2020-10-09 15:27:59,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:27:59,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:27:59,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2020-10-09 15:27:59,806 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9411231884057971 [2020-10-09 15:27:59,806 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1039 transitions. [2020-10-09 15:27:59,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1039 transitions. [2020-10-09 15:27:59,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:27:59,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1039 transitions. [2020-10-09 15:27:59,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:27:59,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:27:59,808 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:27:59,808 INFO L185 Difference]: Start difference. First operand has 352 places, 340 transitions, 780 flow. Second operand 3 states and 1039 transitions. [2020-10-09 15:27:59,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 341 transitions, 806 flow [2020-10-09 15:27:59,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 341 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:27:59,812 INFO L241 Difference]: Finished difference. Result has 355 places, 341 transitions, 797 flow [2020-10-09 15:27:59,812 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=797, PETRI_PLACES=355, PETRI_TRANSITIONS=341} [2020-10-09 15:27:59,812 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 13 predicate places. [2020-10-09 15:27:59,812 INFO L481 AbstractCegarLoop]: Abstraction has has 355 places, 341 transitions, 797 flow [2020-10-09 15:27:59,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:27:59,813 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:27:59,813 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:28:00,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 172 mathsat -unsat_core_generation=3 [2020-10-09 15:28:00,014 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:00,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:00,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1362596852, now seen corresponding path program 1 times [2020-10-09 15:28:00,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:00,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610562212] [2020-10-09 15:28:00,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 173 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:00,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:00,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:00,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:00,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610562212] [2020-10-09 15:28:00,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:00,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:00,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680371960] [2020-10-09 15:28:00,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:00,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:00,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:00,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:00,204 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 368 [2020-10-09 15:28:00,205 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 341 transitions, 797 flow. Second operand 3 states. [2020-10-09 15:28:00,205 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:00,205 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 368 [2020-10-09 15:28:00,206 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:00,275 INFO L129 PetriNetUnfolder]: 27/389 cut-off events. [2020-10-09 15:28:00,275 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:00,286 INFO L80 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 389 events. 27/389 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1510 event pairs, 0 based on Foata normal form. 1/351 useless extension candidates. Maximal degree in co-relation 447. Up to 14 conditions per place. [2020-10-09 15:28:00,288 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 5 selfloop transitions, 1 changer transitions 0/339 dead transitions. [2020-10-09 15:28:00,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 339 transitions, 799 flow [2020-10-09 15:28:00,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1048 transitions. [2020-10-09 15:28:00,290 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9492753623188406 [2020-10-09 15:28:00,290 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1048 transitions. [2020-10-09 15:28:00,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1048 transitions. [2020-10-09 15:28:00,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:00,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1048 transitions. [2020-10-09 15:28:00,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:00,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:00,291 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:00,291 INFO L185 Difference]: Start difference. First operand has 355 places, 341 transitions, 797 flow. Second operand 3 states and 1048 transitions. [2020-10-09 15:28:00,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 339 transitions, 799 flow [2020-10-09 15:28:00,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 339 transitions, 791 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:00,295 INFO L241 Difference]: Finished difference. Result has 355 places, 339 transitions, 784 flow [2020-10-09 15:28:00,295 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=355, PETRI_TRANSITIONS=339} [2020-10-09 15:28:00,295 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 13 predicate places. [2020-10-09 15:28:00,295 INFO L481 AbstractCegarLoop]: Abstraction has has 355 places, 339 transitions, 784 flow [2020-10-09 15:28:00,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:00,295 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:00,295 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:28:00,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 173 mathsat -unsat_core_generation=3 [2020-10-09 15:28:00,496 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:00,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:00,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1362595829, now seen corresponding path program 1 times [2020-10-09 15:28:00,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:00,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327724790] [2020-10-09 15:28:00,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 174 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:00,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:00,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:00,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:00,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327724790] [2020-10-09 15:28:00,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:00,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:00,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854491526] [2020-10-09 15:28:00,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:00,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:00,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:00,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:00,703 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 368 [2020-10-09 15:28:00,704 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 339 transitions, 784 flow. Second operand 3 states. [2020-10-09 15:28:00,704 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:00,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 368 [2020-10-09 15:28:00,705 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:00,775 INFO L129 PetriNetUnfolder]: 27/387 cut-off events. [2020-10-09 15:28:00,776 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:00,786 INFO L80 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 387 events. 27/387 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1496 event pairs, 0 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 451. Up to 14 conditions per place. [2020-10-09 15:28:00,789 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 8 selfloop transitions, 1 changer transitions 0/337 dead transitions. [2020-10-09 15:28:00,789 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 337 transitions, 797 flow [2020-10-09 15:28:00,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1036 transitions. [2020-10-09 15:28:00,790 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9384057971014492 [2020-10-09 15:28:00,790 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1036 transitions. [2020-10-09 15:28:00,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1036 transitions. [2020-10-09 15:28:00,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:00,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1036 transitions. [2020-10-09 15:28:00,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:00,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:00,791 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:00,791 INFO L185 Difference]: Start difference. First operand has 355 places, 339 transitions, 784 flow. Second operand 3 states and 1036 transitions. [2020-10-09 15:28:00,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 337 transitions, 797 flow [2020-10-09 15:28:00,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 337 transitions, 796 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:00,795 INFO L241 Difference]: Finished difference. Result has 354 places, 337 transitions, 780 flow [2020-10-09 15:28:00,795 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=354, PETRI_TRANSITIONS=337} [2020-10-09 15:28:00,795 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 12 predicate places. [2020-10-09 15:28:00,795 INFO L481 AbstractCegarLoop]: Abstraction has has 354 places, 337 transitions, 780 flow [2020-10-09 15:28:00,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:00,795 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:00,795 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:00,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 174 mathsat -unsat_core_generation=3 [2020-10-09 15:28:00,996 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:00,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:00,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1156571611, now seen corresponding path program 1 times [2020-10-09 15:28:00,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:00,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136688131] [2020-10-09 15:28:00,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 175 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:01,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:01,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:01,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:01,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136688131] [2020-10-09 15:28:01,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:01,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:01,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943773267] [2020-10-09 15:28:01,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:01,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:01,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:01,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:01,184 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 368 [2020-10-09 15:28:01,185 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 337 transitions, 780 flow. Second operand 3 states. [2020-10-09 15:28:01,185 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:01,185 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 368 [2020-10-09 15:28:01,185 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:01,254 INFO L129 PetriNetUnfolder]: 25/392 cut-off events. [2020-10-09 15:28:01,254 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:28:01,263 INFO L80 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 392 events. 25/392 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1544 event pairs, 0 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 454. Up to 14 conditions per place. [2020-10-09 15:28:01,265 INFO L132 encePairwiseOnDemand]: 365/368 looper letters, 5 selfloop transitions, 2 changer transitions 0/338 dead transitions. [2020-10-09 15:28:01,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 338 transitions, 796 flow [2020-10-09 15:28:01,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2020-10-09 15:28:01,267 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9501811594202898 [2020-10-09 15:28:01,267 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1049 transitions. [2020-10-09 15:28:01,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1049 transitions. [2020-10-09 15:28:01,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:01,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1049 transitions. [2020-10-09 15:28:01,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:01,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:01,268 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:01,268 INFO L185 Difference]: Start difference. First operand has 354 places, 337 transitions, 780 flow. Second operand 3 states and 1049 transitions. [2020-10-09 15:28:01,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 338 transitions, 796 flow [2020-10-09 15:28:01,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 338 transitions, 795 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:01,271 INFO L241 Difference]: Finished difference. Result has 357 places, 338 transitions, 793 flow [2020-10-09 15:28:01,272 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=357, PETRI_TRANSITIONS=338} [2020-10-09 15:28:01,272 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 15 predicate places. [2020-10-09 15:28:01,272 INFO L481 AbstractCegarLoop]: Abstraction has has 357 places, 338 transitions, 793 flow [2020-10-09 15:28:01,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:01,272 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:01,272 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:01,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 175 mathsat -unsat_core_generation=3 [2020-10-09 15:28:01,473 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:01,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:01,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1156572634, now seen corresponding path program 1 times [2020-10-09 15:28:01,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:01,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466046919] [2020-10-09 15:28:01,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 176 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 176 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:01,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:01,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:01,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:01,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466046919] [2020-10-09 15:28:01,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:01,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:01,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553900241] [2020-10-09 15:28:01,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:01,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:01,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:01,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:01,697 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 368 [2020-10-09 15:28:01,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 338 transitions, 793 flow. Second operand 3 states. [2020-10-09 15:28:01,698 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:01,698 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 368 [2020-10-09 15:28:01,698 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:01,766 INFO L129 PetriNetUnfolder]: 25/393 cut-off events. [2020-10-09 15:28:01,766 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:01,776 INFO L80 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 393 events. 25/393 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1550 event pairs, 0 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 462. Up to 14 conditions per place. [2020-10-09 15:28:01,778 INFO L132 encePairwiseOnDemand]: 364/368 looper letters, 9 selfloop transitions, 3 changer transitions 0/339 dead transitions. [2020-10-09 15:28:01,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 339 transitions, 819 flow [2020-10-09 15:28:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:01,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2020-10-09 15:28:01,780 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9411231884057971 [2020-10-09 15:28:01,780 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1039 transitions. [2020-10-09 15:28:01,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1039 transitions. [2020-10-09 15:28:01,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:01,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1039 transitions. [2020-10-09 15:28:01,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:01,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:01,781 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:01,781 INFO L185 Difference]: Start difference. First operand has 357 places, 338 transitions, 793 flow. Second operand 3 states and 1039 transitions. [2020-10-09 15:28:01,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 339 transitions, 819 flow [2020-10-09 15:28:01,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 339 transitions, 817 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:01,785 INFO L241 Difference]: Finished difference. Result has 360 places, 339 transitions, 809 flow [2020-10-09 15:28:01,785 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=809, PETRI_PLACES=360, PETRI_TRANSITIONS=339} [2020-10-09 15:28:01,785 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 18 predicate places. [2020-10-09 15:28:01,785 INFO L481 AbstractCegarLoop]: Abstraction has has 360 places, 339 transitions, 809 flow [2020-10-09 15:28:01,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:01,785 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:01,785 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:01,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 176 mathsat -unsat_core_generation=3 [2020-10-09 15:28:01,987 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:01,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:01,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1155618299, now seen corresponding path program 1 times [2020-10-09 15:28:01,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:01,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151441019] [2020-10-09 15:28:01,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 177 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 177 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:02,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:02,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:02,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:02,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151441019] [2020-10-09 15:28:02,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:02,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:02,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366687069] [2020-10-09 15:28:02,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:02,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:02,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:02,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:02,195 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 368 [2020-10-09 15:28:02,196 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 339 transitions, 809 flow. Second operand 3 states. [2020-10-09 15:28:02,196 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:02,196 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 368 [2020-10-09 15:28:02,196 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:02,267 INFO L129 PetriNetUnfolder]: 24/390 cut-off events. [2020-10-09 15:28:02,267 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:28:02,278 INFO L80 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 390 events. 24/390 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1535 event pairs, 0 based on Foata normal form. 2/355 useless extension candidates. Maximal degree in co-relation 461. Up to 14 conditions per place. [2020-10-09 15:28:02,280 INFO L132 encePairwiseOnDemand]: 365/368 looper letters, 9 selfloop transitions, 1 changer transitions 0/337 dead transitions. [2020-10-09 15:28:02,280 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 337 transitions, 817 flow [2020-10-09 15:28:02,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:02,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:02,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1038 transitions. [2020-10-09 15:28:02,281 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9402173913043478 [2020-10-09 15:28:02,281 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1038 transitions. [2020-10-09 15:28:02,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1038 transitions. [2020-10-09 15:28:02,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:02,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1038 transitions. [2020-10-09 15:28:02,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:02,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:02,282 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:02,282 INFO L185 Difference]: Start difference. First operand has 360 places, 339 transitions, 809 flow. Second operand 3 states and 1038 transitions. [2020-10-09 15:28:02,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 337 transitions, 817 flow [2020-10-09 15:28:02,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 337 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:02,286 INFO L241 Difference]: Finished difference. Result has 361 places, 337 transitions, 798 flow [2020-10-09 15:28:02,286 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=361, PETRI_TRANSITIONS=337} [2020-10-09 15:28:02,286 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 19 predicate places. [2020-10-09 15:28:02,286 INFO L481 AbstractCegarLoop]: Abstraction has has 361 places, 337 transitions, 798 flow [2020-10-09 15:28:02,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:02,287 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:02,287 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:02,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 177 mathsat -unsat_core_generation=3 [2020-10-09 15:28:02,487 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:02,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:02,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1155619322, now seen corresponding path program 1 times [2020-10-09 15:28:02,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:02,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667531632] [2020-10-09 15:28:02,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 178 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 178 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:02,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:02,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:02,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:02,662 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:02,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667531632] [2020-10-09 15:28:02,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:02,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:02,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744060781] [2020-10-09 15:28:02,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:02,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:02,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:02,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:02,675 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 368 [2020-10-09 15:28:02,676 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 337 transitions, 798 flow. Second operand 3 states. [2020-10-09 15:28:02,676 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:02,676 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 368 [2020-10-09 15:28:02,676 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:02,743 INFO L129 PetriNetUnfolder]: 24/387 cut-off events. [2020-10-09 15:28:02,743 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:02,753 INFO L80 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 387 events. 24/387 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1508 event pairs, 0 based on Foata normal form. 1/352 useless extension candidates. Maximal degree in co-relation 455. Up to 14 conditions per place. [2020-10-09 15:28:02,755 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 4 selfloop transitions, 1 changer transitions 0/334 dead transitions. [2020-10-09 15:28:02,755 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 334 transitions, 797 flow [2020-10-09 15:28:02,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1050 transitions. [2020-10-09 15:28:02,757 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510869565217391 [2020-10-09 15:28:02,757 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1050 transitions. [2020-10-09 15:28:02,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1050 transitions. [2020-10-09 15:28:02,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:02,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1050 transitions. [2020-10-09 15:28:02,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:02,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:02,758 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:02,758 INFO L185 Difference]: Start difference. First operand has 361 places, 337 transitions, 798 flow. Second operand 3 states and 1050 transitions. [2020-10-09 15:28:02,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 334 transitions, 797 flow [2020-10-09 15:28:02,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 334 transitions, 792 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:02,761 INFO L241 Difference]: Finished difference. Result has 358 places, 334 transitions, 784 flow [2020-10-09 15:28:02,762 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=358, PETRI_TRANSITIONS=334} [2020-10-09 15:28:02,762 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 16 predicate places. [2020-10-09 15:28:02,762 INFO L481 AbstractCegarLoop]: Abstraction has has 358 places, 334 transitions, 784 flow [2020-10-09 15:28:02,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:02,762 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:02,762 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:02,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 178 mathsat -unsat_core_generation=3 [2020-10-09 15:28:02,963 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:02,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:02,963 INFO L82 PathProgramCache]: Analyzing trace with hash -783790632, now seen corresponding path program 1 times [2020-10-09 15:28:02,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:02,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837947768] [2020-10-09 15:28:02,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 179 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:03,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:03,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:03,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:03,140 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:03,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837947768] [2020-10-09 15:28:03,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:03,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:03,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801888955] [2020-10-09 15:28:03,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:03,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:03,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:03,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:03,167 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 368 [2020-10-09 15:28:03,167 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 334 transitions, 784 flow. Second operand 3 states. [2020-10-09 15:28:03,167 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:03,167 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 368 [2020-10-09 15:28:03,167 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:03,238 INFO L129 PetriNetUnfolder]: 23/395 cut-off events. [2020-10-09 15:28:03,238 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:28:03,248 INFO L80 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 395 events. 23/395 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1584 event pairs, 0 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 472. Up to 14 conditions per place. [2020-10-09 15:28:03,250 INFO L132 encePairwiseOnDemand]: 363/368 looper letters, 10 selfloop transitions, 3 changer transitions 0/336 dead transitions. [2020-10-09 15:28:03,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 336 transitions, 814 flow [2020-10-09 15:28:03,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:03,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2020-10-09 15:28:03,252 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9429347826086957 [2020-10-09 15:28:03,252 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1041 transitions. [2020-10-09 15:28:03,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1041 transitions. [2020-10-09 15:28:03,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:03,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1041 transitions. [2020-10-09 15:28:03,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:03,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:03,253 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:03,253 INFO L185 Difference]: Start difference. First operand has 358 places, 334 transitions, 784 flow. Second operand 3 states and 1041 transitions. [2020-10-09 15:28:03,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 336 transitions, 814 flow [2020-10-09 15:28:03,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 336 transitions, 813 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:03,257 INFO L241 Difference]: Finished difference. Result has 361 places, 336 transitions, 807 flow [2020-10-09 15:28:03,257 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=807, PETRI_PLACES=361, PETRI_TRANSITIONS=336} [2020-10-09 15:28:03,257 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 19 predicate places. [2020-10-09 15:28:03,257 INFO L481 AbstractCegarLoop]: Abstraction has has 361 places, 336 transitions, 807 flow [2020-10-09 15:28:03,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:03,258 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:03,258 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:03,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 179 mathsat -unsat_core_generation=3 [2020-10-09 15:28:03,469 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:03,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:03,469 INFO L82 PathProgramCache]: Analyzing trace with hash -783789609, now seen corresponding path program 1 times [2020-10-09 15:28:03,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:03,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034363180] [2020-10-09 15:28:03,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 180 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 180 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:03,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:03,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:03,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:03,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034363180] [2020-10-09 15:28:03,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:03,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:03,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290684152] [2020-10-09 15:28:03,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:03,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:03,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:03,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:03,664 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 368 [2020-10-09 15:28:03,665 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 336 transitions, 807 flow. Second operand 3 states. [2020-10-09 15:28:03,665 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:03,665 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 368 [2020-10-09 15:28:03,665 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:03,789 INFO L129 PetriNetUnfolder]: 22/393 cut-off events. [2020-10-09 15:28:03,790 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:03,810 INFO L80 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 393 events. 22/393 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1573 event pairs, 0 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 467. Up to 14 conditions per place. [2020-10-09 15:28:03,814 INFO L132 encePairwiseOnDemand]: 365/368 looper letters, 5 selfloop transitions, 2 changer transitions 0/336 dead transitions. [2020-10-09 15:28:03,815 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 336 transitions, 819 flow [2020-10-09 15:28:03,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2020-10-09 15:28:03,817 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9501811594202898 [2020-10-09 15:28:03,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1049 transitions. [2020-10-09 15:28:03,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1049 transitions. [2020-10-09 15:28:03,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:03,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1049 transitions. [2020-10-09 15:28:03,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:03,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:03,858 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:03,858 INFO L185 Difference]: Start difference. First operand has 361 places, 336 transitions, 807 flow. Second operand 3 states and 1049 transitions. [2020-10-09 15:28:03,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 336 transitions, 819 flow [2020-10-09 15:28:03,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 336 transitions, 814 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:03,863 INFO L241 Difference]: Finished difference. Result has 364 places, 336 transitions, 812 flow [2020-10-09 15:28:03,863 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=364, PETRI_TRANSITIONS=336} [2020-10-09 15:28:03,864 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 22 predicate places. [2020-10-09 15:28:03,864 INFO L481 AbstractCegarLoop]: Abstraction has has 364 places, 336 transitions, 812 flow [2020-10-09 15:28:03,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:03,864 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:03,864 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:04,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 180 mathsat -unsat_core_generation=3 [2020-10-09 15:28:04,076 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:04,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:04,076 INFO L82 PathProgramCache]: Analyzing trace with hash -782837320, now seen corresponding path program 1 times [2020-10-09 15:28:04,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:04,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549647413] [2020-10-09 15:28:04,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 181 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 181 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:04,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:04,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:04,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:04,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549647413] [2020-10-09 15:28:04,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:04,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:04,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813768231] [2020-10-09 15:28:04,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:04,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:04,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:04,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:04,328 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 368 [2020-10-09 15:28:04,329 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 336 transitions, 812 flow. Second operand 3 states. [2020-10-09 15:28:04,329 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:04,329 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 368 [2020-10-09 15:28:04,329 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:04,473 INFO L129 PetriNetUnfolder]: 21/389 cut-off events. [2020-10-09 15:28:04,473 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:28:04,491 INFO L80 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 389 events. 21/389 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1545 event pairs, 0 based on Foata normal form. 1/357 useless extension candidates. Maximal degree in co-relation 463. Up to 14 conditions per place. [2020-10-09 15:28:04,494 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 4 selfloop transitions, 1 changer transitions 0/333 dead transitions. [2020-10-09 15:28:04,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 333 transitions, 807 flow [2020-10-09 15:28:04,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1050 transitions. [2020-10-09 15:28:04,496 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510869565217391 [2020-10-09 15:28:04,496 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1050 transitions. [2020-10-09 15:28:04,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1050 transitions. [2020-10-09 15:28:04,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:04,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1050 transitions. [2020-10-09 15:28:04,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:04,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:04,499 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:04,499 INFO L185 Difference]: Start difference. First operand has 364 places, 336 transitions, 812 flow. Second operand 3 states and 1050 transitions. [2020-10-09 15:28:04,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 333 transitions, 807 flow [2020-10-09 15:28:04,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 333 transitions, 800 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:04,505 INFO L241 Difference]: Finished difference. Result has 363 places, 333 transitions, 792 flow [2020-10-09 15:28:04,505 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=363, PETRI_TRANSITIONS=333} [2020-10-09 15:28:04,506 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 21 predicate places. [2020-10-09 15:28:04,506 INFO L481 AbstractCegarLoop]: Abstraction has has 363 places, 333 transitions, 792 flow [2020-10-09 15:28:04,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:04,506 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:04,506 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:04,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 181 mathsat -unsat_core_generation=3 [2020-10-09 15:28:04,720 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:04,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:04,720 INFO L82 PathProgramCache]: Analyzing trace with hash -782836297, now seen corresponding path program 1 times [2020-10-09 15:28:04,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:04,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765335845] [2020-10-09 15:28:04,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 182 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 182 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:04,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:04,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:04,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:04,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765335845] [2020-10-09 15:28:04,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:04,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:04,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864493741] [2020-10-09 15:28:04,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:04,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:04,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:04,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:04,909 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 368 [2020-10-09 15:28:04,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 333 transitions, 792 flow. Second operand 3 states. [2020-10-09 15:28:04,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:04,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 368 [2020-10-09 15:28:04,910 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:04,982 INFO L129 PetriNetUnfolder]: 21/387 cut-off events. [2020-10-09 15:28:04,983 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:28:04,993 INFO L80 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 387 events. 21/387 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1531 event pairs, 0 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 465. Up to 14 conditions per place. [2020-10-09 15:28:04,995 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 8 selfloop transitions, 1 changer transitions 0/331 dead transitions. [2020-10-09 15:28:04,995 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 331 transitions, 805 flow [2020-10-09 15:28:04,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1036 transitions. [2020-10-09 15:28:04,996 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9384057971014492 [2020-10-09 15:28:04,996 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1036 transitions. [2020-10-09 15:28:04,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1036 transitions. [2020-10-09 15:28:04,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:04,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1036 transitions. [2020-10-09 15:28:04,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:04,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:04,998 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:04,998 INFO L185 Difference]: Start difference. First operand has 363 places, 333 transitions, 792 flow. Second operand 3 states and 1036 transitions. [2020-10-09 15:28:04,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 331 transitions, 805 flow [2020-10-09 15:28:05,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 331 transitions, 804 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:05,002 INFO L241 Difference]: Finished difference. Result has 362 places, 331 transitions, 788 flow [2020-10-09 15:28:05,002 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=362, PETRI_TRANSITIONS=331} [2020-10-09 15:28:05,002 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 20 predicate places. [2020-10-09 15:28:05,002 INFO L481 AbstractCegarLoop]: Abstraction has has 362 places, 331 transitions, 788 flow [2020-10-09 15:28:05,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:05,003 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:05,003 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:05,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 182 mathsat -unsat_core_generation=3 [2020-10-09 15:28:05,203 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:05,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:05,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1525528981, now seen corresponding path program 1 times [2020-10-09 15:28:05,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:05,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532263705] [2020-10-09 15:28:05,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 183 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 183 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:05,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:05,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:05,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:05,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532263705] [2020-10-09 15:28:05,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:05,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:05,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702516572] [2020-10-09 15:28:05,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:05,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:05,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:05,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:05,396 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 368 [2020-10-09 15:28:05,397 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 331 transitions, 788 flow. Second operand 3 states. [2020-10-09 15:28:05,397 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:05,397 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 368 [2020-10-09 15:28:05,398 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:05,471 INFO L129 PetriNetUnfolder]: 20/394 cut-off events. [2020-10-09 15:28:05,471 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:28:05,482 INFO L80 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 394 events. 20/394 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1590 event pairs, 0 based on Foata normal form. 1/362 useless extension candidates. Maximal degree in co-relation 468. Up to 14 conditions per place. [2020-10-09 15:28:05,484 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 4 selfloop transitions, 1 changer transitions 0/331 dead transitions. [2020-10-09 15:28:05,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 331 transitions, 798 flow [2020-10-09 15:28:05,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:05,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:05,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1050 transitions. [2020-10-09 15:28:05,485 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510869565217391 [2020-10-09 15:28:05,485 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1050 transitions. [2020-10-09 15:28:05,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1050 transitions. [2020-10-09 15:28:05,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:05,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1050 transitions. [2020-10-09 15:28:05,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:05,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:05,487 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:05,487 INFO L185 Difference]: Start difference. First operand has 362 places, 331 transitions, 788 flow. Second operand 3 states and 1050 transitions. [2020-10-09 15:28:05,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 331 transitions, 798 flow [2020-10-09 15:28:05,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 331 transitions, 797 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:05,490 INFO L241 Difference]: Finished difference. Result has 364 places, 331 transitions, 792 flow [2020-10-09 15:28:05,491 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=364, PETRI_TRANSITIONS=331} [2020-10-09 15:28:05,491 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 22 predicate places. [2020-10-09 15:28:05,491 INFO L481 AbstractCegarLoop]: Abstraction has has 364 places, 331 transitions, 792 flow [2020-10-09 15:28:05,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:05,491 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:05,491 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:05,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 183 mathsat -unsat_core_generation=3 [2020-10-09 15:28:05,692 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:05,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:05,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1525527958, now seen corresponding path program 1 times [2020-10-09 15:28:05,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:05,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595112210] [2020-10-09 15:28:05,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 184 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 184 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:05,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:05,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:05,870 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:05,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:05,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595112210] [2020-10-09 15:28:05,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:05,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:05,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718624399] [2020-10-09 15:28:05,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:05,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:05,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:05,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:05,892 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 368 [2020-10-09 15:28:05,892 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 331 transitions, 792 flow. Second operand 3 states. [2020-10-09 15:28:05,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:05,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 368 [2020-10-09 15:28:05,893 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:05,971 INFO L129 PetriNetUnfolder]: 18/396 cut-off events. [2020-10-09 15:28:05,971 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:05,982 INFO L80 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 396 events. 18/396 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1623 event pairs, 0 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 481. Up to 14 conditions per place. [2020-10-09 15:28:05,983 INFO L132 encePairwiseOnDemand]: 364/368 looper letters, 9 selfloop transitions, 3 changer transitions 0/332 dead transitions. [2020-10-09 15:28:05,983 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 332 transitions, 818 flow [2020-10-09 15:28:05,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:05,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2020-10-09 15:28:05,985 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9411231884057971 [2020-10-09 15:28:05,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1039 transitions. [2020-10-09 15:28:05,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1039 transitions. [2020-10-09 15:28:05,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:05,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1039 transitions. [2020-10-09 15:28:05,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:05,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:05,987 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:05,987 INFO L185 Difference]: Start difference. First operand has 364 places, 331 transitions, 792 flow. Second operand 3 states and 1039 transitions. [2020-10-09 15:28:05,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 332 transitions, 818 flow [2020-10-09 15:28:05,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 332 transitions, 817 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:05,992 INFO L241 Difference]: Finished difference. Result has 367 places, 332 transitions, 809 flow [2020-10-09 15:28:05,992 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=809, PETRI_PLACES=367, PETRI_TRANSITIONS=332} [2020-10-09 15:28:05,992 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 25 predicate places. [2020-10-09 15:28:05,992 INFO L481 AbstractCegarLoop]: Abstraction has has 367 places, 332 transitions, 809 flow [2020-10-09 15:28:05,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:05,992 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:05,993 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:06,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 184 mathsat -unsat_core_generation=3 [2020-10-09 15:28:06,194 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:06,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:06,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1526481270, now seen corresponding path program 1 times [2020-10-09 15:28:06,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:06,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043101096] [2020-10-09 15:28:06,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 185 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 185 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:06,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:06,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:06,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:06,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043101096] [2020-10-09 15:28:06,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:06,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:06,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542805727] [2020-10-09 15:28:06,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:06,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:06,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:06,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:06,383 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 368 [2020-10-09 15:28:06,384 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 332 transitions, 809 flow. Second operand 3 states. [2020-10-09 15:28:06,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:06,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 368 [2020-10-09 15:28:06,384 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:06,505 INFO L129 PetriNetUnfolder]: 18/389 cut-off events. [2020-10-09 15:28:06,505 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:06,514 INFO L80 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 389 events. 18/389 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1564 event pairs, 0 based on Foata normal form. 1/360 useless extension candidates. Maximal degree in co-relation 467. Up to 14 conditions per place. [2020-10-09 15:28:06,516 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 5 selfloop transitions, 1 changer transitions 0/330 dead transitions. [2020-10-09 15:28:06,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 330 transitions, 811 flow [2020-10-09 15:28:06,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1048 transitions. [2020-10-09 15:28:06,517 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9492753623188406 [2020-10-09 15:28:06,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1048 transitions. [2020-10-09 15:28:06,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1048 transitions. [2020-10-09 15:28:06,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:06,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1048 transitions. [2020-10-09 15:28:06,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:06,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:06,519 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:06,519 INFO L185 Difference]: Start difference. First operand has 367 places, 332 transitions, 809 flow. Second operand 3 states and 1048 transitions. [2020-10-09 15:28:06,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 330 transitions, 811 flow [2020-10-09 15:28:06,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 330 transitions, 803 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:06,522 INFO L241 Difference]: Finished difference. Result has 367 places, 330 transitions, 796 flow [2020-10-09 15:28:06,522 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=367, PETRI_TRANSITIONS=330} [2020-10-09 15:28:06,522 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 25 predicate places. [2020-10-09 15:28:06,522 INFO L481 AbstractCegarLoop]: Abstraction has has 367 places, 330 transitions, 796 flow [2020-10-09 15:28:06,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:06,523 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:06,523 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:06,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 185 mathsat -unsat_core_generation=3 [2020-10-09 15:28:06,723 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:06,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:06,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1526482293, now seen corresponding path program 1 times [2020-10-09 15:28:06,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:06,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959550261] [2020-10-09 15:28:06,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 186 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:06,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:06,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:06,900 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:06,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:06,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959550261] [2020-10-09 15:28:06,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:06,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:06,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651204067] [2020-10-09 15:28:06,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:06,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:06,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:06,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:06,939 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 368 [2020-10-09 15:28:06,940 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 330 transitions, 796 flow. Second operand 3 states. [2020-10-09 15:28:06,940 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:06,940 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 368 [2020-10-09 15:28:06,940 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:07,012 INFO L129 PetriNetUnfolder]: 18/387 cut-off events. [2020-10-09 15:28:07,013 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:07,023 INFO L80 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 387 events. 18/387 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1550 event pairs, 0 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 471. Up to 14 conditions per place. [2020-10-09 15:28:07,024 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 8 selfloop transitions, 1 changer transitions 0/328 dead transitions. [2020-10-09 15:28:07,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 328 transitions, 809 flow [2020-10-09 15:28:07,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:07,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1036 transitions. [2020-10-09 15:28:07,026 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9384057971014492 [2020-10-09 15:28:07,026 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1036 transitions. [2020-10-09 15:28:07,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1036 transitions. [2020-10-09 15:28:07,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:07,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1036 transitions. [2020-10-09 15:28:07,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:07,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:07,027 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:07,027 INFO L185 Difference]: Start difference. First operand has 367 places, 330 transitions, 796 flow. Second operand 3 states and 1036 transitions. [2020-10-09 15:28:07,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 328 transitions, 809 flow [2020-10-09 15:28:07,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 328 transitions, 808 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:07,030 INFO L241 Difference]: Finished difference. Result has 366 places, 328 transitions, 792 flow [2020-10-09 15:28:07,031 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=366, PETRI_TRANSITIONS=328} [2020-10-09 15:28:07,031 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 24 predicate places. [2020-10-09 15:28:07,031 INFO L481 AbstractCegarLoop]: Abstraction has has 366 places, 328 transitions, 792 flow [2020-10-09 15:28:07,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:07,031 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:07,031 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:07,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 186 mathsat -unsat_core_generation=3 [2020-10-09 15:28:07,232 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:07,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:07,232 INFO L82 PathProgramCache]: Analyzing trace with hash 51927998, now seen corresponding path program 1 times [2020-10-09 15:28:07,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:07,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526960188] [2020-10-09 15:28:07,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 187 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:07,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:07,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:07,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:07,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526960188] [2020-10-09 15:28:07,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:07,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:07,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470249834] [2020-10-09 15:28:07,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:07,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:07,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:07,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:07,427 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 368 [2020-10-09 15:28:07,427 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 328 transitions, 792 flow. Second operand 3 states. [2020-10-09 15:28:07,427 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:07,428 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 368 [2020-10-09 15:28:07,428 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:07,498 INFO L129 PetriNetUnfolder]: 16/392 cut-off events. [2020-10-09 15:28:07,498 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:28:07,508 INFO L80 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 392 events. 16/392 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1600 event pairs, 0 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 474. Up to 14 conditions per place. [2020-10-09 15:28:07,510 INFO L132 encePairwiseOnDemand]: 365/368 looper letters, 5 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2020-10-09 15:28:07,510 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 329 transitions, 808 flow [2020-10-09 15:28:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2020-10-09 15:28:07,511 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9501811594202898 [2020-10-09 15:28:07,511 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1049 transitions. [2020-10-09 15:28:07,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1049 transitions. [2020-10-09 15:28:07,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:07,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1049 transitions. [2020-10-09 15:28:07,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:07,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:07,513 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:07,513 INFO L185 Difference]: Start difference. First operand has 366 places, 328 transitions, 792 flow. Second operand 3 states and 1049 transitions. [2020-10-09 15:28:07,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 329 transitions, 808 flow [2020-10-09 15:28:07,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 329 transitions, 807 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:07,516 INFO L241 Difference]: Finished difference. Result has 369 places, 329 transitions, 805 flow [2020-10-09 15:28:07,516 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=805, PETRI_PLACES=369, PETRI_TRANSITIONS=329} [2020-10-09 15:28:07,516 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 27 predicate places. [2020-10-09 15:28:07,516 INFO L481 AbstractCegarLoop]: Abstraction has has 369 places, 329 transitions, 805 flow [2020-10-09 15:28:07,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:07,517 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:07,517 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:07,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 187 mathsat -unsat_core_generation=3 [2020-10-09 15:28:07,717 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:07,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:07,718 INFO L82 PathProgramCache]: Analyzing trace with hash 51926975, now seen corresponding path program 1 times [2020-10-09 15:28:07,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:07,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844535388] [2020-10-09 15:28:07,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 188 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:07,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:07,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:07,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:07,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844535388] [2020-10-09 15:28:07,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:07,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:07,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111008436] [2020-10-09 15:28:07,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:07,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:07,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:07,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:07,932 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 368 [2020-10-09 15:28:07,933 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 329 transitions, 805 flow. Second operand 3 states. [2020-10-09 15:28:07,933 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:07,933 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 368 [2020-10-09 15:28:07,933 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:08,006 INFO L129 PetriNetUnfolder]: 16/393 cut-off events. [2020-10-09 15:28:08,007 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:08,017 INFO L80 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 393 events. 16/393 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1607 event pairs, 0 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 482. Up to 14 conditions per place. [2020-10-09 15:28:08,018 INFO L132 encePairwiseOnDemand]: 364/368 looper letters, 9 selfloop transitions, 3 changer transitions 0/330 dead transitions. [2020-10-09 15:28:08,019 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 330 transitions, 831 flow [2020-10-09 15:28:08,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:08,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2020-10-09 15:28:08,020 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9411231884057971 [2020-10-09 15:28:08,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1039 transitions. [2020-10-09 15:28:08,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1039 transitions. [2020-10-09 15:28:08,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:08,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1039 transitions. [2020-10-09 15:28:08,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:08,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:08,021 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:08,021 INFO L185 Difference]: Start difference. First operand has 369 places, 329 transitions, 805 flow. Second operand 3 states and 1039 transitions. [2020-10-09 15:28:08,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 330 transitions, 831 flow [2020-10-09 15:28:08,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 330 transitions, 829 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:08,025 INFO L241 Difference]: Finished difference. Result has 372 places, 330 transitions, 821 flow [2020-10-09 15:28:08,025 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=372, PETRI_TRANSITIONS=330} [2020-10-09 15:28:08,025 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 30 predicate places. [2020-10-09 15:28:08,025 INFO L481 AbstractCegarLoop]: Abstraction has has 372 places, 330 transitions, 821 flow [2020-10-09 15:28:08,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:08,025 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:08,026 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:08,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 188 mathsat -unsat_core_generation=3 [2020-10-09 15:28:08,226 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:08,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:08,227 INFO L82 PathProgramCache]: Analyzing trace with hash 52880287, now seen corresponding path program 1 times [2020-10-09 15:28:08,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:08,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059718925] [2020-10-09 15:28:08,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 189 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:08,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:08,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:08,406 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:08,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:08,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059718925] [2020-10-09 15:28:08,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:08,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:08,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232178021] [2020-10-09 15:28:08,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:08,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:08,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:08,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:08,422 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 368 [2020-10-09 15:28:08,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 330 transitions, 821 flow. Second operand 3 states. [2020-10-09 15:28:08,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:08,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 368 [2020-10-09 15:28:08,423 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:08,495 INFO L129 PetriNetUnfolder]: 15/389 cut-off events. [2020-10-09 15:28:08,495 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:08,506 INFO L80 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 389 events. 15/389 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1580 event pairs, 0 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 474. Up to 14 conditions per place. [2020-10-09 15:28:08,507 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 4 selfloop transitions, 1 changer transitions 0/327 dead transitions. [2020-10-09 15:28:08,507 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 327 transitions, 816 flow [2020-10-09 15:28:08,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1050 transitions. [2020-10-09 15:28:08,508 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510869565217391 [2020-10-09 15:28:08,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1050 transitions. [2020-10-09 15:28:08,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1050 transitions. [2020-10-09 15:28:08,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:08,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1050 transitions. [2020-10-09 15:28:08,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:08,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:08,510 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:08,510 INFO L185 Difference]: Start difference. First operand has 372 places, 330 transitions, 821 flow. Second operand 3 states and 1050 transitions. [2020-10-09 15:28:08,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 327 transitions, 816 flow [2020-10-09 15:28:08,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 327 transitions, 808 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:08,513 INFO L241 Difference]: Finished difference. Result has 371 places, 327 transitions, 800 flow [2020-10-09 15:28:08,513 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=371, PETRI_TRANSITIONS=327} [2020-10-09 15:28:08,513 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 29 predicate places. [2020-10-09 15:28:08,513 INFO L481 AbstractCegarLoop]: Abstraction has has 371 places, 327 transitions, 800 flow [2020-10-09 15:28:08,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:08,514 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:08,514 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:08,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 189 mathsat -unsat_core_generation=3 [2020-10-09 15:28:08,714 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:08,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:08,715 INFO L82 PathProgramCache]: Analyzing trace with hash 52881310, now seen corresponding path program 1 times [2020-10-09 15:28:08,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:08,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456532246] [2020-10-09 15:28:08,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 190 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 190 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:08,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:08,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:08,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:08,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456532246] [2020-10-09 15:28:08,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:08,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:08,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027409797] [2020-10-09 15:28:08,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:08,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:08,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:08,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:08,948 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 368 [2020-10-09 15:28:08,949 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 327 transitions, 800 flow. Second operand 3 states. [2020-10-09 15:28:08,949 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:08,949 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 368 [2020-10-09 15:28:08,949 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:09,034 INFO L129 PetriNetUnfolder]: 15/387 cut-off events. [2020-10-09 15:28:09,035 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:28:09,050 INFO L80 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 387 events. 15/387 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1563 event pairs, 0 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 478. Up to 14 conditions per place. [2020-10-09 15:28:09,052 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 8 selfloop transitions, 1 changer transitions 0/325 dead transitions. [2020-10-09 15:28:09,053 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 325 transitions, 813 flow [2020-10-09 15:28:09,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:09,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1036 transitions. [2020-10-09 15:28:09,054 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9384057971014492 [2020-10-09 15:28:09,054 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1036 transitions. [2020-10-09 15:28:09,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1036 transitions. [2020-10-09 15:28:09,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:09,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1036 transitions. [2020-10-09 15:28:09,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:09,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:09,058 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:09,058 INFO L185 Difference]: Start difference. First operand has 371 places, 327 transitions, 800 flow. Second operand 3 states and 1036 transitions. [2020-10-09 15:28:09,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 325 transitions, 813 flow [2020-10-09 15:28:09,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 325 transitions, 812 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:09,065 INFO L241 Difference]: Finished difference. Result has 370 places, 325 transitions, 796 flow [2020-10-09 15:28:09,065 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=370, PETRI_TRANSITIONS=325} [2020-10-09 15:28:09,065 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 28 predicate places. [2020-10-09 15:28:09,066 INFO L481 AbstractCegarLoop]: Abstraction has has 370 places, 325 transitions, 796 flow [2020-10-09 15:28:09,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:09,066 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:09,066 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:09,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 190 mathsat -unsat_core_generation=3 [2020-10-09 15:28:09,279 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:09,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:09,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1385381076, now seen corresponding path program 1 times [2020-10-09 15:28:09,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:09,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325166876] [2020-10-09 15:28:09,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 191 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 191 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:09,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:09,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:09,460 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:09,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:09,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325166876] [2020-10-09 15:28:09,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:09,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:09,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717560007] [2020-10-09 15:28:09,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:09,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:09,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:09,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:09,477 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 368 [2020-10-09 15:28:09,477 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 325 transitions, 796 flow. Second operand 3 states. [2020-10-09 15:28:09,478 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:09,478 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 368 [2020-10-09 15:28:09,478 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:09,553 INFO L129 PetriNetUnfolder]: 14/394 cut-off events. [2020-10-09 15:28:09,553 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:28:09,563 INFO L80 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 394 events. 14/394 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1625 event pairs, 0 based on Foata normal form. 1/368 useless extension candidates. Maximal degree in co-relation 481. Up to 14 conditions per place. [2020-10-09 15:28:09,564 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 4 selfloop transitions, 1 changer transitions 0/325 dead transitions. [2020-10-09 15:28:09,564 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 325 transitions, 806 flow [2020-10-09 15:28:09,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1050 transitions. [2020-10-09 15:28:09,565 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510869565217391 [2020-10-09 15:28:09,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1050 transitions. [2020-10-09 15:28:09,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1050 transitions. [2020-10-09 15:28:09,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:09,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1050 transitions. [2020-10-09 15:28:09,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:09,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:09,567 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:09,567 INFO L185 Difference]: Start difference. First operand has 370 places, 325 transitions, 796 flow. Second operand 3 states and 1050 transitions. [2020-10-09 15:28:09,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 325 transitions, 806 flow [2020-10-09 15:28:09,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 325 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:09,571 INFO L241 Difference]: Finished difference. Result has 372 places, 325 transitions, 800 flow [2020-10-09 15:28:09,571 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=372, PETRI_TRANSITIONS=325} [2020-10-09 15:28:09,571 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 30 predicate places. [2020-10-09 15:28:09,571 INFO L481 AbstractCegarLoop]: Abstraction has has 372 places, 325 transitions, 800 flow [2020-10-09 15:28:09,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:09,571 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:09,571 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:09,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 191 mathsat -unsat_core_generation=3 [2020-10-09 15:28:09,783 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:09,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:09,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1385382099, now seen corresponding path program 1 times [2020-10-09 15:28:09,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:09,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501205301] [2020-10-09 15:28:09,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 192 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 192 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:09,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:09,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:09,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:09,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501205301] [2020-10-09 15:28:09,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:09,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:09,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233739510] [2020-10-09 15:28:09,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:09,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:09,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:09,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:09,998 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 368 [2020-10-09 15:28:09,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 325 transitions, 800 flow. Second operand 3 states. [2020-10-09 15:28:09,999 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:09,999 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 368 [2020-10-09 15:28:09,999 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:10,073 INFO L129 PetriNetUnfolder]: 12/396 cut-off events. [2020-10-09 15:28:10,074 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:10,084 INFO L80 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 396 events. 12/396 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1657 event pairs, 0 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 494. Up to 14 conditions per place. [2020-10-09 15:28:10,085 INFO L132 encePairwiseOnDemand]: 364/368 looper letters, 9 selfloop transitions, 3 changer transitions 0/326 dead transitions. [2020-10-09 15:28:10,085 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 326 transitions, 826 flow [2020-10-09 15:28:10,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:10,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2020-10-09 15:28:10,086 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9411231884057971 [2020-10-09 15:28:10,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1039 transitions. [2020-10-09 15:28:10,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1039 transitions. [2020-10-09 15:28:10,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:10,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1039 transitions. [2020-10-09 15:28:10,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:10,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:10,087 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:10,088 INFO L185 Difference]: Start difference. First operand has 372 places, 325 transitions, 800 flow. Second operand 3 states and 1039 transitions. [2020-10-09 15:28:10,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 326 transitions, 826 flow [2020-10-09 15:28:10,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 326 transitions, 825 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:10,092 INFO L241 Difference]: Finished difference. Result has 375 places, 326 transitions, 817 flow [2020-10-09 15:28:10,093 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=817, PETRI_PLACES=375, PETRI_TRANSITIONS=326} [2020-10-09 15:28:10,093 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 33 predicate places. [2020-10-09 15:28:10,093 INFO L481 AbstractCegarLoop]: Abstraction has has 375 places, 326 transitions, 817 flow [2020-10-09 15:28:10,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:10,093 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:10,093 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:10,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 192 mathsat -unsat_core_generation=3 [2020-10-09 15:28:10,304 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:10,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:10,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1384428787, now seen corresponding path program 1 times [2020-10-09 15:28:10,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:10,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833421828] [2020-10-09 15:28:10,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 193 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:10,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:10,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:10,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:10,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833421828] [2020-10-09 15:28:10,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:10,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:10,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958049962] [2020-10-09 15:28:10,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:10,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:10,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:10,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:10,512 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 368 [2020-10-09 15:28:10,512 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 326 transitions, 817 flow. Second operand 3 states. [2020-10-09 15:28:10,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:10,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 368 [2020-10-09 15:28:10,513 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:10,630 INFO L129 PetriNetUnfolder]: 12/389 cut-off events. [2020-10-09 15:28:10,630 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:10,646 INFO L80 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 389 events. 12/389 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1598 event pairs, 0 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 480. Up to 14 conditions per place. [2020-10-09 15:28:10,647 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 5 selfloop transitions, 1 changer transitions 0/324 dead transitions. [2020-10-09 15:28:10,647 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 324 transitions, 819 flow [2020-10-09 15:28:10,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1048 transitions. [2020-10-09 15:28:10,649 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9492753623188406 [2020-10-09 15:28:10,649 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1048 transitions. [2020-10-09 15:28:10,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1048 transitions. [2020-10-09 15:28:10,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:10,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1048 transitions. [2020-10-09 15:28:10,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:10,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:10,651 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:10,651 INFO L185 Difference]: Start difference. First operand has 375 places, 326 transitions, 817 flow. Second operand 3 states and 1048 transitions. [2020-10-09 15:28:10,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 324 transitions, 819 flow [2020-10-09 15:28:10,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 324 transitions, 811 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:10,656 INFO L241 Difference]: Finished difference. Result has 375 places, 324 transitions, 804 flow [2020-10-09 15:28:10,657 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=375, PETRI_TRANSITIONS=324} [2020-10-09 15:28:10,657 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 33 predicate places. [2020-10-09 15:28:10,657 INFO L481 AbstractCegarLoop]: Abstraction has has 375 places, 324 transitions, 804 flow [2020-10-09 15:28:10,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:10,657 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:10,657 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:10,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 193 mathsat -unsat_core_generation=3 [2020-10-09 15:28:10,870 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:10,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:10,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1384427764, now seen corresponding path program 1 times [2020-10-09 15:28:10,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:10,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579135036] [2020-10-09 15:28:10,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 194 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:11,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:11,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:11,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:11,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579135036] [2020-10-09 15:28:11,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:11,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:11,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901312449] [2020-10-09 15:28:11,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:11,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:11,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:11,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:11,088 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 368 [2020-10-09 15:28:11,089 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 324 transitions, 804 flow. Second operand 3 states. [2020-10-09 15:28:11,089 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:11,089 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 368 [2020-10-09 15:28:11,089 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:11,162 INFO L129 PetriNetUnfolder]: 12/387 cut-off events. [2020-10-09 15:28:11,162 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:11,172 INFO L80 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 387 events. 12/387 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1580 event pairs, 0 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 484. Up to 14 conditions per place. [2020-10-09 15:28:11,173 INFO L132 encePairwiseOnDemand]: 366/368 looper letters, 8 selfloop transitions, 1 changer transitions 0/322 dead transitions. [2020-10-09 15:28:11,173 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 322 transitions, 817 flow [2020-10-09 15:28:11,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1036 transitions. [2020-10-09 15:28:11,174 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9384057971014492 [2020-10-09 15:28:11,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1036 transitions. [2020-10-09 15:28:11,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1036 transitions. [2020-10-09 15:28:11,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:11,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1036 transitions. [2020-10-09 15:28:11,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:11,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:11,176 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:11,176 INFO L185 Difference]: Start difference. First operand has 375 places, 324 transitions, 804 flow. Second operand 3 states and 1036 transitions. [2020-10-09 15:28:11,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 322 transitions, 817 flow [2020-10-09 15:28:11,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 322 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:11,179 INFO L241 Difference]: Finished difference. Result has 374 places, 322 transitions, 800 flow [2020-10-09 15:28:11,179 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=374, PETRI_TRANSITIONS=322} [2020-10-09 15:28:11,179 INFO L341 CegarLoopForPetriNet]: 342 programPoint places, 32 predicate places. [2020-10-09 15:28:11,180 INFO L481 AbstractCegarLoop]: Abstraction has has 374 places, 322 transitions, 800 flow [2020-10-09 15:28:11,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:11,180 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:11,180 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:11,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 194 mathsat -unsat_core_generation=3 [2020-10-09 15:28:11,380 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:11,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:11,381 INFO L82 PathProgramCache]: Analyzing trace with hash -814866638, now seen corresponding path program 1 times [2020-10-09 15:28:11,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:11,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524373279] [2020-10-09 15:28:11,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 195 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:28:11,578 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:28:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:28:11,602 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:28:11,638 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:28:11,638 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:28:11,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 195 mathsat -unsat_core_generation=3 [2020-10-09 15:28:11,839 WARN L371 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:28:11,839 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2020-10-09 15:28:11,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,866 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,866 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,866 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,866 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,866 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,868 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,868 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,871 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,871 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,871 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,871 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,874 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,874 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,874 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,874 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,874 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,875 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,875 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,875 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,875 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,875 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,875 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,875 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,880 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,880 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,880 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,880 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,880 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,880 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,880 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,883 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,883 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,883 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,883 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,883 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,915 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,920 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,920 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,920 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,924 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,925 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,925 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,925 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,925 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,927 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,928 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,928 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,928 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,929 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,929 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,929 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,929 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,930 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,930 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,931 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,931 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,931 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,931 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,931 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,931 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,931 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,931 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,931 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,932 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,933 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,933 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,933 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,933 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,933 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,933 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,933 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,933 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,933 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,934 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,934 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,934 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,934 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,935 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,935 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,935 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,935 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,935 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,935 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,935 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,935 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,936 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,936 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,936 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:11,937 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-10-09 15:28:11,938 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:28:11,938 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:28:11,938 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:28:11,938 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:28:11,938 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:28:11,938 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:28:11,938 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:28:11,938 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:28:11,942 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 367 places, 395 transitions, 1042 flow [2020-10-09 15:28:12,021 INFO L129 PetriNetUnfolder]: 71/520 cut-off events. [2020-10-09 15:28:12,021 INFO L130 PetriNetUnfolder]: For 546/546 co-relation queries the response was YES. [2020-10-09 15:28:12,037 INFO L80 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 520 events. 71/520 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2088 event pairs, 0 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 609. Up to 30 conditions per place. [2020-10-09 15:28:12,037 INFO L82 GeneralOperation]: Start removeDead. Operand has 367 places, 395 transitions, 1042 flow [2020-10-09 15:28:12,044 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 367 places, 395 transitions, 1042 flow [2020-10-09 15:28:12,049 INFO L129 PetriNetUnfolder]: 9/96 cut-off events. [2020-10-09 15:28:12,049 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:28:12,049 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:12,049 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:12,049 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:12,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:12,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1161619809, now seen corresponding path program 1 times [2020-10-09 15:28:12,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:12,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542852470] [2020-10-09 15:28:12,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 196 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 196 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:12,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:12,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:12,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:28:12,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:28:12,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542852470] [2020-10-09 15:28:12,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:12,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:12,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245969882] [2020-10-09 15:28:12,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:12,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:12,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:12,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:12,251 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 395 [2020-10-09 15:28:12,251 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 395 transitions, 1042 flow. Second operand 3 states. [2020-10-09 15:28:12,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:12,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 395 [2020-10-09 15:28:12,252 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:12,324 INFO L129 PetriNetUnfolder]: 40/421 cut-off events. [2020-10-09 15:28:12,324 INFO L130 PetriNetUnfolder]: For 547/547 co-relation queries the response was YES. [2020-10-09 15:28:12,336 INFO L80 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 421 events. 40/421 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1590 event pairs, 0 based on Foata normal form. 58/423 useless extension candidates. Maximal degree in co-relation 521. Up to 15 conditions per place. [2020-10-09 15:28:12,339 INFO L132 encePairwiseOnDemand]: 376/395 looper letters, 5 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2020-10-09 15:28:12,339 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 376 transitions, 1018 flow [2020-10-09 15:28:12,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:12,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1159 transitions. [2020-10-09 15:28:12,341 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9780590717299578 [2020-10-09 15:28:12,341 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1159 transitions. [2020-10-09 15:28:12,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1159 transitions. [2020-10-09 15:28:12,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:12,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1159 transitions. [2020-10-09 15:28:12,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:12,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:12,342 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:12,342 INFO L185 Difference]: Start difference. First operand has 367 places, 395 transitions, 1042 flow. Second operand 3 states and 1159 transitions. [2020-10-09 15:28:12,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 376 transitions, 1018 flow [2020-10-09 15:28:12,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 376 transitions, 836 flow, removed 91 selfloop flow, removed 0 redundant places. [2020-10-09 15:28:12,348 INFO L241 Difference]: Finished difference. Result has 366 places, 376 transitions, 834 flow [2020-10-09 15:28:12,348 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=366, PETRI_TRANSITIONS=376} [2020-10-09 15:28:12,349 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, -1 predicate places. [2020-10-09 15:28:12,349 INFO L481 AbstractCegarLoop]: Abstraction has has 366 places, 376 transitions, 834 flow [2020-10-09 15:28:12,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:12,349 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:12,349 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:12,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 196 mathsat -unsat_core_generation=3 [2020-10-09 15:28:12,560 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:12,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:12,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1162573121, now seen corresponding path program 1 times [2020-10-09 15:28:12,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:12,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547014852] [2020-10-09 15:28:12,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 197 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 197 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:12,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:12,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:28:12,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:28:12,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547014852] [2020-10-09 15:28:12,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:12,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:12,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86080330] [2020-10-09 15:28:12,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:12,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:12,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:12,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:12,767 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:12,768 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 376 transitions, 834 flow. Second operand 3 states. [2020-10-09 15:28:12,768 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:12,768 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:12,768 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:12,837 INFO L129 PetriNetUnfolder]: 40/420 cut-off events. [2020-10-09 15:28:12,838 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:12,849 INFO L80 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 420 events. 40/420 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1582 event pairs, 0 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 461. Up to 15 conditions per place. [2020-10-09 15:28:12,852 INFO L132 encePairwiseOnDemand]: 391/395 looper letters, 9 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2020-10-09 15:28:12,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 376 transitions, 856 flow [2020-10-09 15:28:12,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1117 transitions. [2020-10-09 15:28:12,853 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9426160337552743 [2020-10-09 15:28:12,853 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1117 transitions. [2020-10-09 15:28:12,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1117 transitions. [2020-10-09 15:28:12,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:12,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1117 transitions. [2020-10-09 15:28:12,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:12,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:12,855 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:12,855 INFO L185 Difference]: Start difference. First operand has 366 places, 376 transitions, 834 flow. Second operand 3 states and 1117 transitions. [2020-10-09 15:28:12,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 376 transitions, 856 flow [2020-10-09 15:28:12,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 376 transitions, 854 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:12,858 INFO L241 Difference]: Finished difference. Result has 369 places, 376 transitions, 844 flow [2020-10-09 15:28:12,859 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=844, PETRI_PLACES=369, PETRI_TRANSITIONS=376} [2020-10-09 15:28:12,859 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 2 predicate places. [2020-10-09 15:28:12,859 INFO L481 AbstractCegarLoop]: Abstraction has has 369 places, 376 transitions, 844 flow [2020-10-09 15:28:12,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:12,859 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:12,859 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:13,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 197 mathsat -unsat_core_generation=3 [2020-10-09 15:28:13,060 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:13,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:13,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1162572098, now seen corresponding path program 1 times [2020-10-09 15:28:13,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:13,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368089953] [2020-10-09 15:28:13,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 198 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 198 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:13,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:13,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:13,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:28:13,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:28:13,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368089953] [2020-10-09 15:28:13,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:13,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:13,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604350450] [2020-10-09 15:28:13,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:13,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:13,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:13,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:13,258 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 395 [2020-10-09 15:28:13,259 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 376 transitions, 844 flow. Second operand 3 states. [2020-10-09 15:28:13,259 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:13,259 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 395 [2020-10-09 15:28:13,259 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:13,325 INFO L129 PetriNetUnfolder]: 39/418 cut-off events. [2020-10-09 15:28:13,325 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:13,336 INFO L80 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 418 events. 39/418 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1573 event pairs, 0 based on Foata normal form. 1/367 useless extension candidates. Maximal degree in co-relation 459. Up to 15 conditions per place. [2020-10-09 15:28:13,339 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 4 selfloop transitions, 1 changer transitions 0/374 dead transitions. [2020-10-09 15:28:13,339 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 374 transitions, 845 flow [2020-10-09 15:28:13,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2020-10-09 15:28:13,340 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518987341772152 [2020-10-09 15:28:13,340 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1128 transitions. [2020-10-09 15:28:13,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1128 transitions. [2020-10-09 15:28:13,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:13,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1128 transitions. [2020-10-09 15:28:13,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:13,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:13,341 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:13,342 INFO L185 Difference]: Start difference. First operand has 369 places, 376 transitions, 844 flow. Second operand 3 states and 1128 transitions. [2020-10-09 15:28:13,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 374 transitions, 845 flow [2020-10-09 15:28:13,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 374 transitions, 839 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-09 15:28:13,345 INFO L241 Difference]: Finished difference. Result has 369 places, 374 transitions, 831 flow [2020-10-09 15:28:13,345 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=831, PETRI_PLACES=369, PETRI_TRANSITIONS=374} [2020-10-09 15:28:13,345 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 2 predicate places. [2020-10-09 15:28:13,345 INFO L481 AbstractCegarLoop]: Abstraction has has 369 places, 374 transitions, 831 flow [2020-10-09 15:28:13,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:13,345 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:13,345 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:13,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 198 mathsat -unsat_core_generation=3 [2020-10-09 15:28:13,546 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:13,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:13,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1161618786, now seen corresponding path program 1 times [2020-10-09 15:28:13,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:13,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217752908] [2020-10-09 15:28:13,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 199 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 199 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:13,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:13,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:13,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:28:13,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:28:13,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217752908] [2020-10-09 15:28:13,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:13,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:13,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305765063] [2020-10-09 15:28:13,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:13,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:13,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:13,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:13,770 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:13,770 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 374 transitions, 831 flow. Second operand 3 states. [2020-10-09 15:28:13,771 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:13,771 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:13,771 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:13,875 INFO L129 PetriNetUnfolder]: 39/416 cut-off events. [2020-10-09 15:28:13,876 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-09 15:28:13,882 INFO L80 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 416 events. 39/416 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1563 event pairs, 0 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 465. Up to 15 conditions per place. [2020-10-09 15:28:13,885 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 8 selfloop transitions, 1 changer transitions 0/372 dead transitions. [2020-10-09 15:28:13,885 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 372 transitions, 843 flow [2020-10-09 15:28:13,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:13,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1114 transitions. [2020-10-09 15:28:13,886 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.940084388185654 [2020-10-09 15:28:13,886 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1114 transitions. [2020-10-09 15:28:13,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1114 transitions. [2020-10-09 15:28:13,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:13,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1114 transitions. [2020-10-09 15:28:13,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:13,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:13,888 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:13,888 INFO L185 Difference]: Start difference. First operand has 369 places, 374 transitions, 831 flow. Second operand 3 states and 1114 transitions. [2020-10-09 15:28:13,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 372 transitions, 843 flow [2020-10-09 15:28:13,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 372 transitions, 842 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:13,891 INFO L241 Difference]: Finished difference. Result has 368 places, 372 transitions, 826 flow [2020-10-09 15:28:13,891 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=368, PETRI_TRANSITIONS=372} [2020-10-09 15:28:13,891 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 1 predicate places. [2020-10-09 15:28:13,891 INFO L481 AbstractCegarLoop]: Abstraction has has 368 places, 372 transitions, 826 flow [2020-10-09 15:28:13,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:13,891 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:13,891 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:28:14,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 199 mathsat -unsat_core_generation=3 [2020-10-09 15:28:14,092 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:14,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:14,093 INFO L82 PathProgramCache]: Analyzing trace with hash -562489367, now seen corresponding path program 1 times [2020-10-09 15:28:14,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:14,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934647950] [2020-10-09 15:28:14,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 200 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 200 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:14,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:14,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:28:14,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:28:14,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934647950] [2020-10-09 15:28:14,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:14,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:14,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232445511] [2020-10-09 15:28:14,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:14,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:14,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:14,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:14,287 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 395 [2020-10-09 15:28:14,287 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 372 transitions, 826 flow. Second operand 3 states. [2020-10-09 15:28:14,287 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:14,288 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 395 [2020-10-09 15:28:14,288 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:14,357 INFO L129 PetriNetUnfolder]: 37/421 cut-off events. [2020-10-09 15:28:14,357 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:14,368 INFO L80 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 421 events. 37/421 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1611 event pairs, 0 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 467. Up to 15 conditions per place. [2020-10-09 15:28:14,371 INFO L132 encePairwiseOnDemand]: 392/395 looper letters, 5 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2020-10-09 15:28:14,371 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 373 transitions, 842 flow [2020-10-09 15:28:14,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1127 transitions. [2020-10-09 15:28:14,372 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510548523206751 [2020-10-09 15:28:14,372 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1127 transitions. [2020-10-09 15:28:14,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1127 transitions. [2020-10-09 15:28:14,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:14,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1127 transitions. [2020-10-09 15:28:14,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:14,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:14,374 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:14,374 INFO L185 Difference]: Start difference. First operand has 368 places, 372 transitions, 826 flow. Second operand 3 states and 1127 transitions. [2020-10-09 15:28:14,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 373 transitions, 842 flow [2020-10-09 15:28:14,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 373 transitions, 841 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:14,378 INFO L241 Difference]: Finished difference. Result has 371 places, 373 transitions, 839 flow [2020-10-09 15:28:14,378 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=839, PETRI_PLACES=371, PETRI_TRANSITIONS=373} [2020-10-09 15:28:14,378 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 4 predicate places. [2020-10-09 15:28:14,378 INFO L481 AbstractCegarLoop]: Abstraction has has 371 places, 373 transitions, 839 flow [2020-10-09 15:28:14,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:14,378 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:14,378 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:28:14,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 200 mathsat -unsat_core_generation=3 [2020-10-09 15:28:14,579 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:14,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:14,579 INFO L82 PathProgramCache]: Analyzing trace with hash -562490390, now seen corresponding path program 1 times [2020-10-09 15:28:14,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:14,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557937909] [2020-10-09 15:28:14,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 201 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 201 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:14,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:14,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:28:14,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:28:14,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557937909] [2020-10-09 15:28:14,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:14,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:14,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532648875] [2020-10-09 15:28:14,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:14,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:14,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:14,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:14,794 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:14,795 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 373 transitions, 839 flow. Second operand 3 states. [2020-10-09 15:28:14,795 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:14,795 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:14,795 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:14,867 INFO L129 PetriNetUnfolder]: 37/422 cut-off events. [2020-10-09 15:28:14,867 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:14,879 INFO L80 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 422 events. 37/422 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1623 event pairs, 0 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 475. Up to 15 conditions per place. [2020-10-09 15:28:14,882 INFO L132 encePairwiseOnDemand]: 391/395 looper letters, 9 selfloop transitions, 3 changer transitions 0/374 dead transitions. [2020-10-09 15:28:14,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 374 transitions, 865 flow [2020-10-09 15:28:14,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1117 transitions. [2020-10-09 15:28:14,883 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9426160337552743 [2020-10-09 15:28:14,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1117 transitions. [2020-10-09 15:28:14,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1117 transitions. [2020-10-09 15:28:14,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:14,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1117 transitions. [2020-10-09 15:28:14,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:14,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:14,884 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:14,884 INFO L185 Difference]: Start difference. First operand has 371 places, 373 transitions, 839 flow. Second operand 3 states and 1117 transitions. [2020-10-09 15:28:14,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 374 transitions, 865 flow [2020-10-09 15:28:14,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 374 transitions, 863 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:14,888 INFO L241 Difference]: Finished difference. Result has 374 places, 374 transitions, 855 flow [2020-10-09 15:28:14,888 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=855, PETRI_PLACES=374, PETRI_TRANSITIONS=374} [2020-10-09 15:28:14,888 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 7 predicate places. [2020-10-09 15:28:14,888 INFO L481 AbstractCegarLoop]: Abstraction has has 374 places, 374 transitions, 855 flow [2020-10-09 15:28:14,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:14,888 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:14,888 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:28:15,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 201 mathsat -unsat_core_generation=3 [2020-10-09 15:28:15,089 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:15,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:15,089 INFO L82 PathProgramCache]: Analyzing trace with hash -561537078, now seen corresponding path program 1 times [2020-10-09 15:28:15,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:15,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085131100] [2020-10-09 15:28:15,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 202 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 202 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:15,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:15,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:28:15,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:15,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:28:15,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085131100] [2020-10-09 15:28:15,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:15,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:15,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888762852] [2020-10-09 15:28:15,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:15,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:15,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:15,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:15,302 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 395 [2020-10-09 15:28:15,302 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 374 transitions, 855 flow. Second operand 3 states. [2020-10-09 15:28:15,302 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:15,303 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 395 [2020-10-09 15:28:15,303 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:15,369 INFO L129 PetriNetUnfolder]: 36/418 cut-off events. [2020-10-09 15:28:15,370 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:28:15,380 INFO L80 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 418 events. 36/418 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1595 event pairs, 0 based on Foata normal form. 1/370 useless extension candidates. Maximal degree in co-relation 467. Up to 15 conditions per place. [2020-10-09 15:28:15,383 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 4 selfloop transitions, 1 changer transitions 0/371 dead transitions. [2020-10-09 15:28:15,383 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 371 transitions, 850 flow [2020-10-09 15:28:15,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2020-10-09 15:28:15,384 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518987341772152 [2020-10-09 15:28:15,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1128 transitions. [2020-10-09 15:28:15,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1128 transitions. [2020-10-09 15:28:15,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:15,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1128 transitions. [2020-10-09 15:28:15,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:15,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:15,386 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:15,386 INFO L185 Difference]: Start difference. First operand has 374 places, 374 transitions, 855 flow. Second operand 3 states and 1128 transitions. [2020-10-09 15:28:15,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 371 transitions, 850 flow [2020-10-09 15:28:15,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 371 transitions, 842 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:15,389 INFO L241 Difference]: Finished difference. Result has 373 places, 371 transitions, 834 flow [2020-10-09 15:28:15,390 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=373, PETRI_TRANSITIONS=371} [2020-10-09 15:28:15,390 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 6 predicate places. [2020-10-09 15:28:15,390 INFO L481 AbstractCegarLoop]: Abstraction has has 373 places, 371 transitions, 834 flow [2020-10-09 15:28:15,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:15,390 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:15,390 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:28:15,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 202 mathsat -unsat_core_generation=3 [2020-10-09 15:28:15,591 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:15,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:15,591 INFO L82 PathProgramCache]: Analyzing trace with hash -561536055, now seen corresponding path program 1 times [2020-10-09 15:28:15,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:15,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634765145] [2020-10-09 15:28:15,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 203 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 203 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:15,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:15,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:28:15,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:28:15,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634765145] [2020-10-09 15:28:15,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:15,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:15,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840084064] [2020-10-09 15:28:15,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:15,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:15,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:15,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:15,804 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:15,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 371 transitions, 834 flow. Second operand 3 states. [2020-10-09 15:28:15,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:15,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:15,805 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:15,881 INFO L129 PetriNetUnfolder]: 36/416 cut-off events. [2020-10-09 15:28:15,881 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:15,892 INFO L80 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 416 events. 36/416 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1580 event pairs, 0 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 472. Up to 15 conditions per place. [2020-10-09 15:28:15,894 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 8 selfloop transitions, 1 changer transitions 0/369 dead transitions. [2020-10-09 15:28:15,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 369 transitions, 847 flow [2020-10-09 15:28:15,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1114 transitions. [2020-10-09 15:28:15,896 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.940084388185654 [2020-10-09 15:28:15,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1114 transitions. [2020-10-09 15:28:15,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1114 transitions. [2020-10-09 15:28:15,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:15,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1114 transitions. [2020-10-09 15:28:15,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:15,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:15,897 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:15,897 INFO L185 Difference]: Start difference. First operand has 373 places, 371 transitions, 834 flow. Second operand 3 states and 1114 transitions. [2020-10-09 15:28:15,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 369 transitions, 847 flow [2020-10-09 15:28:15,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 369 transitions, 846 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:15,901 INFO L241 Difference]: Finished difference. Result has 372 places, 369 transitions, 830 flow [2020-10-09 15:28:15,901 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=830, PETRI_PLACES=372, PETRI_TRANSITIONS=369} [2020-10-09 15:28:15,901 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 5 predicate places. [2020-10-09 15:28:15,901 INFO L481 AbstractCegarLoop]: Abstraction has has 372 places, 369 transitions, 830 flow [2020-10-09 15:28:15,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:15,901 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:15,901 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:28:16,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 203 mathsat -unsat_core_generation=3 [2020-10-09 15:28:16,102 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:16,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:16,103 INFO L82 PathProgramCache]: Analyzing trace with hash 637191795, now seen corresponding path program 1 times [2020-10-09 15:28:16,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:16,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437684304] [2020-10-09 15:28:16,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 204 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 204 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:16,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:16,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:28:16,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:28:16,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437684304] [2020-10-09 15:28:16,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:16,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:16,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76477142] [2020-10-09 15:28:16,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:16,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:16,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:16,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:16,307 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:16,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 369 transitions, 830 flow. Second operand 3 states. [2020-10-09 15:28:16,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:16,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:16,308 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:16,417 INFO L129 PetriNetUnfolder]: 35/424 cut-off events. [2020-10-09 15:28:16,418 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:16,425 INFO L80 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 424 events. 35/424 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1650 event pairs, 0 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 484. Up to 15 conditions per place. [2020-10-09 15:28:16,427 INFO L132 encePairwiseOnDemand]: 390/395 looper letters, 10 selfloop transitions, 3 changer transitions 0/371 dead transitions. [2020-10-09 15:28:16,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 371 transitions, 860 flow [2020-10-09 15:28:16,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1119 transitions. [2020-10-09 15:28:16,428 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9443037974683545 [2020-10-09 15:28:16,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1119 transitions. [2020-10-09 15:28:16,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1119 transitions. [2020-10-09 15:28:16,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:16,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1119 transitions. [2020-10-09 15:28:16,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:16,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:16,430 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:16,430 INFO L185 Difference]: Start difference. First operand has 372 places, 369 transitions, 830 flow. Second operand 3 states and 1119 transitions. [2020-10-09 15:28:16,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 371 transitions, 860 flow [2020-10-09 15:28:16,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 371 transitions, 859 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:16,433 INFO L241 Difference]: Finished difference. Result has 375 places, 371 transitions, 853 flow [2020-10-09 15:28:16,433 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=853, PETRI_PLACES=375, PETRI_TRANSITIONS=371} [2020-10-09 15:28:16,434 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 8 predicate places. [2020-10-09 15:28:16,434 INFO L481 AbstractCegarLoop]: Abstraction has has 375 places, 371 transitions, 853 flow [2020-10-09 15:28:16,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:16,434 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:16,434 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:28:16,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 204 mathsat -unsat_core_generation=3 [2020-10-09 15:28:16,635 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:16,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:16,635 INFO L82 PathProgramCache]: Analyzing trace with hash 637192818, now seen corresponding path program 1 times [2020-10-09 15:28:16,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:16,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197712774] [2020-10-09 15:28:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 205 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 205 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:16,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:16,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:28:16,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:28:16,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197712774] [2020-10-09 15:28:16,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:16,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:16,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687623458] [2020-10-09 15:28:16,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:16,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:16,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:16,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:16,834 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 395 [2020-10-09 15:28:16,835 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 371 transitions, 853 flow. Second operand 3 states. [2020-10-09 15:28:16,835 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:16,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 395 [2020-10-09 15:28:16,835 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:16,936 INFO L129 PetriNetUnfolder]: 34/422 cut-off events. [2020-10-09 15:28:16,936 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:28:16,947 INFO L80 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 422 events. 34/422 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1637 event pairs, 0 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 480. Up to 15 conditions per place. [2020-10-09 15:28:16,950 INFO L132 encePairwiseOnDemand]: 392/395 looper letters, 5 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2020-10-09 15:28:16,950 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 371 transitions, 865 flow [2020-10-09 15:28:16,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:16,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1127 transitions. [2020-10-09 15:28:16,951 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510548523206751 [2020-10-09 15:28:16,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1127 transitions. [2020-10-09 15:28:16,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1127 transitions. [2020-10-09 15:28:16,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:16,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1127 transitions. [2020-10-09 15:28:16,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:16,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:16,953 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:16,953 INFO L185 Difference]: Start difference. First operand has 375 places, 371 transitions, 853 flow. Second operand 3 states and 1127 transitions. [2020-10-09 15:28:16,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 371 transitions, 865 flow [2020-10-09 15:28:16,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 371 transitions, 860 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:16,959 INFO L241 Difference]: Finished difference. Result has 378 places, 371 transitions, 858 flow [2020-10-09 15:28:16,959 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=378, PETRI_TRANSITIONS=371} [2020-10-09 15:28:16,959 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 11 predicate places. [2020-10-09 15:28:16,960 INFO L481 AbstractCegarLoop]: Abstraction has has 378 places, 371 transitions, 858 flow [2020-10-09 15:28:16,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:16,960 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:16,960 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:28:17,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 205 mathsat -unsat_core_generation=3 [2020-10-09 15:28:17,171 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:17,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:17,172 INFO L82 PathProgramCache]: Analyzing trace with hash 638145107, now seen corresponding path program 1 times [2020-10-09 15:28:17,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:17,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583858381] [2020-10-09 15:28:17,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 206 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 206 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:17,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:17,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:28:17,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:28:17,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583858381] [2020-10-09 15:28:17,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:17,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:17,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584742115] [2020-10-09 15:28:17,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:17,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:17,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:17,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:17,375 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 395 [2020-10-09 15:28:17,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 371 transitions, 858 flow. Second operand 3 states. [2020-10-09 15:28:17,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:17,376 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 395 [2020-10-09 15:28:17,376 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:17,451 INFO L129 PetriNetUnfolder]: 33/418 cut-off events. [2020-10-09 15:28:17,451 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:28:17,463 INFO L80 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 418 events. 33/418 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1611 event pairs, 0 based on Foata normal form. 1/373 useless extension candidates. Maximal degree in co-relation 477. Up to 15 conditions per place. [2020-10-09 15:28:17,465 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 4 selfloop transitions, 1 changer transitions 0/368 dead transitions. [2020-10-09 15:28:17,465 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 368 transitions, 853 flow [2020-10-09 15:28:17,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2020-10-09 15:28:17,466 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518987341772152 [2020-10-09 15:28:17,467 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1128 transitions. [2020-10-09 15:28:17,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1128 transitions. [2020-10-09 15:28:17,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:17,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1128 transitions. [2020-10-09 15:28:17,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:17,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:17,468 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:17,469 INFO L185 Difference]: Start difference. First operand has 378 places, 371 transitions, 858 flow. Second operand 3 states and 1128 transitions. [2020-10-09 15:28:17,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 368 transitions, 853 flow [2020-10-09 15:28:17,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 368 transitions, 846 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:17,473 INFO L241 Difference]: Finished difference. Result has 377 places, 368 transitions, 838 flow [2020-10-09 15:28:17,473 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=377, PETRI_TRANSITIONS=368} [2020-10-09 15:28:17,473 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 10 predicate places. [2020-10-09 15:28:17,473 INFO L481 AbstractCegarLoop]: Abstraction has has 377 places, 368 transitions, 838 flow [2020-10-09 15:28:17,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:17,473 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:17,473 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:28:17,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 206 mathsat -unsat_core_generation=3 [2020-10-09 15:28:17,674 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:17,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:17,675 INFO L82 PathProgramCache]: Analyzing trace with hash 638146130, now seen corresponding path program 1 times [2020-10-09 15:28:17,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:17,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597036835] [2020-10-09 15:28:17,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 207 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 207 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:17,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:17,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:28:17,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:28:17,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597036835] [2020-10-09 15:28:17,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:17,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:17,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781202660] [2020-10-09 15:28:17,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:17,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:17,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:17,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:17,881 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:17,882 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 368 transitions, 838 flow. Second operand 3 states. [2020-10-09 15:28:17,882 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:17,882 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:17,882 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:17,955 INFO L129 PetriNetUnfolder]: 33/416 cut-off events. [2020-10-09 15:28:17,955 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:17,966 INFO L80 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 416 events. 33/416 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1598 event pairs, 0 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 479. Up to 15 conditions per place. [2020-10-09 15:28:17,969 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 8 selfloop transitions, 1 changer transitions 0/366 dead transitions. [2020-10-09 15:28:17,969 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 366 transitions, 851 flow [2020-10-09 15:28:17,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1114 transitions. [2020-10-09 15:28:17,970 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.940084388185654 [2020-10-09 15:28:17,970 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1114 transitions. [2020-10-09 15:28:17,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1114 transitions. [2020-10-09 15:28:17,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:17,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1114 transitions. [2020-10-09 15:28:17,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:17,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:17,971 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:17,971 INFO L185 Difference]: Start difference. First operand has 377 places, 368 transitions, 838 flow. Second operand 3 states and 1114 transitions. [2020-10-09 15:28:17,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 366 transitions, 851 flow [2020-10-09 15:28:17,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 366 transitions, 850 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:17,975 INFO L241 Difference]: Finished difference. Result has 376 places, 366 transitions, 834 flow [2020-10-09 15:28:17,975 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=376, PETRI_TRANSITIONS=366} [2020-10-09 15:28:17,975 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 9 predicate places. [2020-10-09 15:28:17,975 INFO L481 AbstractCegarLoop]: Abstraction has has 376 places, 366 transitions, 834 flow [2020-10-09 15:28:17,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:17,975 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:17,976 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:28:18,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 207 mathsat -unsat_core_generation=3 [2020-10-09 15:28:18,176 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:18,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:18,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1469490781, now seen corresponding path program 1 times [2020-10-09 15:28:18,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:18,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818585414] [2020-10-09 15:28:18,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 208 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 208 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:18,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:18,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:18,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:18,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818585414] [2020-10-09 15:28:18,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:18,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:18,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862009106] [2020-10-09 15:28:18,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:18,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:18,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:18,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:18,380 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 395 [2020-10-09 15:28:18,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 366 transitions, 834 flow. Second operand 3 states. [2020-10-09 15:28:18,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:18,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 395 [2020-10-09 15:28:18,381 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:18,454 INFO L129 PetriNetUnfolder]: 32/423 cut-off events. [2020-10-09 15:28:18,454 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:18,466 INFO L80 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 423 events. 32/423 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1657 event pairs, 0 based on Foata normal form. 1/378 useless extension candidates. Maximal degree in co-relation 482. Up to 15 conditions per place. [2020-10-09 15:28:18,468 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 4 selfloop transitions, 1 changer transitions 0/366 dead transitions. [2020-10-09 15:28:18,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 366 transitions, 844 flow [2020-10-09 15:28:18,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2020-10-09 15:28:18,469 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518987341772152 [2020-10-09 15:28:18,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1128 transitions. [2020-10-09 15:28:18,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1128 transitions. [2020-10-09 15:28:18,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:18,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1128 transitions. [2020-10-09 15:28:18,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:18,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:18,471 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:18,471 INFO L185 Difference]: Start difference. First operand has 376 places, 366 transitions, 834 flow. Second operand 3 states and 1128 transitions. [2020-10-09 15:28:18,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 366 transitions, 844 flow [2020-10-09 15:28:18,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 366 transitions, 843 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:18,474 INFO L241 Difference]: Finished difference. Result has 378 places, 366 transitions, 838 flow [2020-10-09 15:28:18,474 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=378, PETRI_TRANSITIONS=366} [2020-10-09 15:28:18,475 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 11 predicate places. [2020-10-09 15:28:18,475 INFO L481 AbstractCegarLoop]: Abstraction has has 378 places, 366 transitions, 838 flow [2020-10-09 15:28:18,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:18,475 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:18,475 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:28:18,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 208 mathsat -unsat_core_generation=3 [2020-10-09 15:28:18,676 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:18,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:18,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1469491804, now seen corresponding path program 1 times [2020-10-09 15:28:18,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:18,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411230810] [2020-10-09 15:28:18,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 209 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 209 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:18,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:18,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:18,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:18,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411230810] [2020-10-09 15:28:18,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:18,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:18,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929291694] [2020-10-09 15:28:18,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:18,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:18,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:18,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:18,883 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:18,884 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 366 transitions, 838 flow. Second operand 3 states. [2020-10-09 15:28:18,884 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:18,884 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:18,884 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:18,963 INFO L129 PetriNetUnfolder]: 30/425 cut-off events. [2020-10-09 15:28:18,963 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:18,974 INFO L80 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 425 events. 30/425 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1694 event pairs, 0 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 495. Up to 15 conditions per place. [2020-10-09 15:28:18,977 INFO L132 encePairwiseOnDemand]: 391/395 looper letters, 9 selfloop transitions, 3 changer transitions 0/367 dead transitions. [2020-10-09 15:28:18,977 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 367 transitions, 864 flow [2020-10-09 15:28:18,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1117 transitions. [2020-10-09 15:28:18,978 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9426160337552743 [2020-10-09 15:28:18,978 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1117 transitions. [2020-10-09 15:28:18,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1117 transitions. [2020-10-09 15:28:18,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:18,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1117 transitions. [2020-10-09 15:28:18,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:18,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:18,979 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:18,979 INFO L185 Difference]: Start difference. First operand has 378 places, 366 transitions, 838 flow. Second operand 3 states and 1117 transitions. [2020-10-09 15:28:18,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 367 transitions, 864 flow [2020-10-09 15:28:18,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 367 transitions, 863 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:18,984 INFO L241 Difference]: Finished difference. Result has 381 places, 367 transitions, 855 flow [2020-10-09 15:28:18,985 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=855, PETRI_PLACES=381, PETRI_TRANSITIONS=367} [2020-10-09 15:28:18,985 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 14 predicate places. [2020-10-09 15:28:18,985 INFO L481 AbstractCegarLoop]: Abstraction has has 381 places, 367 transitions, 855 flow [2020-10-09 15:28:18,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:18,985 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:18,985 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:28:19,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 209 mathsat -unsat_core_generation=3 [2020-10-09 15:28:19,195 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:19,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:19,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1468538492, now seen corresponding path program 1 times [2020-10-09 15:28:19,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:19,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495334400] [2020-10-09 15:28:19,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 210 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 210 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:19,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:19,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:19,406 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:19,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:19,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495334400] [2020-10-09 15:28:19,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:19,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:19,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204225147] [2020-10-09 15:28:19,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:19,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:19,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:19,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:19,418 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 395 [2020-10-09 15:28:19,418 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 367 transitions, 855 flow. Second operand 3 states. [2020-10-09 15:28:19,418 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:19,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 395 [2020-10-09 15:28:19,419 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:19,491 INFO L129 PetriNetUnfolder]: 30/418 cut-off events. [2020-10-09 15:28:19,491 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:28:19,502 INFO L80 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 418 events. 30/418 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1629 event pairs, 0 based on Foata normal form. 1/376 useless extension candidates. Maximal degree in co-relation 480. Up to 15 conditions per place. [2020-10-09 15:28:19,505 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 5 selfloop transitions, 1 changer transitions 0/365 dead transitions. [2020-10-09 15:28:19,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 365 transitions, 857 flow [2020-10-09 15:28:19,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1126 transitions. [2020-10-09 15:28:19,506 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.950210970464135 [2020-10-09 15:28:19,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1126 transitions. [2020-10-09 15:28:19,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1126 transitions. [2020-10-09 15:28:19,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:19,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1126 transitions. [2020-10-09 15:28:19,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:19,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:19,507 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:19,507 INFO L185 Difference]: Start difference. First operand has 381 places, 367 transitions, 855 flow. Second operand 3 states and 1126 transitions. [2020-10-09 15:28:19,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 365 transitions, 857 flow [2020-10-09 15:28:19,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 365 transitions, 849 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:19,511 INFO L241 Difference]: Finished difference. Result has 381 places, 365 transitions, 842 flow [2020-10-09 15:28:19,511 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=381, PETRI_TRANSITIONS=365} [2020-10-09 15:28:19,511 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 14 predicate places. [2020-10-09 15:28:19,511 INFO L481 AbstractCegarLoop]: Abstraction has has 381 places, 365 transitions, 842 flow [2020-10-09 15:28:19,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:19,511 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:19,511 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:28:19,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 210 mathsat -unsat_core_generation=3 [2020-10-09 15:28:19,712 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:19,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1468537469, now seen corresponding path program 1 times [2020-10-09 15:28:19,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:19,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798998590] [2020-10-09 15:28:19,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 211 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 211 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:19,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:19,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:19,901 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:19,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:19,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798998590] [2020-10-09 15:28:19,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:19,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:19,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851484246] [2020-10-09 15:28:19,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:19,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:19,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:19,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:19,937 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:19,938 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 365 transitions, 842 flow. Second operand 3 states. [2020-10-09 15:28:19,938 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:19,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:19,938 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:20,010 INFO L129 PetriNetUnfolder]: 30/416 cut-off events. [2020-10-09 15:28:20,010 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:20,021 INFO L80 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 416 events. 30/416 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1615 event pairs, 0 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 485. Up to 15 conditions per place. [2020-10-09 15:28:20,024 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 8 selfloop transitions, 1 changer transitions 0/363 dead transitions. [2020-10-09 15:28:20,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 363 transitions, 855 flow [2020-10-09 15:28:20,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:20,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1114 transitions. [2020-10-09 15:28:20,025 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.940084388185654 [2020-10-09 15:28:20,025 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1114 transitions. [2020-10-09 15:28:20,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1114 transitions. [2020-10-09 15:28:20,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:20,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1114 transitions. [2020-10-09 15:28:20,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:20,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:20,027 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:20,027 INFO L185 Difference]: Start difference. First operand has 381 places, 365 transitions, 842 flow. Second operand 3 states and 1114 transitions. [2020-10-09 15:28:20,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 363 transitions, 855 flow [2020-10-09 15:28:20,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 363 transitions, 854 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:20,030 INFO L241 Difference]: Finished difference. Result has 380 places, 363 transitions, 838 flow [2020-10-09 15:28:20,030 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=380, PETRI_TRANSITIONS=363} [2020-10-09 15:28:20,031 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 13 predicate places. [2020-10-09 15:28:20,031 INFO L481 AbstractCegarLoop]: Abstraction has has 380 places, 363 transitions, 838 flow [2020-10-09 15:28:20,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:20,031 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:20,031 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:20,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 211 mathsat -unsat_core_generation=3 [2020-10-09 15:28:20,232 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:20,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:20,232 INFO L82 PathProgramCache]: Analyzing trace with hash -937779320, now seen corresponding path program 1 times [2020-10-09 15:28:20,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:20,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076965424] [2020-10-09 15:28:20,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 212 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 212 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:20,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:20,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:20,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:20,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076965424] [2020-10-09 15:28:20,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:20,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:20,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823347154] [2020-10-09 15:28:20,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:20,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:20,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:20,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:20,458 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:20,459 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 363 transitions, 838 flow. Second operand 3 states. [2020-10-09 15:28:20,459 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:20,459 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:20,459 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:20,535 INFO L129 PetriNetUnfolder]: 29/424 cut-off events. [2020-10-09 15:28:20,535 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:20,549 INFO L80 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 424 events. 29/424 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1684 event pairs, 0 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 497. Up to 15 conditions per place. [2020-10-09 15:28:20,552 INFO L132 encePairwiseOnDemand]: 390/395 looper letters, 10 selfloop transitions, 3 changer transitions 0/365 dead transitions. [2020-10-09 15:28:20,552 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 365 transitions, 868 flow [2020-10-09 15:28:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:20,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1119 transitions. [2020-10-09 15:28:20,553 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9443037974683545 [2020-10-09 15:28:20,554 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1119 transitions. [2020-10-09 15:28:20,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1119 transitions. [2020-10-09 15:28:20,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:20,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1119 transitions. [2020-10-09 15:28:20,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:20,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:20,555 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:20,555 INFO L185 Difference]: Start difference. First operand has 380 places, 363 transitions, 838 flow. Second operand 3 states and 1119 transitions. [2020-10-09 15:28:20,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 365 transitions, 868 flow [2020-10-09 15:28:20,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 365 transitions, 867 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:20,560 INFO L241 Difference]: Finished difference. Result has 383 places, 365 transitions, 861 flow [2020-10-09 15:28:20,560 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=861, PETRI_PLACES=383, PETRI_TRANSITIONS=365} [2020-10-09 15:28:20,560 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 16 predicate places. [2020-10-09 15:28:20,560 INFO L481 AbstractCegarLoop]: Abstraction has has 383 places, 365 transitions, 861 flow [2020-10-09 15:28:20,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:20,560 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:20,560 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:20,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 212 mathsat -unsat_core_generation=3 [2020-10-09 15:28:20,761 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:20,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:20,761 INFO L82 PathProgramCache]: Analyzing trace with hash -937778297, now seen corresponding path program 1 times [2020-10-09 15:28:20,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:20,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138947489] [2020-10-09 15:28:20,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 213 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 213 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:20,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:20,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:20,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:20,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138947489] [2020-10-09 15:28:20,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:20,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:20,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212703317] [2020-10-09 15:28:20,952 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:20,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:20,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:20,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:20,963 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 395 [2020-10-09 15:28:20,964 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 365 transitions, 861 flow. Second operand 3 states. [2020-10-09 15:28:20,964 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:20,964 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 395 [2020-10-09 15:28:20,964 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:21,039 INFO L129 PetriNetUnfolder]: 28/422 cut-off events. [2020-10-09 15:28:21,039 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:28:21,050 INFO L80 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 422 events. 28/422 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1671 event pairs, 0 based on Foata normal form. 0/381 useless extension candidates. Maximal degree in co-relation 494. Up to 15 conditions per place. [2020-10-09 15:28:21,052 INFO L132 encePairwiseOnDemand]: 392/395 looper letters, 5 selfloop transitions, 2 changer transitions 0/365 dead transitions. [2020-10-09 15:28:21,053 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 365 transitions, 873 flow [2020-10-09 15:28:21,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1127 transitions. [2020-10-09 15:28:21,054 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510548523206751 [2020-10-09 15:28:21,054 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1127 transitions. [2020-10-09 15:28:21,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1127 transitions. [2020-10-09 15:28:21,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:21,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1127 transitions. [2020-10-09 15:28:21,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:21,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:21,055 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:21,055 INFO L185 Difference]: Start difference. First operand has 383 places, 365 transitions, 861 flow. Second operand 3 states and 1127 transitions. [2020-10-09 15:28:21,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 365 transitions, 873 flow [2020-10-09 15:28:21,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 365 transitions, 868 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:21,059 INFO L241 Difference]: Finished difference. Result has 386 places, 365 transitions, 866 flow [2020-10-09 15:28:21,059 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=866, PETRI_PLACES=386, PETRI_TRANSITIONS=365} [2020-10-09 15:28:21,059 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 19 predicate places. [2020-10-09 15:28:21,060 INFO L481 AbstractCegarLoop]: Abstraction has has 386 places, 365 transitions, 866 flow [2020-10-09 15:28:21,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:21,060 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:21,060 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:21,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 213 mathsat -unsat_core_generation=3 [2020-10-09 15:28:21,261 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:21,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:21,261 INFO L82 PathProgramCache]: Analyzing trace with hash -936826008, now seen corresponding path program 1 times [2020-10-09 15:28:21,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:21,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989374183] [2020-10-09 15:28:21,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 214 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 214 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:21,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:21,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:21,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:21,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989374183] [2020-10-09 15:28:21,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:21,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:21,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902851580] [2020-10-09 15:28:21,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:21,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:21,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:21,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:21,465 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 395 [2020-10-09 15:28:21,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 365 transitions, 866 flow. Second operand 3 states. [2020-10-09 15:28:21,466 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:21,466 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 395 [2020-10-09 15:28:21,466 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:21,562 INFO L129 PetriNetUnfolder]: 27/418 cut-off events. [2020-10-09 15:28:21,562 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:28:21,573 INFO L80 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 418 events. 27/418 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1643 event pairs, 0 based on Foata normal form. 1/379 useless extension candidates. Maximal degree in co-relation 490. Up to 15 conditions per place. [2020-10-09 15:28:21,575 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 4 selfloop transitions, 1 changer transitions 0/362 dead transitions. [2020-10-09 15:28:21,575 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 362 transitions, 861 flow [2020-10-09 15:28:21,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2020-10-09 15:28:21,577 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518987341772152 [2020-10-09 15:28:21,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1128 transitions. [2020-10-09 15:28:21,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1128 transitions. [2020-10-09 15:28:21,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:21,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1128 transitions. [2020-10-09 15:28:21,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:21,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:21,578 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:21,578 INFO L185 Difference]: Start difference. First operand has 386 places, 365 transitions, 866 flow. Second operand 3 states and 1128 transitions. [2020-10-09 15:28:21,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 362 transitions, 861 flow [2020-10-09 15:28:21,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 362 transitions, 854 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:21,582 INFO L241 Difference]: Finished difference. Result has 385 places, 362 transitions, 846 flow [2020-10-09 15:28:21,582 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=846, PETRI_PLACES=385, PETRI_TRANSITIONS=362} [2020-10-09 15:28:21,582 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 18 predicate places. [2020-10-09 15:28:21,582 INFO L481 AbstractCegarLoop]: Abstraction has has 385 places, 362 transitions, 846 flow [2020-10-09 15:28:21,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:21,582 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:21,582 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:21,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 214 mathsat -unsat_core_generation=3 [2020-10-09 15:28:21,783 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:21,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:21,783 INFO L82 PathProgramCache]: Analyzing trace with hash -936824985, now seen corresponding path program 1 times [2020-10-09 15:28:21,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:21,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460908440] [2020-10-09 15:28:21,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 215 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 215 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:21,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:21,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:21,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:21,994 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:21,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460908440] [2020-10-09 15:28:21,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:21,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:21,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27835179] [2020-10-09 15:28:21,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:21,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:21,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:21,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:22,027 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:22,028 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 362 transitions, 846 flow. Second operand 3 states. [2020-10-09 15:28:22,028 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:22,028 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:22,029 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:22,143 INFO L129 PetriNetUnfolder]: 27/416 cut-off events. [2020-10-09 15:28:22,143 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:22,154 INFO L80 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 416 events. 27/416 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1632 event pairs, 0 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 492. Up to 15 conditions per place. [2020-10-09 15:28:22,157 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 8 selfloop transitions, 1 changer transitions 0/360 dead transitions. [2020-10-09 15:28:22,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 360 transitions, 859 flow [2020-10-09 15:28:22,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1114 transitions. [2020-10-09 15:28:22,158 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.940084388185654 [2020-10-09 15:28:22,158 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1114 transitions. [2020-10-09 15:28:22,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1114 transitions. [2020-10-09 15:28:22,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:22,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1114 transitions. [2020-10-09 15:28:22,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:22,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:22,159 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:22,159 INFO L185 Difference]: Start difference. First operand has 385 places, 362 transitions, 846 flow. Second operand 3 states and 1114 transitions. [2020-10-09 15:28:22,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 360 transitions, 859 flow [2020-10-09 15:28:22,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 360 transitions, 858 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:22,163 INFO L241 Difference]: Finished difference. Result has 384 places, 360 transitions, 842 flow [2020-10-09 15:28:22,163 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=384, PETRI_TRANSITIONS=360} [2020-10-09 15:28:22,163 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 17 predicate places. [2020-10-09 15:28:22,163 INFO L481 AbstractCegarLoop]: Abstraction has has 384 places, 360 transitions, 842 flow [2020-10-09 15:28:22,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:22,163 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:22,163 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:22,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 215 mathsat -unsat_core_generation=3 [2020-10-09 15:28:22,364 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:22,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:22,364 INFO L82 PathProgramCache]: Analyzing trace with hash 2066295572, now seen corresponding path program 1 times [2020-10-09 15:28:22,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:22,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246460259] [2020-10-09 15:28:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 216 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 216 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:22,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:22,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:22,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:22,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246460259] [2020-10-09 15:28:22,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:22,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:22,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828342764] [2020-10-09 15:28:22,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:22,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:22,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:22,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:22,584 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:22,585 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 360 transitions, 842 flow. Second operand 3 states. [2020-10-09 15:28:22,585 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:22,585 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:22,585 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:22,664 INFO L129 PetriNetUnfolder]: 26/424 cut-off events. [2020-10-09 15:28:22,664 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:22,676 INFO L80 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 424 events. 26/424 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1701 event pairs, 0 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 504. Up to 15 conditions per place. [2020-10-09 15:28:22,678 INFO L132 encePairwiseOnDemand]: 390/395 looper letters, 10 selfloop transitions, 3 changer transitions 0/362 dead transitions. [2020-10-09 15:28:22,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 362 transitions, 872 flow [2020-10-09 15:28:22,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:22,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1119 transitions. [2020-10-09 15:28:22,679 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9443037974683545 [2020-10-09 15:28:22,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1119 transitions. [2020-10-09 15:28:22,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1119 transitions. [2020-10-09 15:28:22,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:22,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1119 transitions. [2020-10-09 15:28:22,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:22,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:22,681 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:22,681 INFO L185 Difference]: Start difference. First operand has 384 places, 360 transitions, 842 flow. Second operand 3 states and 1119 transitions. [2020-10-09 15:28:22,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 362 transitions, 872 flow [2020-10-09 15:28:22,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 362 transitions, 871 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:22,684 INFO L241 Difference]: Finished difference. Result has 387 places, 362 transitions, 865 flow [2020-10-09 15:28:22,684 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=865, PETRI_PLACES=387, PETRI_TRANSITIONS=362} [2020-10-09 15:28:22,684 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 20 predicate places. [2020-10-09 15:28:22,685 INFO L481 AbstractCegarLoop]: Abstraction has has 387 places, 362 transitions, 865 flow [2020-10-09 15:28:22,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:22,685 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:22,685 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:22,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 216 mathsat -unsat_core_generation=3 [2020-10-09 15:28:22,885 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:22,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:22,886 INFO L82 PathProgramCache]: Analyzing trace with hash 2066296595, now seen corresponding path program 1 times [2020-10-09 15:28:22,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:22,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830034897] [2020-10-09 15:28:22,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 217 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 217 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:23,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:23,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:23,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:23,080 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:23,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830034897] [2020-10-09 15:28:23,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:23,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:23,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662913547] [2020-10-09 15:28:23,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:23,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:23,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:23,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:23,098 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 395 [2020-10-09 15:28:23,099 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 362 transitions, 865 flow. Second operand 3 states. [2020-10-09 15:28:23,099 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:23,100 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 395 [2020-10-09 15:28:23,100 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:23,180 INFO L129 PetriNetUnfolder]: 25/422 cut-off events. [2020-10-09 15:28:23,181 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:28:23,192 INFO L80 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 422 events. 25/422 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1692 event pairs, 0 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 501. Up to 15 conditions per place. [2020-10-09 15:28:23,194 INFO L132 encePairwiseOnDemand]: 392/395 looper letters, 5 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2020-10-09 15:28:23,194 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 362 transitions, 877 flow [2020-10-09 15:28:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1127 transitions. [2020-10-09 15:28:23,195 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510548523206751 [2020-10-09 15:28:23,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1127 transitions. [2020-10-09 15:28:23,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1127 transitions. [2020-10-09 15:28:23,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:23,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1127 transitions. [2020-10-09 15:28:23,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:23,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:23,197 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:23,197 INFO L185 Difference]: Start difference. First operand has 387 places, 362 transitions, 865 flow. Second operand 3 states and 1127 transitions. [2020-10-09 15:28:23,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 362 transitions, 877 flow [2020-10-09 15:28:23,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 362 transitions, 872 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:23,202 INFO L241 Difference]: Finished difference. Result has 390 places, 362 transitions, 870 flow [2020-10-09 15:28:23,203 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=390, PETRI_TRANSITIONS=362} [2020-10-09 15:28:23,203 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 23 predicate places. [2020-10-09 15:28:23,203 INFO L481 AbstractCegarLoop]: Abstraction has has 390 places, 362 transitions, 870 flow [2020-10-09 15:28:23,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:23,203 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:23,203 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:23,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 217 mathsat -unsat_core_generation=3 [2020-10-09 15:28:23,404 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:23,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:23,404 INFO L82 PathProgramCache]: Analyzing trace with hash 2067248884, now seen corresponding path program 1 times [2020-10-09 15:28:23,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:23,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720534638] [2020-10-09 15:28:23,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 218 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 218 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:23,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:23,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:23,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:23,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720534638] [2020-10-09 15:28:23,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:23,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:23,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397937613] [2020-10-09 15:28:23,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:23,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:23,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:23,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:23,621 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 395 [2020-10-09 15:28:23,622 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 362 transitions, 870 flow. Second operand 3 states. [2020-10-09 15:28:23,622 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:23,622 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 395 [2020-10-09 15:28:23,622 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:23,694 INFO L129 PetriNetUnfolder]: 24/418 cut-off events. [2020-10-09 15:28:23,694 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:28:23,706 INFO L80 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 418 events. 24/418 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1663 event pairs, 0 based on Foata normal form. 1/382 useless extension candidates. Maximal degree in co-relation 497. Up to 15 conditions per place. [2020-10-09 15:28:23,708 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 4 selfloop transitions, 1 changer transitions 0/359 dead transitions. [2020-10-09 15:28:23,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 359 transitions, 865 flow [2020-10-09 15:28:23,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:23,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2020-10-09 15:28:23,710 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518987341772152 [2020-10-09 15:28:23,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1128 transitions. [2020-10-09 15:28:23,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1128 transitions. [2020-10-09 15:28:23,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:23,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1128 transitions. [2020-10-09 15:28:23,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:23,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:23,711 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:23,711 INFO L185 Difference]: Start difference. First operand has 390 places, 362 transitions, 870 flow. Second operand 3 states and 1128 transitions. [2020-10-09 15:28:23,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 359 transitions, 865 flow [2020-10-09 15:28:23,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 359 transitions, 858 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:23,714 INFO L241 Difference]: Finished difference. Result has 389 places, 359 transitions, 850 flow [2020-10-09 15:28:23,715 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=389, PETRI_TRANSITIONS=359} [2020-10-09 15:28:23,715 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 22 predicate places. [2020-10-09 15:28:23,715 INFO L481 AbstractCegarLoop]: Abstraction has has 389 places, 359 transitions, 850 flow [2020-10-09 15:28:23,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:23,715 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:23,715 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:23,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 218 mathsat -unsat_core_generation=3 [2020-10-09 15:28:23,916 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:23,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:23,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2067249907, now seen corresponding path program 1 times [2020-10-09 15:28:23,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:23,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989825395] [2020-10-09 15:28:23,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 219 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 219 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:24,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:24,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:24,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:24,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989825395] [2020-10-09 15:28:24,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:24,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:24,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627844881] [2020-10-09 15:28:24,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:24,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:24,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:24,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:24,143 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:24,144 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 359 transitions, 850 flow. Second operand 3 states. [2020-10-09 15:28:24,144 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:24,144 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:24,144 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:24,220 INFO L129 PetriNetUnfolder]: 24/416 cut-off events. [2020-10-09 15:28:24,220 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:24,232 INFO L80 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 416 events. 24/416 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1649 event pairs, 0 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 499. Up to 15 conditions per place. [2020-10-09 15:28:24,234 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 8 selfloop transitions, 1 changer transitions 0/357 dead transitions. [2020-10-09 15:28:24,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 357 transitions, 863 flow [2020-10-09 15:28:24,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:24,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1114 transitions. [2020-10-09 15:28:24,236 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.940084388185654 [2020-10-09 15:28:24,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1114 transitions. [2020-10-09 15:28:24,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1114 transitions. [2020-10-09 15:28:24,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:24,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1114 transitions. [2020-10-09 15:28:24,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:24,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:24,238 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:24,238 INFO L185 Difference]: Start difference. First operand has 389 places, 359 transitions, 850 flow. Second operand 3 states and 1114 transitions. [2020-10-09 15:28:24,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 357 transitions, 863 flow [2020-10-09 15:28:24,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 357 transitions, 862 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:24,241 INFO L241 Difference]: Finished difference. Result has 388 places, 357 transitions, 846 flow [2020-10-09 15:28:24,241 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=846, PETRI_PLACES=388, PETRI_TRANSITIONS=357} [2020-10-09 15:28:24,241 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 21 predicate places. [2020-10-09 15:28:24,241 INFO L481 AbstractCegarLoop]: Abstraction has has 388 places, 357 transitions, 846 flow [2020-10-09 15:28:24,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:24,242 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:24,242 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:24,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 219 mathsat -unsat_core_generation=3 [2020-10-09 15:28:24,443 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:24,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:24,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1071802208, now seen corresponding path program 1 times [2020-10-09 15:28:24,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:24,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679645451] [2020-10-09 15:28:24,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 220 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 220 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:24,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:24,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:24,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:24,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679645451] [2020-10-09 15:28:24,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:24,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:24,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148961293] [2020-10-09 15:28:24,655 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:24,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:24,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:24,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:24,665 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 395 [2020-10-09 15:28:24,666 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 357 transitions, 846 flow. Second operand 3 states. [2020-10-09 15:28:24,666 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:24,666 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 395 [2020-10-09 15:28:24,667 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:24,743 INFO L129 PetriNetUnfolder]: 22/421 cut-off events. [2020-10-09 15:28:24,743 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:24,754 INFO L80 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 421 events. 22/421 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1699 event pairs, 0 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 502. Up to 15 conditions per place. [2020-10-09 15:28:24,756 INFO L132 encePairwiseOnDemand]: 392/395 looper letters, 5 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2020-10-09 15:28:24,756 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 358 transitions, 862 flow [2020-10-09 15:28:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1127 transitions. [2020-10-09 15:28:24,757 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510548523206751 [2020-10-09 15:28:24,757 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1127 transitions. [2020-10-09 15:28:24,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1127 transitions. [2020-10-09 15:28:24,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:24,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1127 transitions. [2020-10-09 15:28:24,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:24,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:24,759 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:24,759 INFO L185 Difference]: Start difference. First operand has 388 places, 357 transitions, 846 flow. Second operand 3 states and 1127 transitions. [2020-10-09 15:28:24,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 358 transitions, 862 flow [2020-10-09 15:28:24,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 358 transitions, 861 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:24,763 INFO L241 Difference]: Finished difference. Result has 391 places, 358 transitions, 859 flow [2020-10-09 15:28:24,763 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=859, PETRI_PLACES=391, PETRI_TRANSITIONS=358} [2020-10-09 15:28:24,763 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 24 predicate places. [2020-10-09 15:28:24,763 INFO L481 AbstractCegarLoop]: Abstraction has has 391 places, 358 transitions, 859 flow [2020-10-09 15:28:24,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:24,764 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:24,764 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:24,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 220 mathsat -unsat_core_generation=3 [2020-10-09 15:28:24,964 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:24,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:24,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1071803231, now seen corresponding path program 1 times [2020-10-09 15:28:24,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:24,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921913824] [2020-10-09 15:28:24,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 221 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 221 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:25,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:25,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:25,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:25,161 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:25,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921913824] [2020-10-09 15:28:25,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:25,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:25,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100363978] [2020-10-09 15:28:25,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:25,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:25,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:25,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:25,180 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:25,181 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 358 transitions, 859 flow. Second operand 3 states. [2020-10-09 15:28:25,181 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:25,181 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:25,181 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:25,264 INFO L129 PetriNetUnfolder]: 22/422 cut-off events. [2020-10-09 15:28:25,264 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:25,275 INFO L80 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 422 events. 22/422 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1710 event pairs, 0 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 510. Up to 15 conditions per place. [2020-10-09 15:28:25,277 INFO L132 encePairwiseOnDemand]: 391/395 looper letters, 9 selfloop transitions, 3 changer transitions 0/359 dead transitions. [2020-10-09 15:28:25,277 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 359 transitions, 885 flow [2020-10-09 15:28:25,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:25,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1117 transitions. [2020-10-09 15:28:25,278 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9426160337552743 [2020-10-09 15:28:25,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1117 transitions. [2020-10-09 15:28:25,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1117 transitions. [2020-10-09 15:28:25,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:25,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1117 transitions. [2020-10-09 15:28:25,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:25,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:25,280 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:25,280 INFO L185 Difference]: Start difference. First operand has 391 places, 358 transitions, 859 flow. Second operand 3 states and 1117 transitions. [2020-10-09 15:28:25,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 359 transitions, 885 flow [2020-10-09 15:28:25,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 359 transitions, 883 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:25,283 INFO L241 Difference]: Finished difference. Result has 394 places, 359 transitions, 875 flow [2020-10-09 15:28:25,283 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=875, PETRI_PLACES=394, PETRI_TRANSITIONS=359} [2020-10-09 15:28:25,283 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 27 predicate places. [2020-10-09 15:28:25,284 INFO L481 AbstractCegarLoop]: Abstraction has has 394 places, 359 transitions, 875 flow [2020-10-09 15:28:25,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:25,284 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:25,284 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:25,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 221 mathsat -unsat_core_generation=3 [2020-10-09 15:28:25,485 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:25,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:25,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1070848896, now seen corresponding path program 1 times [2020-10-09 15:28:25,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:25,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041738304] [2020-10-09 15:28:25,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 222 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 222 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:25,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:25,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:25,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:25,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041738304] [2020-10-09 15:28:25,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:25,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:25,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406909633] [2020-10-09 15:28:25,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:25,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:25,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:25,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:25,722 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:25,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 359 transitions, 875 flow. Second operand 3 states. [2020-10-09 15:28:25,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:25,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:25,722 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:25,801 INFO L129 PetriNetUnfolder]: 21/419 cut-off events. [2020-10-09 15:28:25,801 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:28:25,813 INFO L80 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 419 events. 21/419 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1689 event pairs, 0 based on Foata normal form. 2/386 useless extension candidates. Maximal degree in co-relation 509. Up to 15 conditions per place. [2020-10-09 15:28:25,815 INFO L132 encePairwiseOnDemand]: 392/395 looper letters, 9 selfloop transitions, 1 changer transitions 0/357 dead transitions. [2020-10-09 15:28:25,815 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 357 transitions, 883 flow [2020-10-09 15:28:25,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1116 transitions. [2020-10-09 15:28:25,816 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9417721518987342 [2020-10-09 15:28:25,816 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1116 transitions. [2020-10-09 15:28:25,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1116 transitions. [2020-10-09 15:28:25,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:25,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1116 transitions. [2020-10-09 15:28:25,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:25,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:25,817 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:25,817 INFO L185 Difference]: Start difference. First operand has 394 places, 359 transitions, 875 flow. Second operand 3 states and 1116 transitions. [2020-10-09 15:28:25,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 357 transitions, 883 flow [2020-10-09 15:28:25,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 357 transitions, 882 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:25,821 INFO L241 Difference]: Finished difference. Result has 395 places, 357 transitions, 864 flow [2020-10-09 15:28:25,821 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=864, PETRI_PLACES=395, PETRI_TRANSITIONS=357} [2020-10-09 15:28:25,821 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 28 predicate places. [2020-10-09 15:28:25,821 INFO L481 AbstractCegarLoop]: Abstraction has has 395 places, 357 transitions, 864 flow [2020-10-09 15:28:25,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:25,821 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:25,821 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:26,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 222 mathsat -unsat_core_generation=3 [2020-10-09 15:28:26,022 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:26,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:26,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1070849919, now seen corresponding path program 1 times [2020-10-09 15:28:26,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:26,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910409488] [2020-10-09 15:28:26,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 223 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 223 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:26,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:26,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:26,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:26,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910409488] [2020-10-09 15:28:26,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:26,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:26,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288544689] [2020-10-09 15:28:26,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:26,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:26,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:26,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:26,232 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 395 [2020-10-09 15:28:26,232 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 357 transitions, 864 flow. Second operand 3 states. [2020-10-09 15:28:26,232 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:26,232 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 395 [2020-10-09 15:28:26,233 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:26,304 INFO L129 PetriNetUnfolder]: 21/416 cut-off events. [2020-10-09 15:28:26,304 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:26,315 INFO L80 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 416 events. 21/416 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1667 event pairs, 0 based on Foata normal form. 1/383 useless extension candidates. Maximal degree in co-relation 503. Up to 15 conditions per place. [2020-10-09 15:28:26,316 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 4 selfloop transitions, 1 changer transitions 0/354 dead transitions. [2020-10-09 15:28:26,316 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 354 transitions, 863 flow [2020-10-09 15:28:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2020-10-09 15:28:26,317 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518987341772152 [2020-10-09 15:28:26,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1128 transitions. [2020-10-09 15:28:26,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1128 transitions. [2020-10-09 15:28:26,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:26,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1128 transitions. [2020-10-09 15:28:26,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:26,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:26,319 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:26,319 INFO L185 Difference]: Start difference. First operand has 395 places, 357 transitions, 864 flow. Second operand 3 states and 1128 transitions. [2020-10-09 15:28:26,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 354 transitions, 863 flow [2020-10-09 15:28:26,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 354 transitions, 858 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:26,322 INFO L241 Difference]: Finished difference. Result has 392 places, 354 transitions, 850 flow [2020-10-09 15:28:26,322 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=392, PETRI_TRANSITIONS=354} [2020-10-09 15:28:26,323 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 25 predicate places. [2020-10-09 15:28:26,323 INFO L481 AbstractCegarLoop]: Abstraction has has 392 places, 354 transitions, 850 flow [2020-10-09 15:28:26,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:26,323 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:26,323 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:26,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 223 mathsat -unsat_core_generation=3 [2020-10-09 15:28:26,524 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:26,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:26,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1680569425, now seen corresponding path program 1 times [2020-10-09 15:28:26,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:26,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034865916] [2020-10-09 15:28:26,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 224 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 224 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:26,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:26,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:26,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:26,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034865916] [2020-10-09 15:28:26,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:26,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:26,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256711539] [2020-10-09 15:28:26,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:26,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:26,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:26,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:26,761 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:26,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 354 transitions, 850 flow. Second operand 3 states. [2020-10-09 15:28:26,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:26,762 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:26,762 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:26,874 INFO L129 PetriNetUnfolder]: 20/424 cut-off events. [2020-10-09 15:28:26,874 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:26,881 INFO L80 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 424 events. 20/424 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1737 event pairs, 0 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 520. Up to 15 conditions per place. [2020-10-09 15:28:26,883 INFO L132 encePairwiseOnDemand]: 390/395 looper letters, 10 selfloop transitions, 3 changer transitions 0/356 dead transitions. [2020-10-09 15:28:26,883 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 356 transitions, 880 flow [2020-10-09 15:28:26,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:26,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:26,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1119 transitions. [2020-10-09 15:28:26,884 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9443037974683545 [2020-10-09 15:28:26,884 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1119 transitions. [2020-10-09 15:28:26,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1119 transitions. [2020-10-09 15:28:26,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:26,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1119 transitions. [2020-10-09 15:28:26,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:26,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:26,886 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:26,886 INFO L185 Difference]: Start difference. First operand has 392 places, 354 transitions, 850 flow. Second operand 3 states and 1119 transitions. [2020-10-09 15:28:26,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 356 transitions, 880 flow [2020-10-09 15:28:26,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 356 transitions, 879 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:26,889 INFO L241 Difference]: Finished difference. Result has 395 places, 356 transitions, 873 flow [2020-10-09 15:28:26,889 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=873, PETRI_PLACES=395, PETRI_TRANSITIONS=356} [2020-10-09 15:28:26,889 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 28 predicate places. [2020-10-09 15:28:26,889 INFO L481 AbstractCegarLoop]: Abstraction has has 395 places, 356 transitions, 873 flow [2020-10-09 15:28:26,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:26,889 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:26,889 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:27,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 224 mathsat -unsat_core_generation=3 [2020-10-09 15:28:27,090 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:27,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:27,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1680568402, now seen corresponding path program 1 times [2020-10-09 15:28:27,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:27,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338196602] [2020-10-09 15:28:27,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 225 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 225 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:27,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:27,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:27,286 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:27,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:27,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338196602] [2020-10-09 15:28:27,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:27,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:27,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365568415] [2020-10-09 15:28:27,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:27,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:27,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:27,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:27,300 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 395 [2020-10-09 15:28:27,301 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 356 transitions, 873 flow. Second operand 3 states. [2020-10-09 15:28:27,301 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:27,301 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 395 [2020-10-09 15:28:27,301 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:27,390 INFO L129 PetriNetUnfolder]: 19/422 cut-off events. [2020-10-09 15:28:27,390 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:28:27,402 INFO L80 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 422 events. 19/422 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1727 event pairs, 0 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 515. Up to 15 conditions per place. [2020-10-09 15:28:27,404 INFO L132 encePairwiseOnDemand]: 392/395 looper letters, 5 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2020-10-09 15:28:27,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 356 transitions, 885 flow [2020-10-09 15:28:27,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1127 transitions. [2020-10-09 15:28:27,405 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510548523206751 [2020-10-09 15:28:27,405 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1127 transitions. [2020-10-09 15:28:27,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1127 transitions. [2020-10-09 15:28:27,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:27,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1127 transitions. [2020-10-09 15:28:27,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:27,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:27,407 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:27,407 INFO L185 Difference]: Start difference. First operand has 395 places, 356 transitions, 873 flow. Second operand 3 states and 1127 transitions. [2020-10-09 15:28:27,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 356 transitions, 885 flow [2020-10-09 15:28:27,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 356 transitions, 880 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:27,410 INFO L241 Difference]: Finished difference. Result has 398 places, 356 transitions, 878 flow [2020-10-09 15:28:27,411 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=398, PETRI_TRANSITIONS=356} [2020-10-09 15:28:27,411 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 31 predicate places. [2020-10-09 15:28:27,411 INFO L481 AbstractCegarLoop]: Abstraction has has 398 places, 356 transitions, 878 flow [2020-10-09 15:28:27,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:27,411 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:27,411 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:27,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 225 mathsat -unsat_core_generation=3 [2020-10-09 15:28:27,612 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:27,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1679616113, now seen corresponding path program 1 times [2020-10-09 15:28:27,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:27,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667253871] [2020-10-09 15:28:27,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 226 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 226 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:27,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:27,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:27,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:27,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667253871] [2020-10-09 15:28:27,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:27,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:27,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301312410] [2020-10-09 15:28:27,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:27,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:27,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:27,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:27,826 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 395 [2020-10-09 15:28:27,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 356 transitions, 878 flow. Second operand 3 states. [2020-10-09 15:28:27,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:27,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 395 [2020-10-09 15:28:27,827 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:27,906 INFO L129 PetriNetUnfolder]: 18/418 cut-off events. [2020-10-09 15:28:27,907 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:28:27,918 INFO L80 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 418 events. 18/418 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1699 event pairs, 0 based on Foata normal form. 1/388 useless extension candidates. Maximal degree in co-relation 511. Up to 15 conditions per place. [2020-10-09 15:28:27,920 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 4 selfloop transitions, 1 changer transitions 0/353 dead transitions. [2020-10-09 15:28:27,920 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 353 transitions, 873 flow [2020-10-09 15:28:27,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2020-10-09 15:28:27,921 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518987341772152 [2020-10-09 15:28:27,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1128 transitions. [2020-10-09 15:28:27,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1128 transitions. [2020-10-09 15:28:27,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:27,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1128 transitions. [2020-10-09 15:28:27,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:27,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:27,923 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:27,923 INFO L185 Difference]: Start difference. First operand has 398 places, 356 transitions, 878 flow. Second operand 3 states and 1128 transitions. [2020-10-09 15:28:27,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 353 transitions, 873 flow [2020-10-09 15:28:27,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 353 transitions, 866 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:27,926 INFO L241 Difference]: Finished difference. Result has 397 places, 353 transitions, 858 flow [2020-10-09 15:28:27,926 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=397, PETRI_TRANSITIONS=353} [2020-10-09 15:28:27,927 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 30 predicate places. [2020-10-09 15:28:27,927 INFO L481 AbstractCegarLoop]: Abstraction has has 397 places, 353 transitions, 858 flow [2020-10-09 15:28:27,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:27,927 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:27,927 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:28,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 226 mathsat -unsat_core_generation=3 [2020-10-09 15:28:28,128 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:28,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:28,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1679615090, now seen corresponding path program 1 times [2020-10-09 15:28:28,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:28,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594030692] [2020-10-09 15:28:28,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 227 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 227 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:28,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:28,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:28,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:28,325 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:28,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594030692] [2020-10-09 15:28:28,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:28,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:28,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437808664] [2020-10-09 15:28:28,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:28,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:28,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:28,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:28,360 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:28,361 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 353 transitions, 858 flow. Second operand 3 states. [2020-10-09 15:28:28,361 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:28,361 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:28,361 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:28,440 INFO L129 PetriNetUnfolder]: 18/416 cut-off events. [2020-10-09 15:28:28,440 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:28,451 INFO L80 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 416 events. 18/416 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1685 event pairs, 0 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 513. Up to 15 conditions per place. [2020-10-09 15:28:28,453 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 8 selfloop transitions, 1 changer transitions 0/351 dead transitions. [2020-10-09 15:28:28,453 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 351 transitions, 871 flow [2020-10-09 15:28:28,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:28,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1114 transitions. [2020-10-09 15:28:28,454 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.940084388185654 [2020-10-09 15:28:28,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1114 transitions. [2020-10-09 15:28:28,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1114 transitions. [2020-10-09 15:28:28,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:28,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1114 transitions. [2020-10-09 15:28:28,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:28,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:28,456 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:28,456 INFO L185 Difference]: Start difference. First operand has 397 places, 353 transitions, 858 flow. Second operand 3 states and 1114 transitions. [2020-10-09 15:28:28,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 351 transitions, 871 flow [2020-10-09 15:28:28,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 351 transitions, 870 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:28,459 INFO L241 Difference]: Finished difference. Result has 396 places, 351 transitions, 854 flow [2020-10-09 15:28:28,459 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=854, PETRI_PLACES=396, PETRI_TRANSITIONS=351} [2020-10-09 15:28:28,459 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 29 predicate places. [2020-10-09 15:28:28,460 INFO L481 AbstractCegarLoop]: Abstraction has has 396 places, 351 transitions, 854 flow [2020-10-09 15:28:28,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:28,460 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:28,460 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:28,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 227 mathsat -unsat_core_generation=3 [2020-10-09 15:28:28,661 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:28,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:28,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1307789757, now seen corresponding path program 1 times [2020-10-09 15:28:28,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:28,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528932228] [2020-10-09 15:28:28,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 228 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 228 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:28,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:28,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:28,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:28,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528932228] [2020-10-09 15:28:28,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:28,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:28,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427600300] [2020-10-09 15:28:28,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:28,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:28,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:28,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:28,877 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 395 [2020-10-09 15:28:28,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 351 transitions, 854 flow. Second operand 3 states. [2020-10-09 15:28:28,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:28,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 395 [2020-10-09 15:28:28,878 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:28,958 INFO L129 PetriNetUnfolder]: 16/421 cut-off events. [2020-10-09 15:28:28,958 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:28,970 INFO L80 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 421 events. 16/421 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1737 event pairs, 0 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 516. Up to 15 conditions per place. [2020-10-09 15:28:28,971 INFO L132 encePairwiseOnDemand]: 392/395 looper letters, 5 selfloop transitions, 2 changer transitions 0/352 dead transitions. [2020-10-09 15:28:28,971 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 352 transitions, 870 flow [2020-10-09 15:28:28,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1127 transitions. [2020-10-09 15:28:28,973 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510548523206751 [2020-10-09 15:28:28,973 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1127 transitions. [2020-10-09 15:28:28,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1127 transitions. [2020-10-09 15:28:28,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:28,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1127 transitions. [2020-10-09 15:28:28,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:28,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:28,974 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:28,974 INFO L185 Difference]: Start difference. First operand has 396 places, 351 transitions, 854 flow. Second operand 3 states and 1127 transitions. [2020-10-09 15:28:28,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 352 transitions, 870 flow [2020-10-09 15:28:28,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 352 transitions, 869 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:28,978 INFO L241 Difference]: Finished difference. Result has 399 places, 352 transitions, 867 flow [2020-10-09 15:28:28,978 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=867, PETRI_PLACES=399, PETRI_TRANSITIONS=352} [2020-10-09 15:28:28,978 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 32 predicate places. [2020-10-09 15:28:28,978 INFO L481 AbstractCegarLoop]: Abstraction has has 399 places, 352 transitions, 867 flow [2020-10-09 15:28:28,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:28,978 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:28,978 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:29,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 228 mathsat -unsat_core_generation=3 [2020-10-09 15:28:29,179 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:29,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:29,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1307788734, now seen corresponding path program 1 times [2020-10-09 15:28:29,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:29,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037574262] [2020-10-09 15:28:29,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 229 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 229 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:29,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:29,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:29,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:29,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037574262] [2020-10-09 15:28:29,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:29,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:29,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196416191] [2020-10-09 15:28:29,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:29,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:29,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:29,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:29,398 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:29,399 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 352 transitions, 867 flow. Second operand 3 states. [2020-10-09 15:28:29,399 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:29,399 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:29,400 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:29,522 INFO L129 PetriNetUnfolder]: 16/422 cut-off events. [2020-10-09 15:28:29,522 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:29,530 INFO L80 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 422 events. 16/422 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1743 event pairs, 0 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 524. Up to 15 conditions per place. [2020-10-09 15:28:29,531 INFO L132 encePairwiseOnDemand]: 391/395 looper letters, 9 selfloop transitions, 3 changer transitions 0/353 dead transitions. [2020-10-09 15:28:29,531 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 353 transitions, 893 flow [2020-10-09 15:28:29,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:29,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1117 transitions. [2020-10-09 15:28:29,532 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9426160337552743 [2020-10-09 15:28:29,532 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1117 transitions. [2020-10-09 15:28:29,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1117 transitions. [2020-10-09 15:28:29,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:29,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1117 transitions. [2020-10-09 15:28:29,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:29,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:29,534 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:29,534 INFO L185 Difference]: Start difference. First operand has 399 places, 352 transitions, 867 flow. Second operand 3 states and 1117 transitions. [2020-10-09 15:28:29,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 353 transitions, 893 flow [2020-10-09 15:28:29,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 353 transitions, 891 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:29,537 INFO L241 Difference]: Finished difference. Result has 402 places, 353 transitions, 883 flow [2020-10-09 15:28:29,537 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=883, PETRI_PLACES=402, PETRI_TRANSITIONS=353} [2020-10-09 15:28:29,537 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 35 predicate places. [2020-10-09 15:28:29,537 INFO L481 AbstractCegarLoop]: Abstraction has has 402 places, 353 transitions, 883 flow [2020-10-09 15:28:29,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:29,538 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:29,538 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:29,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 229 mathsat -unsat_core_generation=3 [2020-10-09 15:28:29,738 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:29,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:29,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1308743069, now seen corresponding path program 1 times [2020-10-09 15:28:29,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:29,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219215623] [2020-10-09 15:28:29,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 230 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 230 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:29,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:29,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:29,938 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:29,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:29,941 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:29,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219215623] [2020-10-09 15:28:29,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:29,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:29,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098684340] [2020-10-09 15:28:29,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:29,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:29,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:29,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:29,978 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:29,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 353 transitions, 883 flow. Second operand 3 states. [2020-10-09 15:28:29,979 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:29,979 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:29,979 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:30,068 INFO L129 PetriNetUnfolder]: 15/419 cut-off events. [2020-10-09 15:28:30,068 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:28:30,080 INFO L80 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 419 events. 15/419 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1726 event pairs, 0 based on Foata normal form. 2/392 useless extension candidates. Maximal degree in co-relation 523. Up to 15 conditions per place. [2020-10-09 15:28:30,082 INFO L132 encePairwiseOnDemand]: 392/395 looper letters, 9 selfloop transitions, 1 changer transitions 0/351 dead transitions. [2020-10-09 15:28:30,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 351 transitions, 891 flow [2020-10-09 15:28:30,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:30,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1116 transitions. [2020-10-09 15:28:30,084 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9417721518987342 [2020-10-09 15:28:30,084 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1116 transitions. [2020-10-09 15:28:30,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1116 transitions. [2020-10-09 15:28:30,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:30,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1116 transitions. [2020-10-09 15:28:30,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:30,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:30,086 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:30,086 INFO L185 Difference]: Start difference. First operand has 402 places, 353 transitions, 883 flow. Second operand 3 states and 1116 transitions. [2020-10-09 15:28:30,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 351 transitions, 891 flow [2020-10-09 15:28:30,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 351 transitions, 890 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:30,091 INFO L241 Difference]: Finished difference. Result has 403 places, 351 transitions, 872 flow [2020-10-09 15:28:30,091 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=403, PETRI_TRANSITIONS=351} [2020-10-09 15:28:30,091 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 36 predicate places. [2020-10-09 15:28:30,091 INFO L481 AbstractCegarLoop]: Abstraction has has 403 places, 351 transitions, 872 flow [2020-10-09 15:28:30,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:30,091 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:30,091 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:30,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 230 mathsat -unsat_core_generation=3 [2020-10-09 15:28:30,292 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:30,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:30,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1308742046, now seen corresponding path program 1 times [2020-10-09 15:28:30,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:30,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512729516] [2020-10-09 15:28:30,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 231 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 231 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:30,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:30,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:30,495 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:30,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:30,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512729516] [2020-10-09 15:28:30,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:30,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:30,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246505912] [2020-10-09 15:28:30,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:30,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:30,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:30,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:30,522 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 395 [2020-10-09 15:28:30,523 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 351 transitions, 872 flow. Second operand 3 states. [2020-10-09 15:28:30,523 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:30,523 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 395 [2020-10-09 15:28:30,523 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:30,605 INFO L129 PetriNetUnfolder]: 15/416 cut-off events. [2020-10-09 15:28:30,605 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:30,617 INFO L80 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 416 events. 15/416 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1703 event pairs, 0 based on Foata normal form. 1/389 useless extension candidates. Maximal degree in co-relation 517. Up to 15 conditions per place. [2020-10-09 15:28:30,619 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 4 selfloop transitions, 1 changer transitions 0/348 dead transitions. [2020-10-09 15:28:30,619 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 348 transitions, 871 flow [2020-10-09 15:28:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2020-10-09 15:28:30,620 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518987341772152 [2020-10-09 15:28:30,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1128 transitions. [2020-10-09 15:28:30,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1128 transitions. [2020-10-09 15:28:30,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:30,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1128 transitions. [2020-10-09 15:28:30,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:30,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:30,622 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:30,622 INFO L185 Difference]: Start difference. First operand has 403 places, 351 transitions, 872 flow. Second operand 3 states and 1128 transitions. [2020-10-09 15:28:30,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 348 transitions, 871 flow [2020-10-09 15:28:30,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 348 transitions, 866 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:30,626 INFO L241 Difference]: Finished difference. Result has 400 places, 348 transitions, 858 flow [2020-10-09 15:28:30,626 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=400, PETRI_TRANSITIONS=348} [2020-10-09 15:28:30,626 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 33 predicate places. [2020-10-09 15:28:30,626 INFO L481 AbstractCegarLoop]: Abstraction has has 400 places, 348 transitions, 858 flow [2020-10-09 15:28:30,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:30,626 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:30,627 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:30,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 231 mathsat -unsat_core_generation=3 [2020-10-09 15:28:30,827 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:30,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:30,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1769996755, now seen corresponding path program 1 times [2020-10-09 15:28:30,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:30,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531521234] [2020-10-09 15:28:30,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 232 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 232 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:31,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:31,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:31,030 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:28:31,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:28:31,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531521234] [2020-10-09 15:28:31,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:31,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:31,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302329589] [2020-10-09 15:28:31,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:31,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:31,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:31,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:31,061 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:31,061 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 348 transitions, 858 flow. Second operand 3 states. [2020-10-09 15:28:31,061 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:31,061 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:31,062 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:31,154 INFO L129 PetriNetUnfolder]: 14/424 cut-off events. [2020-10-09 15:28:31,154 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-09 15:28:31,167 INFO L80 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 424 events. 14/424 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1772 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 534. Up to 15 conditions per place. [2020-10-09 15:28:31,168 INFO L132 encePairwiseOnDemand]: 390/395 looper letters, 10 selfloop transitions, 3 changer transitions 0/350 dead transitions. [2020-10-09 15:28:31,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 350 transitions, 888 flow [2020-10-09 15:28:31,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:31,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1119 transitions. [2020-10-09 15:28:31,169 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9443037974683545 [2020-10-09 15:28:31,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1119 transitions. [2020-10-09 15:28:31,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1119 transitions. [2020-10-09 15:28:31,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:31,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1119 transitions. [2020-10-09 15:28:31,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:31,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:31,171 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:31,171 INFO L185 Difference]: Start difference. First operand has 400 places, 348 transitions, 858 flow. Second operand 3 states and 1119 transitions. [2020-10-09 15:28:31,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 350 transitions, 888 flow [2020-10-09 15:28:31,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 350 transitions, 887 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:31,175 INFO L241 Difference]: Finished difference. Result has 403 places, 350 transitions, 881 flow [2020-10-09 15:28:31,176 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=881, PETRI_PLACES=403, PETRI_TRANSITIONS=350} [2020-10-09 15:28:31,176 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 36 predicate places. [2020-10-09 15:28:31,176 INFO L481 AbstractCegarLoop]: Abstraction has has 403 places, 350 transitions, 881 flow [2020-10-09 15:28:31,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:31,176 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:31,176 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:31,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 232 mathsat -unsat_core_generation=3 [2020-10-09 15:28:31,388 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:31,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:31,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1769997778, now seen corresponding path program 1 times [2020-10-09 15:28:31,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:31,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40985943] [2020-10-09 15:28:31,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 233 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 233 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:31,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:31,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:28:31,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:28:31,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40985943] [2020-10-09 15:28:31,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:31,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:31,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179324192] [2020-10-09 15:28:31,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:31,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:31,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:31,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:31,618 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 395 [2020-10-09 15:28:31,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 350 transitions, 881 flow. Second operand 3 states. [2020-10-09 15:28:31,619 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:31,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 395 [2020-10-09 15:28:31,619 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:31,706 INFO L129 PetriNetUnfolder]: 12/425 cut-off events. [2020-10-09 15:28:31,706 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:28:31,720 INFO L80 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 425 events. 12/425 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1795 event pairs, 0 based on Foata normal form. 1/401 useless extension candidates. Maximal degree in co-relation 530. Up to 15 conditions per place. [2020-10-09 15:28:31,721 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 4 selfloop transitions, 1 changer transitions 0/349 dead transitions. [2020-10-09 15:28:31,721 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 349 transitions, 887 flow [2020-10-09 15:28:31,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2020-10-09 15:28:31,722 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518987341772152 [2020-10-09 15:28:31,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1128 transitions. [2020-10-09 15:28:31,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1128 transitions. [2020-10-09 15:28:31,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:31,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1128 transitions. [2020-10-09 15:28:31,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:31,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:31,724 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:31,724 INFO L185 Difference]: Start difference. First operand has 403 places, 350 transitions, 881 flow. Second operand 3 states and 1128 transitions. [2020-10-09 15:28:31,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 349 transitions, 887 flow [2020-10-09 15:28:31,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 349 transitions, 882 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:31,728 INFO L241 Difference]: Finished difference. Result has 405 places, 349 transitions, 877 flow [2020-10-09 15:28:31,728 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=405, PETRI_TRANSITIONS=349} [2020-10-09 15:28:31,728 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 38 predicate places. [2020-10-09 15:28:31,728 INFO L481 AbstractCegarLoop]: Abstraction has has 405 places, 349 transitions, 877 flow [2020-10-09 15:28:31,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:31,728 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:31,728 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:31,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 233 mathsat -unsat_core_generation=3 [2020-10-09 15:28:31,929 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:31,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1770950067, now seen corresponding path program 1 times [2020-10-09 15:28:31,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:31,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968086495] [2020-10-09 15:28:31,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 234 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 234 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:32,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:32,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:28:32,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:28:32,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968086495] [2020-10-09 15:28:32,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:32,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:32,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293949372] [2020-10-09 15:28:32,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:32,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:32,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:32,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:32,152 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 395 [2020-10-09 15:28:32,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 349 transitions, 877 flow. Second operand 3 states. [2020-10-09 15:28:32,153 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:32,153 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 395 [2020-10-09 15:28:32,153 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:32,263 INFO L129 PetriNetUnfolder]: 12/418 cut-off events. [2020-10-09 15:28:32,263 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:28:32,273 INFO L80 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 418 events. 12/418 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1734 event pairs, 0 based on Foata normal form. 1/394 useless extension candidates. Maximal degree in co-relation 526. Up to 15 conditions per place. [2020-10-09 15:28:32,274 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 5 selfloop transitions, 1 changer transitions 0/347 dead transitions. [2020-10-09 15:28:32,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 347 transitions, 880 flow [2020-10-09 15:28:32,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1126 transitions. [2020-10-09 15:28:32,275 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.950210970464135 [2020-10-09 15:28:32,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1126 transitions. [2020-10-09 15:28:32,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1126 transitions. [2020-10-09 15:28:32,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:32,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1126 transitions. [2020-10-09 15:28:32,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:32,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:32,277 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:32,277 INFO L185 Difference]: Start difference. First operand has 405 places, 349 transitions, 877 flow. Second operand 3 states and 1126 transitions. [2020-10-09 15:28:32,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 347 transitions, 880 flow [2020-10-09 15:28:32,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 347 transitions, 873 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:32,280 INFO L241 Difference]: Finished difference. Result has 405 places, 347 transitions, 866 flow [2020-10-09 15:28:32,281 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=866, PETRI_PLACES=405, PETRI_TRANSITIONS=347} [2020-10-09 15:28:32,281 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 38 predicate places. [2020-10-09 15:28:32,281 INFO L481 AbstractCegarLoop]: Abstraction has has 405 places, 347 transitions, 866 flow [2020-10-09 15:28:32,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:32,281 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:32,281 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:32,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 234 mathsat -unsat_core_generation=3 [2020-10-09 15:28:32,482 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:32,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:32,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1770951090, now seen corresponding path program 1 times [2020-10-09 15:28:32,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:32,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480240660] [2020-10-09 15:28:32,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 235 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 235 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:32,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:32,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:28:32,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:28:32,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480240660] [2020-10-09 15:28:32,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:32,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:32,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478661672] [2020-10-09 15:28:32,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:32,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:32,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:32,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:32,714 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 395 [2020-10-09 15:28:32,715 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 347 transitions, 866 flow. Second operand 3 states. [2020-10-09 15:28:32,715 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:32,715 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 395 [2020-10-09 15:28:32,715 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:32,798 INFO L129 PetriNetUnfolder]: 12/416 cut-off events. [2020-10-09 15:28:32,798 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:32,810 INFO L80 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 416 events. 12/416 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1720 event pairs, 0 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 526. Up to 15 conditions per place. [2020-10-09 15:28:32,811 INFO L132 encePairwiseOnDemand]: 393/395 looper letters, 8 selfloop transitions, 1 changer transitions 0/345 dead transitions. [2020-10-09 15:28:32,811 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 345 transitions, 879 flow [2020-10-09 15:28:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1114 transitions. [2020-10-09 15:28:32,812 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.940084388185654 [2020-10-09 15:28:32,812 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1114 transitions. [2020-10-09 15:28:32,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1114 transitions. [2020-10-09 15:28:32,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:32,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1114 transitions. [2020-10-09 15:28:32,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:32,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:32,813 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:32,813 INFO L185 Difference]: Start difference. First operand has 405 places, 347 transitions, 866 flow. Second operand 3 states and 1114 transitions. [2020-10-09 15:28:32,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 345 transitions, 879 flow [2020-10-09 15:28:32,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 345 transitions, 878 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:32,817 INFO L241 Difference]: Finished difference. Result has 404 places, 345 transitions, 862 flow [2020-10-09 15:28:32,817 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=404, PETRI_TRANSITIONS=345} [2020-10-09 15:28:32,817 INFO L341 CegarLoopForPetriNet]: 367 programPoint places, 37 predicate places. [2020-10-09 15:28:32,817 INFO L481 AbstractCegarLoop]: Abstraction has has 404 places, 345 transitions, 862 flow [2020-10-09 15:28:32,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:32,817 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:32,818 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:33,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 235 mathsat -unsat_core_generation=3 [2020-10-09 15:28:33,018 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:33,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:33,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1967924270, now seen corresponding path program 1 times [2020-10-09 15:28:33,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:33,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519614139] [2020-10-09 15:28:33,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 236 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 236 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:28:33,218 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:28:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:28:33,244 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:28:33,284 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:28:33,284 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:28:33,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 236 mathsat -unsat_core_generation=3 [2020-10-09 15:28:33,485 WARN L371 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:28:33,485 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2020-10-09 15:28:33,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:33,613 INFO L253 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2020-10-09 15:28:33,613 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:28:33,613 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:28:33,613 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:28:33,613 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:28:33,613 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:28:33,613 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:28:33,613 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:28:33,613 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:28:33,616 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 392 places, 422 transitions, 1129 flow [2020-10-09 15:28:33,705 INFO L129 PetriNetUnfolder]: 76/556 cut-off events. [2020-10-09 15:28:33,706 INFO L130 PetriNetUnfolder]: For 665/665 co-relation queries the response was YES. [2020-10-09 15:28:33,723 INFO L80 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 556 events. 76/556 cut-off events. For 665/665 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2193 event pairs, 0 based on Foata normal form. 0/449 useless extension candidates. Maximal degree in co-relation 662. Up to 32 conditions per place. [2020-10-09 15:28:33,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 392 places, 422 transitions, 1129 flow [2020-10-09 15:28:33,731 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 392 places, 422 transitions, 1129 flow [2020-10-09 15:28:33,736 INFO L129 PetriNetUnfolder]: 10/99 cut-off events. [2020-10-09 15:28:33,736 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:28:33,736 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:33,736 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:33,737 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:33,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:33,737 INFO L82 PathProgramCache]: Analyzing trace with hash -695109861, now seen corresponding path program 1 times [2020-10-09 15:28:33,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:33,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241591904] [2020-10-09 15:28:33,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 237 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 237 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:33,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:33,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:28:33,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:33,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:28:33,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241591904] [2020-10-09 15:28:33,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:33,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:33,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694849670] [2020-10-09 15:28:33,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:33,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:33,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:33,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:33,974 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:33,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 422 transitions, 1129 flow. Second operand 3 states. [2020-10-09 15:28:33,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:33,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:33,975 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:34,065 INFO L129 PetriNetUnfolder]: 44/453 cut-off events. [2020-10-09 15:28:34,065 INFO L130 PetriNetUnfolder]: For 666/666 co-relation queries the response was YES. [2020-10-09 15:28:34,080 INFO L80 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 453 events. 44/453 cut-off events. For 666/666 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1734 event pairs, 0 based on Foata normal form. 68/460 useless extension candidates. Maximal degree in co-relation 571. Up to 16 conditions per place. [2020-10-09 15:28:34,084 INFO L132 encePairwiseOnDemand]: 400/422 looper letters, 10 selfloop transitions, 3 changer transitions 0/403 dead transitions. [2020-10-09 15:28:34,084 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 403 transitions, 1117 flow [2020-10-09 15:28:34,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:34,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1231 transitions. [2020-10-09 15:28:34,086 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9723538704581358 [2020-10-09 15:28:34,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1231 transitions. [2020-10-09 15:28:34,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1231 transitions. [2020-10-09 15:28:34,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:34,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1231 transitions. [2020-10-09 15:28:34,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:34,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:34,087 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:34,087 INFO L185 Difference]: Start difference. First operand has 392 places, 422 transitions, 1129 flow. Second operand 3 states and 1231 transitions. [2020-10-09 15:28:34,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 403 transitions, 1117 flow [2020-10-09 15:28:34,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 403 transitions, 907 flow, removed 105 selfloop flow, removed 0 redundant places. [2020-10-09 15:28:34,092 INFO L241 Difference]: Finished difference. Result has 391 places, 403 transitions, 901 flow [2020-10-09 15:28:34,092 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=901, PETRI_PLACES=391, PETRI_TRANSITIONS=403} [2020-10-09 15:28:34,092 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, -1 predicate places. [2020-10-09 15:28:34,092 INFO L481 AbstractCegarLoop]: Abstraction has has 391 places, 403 transitions, 901 flow [2020-10-09 15:28:34,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:34,092 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:34,092 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:34,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 237 mathsat -unsat_core_generation=3 [2020-10-09 15:28:34,293 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:34,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:34,294 INFO L82 PathProgramCache]: Analyzing trace with hash -695110884, now seen corresponding path program 1 times [2020-10-09 15:28:34,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:34,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062931097] [2020-10-09 15:28:34,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 238 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 238 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:34,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:34,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:28:34,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:28:34,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062931097] [2020-10-09 15:28:34,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:34,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:34,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216729242] [2020-10-09 15:28:34,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:34,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:34,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:34,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:34,529 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 422 [2020-10-09 15:28:34,530 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 403 transitions, 901 flow. Second operand 3 states. [2020-10-09 15:28:34,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:34,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 422 [2020-10-09 15:28:34,530 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:34,608 INFO L129 PetriNetUnfolder]: 42/454 cut-off events. [2020-10-09 15:28:34,608 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:28:34,622 INFO L80 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 454 events. 42/454 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1761 event pairs, 0 based on Foata normal form. 1/399 useless extension candidates. Maximal degree in co-relation 493. Up to 16 conditions per place. [2020-10-09 15:28:34,626 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 4 selfloop transitions, 1 changer transitions 0/402 dead transitions. [2020-10-09 15:28:34,626 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 402 transitions, 907 flow [2020-10-09 15:28:34,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:34,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1206 transitions. [2020-10-09 15:28:34,628 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.95260663507109 [2020-10-09 15:28:34,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1206 transitions. [2020-10-09 15:28:34,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1206 transitions. [2020-10-09 15:28:34,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:34,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1206 transitions. [2020-10-09 15:28:34,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:34,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:34,631 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:34,631 INFO L185 Difference]: Start difference. First operand has 391 places, 403 transitions, 901 flow. Second operand 3 states and 1206 transitions. [2020-10-09 15:28:34,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 402 transitions, 907 flow [2020-10-09 15:28:34,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 402 transitions, 902 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:34,637 INFO L241 Difference]: Finished difference. Result has 393 places, 402 transitions, 897 flow [2020-10-09 15:28:34,637 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=393, PETRI_TRANSITIONS=402} [2020-10-09 15:28:34,637 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 1 predicate places. [2020-10-09 15:28:34,637 INFO L481 AbstractCegarLoop]: Abstraction has has 393 places, 402 transitions, 897 flow [2020-10-09 15:28:34,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:34,638 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:34,638 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:34,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 238 mathsat -unsat_core_generation=3 [2020-10-09 15:28:34,851 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:34,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:34,851 INFO L82 PathProgramCache]: Analyzing trace with hash -696063173, now seen corresponding path program 1 times [2020-10-09 15:28:34,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:34,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204994205] [2020-10-09 15:28:34,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 239 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 239 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:35,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:35,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:28:35,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:28:35,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204994205] [2020-10-09 15:28:35,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:35,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:35,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175312709] [2020-10-09 15:28:35,058 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:35,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:35,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:35,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:35,077 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 422 [2020-10-09 15:28:35,078 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 402 transitions, 897 flow. Second operand 3 states. [2020-10-09 15:28:35,078 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:35,078 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 422 [2020-10-09 15:28:35,078 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:35,167 INFO L129 PetriNetUnfolder]: 42/447 cut-off events. [2020-10-09 15:28:35,167 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:28:35,179 INFO L80 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 447 events. 42/447 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1705 event pairs, 0 based on Foata normal form. 1/392 useless extension candidates. Maximal degree in co-relation 495. Up to 16 conditions per place. [2020-10-09 15:28:35,183 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 5 selfloop transitions, 1 changer transitions 0/400 dead transitions. [2020-10-09 15:28:35,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 400 transitions, 900 flow [2020-10-09 15:28:35,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2020-10-09 15:28:35,184 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510268562401264 [2020-10-09 15:28:35,184 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2020-10-09 15:28:35,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2020-10-09 15:28:35,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:35,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2020-10-09 15:28:35,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:35,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:35,186 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:35,186 INFO L185 Difference]: Start difference. First operand has 393 places, 402 transitions, 897 flow. Second operand 3 states and 1204 transitions. [2020-10-09 15:28:35,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 400 transitions, 900 flow [2020-10-09 15:28:35,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 400 transitions, 893 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:35,190 INFO L241 Difference]: Finished difference. Result has 393 places, 400 transitions, 886 flow [2020-10-09 15:28:35,190 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=393, PETRI_TRANSITIONS=400} [2020-10-09 15:28:35,190 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 1 predicate places. [2020-10-09 15:28:35,190 INFO L481 AbstractCegarLoop]: Abstraction has has 393 places, 400 transitions, 886 flow [2020-10-09 15:28:35,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:35,190 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:35,190 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:35,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 239 mathsat -unsat_core_generation=3 [2020-10-09 15:28:35,398 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:35,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:35,398 INFO L82 PathProgramCache]: Analyzing trace with hash -696064196, now seen corresponding path program 1 times [2020-10-09 15:28:35,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:35,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666493576] [2020-10-09 15:28:35,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 240 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 240 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:35,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:35,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:28:35,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:28:35,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666493576] [2020-10-09 15:28:35,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:35,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:35,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671606298] [2020-10-09 15:28:35,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:35,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:35,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:35,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:35,629 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:35,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 400 transitions, 886 flow. Second operand 3 states. [2020-10-09 15:28:35,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:35,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:35,630 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:35,708 INFO L129 PetriNetUnfolder]: 42/445 cut-off events. [2020-10-09 15:28:35,708 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:35,721 INFO L80 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 445 events. 42/445 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1694 event pairs, 0 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 495. Up to 16 conditions per place. [2020-10-09 15:28:35,724 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 8 selfloop transitions, 1 changer transitions 0/398 dead transitions. [2020-10-09 15:28:35,725 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 398 transitions, 899 flow [2020-10-09 15:28:35,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:35,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1192 transitions. [2020-10-09 15:28:35,726 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9415481832543444 [2020-10-09 15:28:35,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1192 transitions. [2020-10-09 15:28:35,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1192 transitions. [2020-10-09 15:28:35,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:35,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1192 transitions. [2020-10-09 15:28:35,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:35,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:35,727 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:35,727 INFO L185 Difference]: Start difference. First operand has 393 places, 400 transitions, 886 flow. Second operand 3 states and 1192 transitions. [2020-10-09 15:28:35,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 398 transitions, 899 flow [2020-10-09 15:28:35,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 398 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:35,731 INFO L241 Difference]: Finished difference. Result has 392 places, 398 transitions, 882 flow [2020-10-09 15:28:35,731 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=392, PETRI_TRANSITIONS=398} [2020-10-09 15:28:35,732 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 0 predicate places. [2020-10-09 15:28:35,732 INFO L481 AbstractCegarLoop]: Abstraction has has 392 places, 398 transitions, 882 flow [2020-10-09 15:28:35,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:35,732 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:35,732 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:28:35,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 240 mathsat -unsat_core_generation=3 [2020-10-09 15:28:35,943 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:35,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:35,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1397402051, now seen corresponding path program 1 times [2020-10-09 15:28:35,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:35,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437815231] [2020-10-09 15:28:35,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 241 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 241 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:36,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:36,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:28:36,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:28:36,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437815231] [2020-10-09 15:28:36,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:36,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:36,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939747450] [2020-10-09 15:28:36,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:36,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:36,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:36,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:36,178 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:36,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 398 transitions, 882 flow. Second operand 3 states. [2020-10-09 15:28:36,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:36,179 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:36,179 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:36,262 INFO L129 PetriNetUnfolder]: 41/453 cut-off events. [2020-10-09 15:28:36,262 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:36,276 INFO L80 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 453 events. 41/453 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1761 event pairs, 0 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 507. Up to 16 conditions per place. [2020-10-09 15:28:36,280 INFO L132 encePairwiseOnDemand]: 417/422 looper letters, 10 selfloop transitions, 3 changer transitions 0/400 dead transitions. [2020-10-09 15:28:36,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 400 transitions, 912 flow [2020-10-09 15:28:36,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:36,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:36,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1197 transitions. [2020-10-09 15:28:36,282 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9454976303317536 [2020-10-09 15:28:36,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1197 transitions. [2020-10-09 15:28:36,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1197 transitions. [2020-10-09 15:28:36,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:36,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1197 transitions. [2020-10-09 15:28:36,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:36,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:36,283 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:36,283 INFO L185 Difference]: Start difference. First operand has 392 places, 398 transitions, 882 flow. Second operand 3 states and 1197 transitions. [2020-10-09 15:28:36,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 400 transitions, 912 flow [2020-10-09 15:28:36,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 400 transitions, 911 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:36,287 INFO L241 Difference]: Finished difference. Result has 395 places, 400 transitions, 905 flow [2020-10-09 15:28:36,287 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=905, PETRI_PLACES=395, PETRI_TRANSITIONS=400} [2020-10-09 15:28:36,287 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 3 predicate places. [2020-10-09 15:28:36,287 INFO L481 AbstractCegarLoop]: Abstraction has has 395 places, 400 transitions, 905 flow [2020-10-09 15:28:36,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:36,288 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:36,288 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:28:36,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 241 mathsat -unsat_core_generation=3 [2020-10-09 15:28:36,488 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:36,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:36,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1397403074, now seen corresponding path program 1 times [2020-10-09 15:28:36,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:36,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938581987] [2020-10-09 15:28:36,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 242 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 242 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:36,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:36,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:36,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:28:36,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:28:36,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938581987] [2020-10-09 15:28:36,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:36,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:36,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086715814] [2020-10-09 15:28:36,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:36,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:36,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:36,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:36,717 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 422 [2020-10-09 15:28:36,718 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 400 transitions, 905 flow. Second operand 3 states. [2020-10-09 15:28:36,718 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:36,718 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 422 [2020-10-09 15:28:36,718 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:36,798 INFO L129 PetriNetUnfolder]: 39/454 cut-off events. [2020-10-09 15:28:36,799 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:28:36,812 INFO L80 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 454 events. 39/454 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1782 event pairs, 0 based on Foata normal form. 1/402 useless extension candidates. Maximal degree in co-relation 505. Up to 16 conditions per place. [2020-10-09 15:28:36,816 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 4 selfloop transitions, 1 changer transitions 0/399 dead transitions. [2020-10-09 15:28:36,816 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 399 transitions, 911 flow [2020-10-09 15:28:36,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1206 transitions. [2020-10-09 15:28:36,817 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.95260663507109 [2020-10-09 15:28:36,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1206 transitions. [2020-10-09 15:28:36,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1206 transitions. [2020-10-09 15:28:36,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:36,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1206 transitions. [2020-10-09 15:28:36,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:36,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:36,819 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:36,819 INFO L185 Difference]: Start difference. First operand has 395 places, 400 transitions, 905 flow. Second operand 3 states and 1206 transitions. [2020-10-09 15:28:36,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 399 transitions, 911 flow [2020-10-09 15:28:36,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 399 transitions, 906 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:36,823 INFO L241 Difference]: Finished difference. Result has 397 places, 399 transitions, 901 flow [2020-10-09 15:28:36,824 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=901, PETRI_PLACES=397, PETRI_TRANSITIONS=399} [2020-10-09 15:28:36,824 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 5 predicate places. [2020-10-09 15:28:36,824 INFO L481 AbstractCegarLoop]: Abstraction has has 397 places, 399 transitions, 901 flow [2020-10-09 15:28:36,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:36,824 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:36,824 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:28:37,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 242 mathsat -unsat_core_generation=3 [2020-10-09 15:28:37,036 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:37,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:37,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1398355363, now seen corresponding path program 1 times [2020-10-09 15:28:37,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:37,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953760317] [2020-10-09 15:28:37,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 243 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 243 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:37,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:37,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:28:37,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:28:37,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953760317] [2020-10-09 15:28:37,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:37,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:37,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379049190] [2020-10-09 15:28:37,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:37,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:37,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:37,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:37,238 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 422 [2020-10-09 15:28:37,239 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 399 transitions, 901 flow. Second operand 3 states. [2020-10-09 15:28:37,239 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:37,239 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 422 [2020-10-09 15:28:37,239 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:37,318 INFO L129 PetriNetUnfolder]: 39/447 cut-off events. [2020-10-09 15:28:37,318 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:28:37,331 INFO L80 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 447 events. 39/447 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1724 event pairs, 0 based on Foata normal form. 1/395 useless extension candidates. Maximal degree in co-relation 501. Up to 16 conditions per place. [2020-10-09 15:28:37,334 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 5 selfloop transitions, 1 changer transitions 0/397 dead transitions. [2020-10-09 15:28:37,335 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 397 transitions, 904 flow [2020-10-09 15:28:37,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:37,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2020-10-09 15:28:37,336 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510268562401264 [2020-10-09 15:28:37,336 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2020-10-09 15:28:37,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2020-10-09 15:28:37,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:37,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2020-10-09 15:28:37,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:37,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:37,337 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:37,337 INFO L185 Difference]: Start difference. First operand has 397 places, 399 transitions, 901 flow. Second operand 3 states and 1204 transitions. [2020-10-09 15:28:37,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 397 transitions, 904 flow [2020-10-09 15:28:37,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 397 transitions, 897 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:37,341 INFO L241 Difference]: Finished difference. Result has 397 places, 397 transitions, 890 flow [2020-10-09 15:28:37,341 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=890, PETRI_PLACES=397, PETRI_TRANSITIONS=397} [2020-10-09 15:28:37,341 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 5 predicate places. [2020-10-09 15:28:37,342 INFO L481 AbstractCegarLoop]: Abstraction has has 397 places, 397 transitions, 890 flow [2020-10-09 15:28:37,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:37,342 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:37,342 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:28:37,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 243 mathsat -unsat_core_generation=3 [2020-10-09 15:28:37,542 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:37,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:37,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1398356386, now seen corresponding path program 1 times [2020-10-09 15:28:37,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:37,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632779772] [2020-10-09 15:28:37,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 244 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 244 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:37,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:37,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:28:37,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:28:37,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632779772] [2020-10-09 15:28:37,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:37,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:37,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017256430] [2020-10-09 15:28:37,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:37,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:37,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:37,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:37,779 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:37,780 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 397 transitions, 890 flow. Second operand 3 states. [2020-10-09 15:28:37,780 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:37,780 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:37,780 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:37,886 INFO L129 PetriNetUnfolder]: 39/445 cut-off events. [2020-10-09 15:28:37,887 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:37,894 INFO L80 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 445 events. 39/445 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1712 event pairs, 0 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 501. Up to 16 conditions per place. [2020-10-09 15:28:37,897 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 8 selfloop transitions, 1 changer transitions 0/395 dead transitions. [2020-10-09 15:28:37,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 395 transitions, 903 flow [2020-10-09 15:28:37,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:37,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:37,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1192 transitions. [2020-10-09 15:28:37,899 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9415481832543444 [2020-10-09 15:28:37,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1192 transitions. [2020-10-09 15:28:37,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1192 transitions. [2020-10-09 15:28:37,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:37,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1192 transitions. [2020-10-09 15:28:37,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:37,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:37,900 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:37,900 INFO L185 Difference]: Start difference. First operand has 397 places, 397 transitions, 890 flow. Second operand 3 states and 1192 transitions. [2020-10-09 15:28:37,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 395 transitions, 903 flow [2020-10-09 15:28:37,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 395 transitions, 902 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:37,904 INFO L241 Difference]: Finished difference. Result has 396 places, 395 transitions, 886 flow [2020-10-09 15:28:37,905 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=396, PETRI_TRANSITIONS=395} [2020-10-09 15:28:37,905 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 4 predicate places. [2020-10-09 15:28:37,905 INFO L481 AbstractCegarLoop]: Abstraction has has 396 places, 395 transitions, 886 flow [2020-10-09 15:28:37,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:37,905 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:37,905 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:28:38,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 244 mathsat -unsat_core_generation=3 [2020-10-09 15:28:38,106 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:38,106 INFO L82 PathProgramCache]: Analyzing trace with hash -783684511, now seen corresponding path program 1 times [2020-10-09 15:28:38,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:38,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9884397] [2020-10-09 15:28:38,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 245 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 245 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:38,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:38,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:28:38,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:28:38,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9884397] [2020-10-09 15:28:38,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:38,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:38,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130846776] [2020-10-09 15:28:38,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:38,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:38,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:38,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:38,330 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 422 [2020-10-09 15:28:38,331 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 395 transitions, 886 flow. Second operand 3 states. [2020-10-09 15:28:38,331 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:38,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 422 [2020-10-09 15:28:38,331 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:38,413 INFO L129 PetriNetUnfolder]: 38/452 cut-off events. [2020-10-09 15:28:38,413 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:38,426 INFO L80 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 452 events. 38/452 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1770 event pairs, 0 based on Foata normal form. 1/400 useless extension candidates. Maximal degree in co-relation 504. Up to 16 conditions per place. [2020-10-09 15:28:38,429 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 4 selfloop transitions, 1 changer transitions 0/395 dead transitions. [2020-10-09 15:28:38,429 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 395 transitions, 896 flow [2020-10-09 15:28:38,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1206 transitions. [2020-10-09 15:28:38,431 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.95260663507109 [2020-10-09 15:28:38,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1206 transitions. [2020-10-09 15:28:38,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1206 transitions. [2020-10-09 15:28:38,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:38,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1206 transitions. [2020-10-09 15:28:38,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:38,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:38,432 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:38,432 INFO L185 Difference]: Start difference. First operand has 396 places, 395 transitions, 886 flow. Second operand 3 states and 1206 transitions. [2020-10-09 15:28:38,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 395 transitions, 896 flow [2020-10-09 15:28:38,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 395 transitions, 895 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:38,437 INFO L241 Difference]: Finished difference. Result has 398 places, 395 transitions, 890 flow [2020-10-09 15:28:38,437 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=890, PETRI_PLACES=398, PETRI_TRANSITIONS=395} [2020-10-09 15:28:38,437 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 6 predicate places. [2020-10-09 15:28:38,437 INFO L481 AbstractCegarLoop]: Abstraction has has 398 places, 395 transitions, 890 flow [2020-10-09 15:28:38,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:38,438 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:38,438 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:28:38,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 245 mathsat -unsat_core_generation=3 [2020-10-09 15:28:38,645 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:38,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:38,645 INFO L82 PathProgramCache]: Analyzing trace with hash -783683488, now seen corresponding path program 1 times [2020-10-09 15:28:38,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:38,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484341457] [2020-10-09 15:28:38,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 246 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 246 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:38,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:38,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:38,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:28:38,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:28:38,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484341457] [2020-10-09 15:28:38,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:38,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:38,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956017843] [2020-10-09 15:28:38,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:38,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:38,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:38,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:38,873 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:38,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 395 transitions, 890 flow. Second operand 3 states. [2020-10-09 15:28:38,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:38,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:38,874 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:38,959 INFO L129 PetriNetUnfolder]: 36/454 cut-off events. [2020-10-09 15:28:38,960 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:38,973 INFO L80 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 454 events. 36/454 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1803 event pairs, 0 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 517. Up to 16 conditions per place. [2020-10-09 15:28:38,976 INFO L132 encePairwiseOnDemand]: 418/422 looper letters, 9 selfloop transitions, 3 changer transitions 0/396 dead transitions. [2020-10-09 15:28:38,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 396 transitions, 916 flow [2020-10-09 15:28:38,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:38,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1195 transitions. [2020-10-09 15:28:38,977 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9439178515007899 [2020-10-09 15:28:38,977 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1195 transitions. [2020-10-09 15:28:38,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1195 transitions. [2020-10-09 15:28:38,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:38,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1195 transitions. [2020-10-09 15:28:38,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:38,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:38,979 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:38,979 INFO L185 Difference]: Start difference. First operand has 398 places, 395 transitions, 890 flow. Second operand 3 states and 1195 transitions. [2020-10-09 15:28:38,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 396 transitions, 916 flow [2020-10-09 15:28:38,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 396 transitions, 915 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:38,983 INFO L241 Difference]: Finished difference. Result has 401 places, 396 transitions, 907 flow [2020-10-09 15:28:38,983 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=907, PETRI_PLACES=401, PETRI_TRANSITIONS=396} [2020-10-09 15:28:38,983 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 9 predicate places. [2020-10-09 15:28:38,983 INFO L481 AbstractCegarLoop]: Abstraction has has 401 places, 396 transitions, 907 flow [2020-10-09 15:28:38,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:38,983 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:38,983 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:28:39,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 246 mathsat -unsat_core_generation=3 [2020-10-09 15:28:39,184 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:39,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:39,185 INFO L82 PathProgramCache]: Analyzing trace with hash -784636800, now seen corresponding path program 1 times [2020-10-09 15:28:39,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:39,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118050196] [2020-10-09 15:28:39,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 247 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 247 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:39,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:39,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:28:39,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:28:39,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118050196] [2020-10-09 15:28:39,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:39,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:39,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138165074] [2020-10-09 15:28:39,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:39,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:39,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:39,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:39,405 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 422 [2020-10-09 15:28:39,406 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 396 transitions, 907 flow. Second operand 3 states. [2020-10-09 15:28:39,406 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:39,406 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 422 [2020-10-09 15:28:39,406 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:39,484 INFO L129 PetriNetUnfolder]: 36/447 cut-off events. [2020-10-09 15:28:39,485 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:28:39,497 INFO L80 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 447 events. 36/447 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1742 event pairs, 0 based on Foata normal form. 1/398 useless extension candidates. Maximal degree in co-relation 503. Up to 16 conditions per place. [2020-10-09 15:28:39,500 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 5 selfloop transitions, 1 changer transitions 0/394 dead transitions. [2020-10-09 15:28:39,500 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 394 transitions, 909 flow [2020-10-09 15:28:39,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:39,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2020-10-09 15:28:39,502 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510268562401264 [2020-10-09 15:28:39,502 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2020-10-09 15:28:39,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2020-10-09 15:28:39,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:39,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2020-10-09 15:28:39,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:39,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:39,503 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:39,503 INFO L185 Difference]: Start difference. First operand has 401 places, 396 transitions, 907 flow. Second operand 3 states and 1204 transitions. [2020-10-09 15:28:39,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 394 transitions, 909 flow [2020-10-09 15:28:39,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 394 transitions, 901 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:39,507 INFO L241 Difference]: Finished difference. Result has 401 places, 394 transitions, 894 flow [2020-10-09 15:28:39,508 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=401, PETRI_TRANSITIONS=394} [2020-10-09 15:28:39,508 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 9 predicate places. [2020-10-09 15:28:39,508 INFO L481 AbstractCegarLoop]: Abstraction has has 401 places, 394 transitions, 894 flow [2020-10-09 15:28:39,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:39,508 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:39,508 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:28:39,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 247 mathsat -unsat_core_generation=3 [2020-10-09 15:28:39,709 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:39,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:39,709 INFO L82 PathProgramCache]: Analyzing trace with hash -784637823, now seen corresponding path program 1 times [2020-10-09 15:28:39,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:39,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300656803] [2020-10-09 15:28:39,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 248 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 248 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:39,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:39,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:28:39,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:28:39,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300656803] [2020-10-09 15:28:39,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:39,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:39,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782766219] [2020-10-09 15:28:39,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:39,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:39,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:39,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:39,935 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:39,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 394 transitions, 894 flow. Second operand 3 states. [2020-10-09 15:28:39,936 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:39,936 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:39,937 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:40,017 INFO L129 PetriNetUnfolder]: 36/445 cut-off events. [2020-10-09 15:28:40,018 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:40,030 INFO L80 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 445 events. 36/445 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1725 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 507. Up to 16 conditions per place. [2020-10-09 15:28:40,033 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 8 selfloop transitions, 1 changer transitions 0/392 dead transitions. [2020-10-09 15:28:40,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 392 transitions, 907 flow [2020-10-09 15:28:40,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1192 transitions. [2020-10-09 15:28:40,034 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9415481832543444 [2020-10-09 15:28:40,034 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1192 transitions. [2020-10-09 15:28:40,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1192 transitions. [2020-10-09 15:28:40,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:40,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1192 transitions. [2020-10-09 15:28:40,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:40,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:40,036 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:40,036 INFO L185 Difference]: Start difference. First operand has 401 places, 394 transitions, 894 flow. Second operand 3 states and 1192 transitions. [2020-10-09 15:28:40,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 392 transitions, 907 flow [2020-10-09 15:28:40,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 392 transitions, 906 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:40,041 INFO L241 Difference]: Finished difference. Result has 400 places, 392 transitions, 890 flow [2020-10-09 15:28:40,041 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=890, PETRI_PLACES=400, PETRI_TRANSITIONS=392} [2020-10-09 15:28:40,041 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 8 predicate places. [2020-10-09 15:28:40,041 INFO L481 AbstractCegarLoop]: Abstraction has has 400 places, 392 transitions, 890 flow [2020-10-09 15:28:40,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:40,041 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:40,042 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:28:40,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 248 mathsat -unsat_core_generation=3 [2020-10-09 15:28:40,253 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:40,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:40,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1551078651, now seen corresponding path program 1 times [2020-10-09 15:28:40,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:40,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299092761] [2020-10-09 15:28:40,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 249 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 249 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:40,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:40,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:40,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:40,467 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:40,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299092761] [2020-10-09 15:28:40,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:40,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:40,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28616579] [2020-10-09 15:28:40,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:40,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:40,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:40,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:40,483 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 422 [2020-10-09 15:28:40,484 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 392 transitions, 890 flow. Second operand 3 states. [2020-10-09 15:28:40,484 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:40,484 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 422 [2020-10-09 15:28:40,484 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:40,565 INFO L129 PetriNetUnfolder]: 35/452 cut-off events. [2020-10-09 15:28:40,565 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:40,578 INFO L80 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 452 events. 35/452 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1788 event pairs, 0 based on Foata normal form. 1/403 useless extension candidates. Maximal degree in co-relation 510. Up to 16 conditions per place. [2020-10-09 15:28:40,581 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 4 selfloop transitions, 1 changer transitions 0/392 dead transitions. [2020-10-09 15:28:40,582 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 392 transitions, 900 flow [2020-10-09 15:28:40,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1206 transitions. [2020-10-09 15:28:40,583 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.95260663507109 [2020-10-09 15:28:40,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1206 transitions. [2020-10-09 15:28:40,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1206 transitions. [2020-10-09 15:28:40,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:40,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1206 transitions. [2020-10-09 15:28:40,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:40,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:40,584 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:40,584 INFO L185 Difference]: Start difference. First operand has 400 places, 392 transitions, 890 flow. Second operand 3 states and 1206 transitions. [2020-10-09 15:28:40,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 392 transitions, 900 flow [2020-10-09 15:28:40,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 392 transitions, 899 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:40,588 INFO L241 Difference]: Finished difference. Result has 402 places, 392 transitions, 894 flow [2020-10-09 15:28:40,588 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=402, PETRI_TRANSITIONS=392} [2020-10-09 15:28:40,588 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 10 predicate places. [2020-10-09 15:28:40,589 INFO L481 AbstractCegarLoop]: Abstraction has has 402 places, 392 transitions, 894 flow [2020-10-09 15:28:40,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:40,589 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:40,589 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:28:40,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 249 mathsat -unsat_core_generation=3 [2020-10-09 15:28:40,789 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:40,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:40,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1551077628, now seen corresponding path program 1 times [2020-10-09 15:28:40,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:40,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508224982] [2020-10-09 15:28:40,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 250 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 250 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:41,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:41,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:41,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:41,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508224982] [2020-10-09 15:28:41,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:41,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:41,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996590402] [2020-10-09 15:28:41,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:41,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:41,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:41,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:41,058 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:41,059 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 392 transitions, 894 flow. Second operand 3 states. [2020-10-09 15:28:41,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:41,060 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:41,060 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:41,146 INFO L129 PetriNetUnfolder]: 33/454 cut-off events. [2020-10-09 15:28:41,146 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:41,159 INFO L80 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 454 events. 33/454 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1819 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 523. Up to 16 conditions per place. [2020-10-09 15:28:41,162 INFO L132 encePairwiseOnDemand]: 418/422 looper letters, 9 selfloop transitions, 3 changer transitions 0/393 dead transitions. [2020-10-09 15:28:41,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 393 transitions, 920 flow [2020-10-09 15:28:41,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1195 transitions. [2020-10-09 15:28:41,164 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9439178515007899 [2020-10-09 15:28:41,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1195 transitions. [2020-10-09 15:28:41,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1195 transitions. [2020-10-09 15:28:41,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:41,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1195 transitions. [2020-10-09 15:28:41,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:41,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:41,165 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:41,165 INFO L185 Difference]: Start difference. First operand has 402 places, 392 transitions, 894 flow. Second operand 3 states and 1195 transitions. [2020-10-09 15:28:41,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 393 transitions, 920 flow [2020-10-09 15:28:41,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 393 transitions, 919 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:41,169 INFO L241 Difference]: Finished difference. Result has 405 places, 393 transitions, 911 flow [2020-10-09 15:28:41,169 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=911, PETRI_PLACES=405, PETRI_TRANSITIONS=393} [2020-10-09 15:28:41,169 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 13 predicate places. [2020-10-09 15:28:41,170 INFO L481 AbstractCegarLoop]: Abstraction has has 405 places, 393 transitions, 911 flow [2020-10-09 15:28:41,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:41,170 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:41,170 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:28:41,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 250 mathsat -unsat_core_generation=3 [2020-10-09 15:28:41,371 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:41,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:41,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1552030940, now seen corresponding path program 1 times [2020-10-09 15:28:41,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:41,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023252816] [2020-10-09 15:28:41,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 251 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 251 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:41,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:41,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:41,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:41,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023252816] [2020-10-09 15:28:41,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:41,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:41,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137073101] [2020-10-09 15:28:41,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:41,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:41,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:41,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:41,598 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 422 [2020-10-09 15:28:41,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 393 transitions, 911 flow. Second operand 3 states. [2020-10-09 15:28:41,599 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:41,599 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 422 [2020-10-09 15:28:41,599 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:41,680 INFO L129 PetriNetUnfolder]: 33/447 cut-off events. [2020-10-09 15:28:41,681 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:28:41,694 INFO L80 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 447 events. 33/447 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1759 event pairs, 0 based on Foata normal form. 1/401 useless extension candidates. Maximal degree in co-relation 509. Up to 16 conditions per place. [2020-10-09 15:28:41,697 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 5 selfloop transitions, 1 changer transitions 0/391 dead transitions. [2020-10-09 15:28:41,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 391 transitions, 913 flow [2020-10-09 15:28:41,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:41,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2020-10-09 15:28:41,699 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510268562401264 [2020-10-09 15:28:41,699 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2020-10-09 15:28:41,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2020-10-09 15:28:41,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:41,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2020-10-09 15:28:41,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:41,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:41,701 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:41,701 INFO L185 Difference]: Start difference. First operand has 405 places, 393 transitions, 911 flow. Second operand 3 states and 1204 transitions. [2020-10-09 15:28:41,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 391 transitions, 913 flow [2020-10-09 15:28:41,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 391 transitions, 905 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:41,705 INFO L241 Difference]: Finished difference. Result has 405 places, 391 transitions, 898 flow [2020-10-09 15:28:41,705 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=405, PETRI_TRANSITIONS=391} [2020-10-09 15:28:41,705 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 13 predicate places. [2020-10-09 15:28:41,706 INFO L481 AbstractCegarLoop]: Abstraction has has 405 places, 391 transitions, 898 flow [2020-10-09 15:28:41,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:41,706 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:41,706 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:28:41,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 251 mathsat -unsat_core_generation=3 [2020-10-09 15:28:41,907 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:41,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:41,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1552031963, now seen corresponding path program 1 times [2020-10-09 15:28:41,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:41,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111930748] [2020-10-09 15:28:41,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 252 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 252 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:42,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:42,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:42,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:42,123 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:28:42,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111930748] [2020-10-09 15:28:42,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:42,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:42,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954818576] [2020-10-09 15:28:42,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:42,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:42,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:42,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:42,143 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:42,144 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 391 transitions, 898 flow. Second operand 3 states. [2020-10-09 15:28:42,144 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:42,144 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:42,144 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:42,228 INFO L129 PetriNetUnfolder]: 33/445 cut-off events. [2020-10-09 15:28:42,229 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:42,241 INFO L80 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 445 events. 33/445 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1743 event pairs, 0 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 513. Up to 16 conditions per place. [2020-10-09 15:28:42,244 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 8 selfloop transitions, 1 changer transitions 0/389 dead transitions. [2020-10-09 15:28:42,244 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 389 transitions, 911 flow [2020-10-09 15:28:42,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1192 transitions. [2020-10-09 15:28:42,245 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9415481832543444 [2020-10-09 15:28:42,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1192 transitions. [2020-10-09 15:28:42,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1192 transitions. [2020-10-09 15:28:42,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:42,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1192 transitions. [2020-10-09 15:28:42,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:42,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:42,247 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:42,247 INFO L185 Difference]: Start difference. First operand has 405 places, 391 transitions, 898 flow. Second operand 3 states and 1192 transitions. [2020-10-09 15:28:42,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 389 transitions, 911 flow [2020-10-09 15:28:42,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 389 transitions, 910 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:42,251 INFO L241 Difference]: Finished difference. Result has 404 places, 389 transitions, 894 flow [2020-10-09 15:28:42,251 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=404, PETRI_TRANSITIONS=389} [2020-10-09 15:28:42,251 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 12 predicate places. [2020-10-09 15:28:42,251 INFO L481 AbstractCegarLoop]: Abstraction has has 404 places, 389 transitions, 894 flow [2020-10-09 15:28:42,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:42,251 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:42,251 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:42,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 252 mathsat -unsat_core_generation=3 [2020-10-09 15:28:42,453 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:42,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:42,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1121858647, now seen corresponding path program 1 times [2020-10-09 15:28:42,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:42,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317560378] [2020-10-09 15:28:42,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 253 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 253 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:42,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:42,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:42,665 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:42,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:42,666 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:42,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317560378] [2020-10-09 15:28:42,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:42,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:42,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495065937] [2020-10-09 15:28:42,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:42,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:42,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:42,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:42,701 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:42,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 389 transitions, 894 flow. Second operand 3 states. [2020-10-09 15:28:42,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:42,702 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:42,703 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:42,789 INFO L129 PetriNetUnfolder]: 32/453 cut-off events. [2020-10-09 15:28:42,789 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:42,802 INFO L80 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 453 events. 32/453 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1814 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 525. Up to 16 conditions per place. [2020-10-09 15:28:42,805 INFO L132 encePairwiseOnDemand]: 417/422 looper letters, 10 selfloop transitions, 3 changer transitions 0/391 dead transitions. [2020-10-09 15:28:42,806 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 391 transitions, 924 flow [2020-10-09 15:28:42,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:42,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1197 transitions. [2020-10-09 15:28:42,807 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9454976303317536 [2020-10-09 15:28:42,807 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1197 transitions. [2020-10-09 15:28:42,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1197 transitions. [2020-10-09 15:28:42,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:42,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1197 transitions. [2020-10-09 15:28:42,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:42,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:42,808 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:42,809 INFO L185 Difference]: Start difference. First operand has 404 places, 389 transitions, 894 flow. Second operand 3 states and 1197 transitions. [2020-10-09 15:28:42,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 391 transitions, 924 flow [2020-10-09 15:28:42,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 391 transitions, 923 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:42,812 INFO L241 Difference]: Finished difference. Result has 407 places, 391 transitions, 917 flow [2020-10-09 15:28:42,813 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=917, PETRI_PLACES=407, PETRI_TRANSITIONS=391} [2020-10-09 15:28:42,813 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 15 predicate places. [2020-10-09 15:28:42,813 INFO L481 AbstractCegarLoop]: Abstraction has has 407 places, 391 transitions, 917 flow [2020-10-09 15:28:42,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:42,813 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:42,813 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:43,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 253 mathsat -unsat_core_generation=3 [2020-10-09 15:28:43,014 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:43,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:43,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1121859670, now seen corresponding path program 1 times [2020-10-09 15:28:43,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:43,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137554804] [2020-10-09 15:28:43,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 254 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 254 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:43,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:43,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:43,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:43,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137554804] [2020-10-09 15:28:43,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:43,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:43,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886547176] [2020-10-09 15:28:43,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:43,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:43,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:43,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:43,251 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 422 [2020-10-09 15:28:43,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 391 transitions, 917 flow. Second operand 3 states. [2020-10-09 15:28:43,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:43,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 422 [2020-10-09 15:28:43,252 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:43,336 INFO L129 PetriNetUnfolder]: 30/454 cut-off events. [2020-10-09 15:28:43,336 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:28:43,350 INFO L80 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 454 events. 30/454 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1838 event pairs, 0 based on Foata normal form. 1/411 useless extension candidates. Maximal degree in co-relation 523. Up to 16 conditions per place. [2020-10-09 15:28:43,353 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 4 selfloop transitions, 1 changer transitions 0/390 dead transitions. [2020-10-09 15:28:43,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 390 transitions, 923 flow [2020-10-09 15:28:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:43,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1206 transitions. [2020-10-09 15:28:43,354 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.95260663507109 [2020-10-09 15:28:43,354 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1206 transitions. [2020-10-09 15:28:43,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1206 transitions. [2020-10-09 15:28:43,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:43,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1206 transitions. [2020-10-09 15:28:43,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:43,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:43,356 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:43,356 INFO L185 Difference]: Start difference. First operand has 407 places, 391 transitions, 917 flow. Second operand 3 states and 1206 transitions. [2020-10-09 15:28:43,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 390 transitions, 923 flow [2020-10-09 15:28:43,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 390 transitions, 918 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:43,360 INFO L241 Difference]: Finished difference. Result has 409 places, 390 transitions, 913 flow [2020-10-09 15:28:43,360 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=913, PETRI_PLACES=409, PETRI_TRANSITIONS=390} [2020-10-09 15:28:43,360 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 17 predicate places. [2020-10-09 15:28:43,361 INFO L481 AbstractCegarLoop]: Abstraction has has 409 places, 390 transitions, 913 flow [2020-10-09 15:28:43,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:43,361 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:43,361 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:43,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 254 mathsat -unsat_core_generation=3 [2020-10-09 15:28:43,573 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:43,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1122811959, now seen corresponding path program 1 times [2020-10-09 15:28:43,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:43,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591509216] [2020-10-09 15:28:43,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 255 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 255 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:43,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:43,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:43,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:43,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591509216] [2020-10-09 15:28:43,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:43,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:43,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288050017] [2020-10-09 15:28:43,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:43,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:43,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:43,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:43,819 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 422 [2020-10-09 15:28:43,820 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 390 transitions, 913 flow. Second operand 3 states. [2020-10-09 15:28:43,820 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:43,820 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 422 [2020-10-09 15:28:43,820 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:43,904 INFO L129 PetriNetUnfolder]: 30/447 cut-off events. [2020-10-09 15:28:43,904 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:28:43,917 INFO L80 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 447 events. 30/447 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1777 event pairs, 0 based on Foata normal form. 1/404 useless extension candidates. Maximal degree in co-relation 519. Up to 16 conditions per place. [2020-10-09 15:28:43,919 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 5 selfloop transitions, 1 changer transitions 0/388 dead transitions. [2020-10-09 15:28:43,919 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 388 transitions, 916 flow [2020-10-09 15:28:43,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:43,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:43,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2020-10-09 15:28:43,921 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510268562401264 [2020-10-09 15:28:43,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2020-10-09 15:28:43,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2020-10-09 15:28:43,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:43,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2020-10-09 15:28:43,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:43,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:43,922 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:43,922 INFO L185 Difference]: Start difference. First operand has 409 places, 390 transitions, 913 flow. Second operand 3 states and 1204 transitions. [2020-10-09 15:28:43,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 388 transitions, 916 flow [2020-10-09 15:28:43,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 388 transitions, 909 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:43,926 INFO L241 Difference]: Finished difference. Result has 409 places, 388 transitions, 902 flow [2020-10-09 15:28:43,926 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=409, PETRI_TRANSITIONS=388} [2020-10-09 15:28:43,926 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 17 predicate places. [2020-10-09 15:28:43,926 INFO L481 AbstractCegarLoop]: Abstraction has has 409 places, 388 transitions, 902 flow [2020-10-09 15:28:43,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:43,927 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:43,927 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:44,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 255 mathsat -unsat_core_generation=3 [2020-10-09 15:28:44,128 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:44,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:44,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1122812982, now seen corresponding path program 1 times [2020-10-09 15:28:44,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:44,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326600851] [2020-10-09 15:28:44,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 256 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 256 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:44,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:44,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:44,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:28:44,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326600851] [2020-10-09 15:28:44,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:44,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:44,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590541498] [2020-10-09 15:28:44,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:44,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:44,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:44,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:44,361 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:44,362 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 388 transitions, 902 flow. Second operand 3 states. [2020-10-09 15:28:44,362 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:44,362 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:44,362 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:44,446 INFO L129 PetriNetUnfolder]: 30/445 cut-off events. [2020-10-09 15:28:44,446 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:44,460 INFO L80 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 445 events. 30/445 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1761 event pairs, 0 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 519. Up to 16 conditions per place. [2020-10-09 15:28:44,463 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 8 selfloop transitions, 1 changer transitions 0/386 dead transitions. [2020-10-09 15:28:44,463 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 386 transitions, 915 flow [2020-10-09 15:28:44,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:44,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:44,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1192 transitions. [2020-10-09 15:28:44,464 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9415481832543444 [2020-10-09 15:28:44,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1192 transitions. [2020-10-09 15:28:44,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1192 transitions. [2020-10-09 15:28:44,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:44,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1192 transitions. [2020-10-09 15:28:44,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:44,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:44,466 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:44,466 INFO L185 Difference]: Start difference. First operand has 409 places, 388 transitions, 902 flow. Second operand 3 states and 1192 transitions. [2020-10-09 15:28:44,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 386 transitions, 915 flow [2020-10-09 15:28:44,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 386 transitions, 914 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:44,470 INFO L241 Difference]: Finished difference. Result has 408 places, 386 transitions, 898 flow [2020-10-09 15:28:44,470 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=408, PETRI_TRANSITIONS=386} [2020-10-09 15:28:44,470 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 16 predicate places. [2020-10-09 15:28:44,470 INFO L481 AbstractCegarLoop]: Abstraction has has 408 places, 386 transitions, 898 flow [2020-10-09 15:28:44,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:44,470 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:44,470 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:44,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 256 mathsat -unsat_core_generation=3 [2020-10-09 15:28:44,680 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:44,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:44,681 INFO L82 PathProgramCache]: Analyzing trace with hash 942460368, now seen corresponding path program 1 times [2020-10-09 15:28:44,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:44,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952433299] [2020-10-09 15:28:44,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 257 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 257 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:44,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:44,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:44,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:44,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952433299] [2020-10-09 15:28:44,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:44,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:44,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126814802] [2020-10-09 15:28:44,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:44,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:44,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:44,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:44,924 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 422 [2020-10-09 15:28:44,924 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 386 transitions, 898 flow. Second operand 3 states. [2020-10-09 15:28:44,925 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:44,925 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 422 [2020-10-09 15:28:44,925 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:45,007 INFO L129 PetriNetUnfolder]: 29/452 cut-off events. [2020-10-09 15:28:45,007 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:45,020 INFO L80 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 452 events. 29/452 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1820 event pairs, 0 based on Foata normal form. 1/409 useless extension candidates. Maximal degree in co-relation 522. Up to 16 conditions per place. [2020-10-09 15:28:45,023 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 4 selfloop transitions, 1 changer transitions 0/386 dead transitions. [2020-10-09 15:28:45,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 386 transitions, 908 flow [2020-10-09 15:28:45,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1206 transitions. [2020-10-09 15:28:45,024 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.95260663507109 [2020-10-09 15:28:45,024 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1206 transitions. [2020-10-09 15:28:45,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1206 transitions. [2020-10-09 15:28:45,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:45,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1206 transitions. [2020-10-09 15:28:45,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:45,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:45,026 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:45,026 INFO L185 Difference]: Start difference. First operand has 408 places, 386 transitions, 898 flow. Second operand 3 states and 1206 transitions. [2020-10-09 15:28:45,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 386 transitions, 908 flow [2020-10-09 15:28:45,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 386 transitions, 907 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:45,030 INFO L241 Difference]: Finished difference. Result has 410 places, 386 transitions, 902 flow [2020-10-09 15:28:45,030 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=410, PETRI_TRANSITIONS=386} [2020-10-09 15:28:45,030 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 18 predicate places. [2020-10-09 15:28:45,030 INFO L481 AbstractCegarLoop]: Abstraction has has 410 places, 386 transitions, 902 flow [2020-10-09 15:28:45,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:45,030 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:45,030 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:45,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 257 mathsat -unsat_core_generation=3 [2020-10-09 15:28:45,239 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:45,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:45,239 INFO L82 PathProgramCache]: Analyzing trace with hash 942461391, now seen corresponding path program 1 times [2020-10-09 15:28:45,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:45,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483587758] [2020-10-09 15:28:45,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 258 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 258 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:45,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:45,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:45,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:45,454 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:45,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483587758] [2020-10-09 15:28:45,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:45,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:45,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490862653] [2020-10-09 15:28:45,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:45,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:45,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:45,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:45,484 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:45,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 386 transitions, 902 flow. Second operand 3 states. [2020-10-09 15:28:45,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:45,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:45,485 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:45,573 INFO L129 PetriNetUnfolder]: 27/454 cut-off events. [2020-10-09 15:28:45,573 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:45,586 INFO L80 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 454 events. 27/454 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1853 event pairs, 0 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 535. Up to 16 conditions per place. [2020-10-09 15:28:45,589 INFO L132 encePairwiseOnDemand]: 418/422 looper letters, 9 selfloop transitions, 3 changer transitions 0/387 dead transitions. [2020-10-09 15:28:45,589 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 387 transitions, 928 flow [2020-10-09 15:28:45,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1195 transitions. [2020-10-09 15:28:45,590 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9439178515007899 [2020-10-09 15:28:45,590 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1195 transitions. [2020-10-09 15:28:45,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1195 transitions. [2020-10-09 15:28:45,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:45,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1195 transitions. [2020-10-09 15:28:45,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:45,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:45,592 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:45,592 INFO L185 Difference]: Start difference. First operand has 410 places, 386 transitions, 902 flow. Second operand 3 states and 1195 transitions. [2020-10-09 15:28:45,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 387 transitions, 928 flow [2020-10-09 15:28:45,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 387 transitions, 927 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:45,596 INFO L241 Difference]: Finished difference. Result has 413 places, 387 transitions, 919 flow [2020-10-09 15:28:45,596 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=919, PETRI_PLACES=413, PETRI_TRANSITIONS=387} [2020-10-09 15:28:45,596 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 21 predicate places. [2020-10-09 15:28:45,597 INFO L481 AbstractCegarLoop]: Abstraction has has 413 places, 387 transitions, 919 flow [2020-10-09 15:28:45,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:45,597 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:45,597 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:45,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 258 mathsat -unsat_core_generation=3 [2020-10-09 15:28:45,798 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:45,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:45,798 INFO L82 PathProgramCache]: Analyzing trace with hash 941508079, now seen corresponding path program 1 times [2020-10-09 15:28:45,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:45,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962810101] [2020-10-09 15:28:45,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 259 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 259 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:46,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:46,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:46,011 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:46,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:46,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962810101] [2020-10-09 15:28:46,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:46,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:46,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633480282] [2020-10-09 15:28:46,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:46,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:46,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:46,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:46,024 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 422 [2020-10-09 15:28:46,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 387 transitions, 919 flow. Second operand 3 states. [2020-10-09 15:28:46,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:46,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 422 [2020-10-09 15:28:46,025 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:46,109 INFO L129 PetriNetUnfolder]: 27/447 cut-off events. [2020-10-09 15:28:46,109 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:28:46,122 INFO L80 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 447 events. 27/447 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1796 event pairs, 0 based on Foata normal form. 1/407 useless extension candidates. Maximal degree in co-relation 521. Up to 16 conditions per place. [2020-10-09 15:28:46,124 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 5 selfloop transitions, 1 changer transitions 0/385 dead transitions. [2020-10-09 15:28:46,125 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 385 transitions, 921 flow [2020-10-09 15:28:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2020-10-09 15:28:46,131 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510268562401264 [2020-10-09 15:28:46,132 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2020-10-09 15:28:46,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2020-10-09 15:28:46,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:46,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2020-10-09 15:28:46,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:46,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:46,134 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:46,134 INFO L185 Difference]: Start difference. First operand has 413 places, 387 transitions, 919 flow. Second operand 3 states and 1204 transitions. [2020-10-09 15:28:46,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 385 transitions, 921 flow [2020-10-09 15:28:46,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 385 transitions, 913 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:46,140 INFO L241 Difference]: Finished difference. Result has 413 places, 385 transitions, 906 flow [2020-10-09 15:28:46,141 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=906, PETRI_PLACES=413, PETRI_TRANSITIONS=385} [2020-10-09 15:28:46,141 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 21 predicate places. [2020-10-09 15:28:46,141 INFO L481 AbstractCegarLoop]: Abstraction has has 413 places, 385 transitions, 906 flow [2020-10-09 15:28:46,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:46,142 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:46,142 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:46,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 259 mathsat -unsat_core_generation=3 [2020-10-09 15:28:46,359 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:46,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:46,359 INFO L82 PathProgramCache]: Analyzing trace with hash 941507056, now seen corresponding path program 1 times [2020-10-09 15:28:46,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:46,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419810697] [2020-10-09 15:28:46,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 260 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 260 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:46,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:46,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:46,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:28:46,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419810697] [2020-10-09 15:28:46,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:46,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:46,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127910195] [2020-10-09 15:28:46,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:46,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:46,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:46,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:46,603 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:46,604 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 385 transitions, 906 flow. Second operand 3 states. [2020-10-09 15:28:46,604 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:46,604 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:46,604 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:46,717 INFO L129 PetriNetUnfolder]: 27/445 cut-off events. [2020-10-09 15:28:46,717 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:46,726 INFO L80 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 445 events. 27/445 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1781 event pairs, 0 based on Foata normal form. 0/403 useless extension candidates. Maximal degree in co-relation 525. Up to 16 conditions per place. [2020-10-09 15:28:46,729 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 8 selfloop transitions, 1 changer transitions 0/383 dead transitions. [2020-10-09 15:28:46,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 383 transitions, 919 flow [2020-10-09 15:28:46,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1192 transitions. [2020-10-09 15:28:46,730 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9415481832543444 [2020-10-09 15:28:46,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1192 transitions. [2020-10-09 15:28:46,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1192 transitions. [2020-10-09 15:28:46,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:46,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1192 transitions. [2020-10-09 15:28:46,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:46,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:46,732 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:46,732 INFO L185 Difference]: Start difference. First operand has 413 places, 385 transitions, 906 flow. Second operand 3 states and 1192 transitions. [2020-10-09 15:28:46,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 383 transitions, 919 flow [2020-10-09 15:28:46,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 383 transitions, 918 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:46,736 INFO L241 Difference]: Finished difference. Result has 412 places, 383 transitions, 902 flow [2020-10-09 15:28:46,736 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=412, PETRI_TRANSITIONS=383} [2020-10-09 15:28:46,736 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 20 predicate places. [2020-10-09 15:28:46,736 INFO L481 AbstractCegarLoop]: Abstraction has has 412 places, 383 transitions, 902 flow [2020-10-09 15:28:46,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:46,736 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:46,737 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:46,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 260 mathsat -unsat_core_generation=3 [2020-10-09 15:28:46,948 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:46,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:46,948 INFO L82 PathProgramCache]: Analyzing trace with hash -307633897, now seen corresponding path program 1 times [2020-10-09 15:28:46,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:46,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378953031] [2020-10-09 15:28:46,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 261 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 261 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:47,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:47,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:47,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:47,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378953031] [2020-10-09 15:28:47,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:47,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:47,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524806896] [2020-10-09 15:28:47,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:47,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:47,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:47,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:47,200 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:47,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 383 transitions, 902 flow. Second operand 3 states. [2020-10-09 15:28:47,201 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:47,201 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:47,201 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:47,291 INFO L129 PetriNetUnfolder]: 26/453 cut-off events. [2020-10-09 15:28:47,291 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:47,304 INFO L80 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 453 events. 26/453 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1849 event pairs, 0 based on Foata normal form. 0/411 useless extension candidates. Maximal degree in co-relation 537. Up to 16 conditions per place. [2020-10-09 15:28:47,307 INFO L132 encePairwiseOnDemand]: 417/422 looper letters, 10 selfloop transitions, 3 changer transitions 0/385 dead transitions. [2020-10-09 15:28:47,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 385 transitions, 932 flow [2020-10-09 15:28:47,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1197 transitions. [2020-10-09 15:28:47,308 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9454976303317536 [2020-10-09 15:28:47,308 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1197 transitions. [2020-10-09 15:28:47,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1197 transitions. [2020-10-09 15:28:47,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:47,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1197 transitions. [2020-10-09 15:28:47,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:47,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:47,311 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:47,311 INFO L185 Difference]: Start difference. First operand has 412 places, 383 transitions, 902 flow. Second operand 3 states and 1197 transitions. [2020-10-09 15:28:47,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 385 transitions, 932 flow [2020-10-09 15:28:47,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 385 transitions, 931 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:47,315 INFO L241 Difference]: Finished difference. Result has 415 places, 385 transitions, 925 flow [2020-10-09 15:28:47,315 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=925, PETRI_PLACES=415, PETRI_TRANSITIONS=385} [2020-10-09 15:28:47,315 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 23 predicate places. [2020-10-09 15:28:47,315 INFO L481 AbstractCegarLoop]: Abstraction has has 415 places, 385 transitions, 925 flow [2020-10-09 15:28:47,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:47,315 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:47,315 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:47,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 261 mathsat -unsat_core_generation=3 [2020-10-09 15:28:47,516 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:47,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:47,517 INFO L82 PathProgramCache]: Analyzing trace with hash -307632874, now seen corresponding path program 1 times [2020-10-09 15:28:47,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:47,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248902249] [2020-10-09 15:28:47,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 262 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 262 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:47,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:47,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:47,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:47,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248902249] [2020-10-09 15:28:47,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:47,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:47,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864539498] [2020-10-09 15:28:47,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:47,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:47,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:47,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:47,749 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 422 [2020-10-09 15:28:47,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 385 transitions, 925 flow. Second operand 3 states. [2020-10-09 15:28:47,750 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:47,750 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 422 [2020-10-09 15:28:47,750 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:47,839 INFO L129 PetriNetUnfolder]: 25/451 cut-off events. [2020-10-09 15:28:47,839 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:28:47,852 INFO L80 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 451 events. 25/451 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1840 event pairs, 0 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 534. Up to 16 conditions per place. [2020-10-09 15:28:47,854 INFO L132 encePairwiseOnDemand]: 419/422 looper letters, 5 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2020-10-09 15:28:47,854 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 385 transitions, 937 flow [2020-10-09 15:28:47,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1205 transitions. [2020-10-09 15:28:47,856 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518167456556083 [2020-10-09 15:28:47,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1205 transitions. [2020-10-09 15:28:47,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1205 transitions. [2020-10-09 15:28:47,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:47,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1205 transitions. [2020-10-09 15:28:47,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:47,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:47,858 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:47,858 INFO L185 Difference]: Start difference. First operand has 415 places, 385 transitions, 925 flow. Second operand 3 states and 1205 transitions. [2020-10-09 15:28:47,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 385 transitions, 937 flow [2020-10-09 15:28:47,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 385 transitions, 932 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:47,862 INFO L241 Difference]: Finished difference. Result has 418 places, 385 transitions, 930 flow [2020-10-09 15:28:47,862 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=930, PETRI_PLACES=418, PETRI_TRANSITIONS=385} [2020-10-09 15:28:47,862 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 26 predicate places. [2020-10-09 15:28:47,862 INFO L481 AbstractCegarLoop]: Abstraction has has 418 places, 385 transitions, 930 flow [2020-10-09 15:28:47,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:47,862 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:47,863 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:48,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 262 mathsat -unsat_core_generation=3 [2020-10-09 15:28:48,063 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:48,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:48,064 INFO L82 PathProgramCache]: Analyzing trace with hash -306680585, now seen corresponding path program 1 times [2020-10-09 15:28:48,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:48,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383876329] [2020-10-09 15:28:48,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 263 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 263 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:48,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:48,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:48,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:48,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383876329] [2020-10-09 15:28:48,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:48,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:48,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562712912] [2020-10-09 15:28:48,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:48,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:48,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:48,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:48,256 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 422 [2020-10-09 15:28:48,257 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 385 transitions, 930 flow. Second operand 3 states. [2020-10-09 15:28:48,257 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:48,257 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 422 [2020-10-09 15:28:48,258 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:48,346 INFO L129 PetriNetUnfolder]: 24/447 cut-off events. [2020-10-09 15:28:48,346 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:28:48,359 INFO L80 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 447 events. 24/447 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1812 event pairs, 0 based on Foata normal form. 1/410 useless extension candidates. Maximal degree in co-relation 530. Up to 16 conditions per place. [2020-10-09 15:28:48,361 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 4 selfloop transitions, 1 changer transitions 0/382 dead transitions. [2020-10-09 15:28:48,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 382 transitions, 925 flow [2020-10-09 15:28:48,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1206 transitions. [2020-10-09 15:28:48,362 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.95260663507109 [2020-10-09 15:28:48,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1206 transitions. [2020-10-09 15:28:48,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1206 transitions. [2020-10-09 15:28:48,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:48,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1206 transitions. [2020-10-09 15:28:48,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:48,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:48,364 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:48,364 INFO L185 Difference]: Start difference. First operand has 418 places, 385 transitions, 930 flow. Second operand 3 states and 1206 transitions. [2020-10-09 15:28:48,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 382 transitions, 925 flow [2020-10-09 15:28:48,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 382 transitions, 918 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:48,369 INFO L241 Difference]: Finished difference. Result has 417 places, 382 transitions, 910 flow [2020-10-09 15:28:48,370 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=910, PETRI_PLACES=417, PETRI_TRANSITIONS=382} [2020-10-09 15:28:48,370 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 25 predicate places. [2020-10-09 15:28:48,370 INFO L481 AbstractCegarLoop]: Abstraction has has 417 places, 382 transitions, 910 flow [2020-10-09 15:28:48,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:48,370 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:48,370 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:48,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 263 mathsat -unsat_core_generation=3 [2020-10-09 15:28:48,581 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:48,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:48,582 INFO L82 PathProgramCache]: Analyzing trace with hash -306679562, now seen corresponding path program 1 times [2020-10-09 15:28:48,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:48,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276685730] [2020-10-09 15:28:48,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 264 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 264 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:48,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:48,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:48,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:28:48,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276685730] [2020-10-09 15:28:48,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:48,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:48,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629309779] [2020-10-09 15:28:48,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:48,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:48,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:48,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:48,818 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:48,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 382 transitions, 910 flow. Second operand 3 states. [2020-10-09 15:28:48,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:48,819 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:48,819 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:48,904 INFO L129 PetriNetUnfolder]: 24/445 cut-off events. [2020-10-09 15:28:48,904 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:48,916 INFO L80 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 445 events. 24/445 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1799 event pairs, 0 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 532. Up to 16 conditions per place. [2020-10-09 15:28:48,917 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 8 selfloop transitions, 1 changer transitions 0/380 dead transitions. [2020-10-09 15:28:48,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 380 transitions, 923 flow [2020-10-09 15:28:48,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:48,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1192 transitions. [2020-10-09 15:28:48,919 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9415481832543444 [2020-10-09 15:28:48,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1192 transitions. [2020-10-09 15:28:48,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1192 transitions. [2020-10-09 15:28:48,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:48,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1192 transitions. [2020-10-09 15:28:48,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:48,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:48,920 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:48,920 INFO L185 Difference]: Start difference. First operand has 417 places, 382 transitions, 910 flow. Second operand 3 states and 1192 transitions. [2020-10-09 15:28:48,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 380 transitions, 923 flow [2020-10-09 15:28:48,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 380 transitions, 922 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:48,924 INFO L241 Difference]: Finished difference. Result has 416 places, 380 transitions, 906 flow [2020-10-09 15:28:48,924 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=906, PETRI_PLACES=416, PETRI_TRANSITIONS=380} [2020-10-09 15:28:48,924 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 24 predicate places. [2020-10-09 15:28:48,924 INFO L481 AbstractCegarLoop]: Abstraction has has 416 places, 380 transitions, 906 flow [2020-10-09 15:28:48,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:48,924 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:48,924 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:49,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 264 mathsat -unsat_core_generation=3 [2020-10-09 15:28:49,125 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:49,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:49,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1335259457, now seen corresponding path program 1 times [2020-10-09 15:28:49,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:49,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468435924] [2020-10-09 15:28:49,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 265 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 265 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:49,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:49,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:49,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:49,345 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:49,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468435924] [2020-10-09 15:28:49,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:49,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:49,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77501325] [2020-10-09 15:28:49,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:49,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:49,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:49,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:49,372 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:49,373 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 380 transitions, 906 flow. Second operand 3 states. [2020-10-09 15:28:49,373 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:49,373 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:49,373 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:49,468 INFO L129 PetriNetUnfolder]: 23/453 cut-off events. [2020-10-09 15:28:49,469 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:49,482 INFO L80 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 453 events. 23/453 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1866 event pairs, 0 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 544. Up to 16 conditions per place. [2020-10-09 15:28:49,484 INFO L132 encePairwiseOnDemand]: 417/422 looper letters, 10 selfloop transitions, 3 changer transitions 0/382 dead transitions. [2020-10-09 15:28:49,485 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 382 transitions, 936 flow [2020-10-09 15:28:49,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1197 transitions. [2020-10-09 15:28:49,486 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9454976303317536 [2020-10-09 15:28:49,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1197 transitions. [2020-10-09 15:28:49,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1197 transitions. [2020-10-09 15:28:49,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:49,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1197 transitions. [2020-10-09 15:28:49,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:49,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:49,487 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:49,487 INFO L185 Difference]: Start difference. First operand has 416 places, 380 transitions, 906 flow. Second operand 3 states and 1197 transitions. [2020-10-09 15:28:49,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 382 transitions, 936 flow [2020-10-09 15:28:49,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 382 transitions, 935 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:49,491 INFO L241 Difference]: Finished difference. Result has 419 places, 382 transitions, 929 flow [2020-10-09 15:28:49,491 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=929, PETRI_PLACES=419, PETRI_TRANSITIONS=382} [2020-10-09 15:28:49,491 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 27 predicate places. [2020-10-09 15:28:49,492 INFO L481 AbstractCegarLoop]: Abstraction has has 419 places, 382 transitions, 929 flow [2020-10-09 15:28:49,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:49,492 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:49,492 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:49,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 265 mathsat -unsat_core_generation=3 [2020-10-09 15:28:49,692 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:49,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:49,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1335258434, now seen corresponding path program 1 times [2020-10-09 15:28:49,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:49,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621193047] [2020-10-09 15:28:49,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 266 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 266 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:49,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:49,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:49,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:49,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621193047] [2020-10-09 15:28:49,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:49,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:49,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167426207] [2020-10-09 15:28:49,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:49,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:49,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:49,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:49,948 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 422 [2020-10-09 15:28:49,949 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 382 transitions, 929 flow. Second operand 3 states. [2020-10-09 15:28:49,949 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:49,949 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 422 [2020-10-09 15:28:49,949 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:50,040 INFO L129 PetriNetUnfolder]: 22/451 cut-off events. [2020-10-09 15:28:50,040 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:28:50,054 INFO L80 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 451 events. 22/451 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1857 event pairs, 0 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 541. Up to 16 conditions per place. [2020-10-09 15:28:50,056 INFO L132 encePairwiseOnDemand]: 419/422 looper letters, 5 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2020-10-09 15:28:50,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 382 transitions, 941 flow [2020-10-09 15:28:50,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1205 transitions. [2020-10-09 15:28:50,057 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518167456556083 [2020-10-09 15:28:50,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1205 transitions. [2020-10-09 15:28:50,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1205 transitions. [2020-10-09 15:28:50,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:50,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1205 transitions. [2020-10-09 15:28:50,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:50,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:50,058 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:50,059 INFO L185 Difference]: Start difference. First operand has 419 places, 382 transitions, 929 flow. Second operand 3 states and 1205 transitions. [2020-10-09 15:28:50,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 382 transitions, 941 flow [2020-10-09 15:28:50,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 382 transitions, 936 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:50,062 INFO L241 Difference]: Finished difference. Result has 422 places, 382 transitions, 934 flow [2020-10-09 15:28:50,062 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=934, PETRI_PLACES=422, PETRI_TRANSITIONS=382} [2020-10-09 15:28:50,063 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 30 predicate places. [2020-10-09 15:28:50,063 INFO L481 AbstractCegarLoop]: Abstraction has has 422 places, 382 transitions, 934 flow [2020-10-09 15:28:50,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:50,063 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:50,063 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:50,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 266 mathsat -unsat_core_generation=3 [2020-10-09 15:28:50,264 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:50,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:50,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1334306145, now seen corresponding path program 1 times [2020-10-09 15:28:50,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:50,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314448488] [2020-10-09 15:28:50,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 267 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 267 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:50,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:50,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:50,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:50,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314448488] [2020-10-09 15:28:50,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:50,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:50,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808338144] [2020-10-09 15:28:50,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:50,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:50,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:50,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:50,498 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 422 [2020-10-09 15:28:50,499 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 382 transitions, 934 flow. Second operand 3 states. [2020-10-09 15:28:50,499 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:50,499 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 422 [2020-10-09 15:28:50,500 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:50,588 INFO L129 PetriNetUnfolder]: 21/447 cut-off events. [2020-10-09 15:28:50,588 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:28:50,602 INFO L80 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 447 events. 21/447 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1829 event pairs, 0 based on Foata normal form. 1/413 useless extension candidates. Maximal degree in co-relation 537. Up to 16 conditions per place. [2020-10-09 15:28:50,603 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 4 selfloop transitions, 1 changer transitions 0/379 dead transitions. [2020-10-09 15:28:50,603 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 379 transitions, 929 flow [2020-10-09 15:28:50,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1206 transitions. [2020-10-09 15:28:50,605 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.95260663507109 [2020-10-09 15:28:50,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1206 transitions. [2020-10-09 15:28:50,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1206 transitions. [2020-10-09 15:28:50,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:50,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1206 transitions. [2020-10-09 15:28:50,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:50,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:50,606 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:50,606 INFO L185 Difference]: Start difference. First operand has 422 places, 382 transitions, 934 flow. Second operand 3 states and 1206 transitions. [2020-10-09 15:28:50,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 379 transitions, 929 flow [2020-10-09 15:28:50,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 379 transitions, 922 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:50,610 INFO L241 Difference]: Finished difference. Result has 421 places, 379 transitions, 914 flow [2020-10-09 15:28:50,610 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=914, PETRI_PLACES=421, PETRI_TRANSITIONS=379} [2020-10-09 15:28:50,610 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 29 predicate places. [2020-10-09 15:28:50,610 INFO L481 AbstractCegarLoop]: Abstraction has has 421 places, 379 transitions, 914 flow [2020-10-09 15:28:50,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:50,610 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:50,610 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:50,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 267 mathsat -unsat_core_generation=3 [2020-10-09 15:28:50,811 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:50,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:50,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1334305122, now seen corresponding path program 1 times [2020-10-09 15:28:50,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:50,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411044125] [2020-10-09 15:28:50,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 268 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 268 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:51,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:51,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:51,031 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:51,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:51,032 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:28:51,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411044125] [2020-10-09 15:28:51,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:51,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:51,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051982041] [2020-10-09 15:28:51,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:51,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:51,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:51,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:51,053 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:51,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 379 transitions, 914 flow. Second operand 3 states. [2020-10-09 15:28:51,054 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:51,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:51,054 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:51,145 INFO L129 PetriNetUnfolder]: 21/445 cut-off events. [2020-10-09 15:28:51,145 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:51,158 INFO L80 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 445 events. 21/445 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1812 event pairs, 0 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 539. Up to 16 conditions per place. [2020-10-09 15:28:51,160 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 8 selfloop transitions, 1 changer transitions 0/377 dead transitions. [2020-10-09 15:28:51,160 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 377 transitions, 927 flow [2020-10-09 15:28:51,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1192 transitions. [2020-10-09 15:28:51,161 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9415481832543444 [2020-10-09 15:28:51,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1192 transitions. [2020-10-09 15:28:51,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1192 transitions. [2020-10-09 15:28:51,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:51,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1192 transitions. [2020-10-09 15:28:51,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:51,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:51,163 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:51,163 INFO L185 Difference]: Start difference. First operand has 421 places, 379 transitions, 914 flow. Second operand 3 states and 1192 transitions. [2020-10-09 15:28:51,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 377 transitions, 927 flow [2020-10-09 15:28:51,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 377 transitions, 926 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:51,167 INFO L241 Difference]: Finished difference. Result has 420 places, 377 transitions, 910 flow [2020-10-09 15:28:51,167 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=910, PETRI_PLACES=420, PETRI_TRANSITIONS=377} [2020-10-09 15:28:51,167 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 28 predicate places. [2020-10-09 15:28:51,167 INFO L481 AbstractCegarLoop]: Abstraction has has 420 places, 377 transitions, 910 flow [2020-10-09 15:28:51,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:51,168 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:51,168 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:51,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 268 mathsat -unsat_core_generation=3 [2020-10-09 15:28:51,370 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:51,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:51,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1203534407, now seen corresponding path program 1 times [2020-10-09 15:28:51,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:51,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516436250] [2020-10-09 15:28:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 269 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 269 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:51,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:51,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:51,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:51,592 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:51,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516436250] [2020-10-09 15:28:51,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:51,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:51,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086610915] [2020-10-09 15:28:51,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:51,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:51,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:51,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:51,628 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:51,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 377 transitions, 910 flow. Second operand 3 states. [2020-10-09 15:28:51,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:51,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:51,630 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:51,748 INFO L129 PetriNetUnfolder]: 20/453 cut-off events. [2020-10-09 15:28:51,749 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:51,763 INFO L80 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 453 events. 20/453 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1887 event pairs, 0 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 551. Up to 16 conditions per place. [2020-10-09 15:28:51,765 INFO L132 encePairwiseOnDemand]: 417/422 looper letters, 10 selfloop transitions, 3 changer transitions 0/379 dead transitions. [2020-10-09 15:28:51,765 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 379 transitions, 940 flow [2020-10-09 15:28:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1197 transitions. [2020-10-09 15:28:51,766 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9454976303317536 [2020-10-09 15:28:51,766 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1197 transitions. [2020-10-09 15:28:51,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1197 transitions. [2020-10-09 15:28:51,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:51,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1197 transitions. [2020-10-09 15:28:51,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:51,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:51,767 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:51,768 INFO L185 Difference]: Start difference. First operand has 420 places, 377 transitions, 910 flow. Second operand 3 states and 1197 transitions. [2020-10-09 15:28:51,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 379 transitions, 940 flow [2020-10-09 15:28:51,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 379 transitions, 939 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:51,772 INFO L241 Difference]: Finished difference. Result has 423 places, 379 transitions, 933 flow [2020-10-09 15:28:51,772 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=933, PETRI_PLACES=423, PETRI_TRANSITIONS=379} [2020-10-09 15:28:51,772 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 31 predicate places. [2020-10-09 15:28:51,772 INFO L481 AbstractCegarLoop]: Abstraction has has 423 places, 379 transitions, 933 flow [2020-10-09 15:28:51,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:51,773 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:51,773 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:51,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 269 mathsat -unsat_core_generation=3 [2020-10-09 15:28:51,973 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:51,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:51,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1203533384, now seen corresponding path program 1 times [2020-10-09 15:28:51,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:51,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816523885] [2020-10-09 15:28:51,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 270 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 270 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:52,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:52,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:52,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:52,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816523885] [2020-10-09 15:28:52,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:52,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:52,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989566539] [2020-10-09 15:28:52,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:52,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:52,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:52,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:52,220 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 422 [2020-10-09 15:28:52,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 379 transitions, 933 flow. Second operand 3 states. [2020-10-09 15:28:52,221 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:52,221 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 422 [2020-10-09 15:28:52,221 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:52,313 INFO L129 PetriNetUnfolder]: 18/454 cut-off events. [2020-10-09 15:28:52,313 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:28:52,327 INFO L80 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 454 events. 18/454 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1905 event pairs, 0 based on Foata normal form. 1/423 useless extension candidates. Maximal degree in co-relation 549. Up to 16 conditions per place. [2020-10-09 15:28:52,329 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 4 selfloop transitions, 1 changer transitions 0/378 dead transitions. [2020-10-09 15:28:52,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 378 transitions, 939 flow [2020-10-09 15:28:52,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1206 transitions. [2020-10-09 15:28:52,330 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.95260663507109 [2020-10-09 15:28:52,330 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1206 transitions. [2020-10-09 15:28:52,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1206 transitions. [2020-10-09 15:28:52,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:52,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1206 transitions. [2020-10-09 15:28:52,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:52,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:52,331 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:52,331 INFO L185 Difference]: Start difference. First operand has 423 places, 379 transitions, 933 flow. Second operand 3 states and 1206 transitions. [2020-10-09 15:28:52,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 378 transitions, 939 flow [2020-10-09 15:28:52,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 378 transitions, 934 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:52,335 INFO L241 Difference]: Finished difference. Result has 425 places, 378 transitions, 929 flow [2020-10-09 15:28:52,336 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=929, PETRI_PLACES=425, PETRI_TRANSITIONS=378} [2020-10-09 15:28:52,336 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 33 predicate places. [2020-10-09 15:28:52,336 INFO L481 AbstractCegarLoop]: Abstraction has has 425 places, 378 transitions, 929 flow [2020-10-09 15:28:52,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:52,336 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:52,336 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:52,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 270 mathsat -unsat_core_generation=3 [2020-10-09 15:28:52,537 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:52,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:52,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1202581095, now seen corresponding path program 1 times [2020-10-09 15:28:52,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:52,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343975110] [2020-10-09 15:28:52,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 271 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 271 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:52,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:52,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:52,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:52,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343975110] [2020-10-09 15:28:52,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:52,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:52,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008037980] [2020-10-09 15:28:52,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:52,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:52,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:52,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:52,803 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 422 [2020-10-09 15:28:52,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 378 transitions, 929 flow. Second operand 3 states. [2020-10-09 15:28:52,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:52,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 422 [2020-10-09 15:28:52,804 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:52,898 INFO L129 PetriNetUnfolder]: 18/447 cut-off events. [2020-10-09 15:28:52,898 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:28:52,912 INFO L80 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 447 events. 18/447 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1846 event pairs, 0 based on Foata normal form. 1/416 useless extension candidates. Maximal degree in co-relation 545. Up to 16 conditions per place. [2020-10-09 15:28:52,914 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 5 selfloop transitions, 1 changer transitions 0/376 dead transitions. [2020-10-09 15:28:52,914 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 376 transitions, 932 flow [2020-10-09 15:28:52,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:52,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2020-10-09 15:28:52,916 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510268562401264 [2020-10-09 15:28:52,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2020-10-09 15:28:52,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2020-10-09 15:28:52,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:52,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2020-10-09 15:28:52,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:52,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:52,919 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:52,919 INFO L185 Difference]: Start difference. First operand has 425 places, 378 transitions, 929 flow. Second operand 3 states and 1204 transitions. [2020-10-09 15:28:52,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 376 transitions, 932 flow [2020-10-09 15:28:52,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 376 transitions, 925 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:52,924 INFO L241 Difference]: Finished difference. Result has 425 places, 376 transitions, 918 flow [2020-10-09 15:28:52,925 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=918, PETRI_PLACES=425, PETRI_TRANSITIONS=376} [2020-10-09 15:28:52,925 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 33 predicate places. [2020-10-09 15:28:52,925 INFO L481 AbstractCegarLoop]: Abstraction has has 425 places, 376 transitions, 918 flow [2020-10-09 15:28:52,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:52,925 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:52,925 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:53,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 271 mathsat -unsat_core_generation=3 [2020-10-09 15:28:53,132 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:53,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:53,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1202580072, now seen corresponding path program 1 times [2020-10-09 15:28:53,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:53,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182156953] [2020-10-09 15:28:53,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 272 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 272 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:53,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:53,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:53,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:28:53,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182156953] [2020-10-09 15:28:53,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:53,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:53,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879081573] [2020-10-09 15:28:53,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:53,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:53,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:53,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:53,376 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:53,377 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 376 transitions, 918 flow. Second operand 3 states. [2020-10-09 15:28:53,377 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:53,377 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:53,378 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:53,476 INFO L129 PetriNetUnfolder]: 18/445 cut-off events. [2020-10-09 15:28:53,476 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:53,490 INFO L80 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 445 events. 18/445 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1831 event pairs, 0 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 545. Up to 16 conditions per place. [2020-10-09 15:28:53,492 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 8 selfloop transitions, 1 changer transitions 0/374 dead transitions. [2020-10-09 15:28:53,492 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 374 transitions, 931 flow [2020-10-09 15:28:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1192 transitions. [2020-10-09 15:28:53,494 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9415481832543444 [2020-10-09 15:28:53,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1192 transitions. [2020-10-09 15:28:53,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1192 transitions. [2020-10-09 15:28:53,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:53,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1192 transitions. [2020-10-09 15:28:53,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:53,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:53,495 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:53,495 INFO L185 Difference]: Start difference. First operand has 425 places, 376 transitions, 918 flow. Second operand 3 states and 1192 transitions. [2020-10-09 15:28:53,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 374 transitions, 931 flow [2020-10-09 15:28:53,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 374 transitions, 930 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:53,499 INFO L241 Difference]: Finished difference. Result has 424 places, 374 transitions, 914 flow [2020-10-09 15:28:53,500 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=914, PETRI_PLACES=424, PETRI_TRANSITIONS=374} [2020-10-09 15:28:53,500 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 32 predicate places. [2020-10-09 15:28:53,500 INFO L481 AbstractCegarLoop]: Abstraction has has 424 places, 374 transitions, 914 flow [2020-10-09 15:28:53,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:53,500 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:53,500 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:53,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 272 mathsat -unsat_core_generation=3 [2020-10-09 15:28:53,701 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:53,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:53,701 INFO L82 PathProgramCache]: Analyzing trace with hash 452199281, now seen corresponding path program 1 times [2020-10-09 15:28:53,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:53,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681898596] [2020-10-09 15:28:53,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 273 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 273 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:53,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:53,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:53,931 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:28:53,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:28:53,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681898596] [2020-10-09 15:28:53,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:53,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:53,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834782769] [2020-10-09 15:28:53,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:53,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:53,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:53,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:53,964 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:53,964 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 374 transitions, 914 flow. Second operand 3 states. [2020-10-09 15:28:53,964 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:53,964 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:53,964 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:54,069 INFO L129 PetriNetUnfolder]: 17/453 cut-off events. [2020-10-09 15:28:54,069 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:54,085 INFO L80 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 453 events. 17/453 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1901 event pairs, 0 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 557. Up to 16 conditions per place. [2020-10-09 15:28:54,087 INFO L132 encePairwiseOnDemand]: 417/422 looper letters, 10 selfloop transitions, 3 changer transitions 0/376 dead transitions. [2020-10-09 15:28:54,087 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 376 transitions, 944 flow [2020-10-09 15:28:54,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1197 transitions. [2020-10-09 15:28:54,088 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9454976303317536 [2020-10-09 15:28:54,088 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1197 transitions. [2020-10-09 15:28:54,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1197 transitions. [2020-10-09 15:28:54,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:54,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1197 transitions. [2020-10-09 15:28:54,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:54,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:54,091 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:54,091 INFO L185 Difference]: Start difference. First operand has 424 places, 374 transitions, 914 flow. Second operand 3 states and 1197 transitions. [2020-10-09 15:28:54,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 376 transitions, 944 flow [2020-10-09 15:28:54,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 376 transitions, 943 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:54,095 INFO L241 Difference]: Finished difference. Result has 427 places, 376 transitions, 937 flow [2020-10-09 15:28:54,096 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=937, PETRI_PLACES=427, PETRI_TRANSITIONS=376} [2020-10-09 15:28:54,096 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 35 predicate places. [2020-10-09 15:28:54,096 INFO L481 AbstractCegarLoop]: Abstraction has has 427 places, 376 transitions, 937 flow [2020-10-09 15:28:54,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:54,096 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:54,096 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:54,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 273 mathsat -unsat_core_generation=3 [2020-10-09 15:28:54,297 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:54,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:54,297 INFO L82 PathProgramCache]: Analyzing trace with hash 452198258, now seen corresponding path program 1 times [2020-10-09 15:28:54,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:54,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006419640] [2020-10-09 15:28:54,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 274 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 274 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:54,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:54,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:28:54,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:54,528 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:28:54,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006419640] [2020-10-09 15:28:54,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:54,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:54,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111766849] [2020-10-09 15:28:54,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:54,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:54,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:54,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:54,550 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 422 [2020-10-09 15:28:54,551 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 376 transitions, 937 flow. Second operand 3 states. [2020-10-09 15:28:54,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:54,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 422 [2020-10-09 15:28:54,551 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:54,647 INFO L129 PetriNetUnfolder]: 15/454 cut-off events. [2020-10-09 15:28:54,648 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:28:54,663 INFO L80 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 454 events. 15/454 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1920 event pairs, 0 based on Foata normal form. 1/426 useless extension candidates. Maximal degree in co-relation 555. Up to 16 conditions per place. [2020-10-09 15:28:54,665 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 4 selfloop transitions, 1 changer transitions 0/375 dead transitions. [2020-10-09 15:28:54,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 375 transitions, 943 flow [2020-10-09 15:28:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:54,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:54,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1206 transitions. [2020-10-09 15:28:54,666 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.95260663507109 [2020-10-09 15:28:54,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1206 transitions. [2020-10-09 15:28:54,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1206 transitions. [2020-10-09 15:28:54,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:54,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1206 transitions. [2020-10-09 15:28:54,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:54,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:54,667 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:54,668 INFO L185 Difference]: Start difference. First operand has 427 places, 376 transitions, 937 flow. Second operand 3 states and 1206 transitions. [2020-10-09 15:28:54,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 375 transitions, 943 flow [2020-10-09 15:28:54,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 375 transitions, 938 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:54,672 INFO L241 Difference]: Finished difference. Result has 429 places, 375 transitions, 933 flow [2020-10-09 15:28:54,672 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=933, PETRI_PLACES=429, PETRI_TRANSITIONS=375} [2020-10-09 15:28:54,672 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 37 predicate places. [2020-10-09 15:28:54,672 INFO L481 AbstractCegarLoop]: Abstraction has has 429 places, 375 transitions, 933 flow [2020-10-09 15:28:54,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:54,672 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:54,672 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:54,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 274 mathsat -unsat_core_generation=3 [2020-10-09 15:28:54,873 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:54,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:54,873 INFO L82 PathProgramCache]: Analyzing trace with hash 451245969, now seen corresponding path program 1 times [2020-10-09 15:28:54,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:54,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843752747] [2020-10-09 15:28:54,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 275 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 275 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:55,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:55,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:55,094 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:28:55,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:28:55,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843752747] [2020-10-09 15:28:55,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:55,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:55,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158317838] [2020-10-09 15:28:55,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:55,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:55,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:55,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:55,115 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 422 [2020-10-09 15:28:55,116 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 375 transitions, 933 flow. Second operand 3 states. [2020-10-09 15:28:55,116 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:55,116 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 422 [2020-10-09 15:28:55,116 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:55,233 INFO L129 PetriNetUnfolder]: 15/447 cut-off events. [2020-10-09 15:28:55,233 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:28:55,247 INFO L80 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 447 events. 15/447 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1866 event pairs, 0 based on Foata normal form. 1/419 useless extension candidates. Maximal degree in co-relation 551. Up to 16 conditions per place. [2020-10-09 15:28:55,249 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 5 selfloop transitions, 1 changer transitions 0/373 dead transitions. [2020-10-09 15:28:55,249 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 373 transitions, 936 flow [2020-10-09 15:28:55,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2020-10-09 15:28:55,250 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510268562401264 [2020-10-09 15:28:55,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2020-10-09 15:28:55,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2020-10-09 15:28:55,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:55,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2020-10-09 15:28:55,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:55,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:55,251 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:55,251 INFO L185 Difference]: Start difference. First operand has 429 places, 375 transitions, 933 flow. Second operand 3 states and 1204 transitions. [2020-10-09 15:28:55,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 373 transitions, 936 flow [2020-10-09 15:28:55,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 373 transitions, 929 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:55,255 INFO L241 Difference]: Finished difference. Result has 429 places, 373 transitions, 922 flow [2020-10-09 15:28:55,256 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=922, PETRI_PLACES=429, PETRI_TRANSITIONS=373} [2020-10-09 15:28:55,256 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 37 predicate places. [2020-10-09 15:28:55,256 INFO L481 AbstractCegarLoop]: Abstraction has has 429 places, 373 transitions, 922 flow [2020-10-09 15:28:55,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:55,256 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:55,256 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:55,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 275 mathsat -unsat_core_generation=3 [2020-10-09 15:28:55,457 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:55,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:55,457 INFO L82 PathProgramCache]: Analyzing trace with hash 451244946, now seen corresponding path program 1 times [2020-10-09 15:28:55,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:55,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284718566] [2020-10-09 15:28:55,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 276 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 276 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:55,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:55,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:28:55,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:55,694 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:28:55,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284718566] [2020-10-09 15:28:55,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:55,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:55,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976615258] [2020-10-09 15:28:55,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:55,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:55,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:55,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:55,723 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:55,723 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 373 transitions, 922 flow. Second operand 3 states. [2020-10-09 15:28:55,723 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:55,723 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:55,723 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:55,817 INFO L129 PetriNetUnfolder]: 15/445 cut-off events. [2020-10-09 15:28:55,818 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:55,831 INFO L80 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 445 events. 15/445 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1848 event pairs, 0 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 551. Up to 16 conditions per place. [2020-10-09 15:28:55,832 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 8 selfloop transitions, 1 changer transitions 0/371 dead transitions. [2020-10-09 15:28:55,833 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 371 transitions, 935 flow [2020-10-09 15:28:55,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:55,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1192 transitions. [2020-10-09 15:28:55,834 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9415481832543444 [2020-10-09 15:28:55,834 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1192 transitions. [2020-10-09 15:28:55,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1192 transitions. [2020-10-09 15:28:55,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:55,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1192 transitions. [2020-10-09 15:28:55,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:55,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:55,835 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:55,835 INFO L185 Difference]: Start difference. First operand has 429 places, 373 transitions, 922 flow. Second operand 3 states and 1192 transitions. [2020-10-09 15:28:55,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 371 transitions, 935 flow [2020-10-09 15:28:55,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 371 transitions, 934 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:55,839 INFO L241 Difference]: Finished difference. Result has 428 places, 371 transitions, 918 flow [2020-10-09 15:28:55,839 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=918, PETRI_PLACES=428, PETRI_TRANSITIONS=371} [2020-10-09 15:28:55,839 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 36 predicate places. [2020-10-09 15:28:55,839 INFO L481 AbstractCegarLoop]: Abstraction has has 428 places, 371 transitions, 918 flow [2020-10-09 15:28:55,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:55,840 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:55,840 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:56,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 276 mathsat -unsat_core_generation=3 [2020-10-09 15:28:56,040 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:56,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:56,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1484099997, now seen corresponding path program 1 times [2020-10-09 15:28:56,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:56,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98555288] [2020-10-09 15:28:56,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 277 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 277 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:56,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:28:56,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:28:56,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:28:56,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98555288] [2020-10-09 15:28:56,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:56,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:56,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684370139] [2020-10-09 15:28:56,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:56,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:56,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:56,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:56,284 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 422 [2020-10-09 15:28:56,285 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 371 transitions, 918 flow. Second operand 3 states. [2020-10-09 15:28:56,285 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:56,286 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 422 [2020-10-09 15:28:56,286 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:56,381 INFO L129 PetriNetUnfolder]: 14/452 cut-off events. [2020-10-09 15:28:56,382 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:28:56,399 INFO L80 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 452 events. 14/452 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1908 event pairs, 0 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 554. Up to 16 conditions per place. [2020-10-09 15:28:56,401 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 4 selfloop transitions, 1 changer transitions 0/371 dead transitions. [2020-10-09 15:28:56,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 371 transitions, 928 flow [2020-10-09 15:28:56,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:56,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1206 transitions. [2020-10-09 15:28:56,402 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.95260663507109 [2020-10-09 15:28:56,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1206 transitions. [2020-10-09 15:28:56,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1206 transitions. [2020-10-09 15:28:56,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:56,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1206 transitions. [2020-10-09 15:28:56,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:56,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:56,404 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:56,404 INFO L185 Difference]: Start difference. First operand has 428 places, 371 transitions, 918 flow. Second operand 3 states and 1206 transitions. [2020-10-09 15:28:56,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 371 transitions, 928 flow [2020-10-09 15:28:56,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 371 transitions, 927 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:56,408 INFO L241 Difference]: Finished difference. Result has 430 places, 371 transitions, 922 flow [2020-10-09 15:28:56,409 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=922, PETRI_PLACES=430, PETRI_TRANSITIONS=371} [2020-10-09 15:28:56,409 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 38 predicate places. [2020-10-09 15:28:56,409 INFO L481 AbstractCegarLoop]: Abstraction has has 430 places, 371 transitions, 922 flow [2020-10-09 15:28:56,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:56,409 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:56,409 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:56,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 277 mathsat -unsat_core_generation=3 [2020-10-09 15:28:56,610 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:56,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:56,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1484101020, now seen corresponding path program 1 times [2020-10-09 15:28:56,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:56,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707179046] [2020-10-09 15:28:56,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 278 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 278 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:56,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:56,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:28:56,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:28:56,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707179046] [2020-10-09 15:28:56,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:56,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:56,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470562817] [2020-10-09 15:28:56,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:56,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:56,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:56,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:56,856 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:56,857 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 371 transitions, 922 flow. Second operand 3 states. [2020-10-09 15:28:56,857 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:56,857 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:56,857 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:56,962 INFO L129 PetriNetUnfolder]: 12/454 cut-off events. [2020-10-09 15:28:56,963 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:56,977 INFO L80 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 454 events. 12/454 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1940 event pairs, 0 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 567. Up to 16 conditions per place. [2020-10-09 15:28:56,978 INFO L132 encePairwiseOnDemand]: 418/422 looper letters, 9 selfloop transitions, 3 changer transitions 0/372 dead transitions. [2020-10-09 15:28:56,978 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 372 transitions, 948 flow [2020-10-09 15:28:56,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:56,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1195 transitions. [2020-10-09 15:28:56,980 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9439178515007899 [2020-10-09 15:28:56,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1195 transitions. [2020-10-09 15:28:56,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1195 transitions. [2020-10-09 15:28:56,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:56,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1195 transitions. [2020-10-09 15:28:56,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:56,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:56,981 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:56,981 INFO L185 Difference]: Start difference. First operand has 430 places, 371 transitions, 922 flow. Second operand 3 states and 1195 transitions. [2020-10-09 15:28:56,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 372 transitions, 948 flow [2020-10-09 15:28:56,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 372 transitions, 947 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:56,985 INFO L241 Difference]: Finished difference. Result has 433 places, 372 transitions, 939 flow [2020-10-09 15:28:56,985 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=939, PETRI_PLACES=433, PETRI_TRANSITIONS=372} [2020-10-09 15:28:56,986 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 41 predicate places. [2020-10-09 15:28:56,986 INFO L481 AbstractCegarLoop]: Abstraction has has 433 places, 372 transitions, 939 flow [2020-10-09 15:28:56,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:56,986 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:56,986 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:57,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 278 mathsat -unsat_core_generation=3 [2020-10-09 15:28:57,187 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:57,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:57,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1483147708, now seen corresponding path program 1 times [2020-10-09 15:28:57,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:57,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572662962] [2020-10-09 15:28:57,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 279 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 279 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:57,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:57,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:28:57,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:28:57,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572662962] [2020-10-09 15:28:57,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:57,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:57,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079571730] [2020-10-09 15:28:57,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:57,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:57,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:57,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:57,424 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 422 [2020-10-09 15:28:57,424 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 372 transitions, 939 flow. Second operand 3 states. [2020-10-09 15:28:57,425 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:57,425 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 422 [2020-10-09 15:28:57,425 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:57,520 INFO L129 PetriNetUnfolder]: 12/447 cut-off events. [2020-10-09 15:28:57,521 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:28:57,534 INFO L80 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 447 events. 12/447 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1880 event pairs, 0 based on Foata normal form. 1/422 useless extension candidates. Maximal degree in co-relation 553. Up to 16 conditions per place. [2020-10-09 15:28:57,536 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 5 selfloop transitions, 1 changer transitions 0/370 dead transitions. [2020-10-09 15:28:57,536 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 370 transitions, 941 flow [2020-10-09 15:28:57,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2020-10-09 15:28:57,537 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9510268562401264 [2020-10-09 15:28:57,537 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2020-10-09 15:28:57,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2020-10-09 15:28:57,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:57,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2020-10-09 15:28:57,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:57,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:57,538 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:57,538 INFO L185 Difference]: Start difference. First operand has 433 places, 372 transitions, 939 flow. Second operand 3 states and 1204 transitions. [2020-10-09 15:28:57,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 370 transitions, 941 flow [2020-10-09 15:28:57,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 370 transitions, 933 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:28:57,542 INFO L241 Difference]: Finished difference. Result has 433 places, 370 transitions, 926 flow [2020-10-09 15:28:57,543 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=926, PETRI_PLACES=433, PETRI_TRANSITIONS=370} [2020-10-09 15:28:57,543 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 41 predicate places. [2020-10-09 15:28:57,543 INFO L481 AbstractCegarLoop]: Abstraction has has 433 places, 370 transitions, 926 flow [2020-10-09 15:28:57,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:57,543 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:57,543 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:57,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 279 mathsat -unsat_core_generation=3 [2020-10-09 15:28:57,744 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:57,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:57,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1483146685, now seen corresponding path program 1 times [2020-10-09 15:28:57,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:57,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236969431] [2020-10-09 15:28:57,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 280 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 280 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:57,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:57,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:28:57,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:57,969 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:28:57,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236969431] [2020-10-09 15:28:57,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:57,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:57,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219864041] [2020-10-09 15:28:57,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:57,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:57,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:57,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:57,989 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 422 [2020-10-09 15:28:57,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 370 transitions, 926 flow. Second operand 3 states. [2020-10-09 15:28:57,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:57,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 422 [2020-10-09 15:28:57,990 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:58,090 INFO L129 PetriNetUnfolder]: 12/445 cut-off events. [2020-10-09 15:28:58,090 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:28:58,104 INFO L80 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 445 events. 12/445 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1870 event pairs, 0 based on Foata normal form. 0/418 useless extension candidates. Maximal degree in co-relation 557. Up to 16 conditions per place. [2020-10-09 15:28:58,105 INFO L132 encePairwiseOnDemand]: 420/422 looper letters, 8 selfloop transitions, 1 changer transitions 0/368 dead transitions. [2020-10-09 15:28:58,105 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 368 transitions, 939 flow [2020-10-09 15:28:58,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:58,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1192 transitions. [2020-10-09 15:28:58,106 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9415481832543444 [2020-10-09 15:28:58,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1192 transitions. [2020-10-09 15:28:58,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1192 transitions. [2020-10-09 15:28:58,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:58,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1192 transitions. [2020-10-09 15:28:58,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:58,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:58,108 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:58,108 INFO L185 Difference]: Start difference. First operand has 433 places, 370 transitions, 926 flow. Second operand 3 states and 1192 transitions. [2020-10-09 15:28:58,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 368 transitions, 939 flow [2020-10-09 15:28:58,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 368 transitions, 938 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:28:58,112 INFO L241 Difference]: Finished difference. Result has 432 places, 368 transitions, 922 flow [2020-10-09 15:28:58,112 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=922, PETRI_PLACES=432, PETRI_TRANSITIONS=368} [2020-10-09 15:28:58,112 INFO L341 CegarLoopForPetriNet]: 392 programPoint places, 40 predicate places. [2020-10-09 15:28:58,113 INFO L481 AbstractCegarLoop]: Abstraction has has 432 places, 368 transitions, 922 flow [2020-10-09 15:28:58,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:58,113 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:58,113 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:58,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 280 mathsat -unsat_core_generation=3 [2020-10-09 15:28:58,313 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:58,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:58,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1815019321, now seen corresponding path program 1 times [2020-10-09 15:28:58,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:58,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132477848] [2020-10-09 15:28:58,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 281 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 281 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:28:58,560 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:28:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:28:58,587 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:28:58,629 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:28:58,630 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:28:58,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 281 mathsat -unsat_core_generation=3 [2020-10-09 15:28:58,830 WARN L371 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:28:58,831 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2020-10-09 15:28:58,860 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,861 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,861 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,861 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,861 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,861 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,861 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,861 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,862 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,862 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,862 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,862 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,862 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,862 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,862 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,862 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,862 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,862 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,862 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,864 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,864 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,864 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,864 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,864 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,864 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,864 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,866 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,868 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,868 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,868 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,868 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,871 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,871 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,874 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,875 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,875 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,875 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,875 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,876 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,876 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,876 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,876 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,876 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,876 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,876 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,888 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,888 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,915 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,915 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,915 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,915 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,915 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,920 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,920 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,925 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,925 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,925 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,926 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,926 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,926 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,926 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,932 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,933 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,933 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,933 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,933 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,933 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,933 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,933 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,934 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,934 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,934 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,935 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,935 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,936 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,936 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,936 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,937 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,938 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,938 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,938 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,939 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,939 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,942 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,942 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,942 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,942 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,945 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,945 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,947 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,947 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,947 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,947 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,952 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,955 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,956 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,956 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,956 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,956 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,958 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,958 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,958 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,961 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,961 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,961 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,961 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,961 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,961 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,961 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,964 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,964 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,967 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,968 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,968 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,968 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,969 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,969 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,969 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,970 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:28:58,978 INFO L253 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2020-10-09 15:28:58,978 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:28:58,978 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:28:58,978 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:28:58,978 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:28:58,978 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:28:58,979 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:28:58,979 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:28:58,979 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:28:58,982 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 417 places, 449 transitions, 1218 flow [2020-10-09 15:28:59,193 INFO L129 PetriNetUnfolder]: 81/592 cut-off events. [2020-10-09 15:28:59,194 INFO L130 PetriNetUnfolder]: For 800/800 co-relation queries the response was YES. [2020-10-09 15:28:59,236 INFO L80 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 592 events. 81/592 cut-off events. For 800/800 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2391 event pairs, 0 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 716. Up to 34 conditions per place. [2020-10-09 15:28:59,237 INFO L82 GeneralOperation]: Start removeDead. Operand has 417 places, 449 transitions, 1218 flow [2020-10-09 15:28:59,254 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 417 places, 449 transitions, 1218 flow [2020-10-09 15:28:59,265 INFO L129 PetriNetUnfolder]: 9/95 cut-off events. [2020-10-09 15:28:59,265 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:28:59,265 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:59,265 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:28:59,266 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:28:59,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:28:59,266 INFO L82 PathProgramCache]: Analyzing trace with hash 839044854, now seen corresponding path program 1 times [2020-10-09 15:28:59,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:28:59,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778958938] [2020-10-09 15:28:59,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 282 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 282 with mathsat -unsat_core_generation=3 [2020-10-09 15:28:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:28:59,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:28:59,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:28:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:28:59,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:28:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:28:59,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778958938] [2020-10-09 15:28:59,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:28:59,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:28:59,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014639809] [2020-10-09 15:28:59,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:28:59,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:28:59,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:28:59,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:28:59,606 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:28:59,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 449 transitions, 1218 flow. Second operand 3 states. [2020-10-09 15:28:59,607 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:28:59,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:28:59,608 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:28:59,771 INFO L129 PetriNetUnfolder]: 47/482 cut-off events. [2020-10-09 15:28:59,772 INFO L130 PetriNetUnfolder]: For 801/801 co-relation queries the response was YES. [2020-10-09 15:28:59,801 INFO L80 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 482 events. 47/482 cut-off events. For 801/801 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1854 event pairs, 0 based on Foata normal form. 72/489 useless extension candidates. Maximal degree in co-relation 618. Up to 17 conditions per place. [2020-10-09 15:28:59,810 INFO L132 encePairwiseOnDemand]: 426/449 looper letters, 10 selfloop transitions, 3 changer transitions 0/429 dead transitions. [2020-10-09 15:28:59,810 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 429 transitions, 1204 flow [2020-10-09 15:28:59,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:28:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:28:59,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1311 transitions. [2020-10-09 15:28:59,812 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9732739420935412 [2020-10-09 15:28:59,812 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1311 transitions. [2020-10-09 15:28:59,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1311 transitions. [2020-10-09 15:28:59,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:28:59,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1311 transitions. [2020-10-09 15:28:59,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:28:59,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:28:59,815 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:28:59,815 INFO L185 Difference]: Start difference. First operand has 417 places, 449 transitions, 1218 flow. Second operand 3 states and 1311 transitions. [2020-10-09 15:28:59,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 429 transitions, 1204 flow [2020-10-09 15:28:59,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 429 transitions, 964 flow, removed 120 selfloop flow, removed 0 redundant places. [2020-10-09 15:28:59,823 INFO L241 Difference]: Finished difference. Result has 416 places, 429 transitions, 958 flow [2020-10-09 15:28:59,823 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=958, PETRI_PLACES=416, PETRI_TRANSITIONS=429} [2020-10-09 15:28:59,823 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, -1 predicate places. [2020-10-09 15:28:59,823 INFO L481 AbstractCegarLoop]: Abstraction has has 416 places, 429 transitions, 958 flow [2020-10-09 15:28:59,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:28:59,824 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:28:59,824 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:00,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 282 mathsat -unsat_core_generation=3 [2020-10-09 15:29:00,038 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:00,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:00,038 INFO L82 PathProgramCache]: Analyzing trace with hash 839999189, now seen corresponding path program 1 times [2020-10-09 15:29:00,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:00,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438261287] [2020-10-09 15:29:00,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 283 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 283 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:00,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:00,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:29:00,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:29:00,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438261287] [2020-10-09 15:29:00,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:00,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:00,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252229481] [2020-10-09 15:29:00,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:00,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:00,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:00,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:00,304 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:00,305 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 429 transitions, 958 flow. Second operand 3 states. [2020-10-09 15:29:00,305 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:00,305 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:00,305 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:00,400 INFO L129 PetriNetUnfolder]: 45/480 cut-off events. [2020-10-09 15:29:00,400 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:29:00,416 INFO L80 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 480 events. 45/480 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1849 event pairs, 0 based on Foata normal form. 2/420 useless extension candidates. Maximal degree in co-relation 528. Up to 17 conditions per place. [2020-10-09 15:29:00,421 INFO L132 encePairwiseOnDemand]: 446/449 looper letters, 10 selfloop transitions, 1 changer transitions 0/427 dead transitions. [2020-10-09 15:29:00,421 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 427 transitions, 968 flow [2020-10-09 15:29:00,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:00,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2020-10-09 15:29:00,422 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9450631031922792 [2020-10-09 15:29:00,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1273 transitions. [2020-10-09 15:29:00,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1273 transitions. [2020-10-09 15:29:00,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:00,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1273 transitions. [2020-10-09 15:29:00,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:00,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:00,425 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:00,425 INFO L185 Difference]: Start difference. First operand has 416 places, 429 transitions, 958 flow. Second operand 3 states and 1273 transitions. [2020-10-09 15:29:00,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 427 transitions, 968 flow [2020-10-09 15:29:00,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 427 transitions, 967 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:00,429 INFO L241 Difference]: Finished difference. Result has 417 places, 427 transitions, 947 flow [2020-10-09 15:29:00,429 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=945, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=947, PETRI_PLACES=417, PETRI_TRANSITIONS=427} [2020-10-09 15:29:00,430 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 0 predicate places. [2020-10-09 15:29:00,430 INFO L481 AbstractCegarLoop]: Abstraction has has 417 places, 427 transitions, 947 flow [2020-10-09 15:29:00,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:00,430 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:00,430 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:00,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 283 mathsat -unsat_core_generation=3 [2020-10-09 15:29:00,631 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:00,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:00,631 INFO L82 PathProgramCache]: Analyzing trace with hash 839998166, now seen corresponding path program 1 times [2020-10-09 15:29:00,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:00,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111148077] [2020-10-09 15:29:00,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 284 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 284 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:00,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:00,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:29:00,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:29:00,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111148077] [2020-10-09 15:29:00,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:00,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:00,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694130103] [2020-10-09 15:29:00,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:00,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:00,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:00,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:00,875 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 449 [2020-10-09 15:29:00,876 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 427 transitions, 947 flow. Second operand 3 states. [2020-10-09 15:29:00,876 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:00,876 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 449 [2020-10-09 15:29:00,876 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:00,966 INFO L129 PetriNetUnfolder]: 45/477 cut-off events. [2020-10-09 15:29:00,966 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-09 15:29:00,981 INFO L80 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 477 events. 45/477 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1829 event pairs, 0 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 526. Up to 17 conditions per place. [2020-10-09 15:29:00,986 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 4 selfloop transitions, 1 changer transitions 0/426 dead transitions. [2020-10-09 15:29:00,986 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 426 transitions, 953 flow [2020-10-09 15:29:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:00,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2020-10-09 15:29:00,987 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9532293986636972 [2020-10-09 15:29:00,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2020-10-09 15:29:00,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2020-10-09 15:29:00,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:00,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2020-10-09 15:29:00,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:00,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:00,989 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:00,989 INFO L185 Difference]: Start difference. First operand has 417 places, 427 transitions, 947 flow. Second operand 3 states and 1284 transitions. [2020-10-09 15:29:00,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 426 transitions, 953 flow [2020-10-09 15:29:00,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 426 transitions, 950 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:00,993 INFO L241 Difference]: Finished difference. Result has 419 places, 426 transitions, 945 flow [2020-10-09 15:29:00,993 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=945, PETRI_PLACES=419, PETRI_TRANSITIONS=426} [2020-10-09 15:29:00,993 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 2 predicate places. [2020-10-09 15:29:00,993 INFO L481 AbstractCegarLoop]: Abstraction has has 419 places, 426 transitions, 945 flow [2020-10-09 15:29:00,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:00,993 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:00,993 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:01,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 284 mathsat -unsat_core_generation=3 [2020-10-09 15:29:01,194 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:01,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:01,194 INFO L82 PathProgramCache]: Analyzing trace with hash 839045877, now seen corresponding path program 1 times [2020-10-09 15:29:01,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:01,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370865257] [2020-10-09 15:29:01,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 285 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 285 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:01,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:01,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:29:01,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:29:01,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370865257] [2020-10-09 15:29:01,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:01,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:01,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762400219] [2020-10-09 15:29:01,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:01,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:01,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:01,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:01,446 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 449 [2020-10-09 15:29:01,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 426 transitions, 945 flow. Second operand 3 states. [2020-10-09 15:29:01,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:01,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 449 [2020-10-09 15:29:01,447 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:01,538 INFO L129 PetriNetUnfolder]: 45/474 cut-off events. [2020-10-09 15:29:01,538 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:29:01,552 INFO L80 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 474 events. 45/474 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1808 event pairs, 0 based on Foata normal form. 1/415 useless extension candidates. Maximal degree in co-relation 524. Up to 17 conditions per place. [2020-10-09 15:29:01,557 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 5 selfloop transitions, 1 changer transitions 0/424 dead transitions. [2020-10-09 15:29:01,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 424 transitions, 951 flow [2020-10-09 15:29:01,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2020-10-09 15:29:01,558 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9517446176688938 [2020-10-09 15:29:01,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1282 transitions. [2020-10-09 15:29:01,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1282 transitions. [2020-10-09 15:29:01,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:01,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1282 transitions. [2020-10-09 15:29:01,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:01,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:01,560 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:01,560 INFO L185 Difference]: Start difference. First operand has 419 places, 426 transitions, 945 flow. Second operand 3 states and 1282 transitions. [2020-10-09 15:29:01,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 424 transitions, 951 flow [2020-10-09 15:29:01,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 424 transitions, 947 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-09 15:29:01,564 INFO L241 Difference]: Finished difference. Result has 418 places, 424 transitions, 940 flow [2020-10-09 15:29:01,564 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=940, PETRI_PLACES=418, PETRI_TRANSITIONS=424} [2020-10-09 15:29:01,564 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 1 predicate places. [2020-10-09 15:29:01,564 INFO L481 AbstractCegarLoop]: Abstraction has has 418 places, 424 transitions, 940 flow [2020-10-09 15:29:01,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:01,565 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:01,565 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:29:01,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 285 mathsat -unsat_core_generation=3 [2020-10-09 15:29:01,765 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:01,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:01,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1550462833, now seen corresponding path program 1 times [2020-10-09 15:29:01,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:01,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223506470] [2020-10-09 15:29:01,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 286 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 286 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:02,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:02,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:29:02,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:29:02,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223506470] [2020-10-09 15:29:02,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:02,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:02,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639393460] [2020-10-09 15:29:02,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:02,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:02,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:02,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:02,029 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 449 [2020-10-09 15:29:02,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 424 transitions, 940 flow. Second operand 3 states. [2020-10-09 15:29:02,030 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:02,030 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 449 [2020-10-09 15:29:02,030 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:02,118 INFO L129 PetriNetUnfolder]: 43/479 cut-off events. [2020-10-09 15:29:02,118 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:02,133 INFO L80 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 479 events. 43/479 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1861 event pairs, 0 based on Foata normal form. 0/418 useless extension candidates. Maximal degree in co-relation 533. Up to 17 conditions per place. [2020-10-09 15:29:02,138 INFO L132 encePairwiseOnDemand]: 446/449 looper letters, 5 selfloop transitions, 2 changer transitions 0/425 dead transitions. [2020-10-09 15:29:02,138 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 425 transitions, 956 flow [2020-10-09 15:29:02,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2020-10-09 15:29:02,139 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9524870081662955 [2020-10-09 15:29:02,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1283 transitions. [2020-10-09 15:29:02,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1283 transitions. [2020-10-09 15:29:02,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:02,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1283 transitions. [2020-10-09 15:29:02,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:02,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:02,141 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:02,141 INFO L185 Difference]: Start difference. First operand has 418 places, 424 transitions, 940 flow. Second operand 3 states and 1283 transitions. [2020-10-09 15:29:02,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 425 transitions, 956 flow [2020-10-09 15:29:02,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 425 transitions, 955 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:02,145 INFO L241 Difference]: Finished difference. Result has 421 places, 425 transitions, 953 flow [2020-10-09 15:29:02,145 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=953, PETRI_PLACES=421, PETRI_TRANSITIONS=425} [2020-10-09 15:29:02,145 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 4 predicate places. [2020-10-09 15:29:02,145 INFO L481 AbstractCegarLoop]: Abstraction has has 421 places, 425 transitions, 953 flow [2020-10-09 15:29:02,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:02,145 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:02,145 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:29:02,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 286 mathsat -unsat_core_generation=3 [2020-10-09 15:29:02,346 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:02,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:02,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1550461810, now seen corresponding path program 1 times [2020-10-09 15:29:02,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:02,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746695403] [2020-10-09 15:29:02,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 287 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 287 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:02,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:02,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:29:02,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:29:02,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746695403] [2020-10-09 15:29:02,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:02,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:02,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951306302] [2020-10-09 15:29:02,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:02,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:02,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:02,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:02,609 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:02,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 425 transitions, 953 flow. Second operand 3 states. [2020-10-09 15:29:02,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:02,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:02,610 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:02,701 INFO L129 PetriNetUnfolder]: 43/480 cut-off events. [2020-10-09 15:29:02,702 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:29:02,717 INFO L80 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 480 events. 43/480 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1868 event pairs, 0 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 539. Up to 17 conditions per place. [2020-10-09 15:29:02,722 INFO L132 encePairwiseOnDemand]: 445/449 looper letters, 9 selfloop transitions, 3 changer transitions 0/426 dead transitions. [2020-10-09 15:29:02,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 426 transitions, 979 flow [2020-10-09 15:29:02,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:02,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:02,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2020-10-09 15:29:02,723 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9450631031922792 [2020-10-09 15:29:02,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1273 transitions. [2020-10-09 15:29:02,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1273 transitions. [2020-10-09 15:29:02,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:02,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1273 transitions. [2020-10-09 15:29:02,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:02,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:02,725 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:02,725 INFO L185 Difference]: Start difference. First operand has 421 places, 425 transitions, 953 flow. Second operand 3 states and 1273 transitions. [2020-10-09 15:29:02,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 426 transitions, 979 flow [2020-10-09 15:29:02,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 426 transitions, 977 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:02,729 INFO L241 Difference]: Finished difference. Result has 424 places, 426 transitions, 969 flow [2020-10-09 15:29:02,729 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=969, PETRI_PLACES=424, PETRI_TRANSITIONS=426} [2020-10-09 15:29:02,729 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 7 predicate places. [2020-10-09 15:29:02,729 INFO L481 AbstractCegarLoop]: Abstraction has has 424 places, 426 transitions, 969 flow [2020-10-09 15:29:02,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:02,729 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:02,729 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:29:02,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 287 mathsat -unsat_core_generation=3 [2020-10-09 15:29:02,930 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:02,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:02,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1551415122, now seen corresponding path program 1 times [2020-10-09 15:29:02,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:02,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090930869] [2020-10-09 15:29:02,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 288 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 288 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:03,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:03,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:29:03,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:29:03,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090930869] [2020-10-09 15:29:03,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:03,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:03,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130064766] [2020-10-09 15:29:03,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:03,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:03,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:03,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:03,184 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 449 [2020-10-09 15:29:03,185 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 426 transitions, 969 flow. Second operand 3 states. [2020-10-09 15:29:03,185 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:03,185 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 449 [2020-10-09 15:29:03,185 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:03,273 INFO L129 PetriNetUnfolder]: 42/476 cut-off events. [2020-10-09 15:29:03,273 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:29:03,288 INFO L80 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 476 events. 42/476 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1843 event pairs, 0 based on Foata normal form. 1/420 useless extension candidates. Maximal degree in co-relation 531. Up to 17 conditions per place. [2020-10-09 15:29:03,292 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 4 selfloop transitions, 1 changer transitions 0/423 dead transitions. [2020-10-09 15:29:03,292 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 423 transitions, 964 flow [2020-10-09 15:29:03,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:03,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2020-10-09 15:29:03,294 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9532293986636972 [2020-10-09 15:29:03,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2020-10-09 15:29:03,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2020-10-09 15:29:03,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:03,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2020-10-09 15:29:03,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:03,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:03,295 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:03,295 INFO L185 Difference]: Start difference. First operand has 424 places, 426 transitions, 969 flow. Second operand 3 states and 1284 transitions. [2020-10-09 15:29:03,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 423 transitions, 964 flow [2020-10-09 15:29:03,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 423 transitions, 956 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:03,299 INFO L241 Difference]: Finished difference. Result has 423 places, 423 transitions, 948 flow [2020-10-09 15:29:03,300 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=948, PETRI_PLACES=423, PETRI_TRANSITIONS=423} [2020-10-09 15:29:03,300 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 6 predicate places. [2020-10-09 15:29:03,300 INFO L481 AbstractCegarLoop]: Abstraction has has 423 places, 423 transitions, 948 flow [2020-10-09 15:29:03,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:03,300 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:03,300 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:29:03,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 288 mathsat -unsat_core_generation=3 [2020-10-09 15:29:03,501 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:03,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:03,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1551416145, now seen corresponding path program 1 times [2020-10-09 15:29:03,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:03,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242402626] [2020-10-09 15:29:03,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 289 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 289 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:03,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:03,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:29:03,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:29:03,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242402626] [2020-10-09 15:29:03,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:03,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:03,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688651187] [2020-10-09 15:29:03,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:03,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:03,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:03,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:03,760 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:03,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 423 transitions, 948 flow. Second operand 3 states. [2020-10-09 15:29:03,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:03,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:03,761 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:03,854 INFO L129 PetriNetUnfolder]: 42/474 cut-off events. [2020-10-09 15:29:03,854 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:29:03,870 INFO L80 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 474 events. 42/474 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1831 event pairs, 0 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 535. Up to 17 conditions per place. [2020-10-09 15:29:03,875 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 8 selfloop transitions, 1 changer transitions 0/421 dead transitions. [2020-10-09 15:29:03,875 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 421 transitions, 961 flow [2020-10-09 15:29:03,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:03,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:03,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2020-10-09 15:29:03,876 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9428359317000743 [2020-10-09 15:29:03,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1270 transitions. [2020-10-09 15:29:03,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1270 transitions. [2020-10-09 15:29:03,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:03,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1270 transitions. [2020-10-09 15:29:03,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:03,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:03,878 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:03,878 INFO L185 Difference]: Start difference. First operand has 423 places, 423 transitions, 948 flow. Second operand 3 states and 1270 transitions. [2020-10-09 15:29:03,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 421 transitions, 961 flow [2020-10-09 15:29:03,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 421 transitions, 960 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:03,883 INFO L241 Difference]: Finished difference. Result has 422 places, 421 transitions, 944 flow [2020-10-09 15:29:03,883 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=944, PETRI_PLACES=422, PETRI_TRANSITIONS=421} [2020-10-09 15:29:03,883 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 5 predicate places. [2020-10-09 15:29:03,884 INFO L481 AbstractCegarLoop]: Abstraction has has 422 places, 421 transitions, 944 flow [2020-10-09 15:29:03,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:03,884 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:03,884 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:29:04,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 289 mathsat -unsat_core_generation=3 [2020-10-09 15:29:04,085 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:04,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:04,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1973086703, now seen corresponding path program 1 times [2020-10-09 15:29:04,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:04,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020993277] [2020-10-09 15:29:04,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 290 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 290 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:04,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:04,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:29:04,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:29:04,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020993277] [2020-10-09 15:29:04,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:04,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:04,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348303587] [2020-10-09 15:29:04,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:04,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:04,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:04,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:04,341 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:04,341 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 421 transitions, 944 flow. Second operand 3 states. [2020-10-09 15:29:04,342 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:04,342 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:04,342 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:04,443 INFO L129 PetriNetUnfolder]: 41/482 cut-off events. [2020-10-09 15:29:04,443 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:29:04,460 INFO L80 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 482 events. 41/482 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1898 event pairs, 0 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 547. Up to 17 conditions per place. [2020-10-09 15:29:04,465 INFO L132 encePairwiseOnDemand]: 444/449 looper letters, 10 selfloop transitions, 3 changer transitions 0/423 dead transitions. [2020-10-09 15:29:04,465 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 423 transitions, 974 flow [2020-10-09 15:29:04,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2020-10-09 15:29:04,466 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9465478841870824 [2020-10-09 15:29:04,466 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1275 transitions. [2020-10-09 15:29:04,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1275 transitions. [2020-10-09 15:29:04,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:04,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1275 transitions. [2020-10-09 15:29:04,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:04,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:04,468 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:04,469 INFO L185 Difference]: Start difference. First operand has 422 places, 421 transitions, 944 flow. Second operand 3 states and 1275 transitions. [2020-10-09 15:29:04,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 423 transitions, 974 flow [2020-10-09 15:29:04,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 423 transitions, 973 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:04,473 INFO L241 Difference]: Finished difference. Result has 425 places, 423 transitions, 967 flow [2020-10-09 15:29:04,474 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=967, PETRI_PLACES=425, PETRI_TRANSITIONS=423} [2020-10-09 15:29:04,474 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 8 predicate places. [2020-10-09 15:29:04,474 INFO L481 AbstractCegarLoop]: Abstraction has has 425 places, 423 transitions, 967 flow [2020-10-09 15:29:04,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:04,474 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:04,474 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:29:04,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 290 mathsat -unsat_core_generation=3 [2020-10-09 15:29:04,675 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:04,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:04,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1973087726, now seen corresponding path program 1 times [2020-10-09 15:29:04,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:04,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992265258] [2020-10-09 15:29:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 291 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 291 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:04,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:04,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:29:04,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:29:04,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992265258] [2020-10-09 15:29:04,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:04,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:04,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046418708] [2020-10-09 15:29:04,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:04,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:04,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:04,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:04,918 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 449 [2020-10-09 15:29:04,919 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 423 transitions, 967 flow. Second operand 3 states. [2020-10-09 15:29:04,919 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:04,919 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 449 [2020-10-09 15:29:04,919 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:05,045 INFO L129 PetriNetUnfolder]: 40/480 cut-off events. [2020-10-09 15:29:05,045 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:29:05,057 INFO L80 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 480 events. 40/480 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1885 event pairs, 0 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 544. Up to 17 conditions per place. [2020-10-09 15:29:05,061 INFO L132 encePairwiseOnDemand]: 446/449 looper letters, 5 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2020-10-09 15:29:05,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 423 transitions, 979 flow [2020-10-09 15:29:05,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:05,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2020-10-09 15:29:05,063 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9524870081662955 [2020-10-09 15:29:05,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1283 transitions. [2020-10-09 15:29:05,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1283 transitions. [2020-10-09 15:29:05,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:05,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1283 transitions. [2020-10-09 15:29:05,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:05,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:05,065 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:05,065 INFO L185 Difference]: Start difference. First operand has 425 places, 423 transitions, 967 flow. Second operand 3 states and 1283 transitions. [2020-10-09 15:29:05,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 423 transitions, 979 flow [2020-10-09 15:29:05,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 423 transitions, 974 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:05,069 INFO L241 Difference]: Finished difference. Result has 428 places, 423 transitions, 972 flow [2020-10-09 15:29:05,069 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=972, PETRI_PLACES=428, PETRI_TRANSITIONS=423} [2020-10-09 15:29:05,069 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 11 predicate places. [2020-10-09 15:29:05,069 INFO L481 AbstractCegarLoop]: Abstraction has has 428 places, 423 transitions, 972 flow [2020-10-09 15:29:05,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:05,070 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:05,070 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:29:05,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 291 mathsat -unsat_core_generation=3 [2020-10-09 15:29:05,281 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:05,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:05,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1974040015, now seen corresponding path program 1 times [2020-10-09 15:29:05,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:05,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712996674] [2020-10-09 15:29:05,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 292 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 292 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:05,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:05,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:29:05,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:29:05,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712996674] [2020-10-09 15:29:05,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:05,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:05,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488212958] [2020-10-09 15:29:05,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:05,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:05,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:05,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:05,540 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 449 [2020-10-09 15:29:05,541 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 423 transitions, 972 flow. Second operand 3 states. [2020-10-09 15:29:05,541 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:05,541 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 449 [2020-10-09 15:29:05,541 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:05,639 INFO L129 PetriNetUnfolder]: 39/476 cut-off events. [2020-10-09 15:29:05,639 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:29:05,656 INFO L80 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 476 events. 39/476 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1859 event pairs, 0 based on Foata normal form. 1/423 useless extension candidates. Maximal degree in co-relation 540. Up to 17 conditions per place. [2020-10-09 15:29:05,660 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 4 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2020-10-09 15:29:05,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 420 transitions, 967 flow [2020-10-09 15:29:05,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:05,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:05,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2020-10-09 15:29:05,661 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9532293986636972 [2020-10-09 15:29:05,662 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2020-10-09 15:29:05,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2020-10-09 15:29:05,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:05,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2020-10-09 15:29:05,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:05,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:05,663 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:05,663 INFO L185 Difference]: Start difference. First operand has 428 places, 423 transitions, 972 flow. Second operand 3 states and 1284 transitions. [2020-10-09 15:29:05,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 420 transitions, 967 flow [2020-10-09 15:29:05,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 420 transitions, 960 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:05,667 INFO L241 Difference]: Finished difference. Result has 427 places, 420 transitions, 952 flow [2020-10-09 15:29:05,668 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=952, PETRI_PLACES=427, PETRI_TRANSITIONS=420} [2020-10-09 15:29:05,668 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 10 predicate places. [2020-10-09 15:29:05,668 INFO L481 AbstractCegarLoop]: Abstraction has has 427 places, 420 transitions, 952 flow [2020-10-09 15:29:05,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:05,668 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:05,668 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:29:05,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 292 mathsat -unsat_core_generation=3 [2020-10-09 15:29:05,869 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:05,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:05,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1974041038, now seen corresponding path program 1 times [2020-10-09 15:29:05,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:05,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94579063] [2020-10-09 15:29:05,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 293 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 293 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:06,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:06,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:06,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:29:06,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:29:06,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94579063] [2020-10-09 15:29:06,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:06,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:06,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768323] [2020-10-09 15:29:06,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:06,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:06,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:06,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:06,124 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:06,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 420 transitions, 952 flow. Second operand 3 states. [2020-10-09 15:29:06,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:06,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:06,125 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:06,219 INFO L129 PetriNetUnfolder]: 39/474 cut-off events. [2020-10-09 15:29:06,219 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:29:06,234 INFO L80 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 474 events. 39/474 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1846 event pairs, 0 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 542. Up to 17 conditions per place. [2020-10-09 15:29:06,238 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 8 selfloop transitions, 1 changer transitions 0/418 dead transitions. [2020-10-09 15:29:06,238 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 418 transitions, 965 flow [2020-10-09 15:29:06,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:06,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2020-10-09 15:29:06,239 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9428359317000743 [2020-10-09 15:29:06,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1270 transitions. [2020-10-09 15:29:06,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1270 transitions. [2020-10-09 15:29:06,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:06,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1270 transitions. [2020-10-09 15:29:06,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:06,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:06,240 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:06,240 INFO L185 Difference]: Start difference. First operand has 427 places, 420 transitions, 952 flow. Second operand 3 states and 1270 transitions. [2020-10-09 15:29:06,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 418 transitions, 965 flow [2020-10-09 15:29:06,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 418 transitions, 964 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:06,244 INFO L241 Difference]: Finished difference. Result has 426 places, 418 transitions, 948 flow [2020-10-09 15:29:06,244 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=948, PETRI_PLACES=426, PETRI_TRANSITIONS=418} [2020-10-09 15:29:06,245 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 9 predicate places. [2020-10-09 15:29:06,245 INFO L481 AbstractCegarLoop]: Abstraction has has 426 places, 418 transitions, 948 flow [2020-10-09 15:29:06,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:06,245 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:06,245 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:29:06,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 293 mathsat -unsat_core_generation=3 [2020-10-09 15:29:06,446 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:06,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:06,446 INFO L82 PathProgramCache]: Analyzing trace with hash -363724339, now seen corresponding path program 1 times [2020-10-09 15:29:06,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:06,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239276792] [2020-10-09 15:29:06,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 294 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 294 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:06,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:06,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:29:06,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:29:06,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239276792] [2020-10-09 15:29:06,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:06,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:06,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316985060] [2020-10-09 15:29:06,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:06,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:06,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:06,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:06,692 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 449 [2020-10-09 15:29:06,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 418 transitions, 948 flow. Second operand 3 states. [2020-10-09 15:29:06,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:06,693 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 449 [2020-10-09 15:29:06,693 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:06,787 INFO L129 PetriNetUnfolder]: 38/481 cut-off events. [2020-10-09 15:29:06,787 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:29:06,803 INFO L80 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 481 events. 38/481 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1907 event pairs, 0 based on Foata normal form. 1/428 useless extension candidates. Maximal degree in co-relation 545. Up to 17 conditions per place. [2020-10-09 15:29:06,807 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 4 selfloop transitions, 1 changer transitions 0/418 dead transitions. [2020-10-09 15:29:06,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 418 transitions, 958 flow [2020-10-09 15:29:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:06,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2020-10-09 15:29:06,808 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9532293986636972 [2020-10-09 15:29:06,808 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2020-10-09 15:29:06,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2020-10-09 15:29:06,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:06,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2020-10-09 15:29:06,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:06,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:06,810 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:06,810 INFO L185 Difference]: Start difference. First operand has 426 places, 418 transitions, 948 flow. Second operand 3 states and 1284 transitions. [2020-10-09 15:29:06,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 418 transitions, 958 flow [2020-10-09 15:29:06,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 418 transitions, 957 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:06,814 INFO L241 Difference]: Finished difference. Result has 428 places, 418 transitions, 952 flow [2020-10-09 15:29:06,814 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=947, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=952, PETRI_PLACES=428, PETRI_TRANSITIONS=418} [2020-10-09 15:29:06,814 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 11 predicate places. [2020-10-09 15:29:06,814 INFO L481 AbstractCegarLoop]: Abstraction has has 428 places, 418 transitions, 952 flow [2020-10-09 15:29:06,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:06,814 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:06,814 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:29:07,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 294 mathsat -unsat_core_generation=3 [2020-10-09 15:29:07,015 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:07,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:07,016 INFO L82 PathProgramCache]: Analyzing trace with hash -363723316, now seen corresponding path program 1 times [2020-10-09 15:29:07,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:07,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589291922] [2020-10-09 15:29:07,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 295 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 295 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:07,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:07,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:29:07,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:29:07,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589291922] [2020-10-09 15:29:07,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:07,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:07,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964450234] [2020-10-09 15:29:07,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:07,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:07,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:07,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:07,270 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:07,271 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 418 transitions, 952 flow. Second operand 3 states. [2020-10-09 15:29:07,271 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:07,271 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:07,271 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:07,372 INFO L129 PetriNetUnfolder]: 36/483 cut-off events. [2020-10-09 15:29:07,372 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:07,388 INFO L80 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 483 events. 36/483 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1940 event pairs, 0 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 558. Up to 17 conditions per place. [2020-10-09 15:29:07,391 INFO L132 encePairwiseOnDemand]: 445/449 looper letters, 9 selfloop transitions, 3 changer transitions 0/419 dead transitions. [2020-10-09 15:29:07,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 419 transitions, 978 flow [2020-10-09 15:29:07,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:07,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:07,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2020-10-09 15:29:07,394 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9450631031922792 [2020-10-09 15:29:07,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1273 transitions. [2020-10-09 15:29:07,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1273 transitions. [2020-10-09 15:29:07,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:07,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1273 transitions. [2020-10-09 15:29:07,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:07,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:07,395 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:07,395 INFO L185 Difference]: Start difference. First operand has 428 places, 418 transitions, 952 flow. Second operand 3 states and 1273 transitions. [2020-10-09 15:29:07,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 419 transitions, 978 flow [2020-10-09 15:29:07,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 419 transitions, 977 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:07,399 INFO L241 Difference]: Finished difference. Result has 431 places, 419 transitions, 969 flow [2020-10-09 15:29:07,399 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=969, PETRI_PLACES=431, PETRI_TRANSITIONS=419} [2020-10-09 15:29:07,400 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 14 predicate places. [2020-10-09 15:29:07,400 INFO L481 AbstractCegarLoop]: Abstraction has has 431 places, 419 transitions, 969 flow [2020-10-09 15:29:07,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:07,400 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:07,400 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:29:07,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 295 mathsat -unsat_core_generation=3 [2020-10-09 15:29:07,600 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:07,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:07,601 INFO L82 PathProgramCache]: Analyzing trace with hash -364676628, now seen corresponding path program 1 times [2020-10-09 15:29:07,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:07,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501818501] [2020-10-09 15:29:07,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 296 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 296 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:07,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:07,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:29:07,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:29:07,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501818501] [2020-10-09 15:29:07,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:07,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:07,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600736991] [2020-10-09 15:29:07,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:07,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:07,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:07,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:07,851 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 449 [2020-10-09 15:29:07,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 419 transitions, 969 flow. Second operand 3 states. [2020-10-09 15:29:07,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:07,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 449 [2020-10-09 15:29:07,852 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:07,949 INFO L129 PetriNetUnfolder]: 36/476 cut-off events. [2020-10-09 15:29:07,949 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:29:07,965 INFO L80 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 476 events. 36/476 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1879 event pairs, 0 based on Foata normal form. 1/426 useless extension candidates. Maximal degree in co-relation 544. Up to 17 conditions per place. [2020-10-09 15:29:07,969 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 5 selfloop transitions, 1 changer transitions 0/417 dead transitions. [2020-10-09 15:29:07,969 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 417 transitions, 971 flow [2020-10-09 15:29:07,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2020-10-09 15:29:07,970 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9517446176688938 [2020-10-09 15:29:07,970 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1282 transitions. [2020-10-09 15:29:07,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1282 transitions. [2020-10-09 15:29:07,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:07,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1282 transitions. [2020-10-09 15:29:07,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:07,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:07,971 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:07,971 INFO L185 Difference]: Start difference. First operand has 431 places, 419 transitions, 969 flow. Second operand 3 states and 1282 transitions. [2020-10-09 15:29:07,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 417 transitions, 971 flow [2020-10-09 15:29:07,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 417 transitions, 963 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:07,975 INFO L241 Difference]: Finished difference. Result has 431 places, 417 transitions, 956 flow [2020-10-09 15:29:07,976 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=956, PETRI_PLACES=431, PETRI_TRANSITIONS=417} [2020-10-09 15:29:07,976 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 14 predicate places. [2020-10-09 15:29:07,976 INFO L481 AbstractCegarLoop]: Abstraction has has 431 places, 417 transitions, 956 flow [2020-10-09 15:29:07,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:07,976 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:07,976 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:29:08,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 296 mathsat -unsat_core_generation=3 [2020-10-09 15:29:08,177 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:08,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:08,177 INFO L82 PathProgramCache]: Analyzing trace with hash -364677651, now seen corresponding path program 1 times [2020-10-09 15:29:08,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:08,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066193493] [2020-10-09 15:29:08,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 297 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 297 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:08,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:08,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:29:08,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:08,422 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:29:08,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066193493] [2020-10-09 15:29:08,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:08,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:08,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936316907] [2020-10-09 15:29:08,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:08,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:08,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:08,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:08,458 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:08,458 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 417 transitions, 956 flow. Second operand 3 states. [2020-10-09 15:29:08,458 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:08,459 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:08,459 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:08,552 INFO L129 PetriNetUnfolder]: 36/474 cut-off events. [2020-10-09 15:29:08,552 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:08,567 INFO L80 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 474 events. 36/474 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1862 event pairs, 0 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 548. Up to 17 conditions per place. [2020-10-09 15:29:08,571 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 8 selfloop transitions, 1 changer transitions 0/415 dead transitions. [2020-10-09 15:29:08,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 415 transitions, 969 flow [2020-10-09 15:29:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2020-10-09 15:29:08,572 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9428359317000743 [2020-10-09 15:29:08,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1270 transitions. [2020-10-09 15:29:08,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1270 transitions. [2020-10-09 15:29:08,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:08,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1270 transitions. [2020-10-09 15:29:08,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:08,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:08,573 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:08,574 INFO L185 Difference]: Start difference. First operand has 431 places, 417 transitions, 956 flow. Second operand 3 states and 1270 transitions. [2020-10-09 15:29:08,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 415 transitions, 969 flow [2020-10-09 15:29:08,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 415 transitions, 968 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:08,577 INFO L241 Difference]: Finished difference. Result has 430 places, 415 transitions, 952 flow [2020-10-09 15:29:08,578 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=952, PETRI_PLACES=430, PETRI_TRANSITIONS=415} [2020-10-09 15:29:08,578 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 13 predicate places. [2020-10-09 15:29:08,578 INFO L481 AbstractCegarLoop]: Abstraction has has 430 places, 415 transitions, 952 flow [2020-10-09 15:29:08,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:08,578 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:08,578 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:08,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 297 mathsat -unsat_core_generation=3 [2020-10-09 15:29:08,779 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:08,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:08,779 INFO L82 PathProgramCache]: Analyzing trace with hash 700045035, now seen corresponding path program 1 times [2020-10-09 15:29:08,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:08,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576110381] [2020-10-09 15:29:08,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 298 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 298 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:09,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:09,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:29:09,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:29:09,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576110381] [2020-10-09 15:29:09,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:09,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:09,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752179063] [2020-10-09 15:29:09,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:09,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:09,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:09,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:09,034 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 449 [2020-10-09 15:29:09,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 415 transitions, 952 flow. Second operand 3 states. [2020-10-09 15:29:09,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:09,035 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 449 [2020-10-09 15:29:09,036 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:09,133 INFO L129 PetriNetUnfolder]: 34/479 cut-off events. [2020-10-09 15:29:09,133 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:29:09,148 INFO L80 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 479 events. 34/479 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1913 event pairs, 0 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 551. Up to 17 conditions per place. [2020-10-09 15:29:09,152 INFO L132 encePairwiseOnDemand]: 446/449 looper letters, 5 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2020-10-09 15:29:09,152 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 416 transitions, 968 flow [2020-10-09 15:29:09,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2020-10-09 15:29:09,153 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9524870081662955 [2020-10-09 15:29:09,153 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1283 transitions. [2020-10-09 15:29:09,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1283 transitions. [2020-10-09 15:29:09,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:09,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1283 transitions. [2020-10-09 15:29:09,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:09,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:09,155 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:09,155 INFO L185 Difference]: Start difference. First operand has 430 places, 415 transitions, 952 flow. Second operand 3 states and 1283 transitions. [2020-10-09 15:29:09,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 416 transitions, 968 flow [2020-10-09 15:29:09,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 416 transitions, 967 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:09,159 INFO L241 Difference]: Finished difference. Result has 433 places, 416 transitions, 965 flow [2020-10-09 15:29:09,159 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=965, PETRI_PLACES=433, PETRI_TRANSITIONS=416} [2020-10-09 15:29:09,159 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 16 predicate places. [2020-10-09 15:29:09,159 INFO L481 AbstractCegarLoop]: Abstraction has has 433 places, 416 transitions, 965 flow [2020-10-09 15:29:09,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:09,159 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:09,159 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:09,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 298 mathsat -unsat_core_generation=3 [2020-10-09 15:29:09,360 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:09,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:09,361 INFO L82 PathProgramCache]: Analyzing trace with hash 700044012, now seen corresponding path program 1 times [2020-10-09 15:29:09,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:09,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493667592] [2020-10-09 15:29:09,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 299 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 299 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:09,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:09,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:09,594 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:29:09,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:29:09,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493667592] [2020-10-09 15:29:09,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:09,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:09,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712853318] [2020-10-09 15:29:09,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:09,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:09,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:09,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:09,631 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:09,632 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 416 transitions, 965 flow. Second operand 3 states. [2020-10-09 15:29:09,632 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:09,632 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:09,632 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:09,730 INFO L129 PetriNetUnfolder]: 34/480 cut-off events. [2020-10-09 15:29:09,730 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:29:09,746 INFO L80 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 480 events. 34/480 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1922 event pairs, 0 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 559. Up to 17 conditions per place. [2020-10-09 15:29:09,749 INFO L132 encePairwiseOnDemand]: 445/449 looper letters, 9 selfloop transitions, 3 changer transitions 0/417 dead transitions. [2020-10-09 15:29:09,750 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 417 transitions, 991 flow [2020-10-09 15:29:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:09,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:09,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2020-10-09 15:29:09,751 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9450631031922792 [2020-10-09 15:29:09,751 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1273 transitions. [2020-10-09 15:29:09,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1273 transitions. [2020-10-09 15:29:09,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:09,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1273 transitions. [2020-10-09 15:29:09,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:09,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:09,752 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:09,752 INFO L185 Difference]: Start difference. First operand has 433 places, 416 transitions, 965 flow. Second operand 3 states and 1273 transitions. [2020-10-09 15:29:09,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 417 transitions, 991 flow [2020-10-09 15:29:09,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 417 transitions, 989 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:09,757 INFO L241 Difference]: Finished difference. Result has 436 places, 417 transitions, 981 flow [2020-10-09 15:29:09,757 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=981, PETRI_PLACES=436, PETRI_TRANSITIONS=417} [2020-10-09 15:29:09,757 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 19 predicate places. [2020-10-09 15:29:09,757 INFO L481 AbstractCegarLoop]: Abstraction has has 436 places, 417 transitions, 981 flow [2020-10-09 15:29:09,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:09,757 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:09,757 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:09,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 299 mathsat -unsat_core_generation=3 [2020-10-09 15:29:09,958 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:09,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:09,959 INFO L82 PathProgramCache]: Analyzing trace with hash 700998347, now seen corresponding path program 1 times [2020-10-09 15:29:09,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:09,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19357681] [2020-10-09 15:29:09,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 300 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 300 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:10,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:10,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:29:10,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:29:10,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19357681] [2020-10-09 15:29:10,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:10,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:10,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157243397] [2020-10-09 15:29:10,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:10,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:10,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:10,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:10,214 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:10,215 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 417 transitions, 981 flow. Second operand 3 states. [2020-10-09 15:29:10,215 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:10,215 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:10,216 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:10,318 INFO L129 PetriNetUnfolder]: 33/477 cut-off events. [2020-10-09 15:29:10,318 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:29:10,334 INFO L80 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 477 events. 33/477 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1904 event pairs, 0 based on Foata normal form. 2/430 useless extension candidates. Maximal degree in co-relation 558. Up to 17 conditions per place. [2020-10-09 15:29:10,337 INFO L132 encePairwiseOnDemand]: 446/449 looper letters, 9 selfloop transitions, 1 changer transitions 0/415 dead transitions. [2020-10-09 15:29:10,337 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 415 transitions, 989 flow [2020-10-09 15:29:10,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1272 transitions. [2020-10-09 15:29:10,339 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9443207126948775 [2020-10-09 15:29:10,339 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1272 transitions. [2020-10-09 15:29:10,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1272 transitions. [2020-10-09 15:29:10,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:10,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1272 transitions. [2020-10-09 15:29:10,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:10,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:10,340 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:10,340 INFO L185 Difference]: Start difference. First operand has 436 places, 417 transitions, 981 flow. Second operand 3 states and 1272 transitions. [2020-10-09 15:29:10,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 415 transitions, 989 flow [2020-10-09 15:29:10,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 415 transitions, 988 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:10,344 INFO L241 Difference]: Finished difference. Result has 437 places, 415 transitions, 970 flow [2020-10-09 15:29:10,345 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=968, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=970, PETRI_PLACES=437, PETRI_TRANSITIONS=415} [2020-10-09 15:29:10,345 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 20 predicate places. [2020-10-09 15:29:10,345 INFO L481 AbstractCegarLoop]: Abstraction has has 437 places, 415 transitions, 970 flow [2020-10-09 15:29:10,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:10,345 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:10,345 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:10,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 300 mathsat -unsat_core_generation=3 [2020-10-09 15:29:10,546 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:10,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:10,546 INFO L82 PathProgramCache]: Analyzing trace with hash 700997324, now seen corresponding path program 1 times [2020-10-09 15:29:10,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:10,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967896676] [2020-10-09 15:29:10,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 301 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 301 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:10,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:10,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:29:10,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:10,784 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:29:10,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967896676] [2020-10-09 15:29:10,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:10,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:10,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72331048] [2020-10-09 15:29:10,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:10,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:10,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:10,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:10,806 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 449 [2020-10-09 15:29:10,807 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 415 transitions, 970 flow. Second operand 3 states. [2020-10-09 15:29:10,807 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:10,807 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 449 [2020-10-09 15:29:10,807 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:10,902 INFO L129 PetriNetUnfolder]: 33/474 cut-off events. [2020-10-09 15:29:10,902 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:10,917 INFO L80 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 474 events. 33/474 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1879 event pairs, 0 based on Foata normal form. 1/427 useless extension candidates. Maximal degree in co-relation 552. Up to 17 conditions per place. [2020-10-09 15:29:10,920 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 4 selfloop transitions, 1 changer transitions 0/412 dead transitions. [2020-10-09 15:29:10,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 412 transitions, 969 flow [2020-10-09 15:29:10,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:10,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:10,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2020-10-09 15:29:10,922 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9532293986636972 [2020-10-09 15:29:10,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2020-10-09 15:29:10,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2020-10-09 15:29:10,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:10,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2020-10-09 15:29:10,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:10,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:10,923 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:10,924 INFO L185 Difference]: Start difference. First operand has 437 places, 415 transitions, 970 flow. Second operand 3 states and 1284 transitions. [2020-10-09 15:29:10,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 412 transitions, 969 flow [2020-10-09 15:29:10,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 412 transitions, 964 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:10,927 INFO L241 Difference]: Finished difference. Result has 434 places, 412 transitions, 956 flow [2020-10-09 15:29:10,928 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=956, PETRI_PLACES=434, PETRI_TRANSITIONS=412} [2020-10-09 15:29:10,928 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 17 predicate places. [2020-10-09 15:29:10,928 INFO L481 AbstractCegarLoop]: Abstraction has has 434 places, 412 transitions, 956 flow [2020-10-09 15:29:10,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:10,928 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:10,928 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:11,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 301 mathsat -unsat_core_generation=3 [2020-10-09 15:29:11,129 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:11,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:11,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1393264204, now seen corresponding path program 1 times [2020-10-09 15:29:11,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:11,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494326736] [2020-10-09 15:29:11,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 302 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 302 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:11,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:11,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:29:11,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:11,392 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:29:11,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494326736] [2020-10-09 15:29:11,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:11,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:11,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514614950] [2020-10-09 15:29:11,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:11,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:11,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:11,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:11,414 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 449 [2020-10-09 15:29:11,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 412 transitions, 956 flow. Second operand 3 states. [2020-10-09 15:29:11,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:11,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 449 [2020-10-09 15:29:11,415 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:11,513 INFO L129 PetriNetUnfolder]: 32/481 cut-off events. [2020-10-09 15:29:11,513 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:29:11,530 INFO L80 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 481 events. 32/481 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1940 event pairs, 0 based on Foata normal form. 1/433 useless extension candidates. Maximal degree in co-relation 560. Up to 17 conditions per place. [2020-10-09 15:29:11,533 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 4 selfloop transitions, 1 changer transitions 0/412 dead transitions. [2020-10-09 15:29:11,533 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 412 transitions, 966 flow [2020-10-09 15:29:11,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2020-10-09 15:29:11,534 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9532293986636972 [2020-10-09 15:29:11,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2020-10-09 15:29:11,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2020-10-09 15:29:11,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:11,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2020-10-09 15:29:11,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:11,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:11,536 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:11,536 INFO L185 Difference]: Start difference. First operand has 434 places, 412 transitions, 956 flow. Second operand 3 states and 1284 transitions. [2020-10-09 15:29:11,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 412 transitions, 966 flow [2020-10-09 15:29:11,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 412 transitions, 965 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:11,540 INFO L241 Difference]: Finished difference. Result has 436 places, 412 transitions, 960 flow [2020-10-09 15:29:11,540 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=960, PETRI_PLACES=436, PETRI_TRANSITIONS=412} [2020-10-09 15:29:11,540 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 19 predicate places. [2020-10-09 15:29:11,540 INFO L481 AbstractCegarLoop]: Abstraction has has 436 places, 412 transitions, 960 flow [2020-10-09 15:29:11,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:11,540 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:11,540 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:11,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 302 mathsat -unsat_core_generation=3 [2020-10-09 15:29:11,741 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:11,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:11,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1393265227, now seen corresponding path program 1 times [2020-10-09 15:29:11,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:11,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527093171] [2020-10-09 15:29:11,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 303 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 303 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:11,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:11,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:29:11,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:29:11,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527093171] [2020-10-09 15:29:11,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:11,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:11,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122961039] [2020-10-09 15:29:11,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:11,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:11,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:11,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:12,009 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:12,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 412 transitions, 960 flow. Second operand 3 states. [2020-10-09 15:29:12,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:12,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:12,010 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:12,114 INFO L129 PetriNetUnfolder]: 30/483 cut-off events. [2020-10-09 15:29:12,114 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:12,131 INFO L80 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 483 events. 30/483 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1974 event pairs, 0 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 571. Up to 17 conditions per place. [2020-10-09 15:29:12,134 INFO L132 encePairwiseOnDemand]: 445/449 looper letters, 9 selfloop transitions, 3 changer transitions 0/413 dead transitions. [2020-10-09 15:29:12,134 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 413 transitions, 986 flow [2020-10-09 15:29:12,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2020-10-09 15:29:12,135 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9450631031922792 [2020-10-09 15:29:12,135 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1273 transitions. [2020-10-09 15:29:12,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1273 transitions. [2020-10-09 15:29:12,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:12,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1273 transitions. [2020-10-09 15:29:12,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:12,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:12,137 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:12,137 INFO L185 Difference]: Start difference. First operand has 436 places, 412 transitions, 960 flow. Second operand 3 states and 1273 transitions. [2020-10-09 15:29:12,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 413 transitions, 986 flow [2020-10-09 15:29:12,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 413 transitions, 985 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:12,141 INFO L241 Difference]: Finished difference. Result has 439 places, 413 transitions, 977 flow [2020-10-09 15:29:12,141 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=977, PETRI_PLACES=439, PETRI_TRANSITIONS=413} [2020-10-09 15:29:12,141 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 22 predicate places. [2020-10-09 15:29:12,141 INFO L481 AbstractCegarLoop]: Abstraction has has 439 places, 413 transitions, 977 flow [2020-10-09 15:29:12,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:12,142 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:12,142 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:12,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 303 mathsat -unsat_core_generation=3 [2020-10-09 15:29:12,342 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:12,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:12,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1392311915, now seen corresponding path program 1 times [2020-10-09 15:29:12,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:12,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442220293] [2020-10-09 15:29:12,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 304 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 304 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:12,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:12,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:29:12,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:29:12,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442220293] [2020-10-09 15:29:12,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:12,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:12,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389271186] [2020-10-09 15:29:12,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:12,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:12,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:12,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:12,599 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 449 [2020-10-09 15:29:12,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 413 transitions, 977 flow. Second operand 3 states. [2020-10-09 15:29:12,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:12,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 449 [2020-10-09 15:29:12,600 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:12,698 INFO L129 PetriNetUnfolder]: 30/476 cut-off events. [2020-10-09 15:29:12,698 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:29:12,715 INFO L80 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 476 events. 30/476 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1916 event pairs, 0 based on Foata normal form. 1/432 useless extension candidates. Maximal degree in co-relation 557. Up to 17 conditions per place. [2020-10-09 15:29:12,718 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 5 selfloop transitions, 1 changer transitions 0/411 dead transitions. [2020-10-09 15:29:12,718 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 411 transitions, 979 flow [2020-10-09 15:29:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2020-10-09 15:29:12,719 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9517446176688938 [2020-10-09 15:29:12,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1282 transitions. [2020-10-09 15:29:12,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1282 transitions. [2020-10-09 15:29:12,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:12,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1282 transitions. [2020-10-09 15:29:12,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:12,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:12,721 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:12,721 INFO L185 Difference]: Start difference. First operand has 439 places, 413 transitions, 977 flow. Second operand 3 states and 1282 transitions. [2020-10-09 15:29:12,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 411 transitions, 979 flow [2020-10-09 15:29:12,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 411 transitions, 971 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:12,725 INFO L241 Difference]: Finished difference. Result has 439 places, 411 transitions, 964 flow [2020-10-09 15:29:12,725 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=964, PETRI_PLACES=439, PETRI_TRANSITIONS=411} [2020-10-09 15:29:12,726 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 22 predicate places. [2020-10-09 15:29:12,726 INFO L481 AbstractCegarLoop]: Abstraction has has 439 places, 411 transitions, 964 flow [2020-10-09 15:29:12,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:12,726 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:12,726 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:12,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 304 mathsat -unsat_core_generation=3 [2020-10-09 15:29:12,931 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:12,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:12,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1392310892, now seen corresponding path program 1 times [2020-10-09 15:29:12,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:12,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27893327] [2020-10-09 15:29:12,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 305 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 305 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:13,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:13,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:29:13,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:29:13,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27893327] [2020-10-09 15:29:13,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:13,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:13,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662078819] [2020-10-09 15:29:13,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:13,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:13,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:13,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:13,200 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:13,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 411 transitions, 964 flow. Second operand 3 states. [2020-10-09 15:29:13,201 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:13,201 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:13,201 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:13,298 INFO L129 PetriNetUnfolder]: 30/474 cut-off events. [2020-10-09 15:29:13,298 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:13,313 INFO L80 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 474 events. 30/474 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1901 event pairs, 0 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 561. Up to 17 conditions per place. [2020-10-09 15:29:13,316 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 8 selfloop transitions, 1 changer transitions 0/409 dead transitions. [2020-10-09 15:29:13,316 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 409 transitions, 977 flow [2020-10-09 15:29:13,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:13,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2020-10-09 15:29:13,317 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9428359317000743 [2020-10-09 15:29:13,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1270 transitions. [2020-10-09 15:29:13,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1270 transitions. [2020-10-09 15:29:13,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:13,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1270 transitions. [2020-10-09 15:29:13,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:13,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:13,319 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:13,319 INFO L185 Difference]: Start difference. First operand has 439 places, 411 transitions, 964 flow. Second operand 3 states and 1270 transitions. [2020-10-09 15:29:13,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 409 transitions, 977 flow [2020-10-09 15:29:13,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 409 transitions, 976 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:13,324 INFO L241 Difference]: Finished difference. Result has 438 places, 409 transitions, 960 flow [2020-10-09 15:29:13,324 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=960, PETRI_PLACES=438, PETRI_TRANSITIONS=409} [2020-10-09 15:29:13,324 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 21 predicate places. [2020-10-09 15:29:13,324 INFO L481 AbstractCegarLoop]: Abstraction has has 438 places, 409 transitions, 960 flow [2020-10-09 15:29:13,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:13,324 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:13,324 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:13,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 305 mathsat -unsat_core_generation=3 [2020-10-09 15:29:13,525 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:13,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:13,526 INFO L82 PathProgramCache]: Analyzing trace with hash -389238835, now seen corresponding path program 1 times [2020-10-09 15:29:13,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:13,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878921528] [2020-10-09 15:29:13,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 306 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 306 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:13,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:13,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:13,767 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:29:13,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:29:13,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878921528] [2020-10-09 15:29:13,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:13,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:13,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180932574] [2020-10-09 15:29:13,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:13,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:13,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:13,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:13,783 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 449 [2020-10-09 15:29:13,784 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 409 transitions, 960 flow. Second operand 3 states. [2020-10-09 15:29:13,784 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:13,784 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 449 [2020-10-09 15:29:13,784 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:13,884 INFO L129 PetriNetUnfolder]: 29/481 cut-off events. [2020-10-09 15:29:13,884 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:29:13,901 INFO L80 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 481 events. 29/481 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1958 event pairs, 0 based on Foata normal form. 1/437 useless extension candidates. Maximal degree in co-relation 564. Up to 17 conditions per place. [2020-10-09 15:29:13,904 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 4 selfloop transitions, 1 changer transitions 0/409 dead transitions. [2020-10-09 15:29:13,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 409 transitions, 970 flow [2020-10-09 15:29:13,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:13,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:13,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2020-10-09 15:29:13,905 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9532293986636972 [2020-10-09 15:29:13,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2020-10-09 15:29:13,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2020-10-09 15:29:13,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:13,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2020-10-09 15:29:13,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:13,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:13,906 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:13,906 INFO L185 Difference]: Start difference. First operand has 438 places, 409 transitions, 960 flow. Second operand 3 states and 1284 transitions. [2020-10-09 15:29:13,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 409 transitions, 970 flow [2020-10-09 15:29:13,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 409 transitions, 969 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:13,910 INFO L241 Difference]: Finished difference. Result has 440 places, 409 transitions, 964 flow [2020-10-09 15:29:13,911 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=964, PETRI_PLACES=440, PETRI_TRANSITIONS=409} [2020-10-09 15:29:13,911 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 23 predicate places. [2020-10-09 15:29:13,911 INFO L481 AbstractCegarLoop]: Abstraction has has 440 places, 409 transitions, 964 flow [2020-10-09 15:29:13,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:13,911 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:13,911 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:14,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 306 mathsat -unsat_core_generation=3 [2020-10-09 15:29:14,112 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:14,112 INFO L82 PathProgramCache]: Analyzing trace with hash -389237812, now seen corresponding path program 1 times [2020-10-09 15:29:14,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:14,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447541090] [2020-10-09 15:29:14,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 307 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 307 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:14,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:14,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:29:14,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:29:14,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447541090] [2020-10-09 15:29:14,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:14,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:14,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458197096] [2020-10-09 15:29:14,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:14,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:14,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:14,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:14,391 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:14,391 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 409 transitions, 964 flow. Second operand 3 states. [2020-10-09 15:29:14,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:14,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:14,392 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:14,497 INFO L129 PetriNetUnfolder]: 27/483 cut-off events. [2020-10-09 15:29:14,497 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:14,513 INFO L80 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 483 events. 27/483 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1993 event pairs, 0 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 577. Up to 17 conditions per place. [2020-10-09 15:29:14,516 INFO L132 encePairwiseOnDemand]: 445/449 looper letters, 9 selfloop transitions, 3 changer transitions 0/410 dead transitions. [2020-10-09 15:29:14,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 410 transitions, 990 flow [2020-10-09 15:29:14,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:14,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2020-10-09 15:29:14,517 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9450631031922792 [2020-10-09 15:29:14,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1273 transitions. [2020-10-09 15:29:14,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1273 transitions. [2020-10-09 15:29:14,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:14,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1273 transitions. [2020-10-09 15:29:14,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:14,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:14,519 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:14,519 INFO L185 Difference]: Start difference. First operand has 440 places, 409 transitions, 964 flow. Second operand 3 states and 1273 transitions. [2020-10-09 15:29:14,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 410 transitions, 990 flow [2020-10-09 15:29:14,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 410 transitions, 989 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:14,523 INFO L241 Difference]: Finished difference. Result has 443 places, 410 transitions, 981 flow [2020-10-09 15:29:14,523 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=981, PETRI_PLACES=443, PETRI_TRANSITIONS=410} [2020-10-09 15:29:14,523 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 26 predicate places. [2020-10-09 15:29:14,523 INFO L481 AbstractCegarLoop]: Abstraction has has 443 places, 410 transitions, 981 flow [2020-10-09 15:29:14,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:14,523 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:14,524 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:14,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 307 mathsat -unsat_core_generation=3 [2020-10-09 15:29:14,725 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:14,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:14,725 INFO L82 PathProgramCache]: Analyzing trace with hash -390191124, now seen corresponding path program 1 times [2020-10-09 15:29:14,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:14,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629436120] [2020-10-09 15:29:14,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 308 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 308 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:14,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:14,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:29:14,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:29:14,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629436120] [2020-10-09 15:29:14,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:14,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:14,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488501903] [2020-10-09 15:29:14,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:14,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:14,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:14,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:14,976 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 449 [2020-10-09 15:29:14,976 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 410 transitions, 981 flow. Second operand 3 states. [2020-10-09 15:29:14,976 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:14,977 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 449 [2020-10-09 15:29:14,977 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:15,075 INFO L129 PetriNetUnfolder]: 27/476 cut-off events. [2020-10-09 15:29:15,075 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:29:15,091 INFO L80 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 476 events. 27/476 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1931 event pairs, 0 based on Foata normal form. 1/435 useless extension candidates. Maximal degree in co-relation 563. Up to 17 conditions per place. [2020-10-09 15:29:15,093 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 5 selfloop transitions, 1 changer transitions 0/408 dead transitions. [2020-10-09 15:29:15,093 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 408 transitions, 983 flow [2020-10-09 15:29:15,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2020-10-09 15:29:15,095 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9517446176688938 [2020-10-09 15:29:15,095 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1282 transitions. [2020-10-09 15:29:15,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1282 transitions. [2020-10-09 15:29:15,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:15,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1282 transitions. [2020-10-09 15:29:15,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:15,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:15,096 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:15,096 INFO L185 Difference]: Start difference. First operand has 443 places, 410 transitions, 981 flow. Second operand 3 states and 1282 transitions. [2020-10-09 15:29:15,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 408 transitions, 983 flow [2020-10-09 15:29:15,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 408 transitions, 975 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:15,101 INFO L241 Difference]: Finished difference. Result has 443 places, 408 transitions, 968 flow [2020-10-09 15:29:15,101 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=968, PETRI_PLACES=443, PETRI_TRANSITIONS=408} [2020-10-09 15:29:15,101 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 26 predicate places. [2020-10-09 15:29:15,101 INFO L481 AbstractCegarLoop]: Abstraction has has 443 places, 408 transitions, 968 flow [2020-10-09 15:29:15,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:15,101 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:15,101 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:15,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 308 mathsat -unsat_core_generation=3 [2020-10-09 15:29:15,302 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:15,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:15,302 INFO L82 PathProgramCache]: Analyzing trace with hash -390192147, now seen corresponding path program 1 times [2020-10-09 15:29:15,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:15,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776529413] [2020-10-09 15:29:15,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 309 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 309 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:15,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:15,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:29:15,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:15,544 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:29:15,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776529413] [2020-10-09 15:29:15,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:15,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:15,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455785744] [2020-10-09 15:29:15,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:15,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:15,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:15,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:15,564 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:15,565 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 408 transitions, 968 flow. Second operand 3 states. [2020-10-09 15:29:15,565 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:15,565 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:15,565 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:15,667 INFO L129 PetriNetUnfolder]: 27/474 cut-off events. [2020-10-09 15:29:15,667 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:15,683 INFO L80 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 474 events. 27/474 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1918 event pairs, 0 based on Foata normal form. 0/431 useless extension candidates. Maximal degree in co-relation 567. Up to 17 conditions per place. [2020-10-09 15:29:15,685 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 8 selfloop transitions, 1 changer transitions 0/406 dead transitions. [2020-10-09 15:29:15,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 406 transitions, 981 flow [2020-10-09 15:29:15,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:15,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:15,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2020-10-09 15:29:15,687 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9428359317000743 [2020-10-09 15:29:15,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1270 transitions. [2020-10-09 15:29:15,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1270 transitions. [2020-10-09 15:29:15,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:15,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1270 transitions. [2020-10-09 15:29:15,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:15,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:15,688 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:15,688 INFO L185 Difference]: Start difference. First operand has 443 places, 408 transitions, 968 flow. Second operand 3 states and 1270 transitions. [2020-10-09 15:29:15,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 406 transitions, 981 flow [2020-10-09 15:29:15,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 406 transitions, 980 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:15,692 INFO L241 Difference]: Finished difference. Result has 442 places, 406 transitions, 964 flow [2020-10-09 15:29:15,693 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=964, PETRI_PLACES=442, PETRI_TRANSITIONS=406} [2020-10-09 15:29:15,693 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 25 predicate places. [2020-10-09 15:29:15,693 INFO L481 AbstractCegarLoop]: Abstraction has has 442 places, 406 transitions, 964 flow [2020-10-09 15:29:15,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:15,693 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:15,693 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:15,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 309 mathsat -unsat_core_generation=3 [2020-10-09 15:29:15,894 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:15,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:15,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1617278159, now seen corresponding path program 1 times [2020-10-09 15:29:15,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:15,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735264250] [2020-10-09 15:29:15,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 310 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 310 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:16,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:16,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:16,136 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:29:16,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:29:16,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735264250] [2020-10-09 15:29:16,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:16,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:16,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379552928] [2020-10-09 15:29:16,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:16,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:16,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:16,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:16,162 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 449 [2020-10-09 15:29:16,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 406 transitions, 964 flow. Second operand 3 states. [2020-10-09 15:29:16,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:16,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 449 [2020-10-09 15:29:16,163 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:16,279 INFO L129 PetriNetUnfolder]: 26/481 cut-off events. [2020-10-09 15:29:16,279 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:29:16,295 INFO L80 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 481 events. 26/481 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1977 event pairs, 0 based on Foata normal form. 1/440 useless extension candidates. Maximal degree in co-relation 570. Up to 17 conditions per place. [2020-10-09 15:29:16,297 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 4 selfloop transitions, 1 changer transitions 0/406 dead transitions. [2020-10-09 15:29:16,298 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 406 transitions, 974 flow [2020-10-09 15:29:16,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2020-10-09 15:29:16,299 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9532293986636972 [2020-10-09 15:29:16,299 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2020-10-09 15:29:16,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2020-10-09 15:29:16,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:16,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2020-10-09 15:29:16,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:16,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:16,300 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:16,300 INFO L185 Difference]: Start difference. First operand has 442 places, 406 transitions, 964 flow. Second operand 3 states and 1284 transitions. [2020-10-09 15:29:16,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 406 transitions, 974 flow [2020-10-09 15:29:16,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 406 transitions, 973 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:16,304 INFO L241 Difference]: Finished difference. Result has 444 places, 406 transitions, 968 flow [2020-10-09 15:29:16,305 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=968, PETRI_PLACES=444, PETRI_TRANSITIONS=406} [2020-10-09 15:29:16,305 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 27 predicate places. [2020-10-09 15:29:16,305 INFO L481 AbstractCegarLoop]: Abstraction has has 444 places, 406 transitions, 968 flow [2020-10-09 15:29:16,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:16,305 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:16,305 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:16,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 310 mathsat -unsat_core_generation=3 [2020-10-09 15:29:16,506 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:16,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:16,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1617279182, now seen corresponding path program 1 times [2020-10-09 15:29:16,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:16,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819944997] [2020-10-09 15:29:16,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 311 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 311 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:16,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:16,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:29:16,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:29:16,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819944997] [2020-10-09 15:29:16,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:16,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:16,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080437133] [2020-10-09 15:29:16,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:16,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:16,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:16,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:16,770 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:16,771 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 406 transitions, 968 flow. Second operand 3 states. [2020-10-09 15:29:16,771 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:16,771 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:16,771 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:16,886 INFO L129 PetriNetUnfolder]: 24/483 cut-off events. [2020-10-09 15:29:16,886 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:16,903 INFO L80 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 483 events. 24/483 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2009 event pairs, 0 based on Foata normal form. 0/441 useless extension candidates. Maximal degree in co-relation 583. Up to 17 conditions per place. [2020-10-09 15:29:16,906 INFO L132 encePairwiseOnDemand]: 445/449 looper letters, 9 selfloop transitions, 3 changer transitions 0/407 dead transitions. [2020-10-09 15:29:16,906 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 407 transitions, 994 flow [2020-10-09 15:29:16,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:16,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2020-10-09 15:29:16,907 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9450631031922792 [2020-10-09 15:29:16,907 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1273 transitions. [2020-10-09 15:29:16,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1273 transitions. [2020-10-09 15:29:16,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:16,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1273 transitions. [2020-10-09 15:29:16,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:16,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:16,909 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:16,909 INFO L185 Difference]: Start difference. First operand has 444 places, 406 transitions, 968 flow. Second operand 3 states and 1273 transitions. [2020-10-09 15:29:16,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 407 transitions, 994 flow [2020-10-09 15:29:16,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 407 transitions, 993 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:16,914 INFO L241 Difference]: Finished difference. Result has 447 places, 407 transitions, 985 flow [2020-10-09 15:29:16,914 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=985, PETRI_PLACES=447, PETRI_TRANSITIONS=407} [2020-10-09 15:29:16,914 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 30 predicate places. [2020-10-09 15:29:16,914 INFO L481 AbstractCegarLoop]: Abstraction has has 447 places, 407 transitions, 985 flow [2020-10-09 15:29:16,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:16,914 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:16,915 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:17,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 311 mathsat -unsat_core_generation=3 [2020-10-09 15:29:17,115 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:17,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:17,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1616325870, now seen corresponding path program 1 times [2020-10-09 15:29:17,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:17,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960154408] [2020-10-09 15:29:17,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 312 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 312 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:17,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:17,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:29:17,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:29:17,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960154408] [2020-10-09 15:29:17,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:17,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:17,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993067449] [2020-10-09 15:29:17,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:17,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:17,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:17,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:17,383 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 449 [2020-10-09 15:29:17,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 407 transitions, 985 flow. Second operand 3 states. [2020-10-09 15:29:17,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:17,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 449 [2020-10-09 15:29:17,384 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:17,486 INFO L129 PetriNetUnfolder]: 24/476 cut-off events. [2020-10-09 15:29:17,486 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:29:17,502 INFO L80 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 476 events. 24/476 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1950 event pairs, 0 based on Foata normal form. 1/438 useless extension candidates. Maximal degree in co-relation 569. Up to 17 conditions per place. [2020-10-09 15:29:17,504 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 5 selfloop transitions, 1 changer transitions 0/405 dead transitions. [2020-10-09 15:29:17,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 405 transitions, 987 flow [2020-10-09 15:29:17,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2020-10-09 15:29:17,506 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9517446176688938 [2020-10-09 15:29:17,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1282 transitions. [2020-10-09 15:29:17,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1282 transitions. [2020-10-09 15:29:17,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:17,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1282 transitions. [2020-10-09 15:29:17,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:17,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:17,507 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:17,507 INFO L185 Difference]: Start difference. First operand has 447 places, 407 transitions, 985 flow. Second operand 3 states and 1282 transitions. [2020-10-09 15:29:17,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 405 transitions, 987 flow [2020-10-09 15:29:17,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 405 transitions, 979 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:17,511 INFO L241 Difference]: Finished difference. Result has 447 places, 405 transitions, 972 flow [2020-10-09 15:29:17,512 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=972, PETRI_PLACES=447, PETRI_TRANSITIONS=405} [2020-10-09 15:29:17,512 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 30 predicate places. [2020-10-09 15:29:17,512 INFO L481 AbstractCegarLoop]: Abstraction has has 447 places, 405 transitions, 972 flow [2020-10-09 15:29:17,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:17,512 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:17,512 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:17,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 312 mathsat -unsat_core_generation=3 [2020-10-09 15:29:17,713 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:17,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:17,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1616324847, now seen corresponding path program 1 times [2020-10-09 15:29:17,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:17,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215271890] [2020-10-09 15:29:17,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 313 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 313 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:17,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:17,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:29:17,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:29:17,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215271890] [2020-10-09 15:29:17,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:17,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:17,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557234947] [2020-10-09 15:29:17,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:17,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:17,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:17,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:17,989 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:17,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 405 transitions, 972 flow. Second operand 3 states. [2020-10-09 15:29:17,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:17,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:17,991 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:18,092 INFO L129 PetriNetUnfolder]: 24/474 cut-off events. [2020-10-09 15:29:18,092 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:18,107 INFO L80 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 474 events. 24/474 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1935 event pairs, 0 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 573. Up to 17 conditions per place. [2020-10-09 15:29:18,110 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 8 selfloop transitions, 1 changer transitions 0/403 dead transitions. [2020-10-09 15:29:18,110 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 403 transitions, 985 flow [2020-10-09 15:29:18,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:18,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2020-10-09 15:29:18,111 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9428359317000743 [2020-10-09 15:29:18,111 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1270 transitions. [2020-10-09 15:29:18,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1270 transitions. [2020-10-09 15:29:18,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:18,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1270 transitions. [2020-10-09 15:29:18,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:18,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:18,113 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:18,113 INFO L185 Difference]: Start difference. First operand has 447 places, 405 transitions, 972 flow. Second operand 3 states and 1270 transitions. [2020-10-09 15:29:18,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 403 transitions, 985 flow [2020-10-09 15:29:18,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 403 transitions, 984 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:18,117 INFO L241 Difference]: Finished difference. Result has 446 places, 403 transitions, 968 flow [2020-10-09 15:29:18,117 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=968, PETRI_PLACES=446, PETRI_TRANSITIONS=403} [2020-10-09 15:29:18,117 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 29 predicate places. [2020-10-09 15:29:18,117 INFO L481 AbstractCegarLoop]: Abstraction has has 446 places, 403 transitions, 968 flow [2020-10-09 15:29:18,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:18,117 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:18,117 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:18,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 313 mathsat -unsat_core_generation=3 [2020-10-09 15:29:18,318 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:18,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:18,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1656789775, now seen corresponding path program 1 times [2020-10-09 15:29:18,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:18,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966099156] [2020-10-09 15:29:18,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 314 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 314 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:18,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:18,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:29:18,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:29:18,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966099156] [2020-10-09 15:29:18,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:18,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:18,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000949147] [2020-10-09 15:29:18,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:18,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:18,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:18,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:18,580 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 449 [2020-10-09 15:29:18,581 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 403 transitions, 968 flow. Second operand 3 states. [2020-10-09 15:29:18,581 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:18,581 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 449 [2020-10-09 15:29:18,581 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:18,685 INFO L129 PetriNetUnfolder]: 22/479 cut-off events. [2020-10-09 15:29:18,685 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:29:18,701 INFO L80 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 479 events. 22/479 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1986 event pairs, 0 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 576. Up to 17 conditions per place. [2020-10-09 15:29:18,704 INFO L132 encePairwiseOnDemand]: 446/449 looper letters, 5 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2020-10-09 15:29:18,704 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 404 transitions, 984 flow [2020-10-09 15:29:18,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2020-10-09 15:29:18,705 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9524870081662955 [2020-10-09 15:29:18,705 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1283 transitions. [2020-10-09 15:29:18,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1283 transitions. [2020-10-09 15:29:18,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:18,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1283 transitions. [2020-10-09 15:29:18,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:18,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:18,706 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:18,707 INFO L185 Difference]: Start difference. First operand has 446 places, 403 transitions, 968 flow. Second operand 3 states and 1283 transitions. [2020-10-09 15:29:18,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 404 transitions, 984 flow [2020-10-09 15:29:18,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 404 transitions, 983 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:18,711 INFO L241 Difference]: Finished difference. Result has 449 places, 404 transitions, 981 flow [2020-10-09 15:29:18,711 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=981, PETRI_PLACES=449, PETRI_TRANSITIONS=404} [2020-10-09 15:29:18,711 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 32 predicate places. [2020-10-09 15:29:18,711 INFO L481 AbstractCegarLoop]: Abstraction has has 449 places, 404 transitions, 981 flow [2020-10-09 15:29:18,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:18,711 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:18,711 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:18,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 314 mathsat -unsat_core_generation=3 [2020-10-09 15:29:18,918 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:18,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:18,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1656790798, now seen corresponding path program 1 times [2020-10-09 15:29:18,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:18,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240028976] [2020-10-09 15:29:18,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 315 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 315 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:19,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:19,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:29:19,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:29:19,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240028976] [2020-10-09 15:29:19,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:19,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:19,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396557601] [2020-10-09 15:29:19,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:19,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:19,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:19,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:19,197 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:19,197 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 404 transitions, 981 flow. Second operand 3 states. [2020-10-09 15:29:19,197 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:19,197 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:19,198 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:19,306 INFO L129 PetriNetUnfolder]: 22/480 cut-off events. [2020-10-09 15:29:19,306 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:29:19,322 INFO L80 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 480 events. 22/480 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1996 event pairs, 0 based on Foata normal form. 0/441 useless extension candidates. Maximal degree in co-relation 584. Up to 17 conditions per place. [2020-10-09 15:29:19,325 INFO L132 encePairwiseOnDemand]: 445/449 looper letters, 9 selfloop transitions, 3 changer transitions 0/405 dead transitions. [2020-10-09 15:29:19,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 405 transitions, 1007 flow [2020-10-09 15:29:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2020-10-09 15:29:19,326 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9450631031922792 [2020-10-09 15:29:19,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1273 transitions. [2020-10-09 15:29:19,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1273 transitions. [2020-10-09 15:29:19,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:19,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1273 transitions. [2020-10-09 15:29:19,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:19,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:19,327 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:19,327 INFO L185 Difference]: Start difference. First operand has 449 places, 404 transitions, 981 flow. Second operand 3 states and 1273 transitions. [2020-10-09 15:29:19,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 405 transitions, 1007 flow [2020-10-09 15:29:19,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 405 transitions, 1005 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:19,332 INFO L241 Difference]: Finished difference. Result has 452 places, 405 transitions, 997 flow [2020-10-09 15:29:19,332 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=997, PETRI_PLACES=452, PETRI_TRANSITIONS=405} [2020-10-09 15:29:19,332 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 35 predicate places. [2020-10-09 15:29:19,332 INFO L481 AbstractCegarLoop]: Abstraction has has 452 places, 405 transitions, 997 flow [2020-10-09 15:29:19,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:19,332 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:19,332 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:19,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 315 mathsat -unsat_core_generation=3 [2020-10-09 15:29:19,533 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:19,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:19,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1655836463, now seen corresponding path program 1 times [2020-10-09 15:29:19,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:19,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362594703] [2020-10-09 15:29:19,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 316 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 316 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:19,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:19,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:29:19,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:29:19,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362594703] [2020-10-09 15:29:19,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:19,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:19,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700525202] [2020-10-09 15:29:19,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:19,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:19,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:19,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:19,799 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:19,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 405 transitions, 997 flow. Second operand 3 states. [2020-10-09 15:29:19,799 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:19,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:19,799 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:19,921 INFO L129 PetriNetUnfolder]: 21/477 cut-off events. [2020-10-09 15:29:19,921 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:29:19,935 INFO L80 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 477 events. 21/477 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1976 event pairs, 0 based on Foata normal form. 2/442 useless extension candidates. Maximal degree in co-relation 583. Up to 17 conditions per place. [2020-10-09 15:29:19,938 INFO L132 encePairwiseOnDemand]: 446/449 looper letters, 9 selfloop transitions, 1 changer transitions 0/403 dead transitions. [2020-10-09 15:29:19,938 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 403 transitions, 1005 flow [2020-10-09 15:29:19,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:19,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1272 transitions. [2020-10-09 15:29:19,939 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9443207126948775 [2020-10-09 15:29:19,939 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1272 transitions. [2020-10-09 15:29:19,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1272 transitions. [2020-10-09 15:29:19,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:19,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1272 transitions. [2020-10-09 15:29:19,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:19,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:19,941 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:19,941 INFO L185 Difference]: Start difference. First operand has 452 places, 405 transitions, 997 flow. Second operand 3 states and 1272 transitions. [2020-10-09 15:29:19,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 403 transitions, 1005 flow [2020-10-09 15:29:19,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 403 transitions, 1004 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:19,945 INFO L241 Difference]: Finished difference. Result has 453 places, 403 transitions, 986 flow [2020-10-09 15:29:19,945 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=986, PETRI_PLACES=453, PETRI_TRANSITIONS=403} [2020-10-09 15:29:19,945 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 36 predicate places. [2020-10-09 15:29:19,945 INFO L481 AbstractCegarLoop]: Abstraction has has 453 places, 403 transitions, 986 flow [2020-10-09 15:29:19,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:19,945 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:19,945 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:20,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 316 mathsat -unsat_core_generation=3 [2020-10-09 15:29:20,146 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:20,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:20,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1655837486, now seen corresponding path program 1 times [2020-10-09 15:29:20,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:20,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933895806] [2020-10-09 15:29:20,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 317 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 317 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:20,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:20,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:20,390 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:29:20,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:29:20,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933895806] [2020-10-09 15:29:20,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:20,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:20,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363881825] [2020-10-09 15:29:20,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:20,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:20,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:20,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:20,414 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 449 [2020-10-09 15:29:20,415 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 403 transitions, 986 flow. Second operand 3 states. [2020-10-09 15:29:20,415 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:20,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 449 [2020-10-09 15:29:20,415 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:20,517 INFO L129 PetriNetUnfolder]: 21/474 cut-off events. [2020-10-09 15:29:20,517 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:20,533 INFO L80 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 474 events. 21/474 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1953 event pairs, 0 based on Foata normal form. 1/439 useless extension candidates. Maximal degree in co-relation 577. Up to 17 conditions per place. [2020-10-09 15:29:20,535 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 4 selfloop transitions, 1 changer transitions 0/400 dead transitions. [2020-10-09 15:29:20,535 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 400 transitions, 985 flow [2020-10-09 15:29:20,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2020-10-09 15:29:20,536 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9532293986636972 [2020-10-09 15:29:20,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2020-10-09 15:29:20,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2020-10-09 15:29:20,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:20,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2020-10-09 15:29:20,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:20,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:20,537 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:20,537 INFO L185 Difference]: Start difference. First operand has 453 places, 403 transitions, 986 flow. Second operand 3 states and 1284 transitions. [2020-10-09 15:29:20,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 400 transitions, 985 flow [2020-10-09 15:29:20,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 400 transitions, 980 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:20,542 INFO L241 Difference]: Finished difference. Result has 450 places, 400 transitions, 972 flow [2020-10-09 15:29:20,542 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=972, PETRI_PLACES=450, PETRI_TRANSITIONS=400} [2020-10-09 15:29:20,542 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 33 predicate places. [2020-10-09 15:29:20,542 INFO L481 AbstractCegarLoop]: Abstraction has has 450 places, 400 transitions, 972 flow [2020-10-09 15:29:20,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:20,542 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:20,542 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:20,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 317 mathsat -unsat_core_generation=3 [2020-10-09 15:29:20,743 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:20,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:20,743 INFO L82 PathProgramCache]: Analyzing trace with hash -752107147, now seen corresponding path program 1 times [2020-10-09 15:29:20,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:20,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522635865] [2020-10-09 15:29:20,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 318 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 318 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:20,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:20,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:29:20,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:20,984 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:29:20,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522635865] [2020-10-09 15:29:20,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:20,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:20,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041029370] [2020-10-09 15:29:20,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:20,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:20,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:20,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:21,003 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 449 [2020-10-09 15:29:21,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 400 transitions, 972 flow. Second operand 3 states. [2020-10-09 15:29:21,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:21,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 449 [2020-10-09 15:29:21,004 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:21,110 INFO L129 PetriNetUnfolder]: 19/479 cut-off events. [2020-10-09 15:29:21,110 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:29:21,126 INFO L80 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 479 events. 19/479 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2003 event pairs, 0 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 585. Up to 17 conditions per place. [2020-10-09 15:29:21,128 INFO L132 encePairwiseOnDemand]: 446/449 looper letters, 5 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2020-10-09 15:29:21,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 401 transitions, 988 flow [2020-10-09 15:29:21,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2020-10-09 15:29:21,130 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9524870081662955 [2020-10-09 15:29:21,130 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1283 transitions. [2020-10-09 15:29:21,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1283 transitions. [2020-10-09 15:29:21,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:21,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1283 transitions. [2020-10-09 15:29:21,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:21,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:21,131 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:21,131 INFO L185 Difference]: Start difference. First operand has 450 places, 400 transitions, 972 flow. Second operand 3 states and 1283 transitions. [2020-10-09 15:29:21,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 401 transitions, 988 flow [2020-10-09 15:29:21,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 401 transitions, 987 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:21,135 INFO L241 Difference]: Finished difference. Result has 453 places, 401 transitions, 985 flow [2020-10-09 15:29:21,135 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=985, PETRI_PLACES=453, PETRI_TRANSITIONS=401} [2020-10-09 15:29:21,136 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 36 predicate places. [2020-10-09 15:29:21,136 INFO L481 AbstractCegarLoop]: Abstraction has has 453 places, 401 transitions, 985 flow [2020-10-09 15:29:21,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:21,136 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:21,136 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:21,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 318 mathsat -unsat_core_generation=3 [2020-10-09 15:29:21,337 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:21,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:21,337 INFO L82 PathProgramCache]: Analyzing trace with hash -752108170, now seen corresponding path program 1 times [2020-10-09 15:29:21,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:21,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703180386] [2020-10-09 15:29:21,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 319 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 319 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:21,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:21,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:29:21,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:21,582 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:29:21,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703180386] [2020-10-09 15:29:21,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:21,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:21,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194218722] [2020-10-09 15:29:21,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:21,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:21,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:21,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:21,610 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:21,611 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 401 transitions, 985 flow. Second operand 3 states. [2020-10-09 15:29:21,611 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:21,612 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:21,612 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:21,723 INFO L129 PetriNetUnfolder]: 19/480 cut-off events. [2020-10-09 15:29:21,723 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:29:21,739 INFO L80 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 480 events. 19/480 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2012 event pairs, 0 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 591. Up to 17 conditions per place. [2020-10-09 15:29:21,741 INFO L132 encePairwiseOnDemand]: 445/449 looper letters, 9 selfloop transitions, 3 changer transitions 0/402 dead transitions. [2020-10-09 15:29:21,742 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 402 transitions, 1011 flow [2020-10-09 15:29:21,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:21,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2020-10-09 15:29:21,743 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9450631031922792 [2020-10-09 15:29:21,743 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1273 transitions. [2020-10-09 15:29:21,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1273 transitions. [2020-10-09 15:29:21,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:21,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1273 transitions. [2020-10-09 15:29:21,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:21,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:21,744 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:21,744 INFO L185 Difference]: Start difference. First operand has 453 places, 401 transitions, 985 flow. Second operand 3 states and 1273 transitions. [2020-10-09 15:29:21,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 402 transitions, 1011 flow [2020-10-09 15:29:21,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 402 transitions, 1009 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:21,748 INFO L241 Difference]: Finished difference. Result has 456 places, 402 transitions, 1001 flow [2020-10-09 15:29:21,749 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1001, PETRI_PLACES=456, PETRI_TRANSITIONS=402} [2020-10-09 15:29:21,749 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 39 predicate places. [2020-10-09 15:29:21,749 INFO L481 AbstractCegarLoop]: Abstraction has has 456 places, 402 transitions, 1001 flow [2020-10-09 15:29:21,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:21,749 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:21,749 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:21,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 319 mathsat -unsat_core_generation=3 [2020-10-09 15:29:21,950 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:21,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:21,950 INFO L82 PathProgramCache]: Analyzing trace with hash -751153835, now seen corresponding path program 1 times [2020-10-09 15:29:21,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:21,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876987181] [2020-10-09 15:29:21,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 320 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 320 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:22,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:22,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:29:22,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:29:22,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876987181] [2020-10-09 15:29:22,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:22,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:22,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344646192] [2020-10-09 15:29:22,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:22,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:22,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:22,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:22,225 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:22,226 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 402 transitions, 1001 flow. Second operand 3 states. [2020-10-09 15:29:22,226 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:22,226 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:22,226 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:22,355 INFO L129 PetriNetUnfolder]: 18/477 cut-off events. [2020-10-09 15:29:22,355 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:29:22,367 INFO L80 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 477 events. 18/477 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1992 event pairs, 0 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 590. Up to 17 conditions per place. [2020-10-09 15:29:22,369 INFO L132 encePairwiseOnDemand]: 446/449 looper letters, 9 selfloop transitions, 1 changer transitions 0/400 dead transitions. [2020-10-09 15:29:22,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 400 transitions, 1009 flow [2020-10-09 15:29:22,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1272 transitions. [2020-10-09 15:29:22,370 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9443207126948775 [2020-10-09 15:29:22,370 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1272 transitions. [2020-10-09 15:29:22,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1272 transitions. [2020-10-09 15:29:22,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:22,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1272 transitions. [2020-10-09 15:29:22,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:22,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:22,372 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:22,372 INFO L185 Difference]: Start difference. First operand has 456 places, 402 transitions, 1001 flow. Second operand 3 states and 1272 transitions. [2020-10-09 15:29:22,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 400 transitions, 1009 flow [2020-10-09 15:29:22,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 400 transitions, 1008 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:22,376 INFO L241 Difference]: Finished difference. Result has 457 places, 400 transitions, 990 flow [2020-10-09 15:29:22,376 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=990, PETRI_PLACES=457, PETRI_TRANSITIONS=400} [2020-10-09 15:29:22,376 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 40 predicate places. [2020-10-09 15:29:22,376 INFO L481 AbstractCegarLoop]: Abstraction has has 457 places, 400 transitions, 990 flow [2020-10-09 15:29:22,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:22,377 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:22,377 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:22,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 320 mathsat -unsat_core_generation=3 [2020-10-09 15:29:22,577 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:22,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:22,578 INFO L82 PathProgramCache]: Analyzing trace with hash -751154858, now seen corresponding path program 1 times [2020-10-09 15:29:22,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:22,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147600763] [2020-10-09 15:29:22,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 321 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 321 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:22,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:22,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:29:22,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:22,827 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:29:22,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147600763] [2020-10-09 15:29:22,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:22,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:22,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947351023] [2020-10-09 15:29:22,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:22,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:22,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:22,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:22,847 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 449 [2020-10-09 15:29:22,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 400 transitions, 990 flow. Second operand 3 states. [2020-10-09 15:29:22,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:22,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 449 [2020-10-09 15:29:22,848 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:22,952 INFO L129 PetriNetUnfolder]: 18/474 cut-off events. [2020-10-09 15:29:22,952 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:22,968 INFO L80 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 474 events. 18/474 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1967 event pairs, 0 based on Foata normal form. 1/442 useless extension candidates. Maximal degree in co-relation 584. Up to 17 conditions per place. [2020-10-09 15:29:22,970 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 4 selfloop transitions, 1 changer transitions 0/397 dead transitions. [2020-10-09 15:29:22,970 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 397 transitions, 989 flow [2020-10-09 15:29:22,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2020-10-09 15:29:22,971 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9532293986636972 [2020-10-09 15:29:22,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2020-10-09 15:29:22,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2020-10-09 15:29:22,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:22,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2020-10-09 15:29:22,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:22,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:22,973 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:22,973 INFO L185 Difference]: Start difference. First operand has 457 places, 400 transitions, 990 flow. Second operand 3 states and 1284 transitions. [2020-10-09 15:29:22,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 397 transitions, 989 flow [2020-10-09 15:29:22,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 397 transitions, 984 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:22,977 INFO L241 Difference]: Finished difference. Result has 454 places, 397 transitions, 976 flow [2020-10-09 15:29:22,978 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=976, PETRI_PLACES=454, PETRI_TRANSITIONS=397} [2020-10-09 15:29:22,978 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 37 predicate places. [2020-10-09 15:29:22,978 INFO L481 AbstractCegarLoop]: Abstraction has has 454 places, 397 transitions, 976 flow [2020-10-09 15:29:22,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:22,978 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:22,978 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:23,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 321 mathsat -unsat_core_generation=3 [2020-10-09 15:29:23,179 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:23,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:23,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1075667931, now seen corresponding path program 1 times [2020-10-09 15:29:23,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:23,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054469809] [2020-10-09 15:29:23,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 322 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 322 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:23,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:23,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:23,428 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:29:23,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:29:23,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054469809] [2020-10-09 15:29:23,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:23,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:23,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472761105] [2020-10-09 15:29:23,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:23,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:23,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:23,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:23,449 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 449 [2020-10-09 15:29:23,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 397 transitions, 976 flow. Second operand 3 states. [2020-10-09 15:29:23,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:23,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 449 [2020-10-09 15:29:23,450 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:23,558 INFO L129 PetriNetUnfolder]: 17/481 cut-off events. [2020-10-09 15:29:23,558 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:29:23,574 INFO L80 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 481 events. 17/481 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2028 event pairs, 0 based on Foata normal form. 1/448 useless extension candidates. Maximal degree in co-relation 592. Up to 17 conditions per place. [2020-10-09 15:29:23,576 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 4 selfloop transitions, 1 changer transitions 0/397 dead transitions. [2020-10-09 15:29:23,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 397 transitions, 986 flow [2020-10-09 15:29:23,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2020-10-09 15:29:23,577 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9532293986636972 [2020-10-09 15:29:23,578 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2020-10-09 15:29:23,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2020-10-09 15:29:23,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:23,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2020-10-09 15:29:23,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:23,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:23,579 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:23,579 INFO L185 Difference]: Start difference. First operand has 454 places, 397 transitions, 976 flow. Second operand 3 states and 1284 transitions. [2020-10-09 15:29:23,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 397 transitions, 986 flow [2020-10-09 15:29:23,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 397 transitions, 985 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:23,583 INFO L241 Difference]: Finished difference. Result has 456 places, 397 transitions, 980 flow [2020-10-09 15:29:23,583 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=980, PETRI_PLACES=456, PETRI_TRANSITIONS=397} [2020-10-09 15:29:23,583 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 39 predicate places. [2020-10-09 15:29:23,584 INFO L481 AbstractCegarLoop]: Abstraction has has 456 places, 397 transitions, 980 flow [2020-10-09 15:29:23,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:23,584 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:23,584 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:23,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 322 mathsat -unsat_core_generation=3 [2020-10-09 15:29:23,784 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:23,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:23,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1075668954, now seen corresponding path program 1 times [2020-10-09 15:29:23,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:23,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353809008] [2020-10-09 15:29:23,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 323 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 323 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:24,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:24,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:29:24,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:29:24,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353809008] [2020-10-09 15:29:24,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:24,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:24,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844822888] [2020-10-09 15:29:24,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:24,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:24,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:24,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:24,053 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:24,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 397 transitions, 980 flow. Second operand 3 states. [2020-10-09 15:29:24,054 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:24,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:24,054 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:24,171 INFO L129 PetriNetUnfolder]: 15/483 cut-off events. [2020-10-09 15:29:24,171 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:24,187 INFO L80 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 483 events. 15/483 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2062 event pairs, 0 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 603. Up to 17 conditions per place. [2020-10-09 15:29:24,189 INFO L132 encePairwiseOnDemand]: 445/449 looper letters, 9 selfloop transitions, 3 changer transitions 0/398 dead transitions. [2020-10-09 15:29:24,189 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 398 transitions, 1006 flow [2020-10-09 15:29:24,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:24,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:24,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2020-10-09 15:29:24,190 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9450631031922792 [2020-10-09 15:29:24,191 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1273 transitions. [2020-10-09 15:29:24,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1273 transitions. [2020-10-09 15:29:24,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:24,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1273 transitions. [2020-10-09 15:29:24,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:24,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:24,192 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:24,192 INFO L185 Difference]: Start difference. First operand has 456 places, 397 transitions, 980 flow. Second operand 3 states and 1273 transitions. [2020-10-09 15:29:24,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 398 transitions, 1006 flow [2020-10-09 15:29:24,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 398 transitions, 1005 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:24,196 INFO L241 Difference]: Finished difference. Result has 459 places, 398 transitions, 997 flow [2020-10-09 15:29:24,196 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=997, PETRI_PLACES=459, PETRI_TRANSITIONS=398} [2020-10-09 15:29:24,197 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 42 predicate places. [2020-10-09 15:29:24,197 INFO L481 AbstractCegarLoop]: Abstraction has has 459 places, 398 transitions, 997 flow [2020-10-09 15:29:24,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:24,197 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:24,197 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:24,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 323 mathsat -unsat_core_generation=3 [2020-10-09 15:29:24,398 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:24,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:24,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1074715642, now seen corresponding path program 1 times [2020-10-09 15:29:24,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:24,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122450640] [2020-10-09 15:29:24,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 324 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 324 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:24,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:24,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:24,646 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:29:24,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:29:24,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122450640] [2020-10-09 15:29:24,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:24,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:24,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597402767] [2020-10-09 15:29:24,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:24,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:24,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:24,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:24,660 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 449 [2020-10-09 15:29:24,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 398 transitions, 997 flow. Second operand 3 states. [2020-10-09 15:29:24,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:24,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 449 [2020-10-09 15:29:24,661 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:24,768 INFO L129 PetriNetUnfolder]: 15/476 cut-off events. [2020-10-09 15:29:24,768 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:29:24,784 INFO L80 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 476 events. 15/476 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2002 event pairs, 0 based on Foata normal form. 1/447 useless extension candidates. Maximal degree in co-relation 589. Up to 17 conditions per place. [2020-10-09 15:29:24,786 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 5 selfloop transitions, 1 changer transitions 0/396 dead transitions. [2020-10-09 15:29:24,786 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 396 transitions, 999 flow [2020-10-09 15:29:24,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2020-10-09 15:29:24,787 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9517446176688938 [2020-10-09 15:29:24,787 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1282 transitions. [2020-10-09 15:29:24,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1282 transitions. [2020-10-09 15:29:24,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:24,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1282 transitions. [2020-10-09 15:29:24,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:24,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:24,789 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:24,789 INFO L185 Difference]: Start difference. First operand has 459 places, 398 transitions, 997 flow. Second operand 3 states and 1282 transitions. [2020-10-09 15:29:24,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 396 transitions, 999 flow [2020-10-09 15:29:24,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 396 transitions, 991 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:24,794 INFO L241 Difference]: Finished difference. Result has 459 places, 396 transitions, 984 flow [2020-10-09 15:29:24,794 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=984, PETRI_PLACES=459, PETRI_TRANSITIONS=396} [2020-10-09 15:29:24,794 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 42 predicate places. [2020-10-09 15:29:24,794 INFO L481 AbstractCegarLoop]: Abstraction has has 459 places, 396 transitions, 984 flow [2020-10-09 15:29:24,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:24,794 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:24,794 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:24,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 324 mathsat -unsat_core_generation=3 [2020-10-09 15:29:24,995 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:24,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:24,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1074714619, now seen corresponding path program 1 times [2020-10-09 15:29:24,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:24,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236798755] [2020-10-09 15:29:24,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 325 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 325 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:25,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:25,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:29:25,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:29:25,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236798755] [2020-10-09 15:29:25,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:25,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:25,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936723172] [2020-10-09 15:29:25,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:25,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:25,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:25,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:25,274 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:25,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 396 transitions, 984 flow. Second operand 3 states. [2020-10-09 15:29:25,274 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:25,275 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:25,275 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:25,387 INFO L129 PetriNetUnfolder]: 15/474 cut-off events. [2020-10-09 15:29:25,387 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:25,402 INFO L80 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 474 events. 15/474 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1988 event pairs, 0 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 593. Up to 17 conditions per place. [2020-10-09 15:29:25,404 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 8 selfloop transitions, 1 changer transitions 0/394 dead transitions. [2020-10-09 15:29:25,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 394 transitions, 997 flow [2020-10-09 15:29:25,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2020-10-09 15:29:25,405 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9428359317000743 [2020-10-09 15:29:25,405 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1270 transitions. [2020-10-09 15:29:25,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1270 transitions. [2020-10-09 15:29:25,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:25,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1270 transitions. [2020-10-09 15:29:25,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:25,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:25,407 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:25,407 INFO L185 Difference]: Start difference. First operand has 459 places, 396 transitions, 984 flow. Second operand 3 states and 1270 transitions. [2020-10-09 15:29:25,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 394 transitions, 997 flow [2020-10-09 15:29:25,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 394 transitions, 996 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:25,411 INFO L241 Difference]: Finished difference. Result has 458 places, 394 transitions, 980 flow [2020-10-09 15:29:25,411 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=980, PETRI_PLACES=458, PETRI_TRANSITIONS=394} [2020-10-09 15:29:25,411 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 41 predicate places. [2020-10-09 15:29:25,411 INFO L481 AbstractCegarLoop]: Abstraction has has 458 places, 394 transitions, 980 flow [2020-10-09 15:29:25,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:25,411 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:25,411 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:25,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 325 mathsat -unsat_core_generation=3 [2020-10-09 15:29:25,612 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:25,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:25,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1735508479, now seen corresponding path program 1 times [2020-10-09 15:29:25,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:25,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648690611] [2020-10-09 15:29:25,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 326 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 326 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:25,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:25,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:25,858 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:29:25,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:25,861 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:29:25,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648690611] [2020-10-09 15:29:25,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:25,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:25,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512222225] [2020-10-09 15:29:25,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:25,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:25,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:25,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:25,881 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:25,881 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 394 transitions, 980 flow. Second operand 3 states. [2020-10-09 15:29:25,882 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:25,882 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:25,882 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:25,997 INFO L129 PetriNetUnfolder]: 14/482 cut-off events. [2020-10-09 15:29:25,997 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:29:26,014 INFO L80 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 482 events. 14/482 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2056 event pairs, 0 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 605. Up to 17 conditions per place. [2020-10-09 15:29:26,016 INFO L132 encePairwiseOnDemand]: 444/449 looper letters, 10 selfloop transitions, 3 changer transitions 0/396 dead transitions. [2020-10-09 15:29:26,016 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 396 transitions, 1010 flow [2020-10-09 15:29:26,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:26,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:26,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2020-10-09 15:29:26,017 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9465478841870824 [2020-10-09 15:29:26,017 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1275 transitions. [2020-10-09 15:29:26,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1275 transitions. [2020-10-09 15:29:26,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:26,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1275 transitions. [2020-10-09 15:29:26,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:26,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:26,018 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:26,018 INFO L185 Difference]: Start difference. First operand has 458 places, 394 transitions, 980 flow. Second operand 3 states and 1275 transitions. [2020-10-09 15:29:26,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 396 transitions, 1010 flow [2020-10-09 15:29:26,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 396 transitions, 1009 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:26,023 INFO L241 Difference]: Finished difference. Result has 461 places, 396 transitions, 1003 flow [2020-10-09 15:29:26,023 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1003, PETRI_PLACES=461, PETRI_TRANSITIONS=396} [2020-10-09 15:29:26,023 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 44 predicate places. [2020-10-09 15:29:26,023 INFO L481 AbstractCegarLoop]: Abstraction has has 461 places, 396 transitions, 1003 flow [2020-10-09 15:29:26,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:26,023 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:26,023 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:26,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 326 mathsat -unsat_core_generation=3 [2020-10-09 15:29:26,224 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:26,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:26,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1735507456, now seen corresponding path program 1 times [2020-10-09 15:29:26,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:26,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977256886] [2020-10-09 15:29:26,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 327 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 327 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:26,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:26,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:29:26,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:29:26,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977256886] [2020-10-09 15:29:26,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:26,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:26,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027711396] [2020-10-09 15:29:26,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:26,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:26,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:26,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:26,484 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 449 [2020-10-09 15:29:26,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 396 transitions, 1003 flow. Second operand 3 states. [2020-10-09 15:29:26,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:26,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 449 [2020-10-09 15:29:26,485 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:26,591 INFO L129 PetriNetUnfolder]: 13/480 cut-off events. [2020-10-09 15:29:26,591 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:29:26,607 INFO L80 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 480 events. 13/480 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2048 event pairs, 0 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 602. Up to 17 conditions per place. [2020-10-09 15:29:26,609 INFO L132 encePairwiseOnDemand]: 446/449 looper letters, 5 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2020-10-09 15:29:26,609 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 396 transitions, 1015 flow [2020-10-09 15:29:26,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:26,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2020-10-09 15:29:26,610 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9524870081662955 [2020-10-09 15:29:26,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1283 transitions. [2020-10-09 15:29:26,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1283 transitions. [2020-10-09 15:29:26,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:26,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1283 transitions. [2020-10-09 15:29:26,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:26,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:26,611 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:26,611 INFO L185 Difference]: Start difference. First operand has 461 places, 396 transitions, 1003 flow. Second operand 3 states and 1283 transitions. [2020-10-09 15:29:26,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 396 transitions, 1015 flow [2020-10-09 15:29:26,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 396 transitions, 1010 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:26,615 INFO L241 Difference]: Finished difference. Result has 464 places, 396 transitions, 1008 flow [2020-10-09 15:29:26,616 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1008, PETRI_PLACES=464, PETRI_TRANSITIONS=396} [2020-10-09 15:29:26,616 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 47 predicate places. [2020-10-09 15:29:26,616 INFO L481 AbstractCegarLoop]: Abstraction has has 464 places, 396 transitions, 1008 flow [2020-10-09 15:29:26,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:26,616 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:26,616 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:26,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 327 mathsat -unsat_core_generation=3 [2020-10-09 15:29:26,817 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:26,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:26,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1734555167, now seen corresponding path program 1 times [2020-10-09 15:29:26,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:26,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130108914] [2020-10-09 15:29:26,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 328 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 328 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:27,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:27,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:27,062 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:29:27,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:29:27,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130108914] [2020-10-09 15:29:27,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:27,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:27,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109638892] [2020-10-09 15:29:27,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:27,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:27,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:27,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:27,092 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 449 [2020-10-09 15:29:27,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 396 transitions, 1008 flow. Second operand 3 states. [2020-10-09 15:29:27,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:27,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 449 [2020-10-09 15:29:27,093 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:27,204 INFO L129 PetriNetUnfolder]: 12/476 cut-off events. [2020-10-09 15:29:27,204 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:29:27,221 INFO L80 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 476 events. 12/476 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2020 event pairs, 0 based on Foata normal form. 1/450 useless extension candidates. Maximal degree in co-relation 598. Up to 17 conditions per place. [2020-10-09 15:29:27,222 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 4 selfloop transitions, 1 changer transitions 0/393 dead transitions. [2020-10-09 15:29:27,222 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 393 transitions, 1003 flow [2020-10-09 15:29:27,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2020-10-09 15:29:27,223 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9532293986636972 [2020-10-09 15:29:27,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2020-10-09 15:29:27,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2020-10-09 15:29:27,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:27,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2020-10-09 15:29:27,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:27,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:27,225 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:27,225 INFO L185 Difference]: Start difference. First operand has 464 places, 396 transitions, 1008 flow. Second operand 3 states and 1284 transitions. [2020-10-09 15:29:27,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 393 transitions, 1003 flow [2020-10-09 15:29:27,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 393 transitions, 996 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:27,259 INFO L241 Difference]: Finished difference. Result has 463 places, 393 transitions, 988 flow [2020-10-09 15:29:27,259 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=988, PETRI_PLACES=463, PETRI_TRANSITIONS=393} [2020-10-09 15:29:27,259 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 46 predicate places. [2020-10-09 15:29:27,260 INFO L481 AbstractCegarLoop]: Abstraction has has 463 places, 393 transitions, 988 flow [2020-10-09 15:29:27,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:27,260 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:27,260 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:27,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 328 mathsat -unsat_core_generation=3 [2020-10-09 15:29:27,460 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:27,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:27,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1734554144, now seen corresponding path program 1 times [2020-10-09 15:29:27,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:27,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697585017] [2020-10-09 15:29:27,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 329 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 329 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:27,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:27,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:29:27,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:29:27,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697585017] [2020-10-09 15:29:27,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:27,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:27,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095709958] [2020-10-09 15:29:27,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:27,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:27,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:27,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:27,749 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 449 [2020-10-09 15:29:27,749 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 393 transitions, 988 flow. Second operand 3 states. [2020-10-09 15:29:27,750 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:27,750 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 449 [2020-10-09 15:29:27,750 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:27,860 INFO L129 PetriNetUnfolder]: 12/474 cut-off events. [2020-10-09 15:29:27,861 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 15:29:27,877 INFO L80 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 474 events. 12/474 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2006 event pairs, 0 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 600. Up to 17 conditions per place. [2020-10-09 15:29:27,878 INFO L132 encePairwiseOnDemand]: 447/449 looper letters, 8 selfloop transitions, 1 changer transitions 0/391 dead transitions. [2020-10-09 15:29:27,878 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 391 transitions, 1001 flow [2020-10-09 15:29:27,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2020-10-09 15:29:27,879 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9428359317000743 [2020-10-09 15:29:27,879 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1270 transitions. [2020-10-09 15:29:27,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1270 transitions. [2020-10-09 15:29:27,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:27,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1270 transitions. [2020-10-09 15:29:27,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:27,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:27,881 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:27,881 INFO L185 Difference]: Start difference. First operand has 463 places, 393 transitions, 988 flow. Second operand 3 states and 1270 transitions. [2020-10-09 15:29:27,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 391 transitions, 1001 flow [2020-10-09 15:29:27,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 391 transitions, 1000 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:27,885 INFO L241 Difference]: Finished difference. Result has 462 places, 391 transitions, 984 flow [2020-10-09 15:29:27,885 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=984, PETRI_PLACES=462, PETRI_TRANSITIONS=391} [2020-10-09 15:29:27,886 INFO L341 CegarLoopForPetriNet]: 417 programPoint places, 45 predicate places. [2020-10-09 15:29:27,886 INFO L481 AbstractCegarLoop]: Abstraction has has 462 places, 391 transitions, 984 flow [2020-10-09 15:29:27,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:27,886 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:27,886 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:28,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 329 mathsat -unsat_core_generation=3 [2020-10-09 15:29:28,087 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:28,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1083061551, now seen corresponding path program 1 times [2020-10-09 15:29:28,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:28,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890375561] [2020-10-09 15:29:28,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 330 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 330 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:29:28,336 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:29:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:29:28,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:29:28,411 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:29:28,411 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:29:28,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 330 mathsat -unsat_core_generation=3 [2020-10-09 15:29:28,612 WARN L371 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:29:28,613 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2020-10-09 15:29:28,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,709 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,709 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,709 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,709 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,712 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,712 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,712 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,712 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:29:28,722 INFO L253 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2020-10-09 15:29:28,722 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:29:28,722 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:29:28,722 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:29:28,722 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:29:28,722 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:29:28,722 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:29:28,722 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:29:28,722 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:29:28,725 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 442 places, 476 transitions, 1309 flow [2020-10-09 15:29:28,837 INFO L129 PetriNetUnfolder]: 86/628 cut-off events. [2020-10-09 15:29:28,838 INFO L130 PetriNetUnfolder]: For 952/952 co-relation queries the response was YES. [2020-10-09 15:29:28,862 INFO L80 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 628 events. 86/628 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2541 event pairs, 0 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 771. Up to 36 conditions per place. [2020-10-09 15:29:28,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 442 places, 476 transitions, 1309 flow [2020-10-09 15:29:28,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 442 places, 476 transitions, 1309 flow [2020-10-09 15:29:28,877 INFO L129 PetriNetUnfolder]: 9/96 cut-off events. [2020-10-09 15:29:28,877 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:29:28,877 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:28,877 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:28,877 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:28,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:28,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1468205937, now seen corresponding path program 1 times [2020-10-09 15:29:28,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:28,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725375781] [2020-10-09 15:29:28,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 331 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 331 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:29,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:29,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:29:29,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:29:29,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725375781] [2020-10-09 15:29:29,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:29,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:29,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543081155] [2020-10-09 15:29:29,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:29,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:29,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:29,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:29,142 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 476 [2020-10-09 15:29:29,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 476 transitions, 1309 flow. Second operand 3 states. [2020-10-09 15:29:29,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:29,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 476 [2020-10-09 15:29:29,143 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:29,250 INFO L129 PetriNetUnfolder]: 49/508 cut-off events. [2020-10-09 15:29:29,250 INFO L130 PetriNetUnfolder]: For 953/953 co-relation queries the response was YES. [2020-10-09 15:29:29,270 INFO L80 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 508 events. 49/508 cut-off events. For 953/953 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1962 event pairs, 0 based on Foata normal form. 70/510 useless extension candidates. Maximal degree in co-relation 662. Up to 18 conditions per place. [2020-10-09 15:29:29,275 INFO L132 encePairwiseOnDemand]: 454/476 looper letters, 5 selfloop transitions, 2 changer transitions 0/454 dead transitions. [2020-10-09 15:29:29,276 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 454 transitions, 1279 flow [2020-10-09 15:29:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1399 transitions. [2020-10-09 15:29:29,277 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9796918767507002 [2020-10-09 15:29:29,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1399 transitions. [2020-10-09 15:29:29,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1399 transitions. [2020-10-09 15:29:29,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:29,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1399 transitions. [2020-10-09 15:29:29,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:29,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:29,279 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:29,279 INFO L185 Difference]: Start difference. First operand has 442 places, 476 transitions, 1309 flow. Second operand 3 states and 1399 transitions. [2020-10-09 15:29:29,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 454 transitions, 1279 flow [2020-10-09 15:29:29,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 454 transitions, 1007 flow, removed 136 selfloop flow, removed 0 redundant places. [2020-10-09 15:29:29,284 INFO L241 Difference]: Finished difference. Result has 441 places, 454 transitions, 1005 flow [2020-10-09 15:29:29,284 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1005, PETRI_PLACES=441, PETRI_TRANSITIONS=454} [2020-10-09 15:29:29,284 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, -1 predicate places. [2020-10-09 15:29:29,284 INFO L481 AbstractCegarLoop]: Abstraction has has 441 places, 454 transitions, 1005 flow [2020-10-09 15:29:29,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:29,284 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:29,284 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:29,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 331 mathsat -unsat_core_generation=3 [2020-10-09 15:29:29,485 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:29,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:29,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1468206960, now seen corresponding path program 1 times [2020-10-09 15:29:29,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:29,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269264317] [2020-10-09 15:29:29,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 332 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 332 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:29,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:29,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:29:29,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:29,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:29:29,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269264317] [2020-10-09 15:29:29,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:29,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:29,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582758737] [2020-10-09 15:29:29,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:29,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:29,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:29,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:29,773 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:29,773 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 454 transitions, 1005 flow. Second operand 3 states. [2020-10-09 15:29:29,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:29,774 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:29,774 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:29,904 INFO L129 PetriNetUnfolder]: 49/509 cut-off events. [2020-10-09 15:29:29,904 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:29:29,915 INFO L80 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 509 events. 49/509 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1969 event pairs, 0 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 560. Up to 18 conditions per place. [2020-10-09 15:29:29,919 INFO L132 encePairwiseOnDemand]: 472/476 looper letters, 9 selfloop transitions, 3 changer transitions 0/455 dead transitions. [2020-10-09 15:29:29,920 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 455 transitions, 1031 flow [2020-10-09 15:29:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1351 transitions. [2020-10-09 15:29:29,921 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.946078431372549 [2020-10-09 15:29:29,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1351 transitions. [2020-10-09 15:29:29,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1351 transitions. [2020-10-09 15:29:29,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:29,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1351 transitions. [2020-10-09 15:29:29,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:29,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:29,922 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:29,923 INFO L185 Difference]: Start difference. First operand has 441 places, 454 transitions, 1005 flow. Second operand 3 states and 1351 transitions. [2020-10-09 15:29:29,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 455 transitions, 1031 flow [2020-10-09 15:29:29,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 455 transitions, 1029 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:29,926 INFO L241 Difference]: Finished difference. Result has 444 places, 455 transitions, 1021 flow [2020-10-09 15:29:29,927 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1003, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1021, PETRI_PLACES=444, PETRI_TRANSITIONS=455} [2020-10-09 15:29:29,927 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 2 predicate places. [2020-10-09 15:29:29,927 INFO L481 AbstractCegarLoop]: Abstraction has has 444 places, 455 transitions, 1021 flow [2020-10-09 15:29:29,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:29,927 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:29,927 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:30,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 332 mathsat -unsat_core_generation=3 [2020-10-09 15:29:30,128 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:30,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:30,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1467252625, now seen corresponding path program 1 times [2020-10-09 15:29:30,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:30,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592713107] [2020-10-09 15:29:30,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 333 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 333 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:30,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:30,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:29:30,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:29:30,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592713107] [2020-10-09 15:29:30,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:30,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:30,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511456404] [2020-10-09 15:29:30,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:30,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:30,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:30,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:30,416 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:30,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 455 transitions, 1021 flow. Second operand 3 states. [2020-10-09 15:29:30,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:30,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:30,417 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:30,518 INFO L129 PetriNetUnfolder]: 48/506 cut-off events. [2020-10-09 15:29:30,518 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:29:30,535 INFO L80 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 506 events. 48/506 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1954 event pairs, 0 based on Foata normal form. 2/443 useless extension candidates. Maximal degree in co-relation 562. Up to 18 conditions per place. [2020-10-09 15:29:30,541 INFO L132 encePairwiseOnDemand]: 473/476 looper letters, 9 selfloop transitions, 1 changer transitions 0/453 dead transitions. [2020-10-09 15:29:30,541 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 453 transitions, 1029 flow [2020-10-09 15:29:30,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1350 transitions. [2020-10-09 15:29:30,542 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9453781512605042 [2020-10-09 15:29:30,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1350 transitions. [2020-10-09 15:29:30,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1350 transitions. [2020-10-09 15:29:30,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:30,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1350 transitions. [2020-10-09 15:29:30,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:30,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:30,544 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:30,544 INFO L185 Difference]: Start difference. First operand has 444 places, 455 transitions, 1021 flow. Second operand 3 states and 1350 transitions. [2020-10-09 15:29:30,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 453 transitions, 1029 flow [2020-10-09 15:29:30,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 453 transitions, 1028 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:30,548 INFO L241 Difference]: Finished difference. Result has 445 places, 453 transitions, 1010 flow [2020-10-09 15:29:30,548 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1010, PETRI_PLACES=445, PETRI_TRANSITIONS=453} [2020-10-09 15:29:30,548 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 3 predicate places. [2020-10-09 15:29:30,548 INFO L481 AbstractCegarLoop]: Abstraction has has 445 places, 453 transitions, 1010 flow [2020-10-09 15:29:30,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:30,548 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:30,548 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:30,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 333 mathsat -unsat_core_generation=3 [2020-10-09 15:29:30,749 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:30,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:30,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1467253648, now seen corresponding path program 1 times [2020-10-09 15:29:30,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:30,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193833146] [2020-10-09 15:29:30,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 334 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 334 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:31,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:31,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:29:31,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:29:31,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193833146] [2020-10-09 15:29:31,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:31,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:31,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415856293] [2020-10-09 15:29:31,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:31,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:31,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:31,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:31,024 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 476 [2020-10-09 15:29:31,025 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 453 transitions, 1010 flow. Second operand 3 states. [2020-10-09 15:29:31,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:31,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 476 [2020-10-09 15:29:31,025 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:31,126 INFO L129 PetriNetUnfolder]: 48/503 cut-off events. [2020-10-09 15:29:31,126 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:31,144 INFO L80 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 503 events. 48/503 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1934 event pairs, 0 based on Foata normal form. 1/440 useless extension candidates. Maximal degree in co-relation 557. Up to 18 conditions per place. [2020-10-09 15:29:31,149 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 4 selfloop transitions, 1 changer transitions 0/450 dead transitions. [2020-10-09 15:29:31,149 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 450 transitions, 1009 flow [2020-10-09 15:29:31,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:31,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2020-10-09 15:29:31,151 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9537815126050421 [2020-10-09 15:29:31,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1362 transitions. [2020-10-09 15:29:31,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1362 transitions. [2020-10-09 15:29:31,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:31,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1362 transitions. [2020-10-09 15:29:31,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:31,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:31,152 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:31,152 INFO L185 Difference]: Start difference. First operand has 445 places, 453 transitions, 1010 flow. Second operand 3 states and 1362 transitions. [2020-10-09 15:29:31,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 450 transitions, 1009 flow [2020-10-09 15:29:31,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 450 transitions, 1004 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:31,157 INFO L241 Difference]: Finished difference. Result has 442 places, 450 transitions, 996 flow [2020-10-09 15:29:31,157 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=996, PETRI_PLACES=442, PETRI_TRANSITIONS=450} [2020-10-09 15:29:31,157 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 0 predicate places. [2020-10-09 15:29:31,157 INFO L481 AbstractCegarLoop]: Abstraction has has 442 places, 450 transitions, 996 flow [2020-10-09 15:29:31,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:31,157 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:31,157 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:29:31,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 334 mathsat -unsat_core_generation=3 [2020-10-09 15:29:31,358 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:31,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:31,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1875345114, now seen corresponding path program 1 times [2020-10-09 15:29:31,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:31,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879140412] [2020-10-09 15:29:31,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 335 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 335 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:31,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:31,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:29:31,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:29:31,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879140412] [2020-10-09 15:29:31,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:31,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:31,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952998246] [2020-10-09 15:29:31,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:31,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:31,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:31,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:31,646 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:31,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 450 transitions, 996 flow. Second operand 3 states. [2020-10-09 15:29:31,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:31,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:31,647 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:31,755 INFO L129 PetriNetUnfolder]: 47/511 cut-off events. [2020-10-09 15:29:31,755 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:31,774 INFO L80 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 511 events. 47/511 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2002 event pairs, 0 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 574. Up to 18 conditions per place. [2020-10-09 15:29:31,780 INFO L132 encePairwiseOnDemand]: 471/476 looper letters, 10 selfloop transitions, 3 changer transitions 0/452 dead transitions. [2020-10-09 15:29:31,780 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 452 transitions, 1026 flow [2020-10-09 15:29:31,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1353 transitions. [2020-10-09 15:29:31,781 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474789915966386 [2020-10-09 15:29:31,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1353 transitions. [2020-10-09 15:29:31,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1353 transitions. [2020-10-09 15:29:31,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:31,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1353 transitions. [2020-10-09 15:29:31,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:31,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:31,783 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:31,783 INFO L185 Difference]: Start difference. First operand has 442 places, 450 transitions, 996 flow. Second operand 3 states and 1353 transitions. [2020-10-09 15:29:31,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 452 transitions, 1026 flow [2020-10-09 15:29:31,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 452 transitions, 1025 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:31,788 INFO L241 Difference]: Finished difference. Result has 445 places, 452 transitions, 1019 flow [2020-10-09 15:29:31,788 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1019, PETRI_PLACES=445, PETRI_TRANSITIONS=452} [2020-10-09 15:29:31,788 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 3 predicate places. [2020-10-09 15:29:31,788 INFO L481 AbstractCegarLoop]: Abstraction has has 445 places, 452 transitions, 1019 flow [2020-10-09 15:29:31,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:31,789 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:31,789 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:29:31,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 335 mathsat -unsat_core_generation=3 [2020-10-09 15:29:31,989 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:31,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:31,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1875344091, now seen corresponding path program 1 times [2020-10-09 15:29:31,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:31,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475136678] [2020-10-09 15:29:31,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 336 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 336 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:32,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:32,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:29:32,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:29:32,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475136678] [2020-10-09 15:29:32,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:32,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:32,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247133637] [2020-10-09 15:29:32,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:32,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:32,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:32,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:32,260 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 476 [2020-10-09 15:29:32,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 452 transitions, 1019 flow. Second operand 3 states. [2020-10-09 15:29:32,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:32,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 476 [2020-10-09 15:29:32,261 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:32,369 INFO L129 PetriNetUnfolder]: 46/509 cut-off events. [2020-10-09 15:29:32,369 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:29:32,388 INFO L80 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 509 events. 46/509 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1992 event pairs, 0 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 568. Up to 18 conditions per place. [2020-10-09 15:29:32,394 INFO L132 encePairwiseOnDemand]: 473/476 looper letters, 5 selfloop transitions, 2 changer transitions 0/452 dead transitions. [2020-10-09 15:29:32,394 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 452 transitions, 1031 flow [2020-10-09 15:29:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:32,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1361 transitions. [2020-10-09 15:29:32,395 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9530812324929971 [2020-10-09 15:29:32,395 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1361 transitions. [2020-10-09 15:29:32,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1361 transitions. [2020-10-09 15:29:32,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:32,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1361 transitions. [2020-10-09 15:29:32,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:32,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:32,397 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:32,397 INFO L185 Difference]: Start difference. First operand has 445 places, 452 transitions, 1019 flow. Second operand 3 states and 1361 transitions. [2020-10-09 15:29:32,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 452 transitions, 1031 flow [2020-10-09 15:29:32,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 452 transitions, 1026 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:32,402 INFO L241 Difference]: Finished difference. Result has 448 places, 452 transitions, 1024 flow [2020-10-09 15:29:32,402 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1010, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1024, PETRI_PLACES=448, PETRI_TRANSITIONS=452} [2020-10-09 15:29:32,402 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 6 predicate places. [2020-10-09 15:29:32,402 INFO L481 AbstractCegarLoop]: Abstraction has has 448 places, 452 transitions, 1024 flow [2020-10-09 15:29:32,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:32,402 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:32,402 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:29:32,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 336 mathsat -unsat_core_generation=3 [2020-10-09 15:29:32,603 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:32,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:32,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1874391802, now seen corresponding path program 1 times [2020-10-09 15:29:32,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:32,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668631025] [2020-10-09 15:29:32,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 337 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 337 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:32,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:32,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:29:32,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:29:32,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668631025] [2020-10-09 15:29:32,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:32,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:32,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238389436] [2020-10-09 15:29:32,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:32,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:32,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:32,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:32,909 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 476 [2020-10-09 15:29:32,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 452 transitions, 1024 flow. Second operand 3 states. [2020-10-09 15:29:32,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:32,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 476 [2020-10-09 15:29:32,910 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:33,014 INFO L129 PetriNetUnfolder]: 45/505 cut-off events. [2020-10-09 15:29:33,015 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:29:33,033 INFO L80 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 505 events. 45/505 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1965 event pairs, 0 based on Foata normal form. 1/445 useless extension candidates. Maximal degree in co-relation 565. Up to 18 conditions per place. [2020-10-09 15:29:33,038 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 4 selfloop transitions, 1 changer transitions 0/449 dead transitions. [2020-10-09 15:29:33,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 449 transitions, 1019 flow [2020-10-09 15:29:33,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2020-10-09 15:29:33,039 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9537815126050421 [2020-10-09 15:29:33,039 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1362 transitions. [2020-10-09 15:29:33,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1362 transitions. [2020-10-09 15:29:33,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:33,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1362 transitions. [2020-10-09 15:29:33,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:33,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:33,041 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:33,041 INFO L185 Difference]: Start difference. First operand has 448 places, 452 transitions, 1024 flow. Second operand 3 states and 1362 transitions. [2020-10-09 15:29:33,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 449 transitions, 1019 flow [2020-10-09 15:29:33,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 449 transitions, 1012 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:33,047 INFO L241 Difference]: Finished difference. Result has 447 places, 449 transitions, 1004 flow [2020-10-09 15:29:33,048 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1004, PETRI_PLACES=447, PETRI_TRANSITIONS=449} [2020-10-09 15:29:33,048 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 5 predicate places. [2020-10-09 15:29:33,048 INFO L481 AbstractCegarLoop]: Abstraction has has 447 places, 449 transitions, 1004 flow [2020-10-09 15:29:33,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:33,048 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:33,048 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:29:33,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 337 mathsat -unsat_core_generation=3 [2020-10-09 15:29:33,249 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:33,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:33,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1874390779, now seen corresponding path program 1 times [2020-10-09 15:29:33,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:33,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357000284] [2020-10-09 15:29:33,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 338 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 338 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:33,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:33,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:29:33,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:29:33,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357000284] [2020-10-09 15:29:33,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:33,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:33,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165704626] [2020-10-09 15:29:33,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:33,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:33,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:33,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:33,532 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:33,533 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 449 transitions, 1004 flow. Second operand 3 states. [2020-10-09 15:29:33,533 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:33,533 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:33,533 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:33,635 INFO L129 PetriNetUnfolder]: 45/503 cut-off events. [2020-10-09 15:29:33,635 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:33,652 INFO L80 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 503 events. 45/503 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1948 event pairs, 0 based on Foata normal form. 0/441 useless extension candidates. Maximal degree in co-relation 567. Up to 18 conditions per place. [2020-10-09 15:29:33,657 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 8 selfloop transitions, 1 changer transitions 0/447 dead transitions. [2020-10-09 15:29:33,657 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 447 transitions, 1017 flow [2020-10-09 15:29:33,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1348 transitions. [2020-10-09 15:29:33,659 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9439775910364145 [2020-10-09 15:29:33,659 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1348 transitions. [2020-10-09 15:29:33,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1348 transitions. [2020-10-09 15:29:33,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:33,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1348 transitions. [2020-10-09 15:29:33,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:33,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:33,660 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:33,661 INFO L185 Difference]: Start difference. First operand has 447 places, 449 transitions, 1004 flow. Second operand 3 states and 1348 transitions. [2020-10-09 15:29:33,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 447 transitions, 1017 flow [2020-10-09 15:29:33,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 447 transitions, 1016 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:33,665 INFO L241 Difference]: Finished difference. Result has 446 places, 447 transitions, 1000 flow [2020-10-09 15:29:33,665 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1000, PETRI_PLACES=446, PETRI_TRANSITIONS=447} [2020-10-09 15:29:33,665 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 4 predicate places. [2020-10-09 15:29:33,665 INFO L481 AbstractCegarLoop]: Abstraction has has 446 places, 447 transitions, 1000 flow [2020-10-09 15:29:33,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:33,665 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:33,665 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:29:33,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 338 mathsat -unsat_core_generation=3 [2020-10-09 15:29:33,866 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:33,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:33,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1876692804, now seen corresponding path program 1 times [2020-10-09 15:29:33,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:33,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611109132] [2020-10-09 15:29:33,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 339 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 339 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:34,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:34,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:29:34,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:29:34,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611109132] [2020-10-09 15:29:34,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:34,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:34,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368417012] [2020-10-09 15:29:34,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:34,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:34,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:34,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:34,134 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 476 [2020-10-09 15:29:34,135 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 447 transitions, 1000 flow. Second operand 3 states. [2020-10-09 15:29:34,135 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:34,135 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 476 [2020-10-09 15:29:34,135 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:34,239 INFO L129 PetriNetUnfolder]: 43/508 cut-off events. [2020-10-09 15:29:34,239 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:34,257 INFO L80 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 508 events. 43/508 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2003 event pairs, 0 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 570. Up to 18 conditions per place. [2020-10-09 15:29:34,262 INFO L132 encePairwiseOnDemand]: 473/476 looper letters, 5 selfloop transitions, 2 changer transitions 0/448 dead transitions. [2020-10-09 15:29:34,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 448 transitions, 1016 flow [2020-10-09 15:29:34,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1361 transitions. [2020-10-09 15:29:34,263 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9530812324929971 [2020-10-09 15:29:34,263 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1361 transitions. [2020-10-09 15:29:34,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1361 transitions. [2020-10-09 15:29:34,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:34,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1361 transitions. [2020-10-09 15:29:34,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:34,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:34,265 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:34,265 INFO L185 Difference]: Start difference. First operand has 446 places, 447 transitions, 1000 flow. Second operand 3 states and 1361 transitions. [2020-10-09 15:29:34,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 448 transitions, 1016 flow [2020-10-09 15:29:34,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 448 transitions, 1015 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:34,269 INFO L241 Difference]: Finished difference. Result has 449 places, 448 transitions, 1013 flow [2020-10-09 15:29:34,269 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1013, PETRI_PLACES=449, PETRI_TRANSITIONS=448} [2020-10-09 15:29:34,269 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 7 predicate places. [2020-10-09 15:29:34,269 INFO L481 AbstractCegarLoop]: Abstraction has has 449 places, 448 transitions, 1013 flow [2020-10-09 15:29:34,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:34,269 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:34,270 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:29:34,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 339 mathsat -unsat_core_generation=3 [2020-10-09 15:29:34,470 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:34,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:34,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1876693827, now seen corresponding path program 1 times [2020-10-09 15:29:34,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:34,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037713436] [2020-10-09 15:29:34,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 340 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 340 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:34,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:34,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:29:34,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:29:34,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037713436] [2020-10-09 15:29:34,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:34,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:34,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367810680] [2020-10-09 15:29:34,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:34,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:34,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:34,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:34,763 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:34,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 448 transitions, 1013 flow. Second operand 3 states. [2020-10-09 15:29:34,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:34,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:34,764 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:34,871 INFO L129 PetriNetUnfolder]: 43/509 cut-off events. [2020-10-09 15:29:34,872 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:29:34,890 INFO L80 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 509 events. 43/509 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2009 event pairs, 0 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 577. Up to 18 conditions per place. [2020-10-09 15:29:34,894 INFO L132 encePairwiseOnDemand]: 472/476 looper letters, 9 selfloop transitions, 3 changer transitions 0/449 dead transitions. [2020-10-09 15:29:34,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 449 transitions, 1039 flow [2020-10-09 15:29:34,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1351 transitions. [2020-10-09 15:29:34,896 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.946078431372549 [2020-10-09 15:29:34,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1351 transitions. [2020-10-09 15:29:34,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1351 transitions. [2020-10-09 15:29:34,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:34,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1351 transitions. [2020-10-09 15:29:34,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:34,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:34,897 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:34,897 INFO L185 Difference]: Start difference. First operand has 449 places, 448 transitions, 1013 flow. Second operand 3 states and 1351 transitions. [2020-10-09 15:29:34,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 449 transitions, 1039 flow [2020-10-09 15:29:34,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 449 transitions, 1037 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:34,902 INFO L241 Difference]: Finished difference. Result has 452 places, 449 transitions, 1029 flow [2020-10-09 15:29:34,902 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1029, PETRI_PLACES=452, PETRI_TRANSITIONS=449} [2020-10-09 15:29:34,902 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 10 predicate places. [2020-10-09 15:29:34,902 INFO L481 AbstractCegarLoop]: Abstraction has has 452 places, 449 transitions, 1029 flow [2020-10-09 15:29:34,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:34,902 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:34,902 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:29:35,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 340 mathsat -unsat_core_generation=3 [2020-10-09 15:29:35,103 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:35,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:35,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1875739492, now seen corresponding path program 1 times [2020-10-09 15:29:35,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:35,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003599650] [2020-10-09 15:29:35,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 341 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 341 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:35,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:35,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:35,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:29:35,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:29:35,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003599650] [2020-10-09 15:29:35,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:35,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:35,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763551907] [2020-10-09 15:29:35,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:35,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:35,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:35,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:35,383 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:35,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 449 transitions, 1029 flow. Second operand 3 states. [2020-10-09 15:29:35,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:35,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:35,384 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:35,489 INFO L129 PetriNetUnfolder]: 42/506 cut-off events. [2020-10-09 15:29:35,489 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:29:35,547 INFO L80 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 506 events. 42/506 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1992 event pairs, 0 based on Foata normal form. 2/449 useless extension candidates. Maximal degree in co-relation 576. Up to 18 conditions per place. [2020-10-09 15:29:35,550 INFO L132 encePairwiseOnDemand]: 473/476 looper letters, 9 selfloop transitions, 1 changer transitions 0/447 dead transitions. [2020-10-09 15:29:35,551 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 447 transitions, 1037 flow [2020-10-09 15:29:35,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:35,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:35,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1350 transitions. [2020-10-09 15:29:35,552 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9453781512605042 [2020-10-09 15:29:35,552 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1350 transitions. [2020-10-09 15:29:35,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1350 transitions. [2020-10-09 15:29:35,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:35,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1350 transitions. [2020-10-09 15:29:35,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:35,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:35,553 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:35,553 INFO L185 Difference]: Start difference. First operand has 452 places, 449 transitions, 1029 flow. Second operand 3 states and 1350 transitions. [2020-10-09 15:29:35,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 447 transitions, 1037 flow [2020-10-09 15:29:35,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 447 transitions, 1036 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:35,557 INFO L241 Difference]: Finished difference. Result has 453 places, 447 transitions, 1018 flow [2020-10-09 15:29:35,558 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1018, PETRI_PLACES=453, PETRI_TRANSITIONS=447} [2020-10-09 15:29:35,558 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 11 predicate places. [2020-10-09 15:29:35,558 INFO L481 AbstractCegarLoop]: Abstraction has has 453 places, 447 transitions, 1018 flow [2020-10-09 15:29:35,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:35,558 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:35,558 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:29:35,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 341 mathsat -unsat_core_generation=3 [2020-10-09 15:29:35,759 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:35,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:35,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1875740515, now seen corresponding path program 1 times [2020-10-09 15:29:35,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:35,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808024176] [2020-10-09 15:29:35,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 342 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 342 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:36,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:36,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:36,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:29:36,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:36,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:29:36,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808024176] [2020-10-09 15:29:36,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:36,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:36,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248342724] [2020-10-09 15:29:36,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:36,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:36,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:36,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:36,029 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 476 [2020-10-09 15:29:36,030 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 447 transitions, 1018 flow. Second operand 3 states. [2020-10-09 15:29:36,030 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:36,031 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 476 [2020-10-09 15:29:36,031 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:36,134 INFO L129 PetriNetUnfolder]: 42/503 cut-off events. [2020-10-09 15:29:36,135 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:29:36,152 INFO L80 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 503 events. 42/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1970 event pairs, 0 based on Foata normal form. 1/446 useless extension candidates. Maximal degree in co-relation 571. Up to 18 conditions per place. [2020-10-09 15:29:36,157 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 4 selfloop transitions, 1 changer transitions 0/444 dead transitions. [2020-10-09 15:29:36,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 444 transitions, 1017 flow [2020-10-09 15:29:36,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2020-10-09 15:29:36,158 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9537815126050421 [2020-10-09 15:29:36,158 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1362 transitions. [2020-10-09 15:29:36,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1362 transitions. [2020-10-09 15:29:36,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:36,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1362 transitions. [2020-10-09 15:29:36,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:36,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:36,160 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:36,160 INFO L185 Difference]: Start difference. First operand has 453 places, 447 transitions, 1018 flow. Second operand 3 states and 1362 transitions. [2020-10-09 15:29:36,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 444 transitions, 1017 flow [2020-10-09 15:29:36,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 444 transitions, 1012 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:36,164 INFO L241 Difference]: Finished difference. Result has 450 places, 444 transitions, 1004 flow [2020-10-09 15:29:36,164 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1004, PETRI_PLACES=450, PETRI_TRANSITIONS=444} [2020-10-09 15:29:36,164 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 8 predicate places. [2020-10-09 15:29:36,164 INFO L481 AbstractCegarLoop]: Abstraction has has 450 places, 444 transitions, 1004 flow [2020-10-09 15:29:36,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:36,165 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:36,165 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:29:36,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 342 mathsat -unsat_core_generation=3 [2020-10-09 15:29:36,365 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:36,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:36,366 INFO L82 PathProgramCache]: Analyzing trace with hash 951179445, now seen corresponding path program 1 times [2020-10-09 15:29:36,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:36,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575758807] [2020-10-09 15:29:36,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 343 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 343 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:36,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:36,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:36,624 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:29:36,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:29:36,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575758807] [2020-10-09 15:29:36,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:36,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:36,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311599627] [2020-10-09 15:29:36,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:36,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:36,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:36,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:36,648 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 476 [2020-10-09 15:29:36,649 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 444 transitions, 1004 flow. Second operand 3 states. [2020-10-09 15:29:36,649 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:36,649 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 476 [2020-10-09 15:29:36,649 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:36,759 INFO L129 PetriNetUnfolder]: 41/510 cut-off events. [2020-10-09 15:29:36,760 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:36,780 INFO L80 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 510 events. 41/510 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2027 event pairs, 0 based on Foata normal form. 1/452 useless extension candidates. Maximal degree in co-relation 579. Up to 18 conditions per place. [2020-10-09 15:29:36,784 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 4 selfloop transitions, 1 changer transitions 0/444 dead transitions. [2020-10-09 15:29:36,785 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 444 transitions, 1014 flow [2020-10-09 15:29:36,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:36,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2020-10-09 15:29:36,786 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9537815126050421 [2020-10-09 15:29:36,786 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1362 transitions. [2020-10-09 15:29:36,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1362 transitions. [2020-10-09 15:29:36,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:36,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1362 transitions. [2020-10-09 15:29:36,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:36,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:36,788 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:36,788 INFO L185 Difference]: Start difference. First operand has 450 places, 444 transitions, 1004 flow. Second operand 3 states and 1362 transitions. [2020-10-09 15:29:36,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 444 transitions, 1014 flow [2020-10-09 15:29:36,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 444 transitions, 1013 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:36,792 INFO L241 Difference]: Finished difference. Result has 452 places, 444 transitions, 1008 flow [2020-10-09 15:29:36,793 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1003, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1008, PETRI_PLACES=452, PETRI_TRANSITIONS=444} [2020-10-09 15:29:36,793 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 10 predicate places. [2020-10-09 15:29:36,793 INFO L481 AbstractCegarLoop]: Abstraction has has 452 places, 444 transitions, 1008 flow [2020-10-09 15:29:36,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:36,793 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:36,793 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:29:36,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 343 mathsat -unsat_core_generation=3 [2020-10-09 15:29:36,994 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:36,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:36,994 INFO L82 PathProgramCache]: Analyzing trace with hash 951180468, now seen corresponding path program 1 times [2020-10-09 15:29:36,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:36,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644342391] [2020-10-09 15:29:36,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 344 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 344 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:37,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:37,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:37,255 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:29:37,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:29:37,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644342391] [2020-10-09 15:29:37,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:37,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:37,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170298567] [2020-10-09 15:29:37,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:37,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:37,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:37,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:37,293 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:37,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 444 transitions, 1008 flow. Second operand 3 states. [2020-10-09 15:29:37,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:37,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:37,294 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:37,415 INFO L129 PetriNetUnfolder]: 39/512 cut-off events. [2020-10-09 15:29:37,415 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:29:37,434 INFO L80 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 512 events. 39/512 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2058 event pairs, 0 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 590. Up to 18 conditions per place. [2020-10-09 15:29:37,439 INFO L132 encePairwiseOnDemand]: 472/476 looper letters, 9 selfloop transitions, 3 changer transitions 0/445 dead transitions. [2020-10-09 15:29:37,439 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 445 transitions, 1034 flow [2020-10-09 15:29:37,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1351 transitions. [2020-10-09 15:29:37,440 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.946078431372549 [2020-10-09 15:29:37,441 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1351 transitions. [2020-10-09 15:29:37,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1351 transitions. [2020-10-09 15:29:37,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:37,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1351 transitions. [2020-10-09 15:29:37,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:37,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:37,442 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:37,442 INFO L185 Difference]: Start difference. First operand has 452 places, 444 transitions, 1008 flow. Second operand 3 states and 1351 transitions. [2020-10-09 15:29:37,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 445 transitions, 1034 flow [2020-10-09 15:29:37,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 445 transitions, 1033 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:37,447 INFO L241 Difference]: Finished difference. Result has 455 places, 445 transitions, 1025 flow [2020-10-09 15:29:37,447 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1025, PETRI_PLACES=455, PETRI_TRANSITIONS=445} [2020-10-09 15:29:37,447 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 13 predicate places. [2020-10-09 15:29:37,447 INFO L481 AbstractCegarLoop]: Abstraction has has 455 places, 445 transitions, 1025 flow [2020-10-09 15:29:37,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:37,448 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:37,448 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:29:37,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 344 mathsat -unsat_core_generation=3 [2020-10-09 15:29:37,648 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:37,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:37,649 INFO L82 PathProgramCache]: Analyzing trace with hash 950227156, now seen corresponding path program 1 times [2020-10-09 15:29:37,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:37,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402103875] [2020-10-09 15:29:37,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 345 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 345 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:37,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:37,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:37,909 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:29:37,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:37,911 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:29:37,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402103875] [2020-10-09 15:29:37,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:37,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:37,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840259793] [2020-10-09 15:29:37,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:37,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:37,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:37,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:37,922 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 476 [2020-10-09 15:29:37,923 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 445 transitions, 1025 flow. Second operand 3 states. [2020-10-09 15:29:37,923 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:37,923 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 476 [2020-10-09 15:29:37,923 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:38,037 INFO L129 PetriNetUnfolder]: 39/505 cut-off events. [2020-10-09 15:29:38,037 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:29:38,057 INFO L80 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 505 events. 39/505 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2001 event pairs, 0 based on Foata normal form. 1/451 useless extension candidates. Maximal degree in co-relation 575. Up to 18 conditions per place. [2020-10-09 15:29:38,062 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 5 selfloop transitions, 1 changer transitions 0/443 dead transitions. [2020-10-09 15:29:38,062 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 443 transitions, 1027 flow [2020-10-09 15:29:38,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:38,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2020-10-09 15:29:38,063 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2020-10-09 15:29:38,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2020-10-09 15:29:38,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2020-10-09 15:29:38,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:38,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2020-10-09 15:29:38,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:38,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:38,065 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:38,065 INFO L185 Difference]: Start difference. First operand has 455 places, 445 transitions, 1025 flow. Second operand 3 states and 1360 transitions. [2020-10-09 15:29:38,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 443 transitions, 1027 flow [2020-10-09 15:29:38,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 443 transitions, 1019 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:38,069 INFO L241 Difference]: Finished difference. Result has 455 places, 443 transitions, 1012 flow [2020-10-09 15:29:38,070 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1012, PETRI_PLACES=455, PETRI_TRANSITIONS=443} [2020-10-09 15:29:38,070 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 13 predicate places. [2020-10-09 15:29:38,070 INFO L481 AbstractCegarLoop]: Abstraction has has 455 places, 443 transitions, 1012 flow [2020-10-09 15:29:38,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:38,070 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:38,070 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:29:38,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 345 mathsat -unsat_core_generation=3 [2020-10-09 15:29:38,271 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:38,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:38,271 INFO L82 PathProgramCache]: Analyzing trace with hash 950226133, now seen corresponding path program 1 times [2020-10-09 15:29:38,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:38,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205860993] [2020-10-09 15:29:38,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 346 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 346 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:38,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:38,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:29:38,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:29:38,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205860993] [2020-10-09 15:29:38,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:38,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:38,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720842887] [2020-10-09 15:29:38,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:38,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:38,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:38,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:38,580 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:38,581 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 443 transitions, 1012 flow. Second operand 3 states. [2020-10-09 15:29:38,581 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:38,581 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:38,581 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:38,697 INFO L129 PetriNetUnfolder]: 39/503 cut-off events. [2020-10-09 15:29:38,697 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:29:38,717 INFO L80 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 503 events. 39/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1984 event pairs, 0 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 580. Up to 18 conditions per place. [2020-10-09 15:29:38,722 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 8 selfloop transitions, 1 changer transitions 0/441 dead transitions. [2020-10-09 15:29:38,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 441 transitions, 1025 flow [2020-10-09 15:29:38,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:38,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1348 transitions. [2020-10-09 15:29:38,723 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9439775910364145 [2020-10-09 15:29:38,724 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1348 transitions. [2020-10-09 15:29:38,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1348 transitions. [2020-10-09 15:29:38,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:38,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1348 transitions. [2020-10-09 15:29:38,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:38,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:38,725 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:38,725 INFO L185 Difference]: Start difference. First operand has 455 places, 443 transitions, 1012 flow. Second operand 3 states and 1348 transitions. [2020-10-09 15:29:38,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 441 transitions, 1025 flow [2020-10-09 15:29:38,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 441 transitions, 1024 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:38,729 INFO L241 Difference]: Finished difference. Result has 454 places, 441 transitions, 1008 flow [2020-10-09 15:29:38,730 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1008, PETRI_PLACES=454, PETRI_TRANSITIONS=441} [2020-10-09 15:29:38,730 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 12 predicate places. [2020-10-09 15:29:38,730 INFO L481 AbstractCegarLoop]: Abstraction has has 454 places, 441 transitions, 1008 flow [2020-10-09 15:29:38,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:38,730 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:38,730 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:38,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 346 mathsat -unsat_core_generation=3 [2020-10-09 15:29:38,931 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:38,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:38,931 INFO L82 PathProgramCache]: Analyzing trace with hash -291689267, now seen corresponding path program 1 times [2020-10-09 15:29:38,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:38,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024490967] [2020-10-09 15:29:38,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 347 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 347 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:39,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:39,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:39,191 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:29:39,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:29:39,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024490967] [2020-10-09 15:29:39,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:39,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:39,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353904665] [2020-10-09 15:29:39,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:39,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:39,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:39,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:39,212 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:39,213 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 441 transitions, 1008 flow. Second operand 3 states. [2020-10-09 15:29:39,213 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:39,213 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:39,213 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:39,327 INFO L129 PetriNetUnfolder]: 38/511 cut-off events. [2020-10-09 15:29:39,328 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:39,346 INFO L80 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 511 events. 38/511 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2056 event pairs, 0 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 592. Up to 18 conditions per place. [2020-10-09 15:29:39,351 INFO L132 encePairwiseOnDemand]: 471/476 looper letters, 10 selfloop transitions, 3 changer transitions 0/443 dead transitions. [2020-10-09 15:29:39,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 443 transitions, 1038 flow [2020-10-09 15:29:39,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1353 transitions. [2020-10-09 15:29:39,352 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474789915966386 [2020-10-09 15:29:39,352 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1353 transitions. [2020-10-09 15:29:39,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1353 transitions. [2020-10-09 15:29:39,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:39,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1353 transitions. [2020-10-09 15:29:39,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:39,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:39,354 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:39,354 INFO L185 Difference]: Start difference. First operand has 454 places, 441 transitions, 1008 flow. Second operand 3 states and 1353 transitions. [2020-10-09 15:29:39,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 443 transitions, 1038 flow [2020-10-09 15:29:39,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 443 transitions, 1037 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:39,358 INFO L241 Difference]: Finished difference. Result has 457 places, 443 transitions, 1031 flow [2020-10-09 15:29:39,358 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1031, PETRI_PLACES=457, PETRI_TRANSITIONS=443} [2020-10-09 15:29:39,358 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 15 predicate places. [2020-10-09 15:29:39,359 INFO L481 AbstractCegarLoop]: Abstraction has has 457 places, 443 transitions, 1031 flow [2020-10-09 15:29:39,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:39,359 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:39,359 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:39,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 347 mathsat -unsat_core_generation=3 [2020-10-09 15:29:39,559 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:39,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:39,560 INFO L82 PathProgramCache]: Analyzing trace with hash -291690290, now seen corresponding path program 1 times [2020-10-09 15:29:39,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:39,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067376534] [2020-10-09 15:29:39,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 348 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 348 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:39,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:39,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:39,822 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:29:39,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:39,825 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:29:39,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067376534] [2020-10-09 15:29:39,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:39,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:39,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427678957] [2020-10-09 15:29:39,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:39,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:39,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:39,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:39,837 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 476 [2020-10-09 15:29:39,838 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 443 transitions, 1031 flow. Second operand 3 states. [2020-10-09 15:29:39,838 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:39,839 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 476 [2020-10-09 15:29:39,839 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:39,949 INFO L129 PetriNetUnfolder]: 36/512 cut-off events. [2020-10-09 15:29:39,949 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:29:39,968 INFO L80 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 512 events. 36/512 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2078 event pairs, 0 based on Foata normal form. 1/461 useless extension candidates. Maximal degree in co-relation 590. Up to 18 conditions per place. [2020-10-09 15:29:39,972 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 4 selfloop transitions, 1 changer transitions 0/442 dead transitions. [2020-10-09 15:29:39,972 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 442 transitions, 1037 flow [2020-10-09 15:29:39,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:39,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2020-10-09 15:29:39,973 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9537815126050421 [2020-10-09 15:29:39,973 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1362 transitions. [2020-10-09 15:29:39,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1362 transitions. [2020-10-09 15:29:39,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:39,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1362 transitions. [2020-10-09 15:29:39,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:39,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:39,975 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:39,975 INFO L185 Difference]: Start difference. First operand has 457 places, 443 transitions, 1031 flow. Second operand 3 states and 1362 transitions. [2020-10-09 15:29:39,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 442 transitions, 1037 flow [2020-10-09 15:29:39,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 442 transitions, 1032 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:39,979 INFO L241 Difference]: Finished difference. Result has 459 places, 442 transitions, 1027 flow [2020-10-09 15:29:39,979 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1027, PETRI_PLACES=459, PETRI_TRANSITIONS=442} [2020-10-09 15:29:39,979 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 17 predicate places. [2020-10-09 15:29:39,980 INFO L481 AbstractCegarLoop]: Abstraction has has 459 places, 442 transitions, 1027 flow [2020-10-09 15:29:39,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:39,980 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:39,980 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:40,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 348 mathsat -unsat_core_generation=3 [2020-10-09 15:29:40,181 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:40,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:40,181 INFO L82 PathProgramCache]: Analyzing trace with hash -292642579, now seen corresponding path program 1 times [2020-10-09 15:29:40,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:40,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761762704] [2020-10-09 15:29:40,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 349 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 349 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:40,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:40,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:29:40,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:29:40,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761762704] [2020-10-09 15:29:40,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:40,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:40,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714344123] [2020-10-09 15:29:40,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:40,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:40,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:40,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:40,459 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 476 [2020-10-09 15:29:40,459 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 442 transitions, 1027 flow. Second operand 3 states. [2020-10-09 15:29:40,460 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:40,460 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 476 [2020-10-09 15:29:40,460 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:40,569 INFO L129 PetriNetUnfolder]: 36/505 cut-off events. [2020-10-09 15:29:40,569 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:29:40,586 INFO L80 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 505 events. 36/505 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2019 event pairs, 0 based on Foata normal form. 1/454 useless extension candidates. Maximal degree in co-relation 586. Up to 18 conditions per place. [2020-10-09 15:29:40,590 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 5 selfloop transitions, 1 changer transitions 0/440 dead transitions. [2020-10-09 15:29:40,590 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 440 transitions, 1030 flow [2020-10-09 15:29:40,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:40,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2020-10-09 15:29:40,592 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2020-10-09 15:29:40,592 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2020-10-09 15:29:40,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2020-10-09 15:29:40,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:40,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2020-10-09 15:29:40,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:40,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:40,593 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:40,593 INFO L185 Difference]: Start difference. First operand has 459 places, 442 transitions, 1027 flow. Second operand 3 states and 1360 transitions. [2020-10-09 15:29:40,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 440 transitions, 1030 flow [2020-10-09 15:29:40,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 440 transitions, 1023 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:40,598 INFO L241 Difference]: Finished difference. Result has 459 places, 440 transitions, 1016 flow [2020-10-09 15:29:40,598 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1016, PETRI_PLACES=459, PETRI_TRANSITIONS=440} [2020-10-09 15:29:40,598 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 17 predicate places. [2020-10-09 15:29:40,598 INFO L481 AbstractCegarLoop]: Abstraction has has 459 places, 440 transitions, 1016 flow [2020-10-09 15:29:40,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:40,598 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:40,599 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:40,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 349 mathsat -unsat_core_generation=3 [2020-10-09 15:29:40,799 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:40,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:40,800 INFO L82 PathProgramCache]: Analyzing trace with hash -292643602, now seen corresponding path program 1 times [2020-10-09 15:29:40,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:40,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085736136] [2020-10-09 15:29:40,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 350 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 350 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:41,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:41,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:29:41,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:29:41,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085736136] [2020-10-09 15:29:41,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:41,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:41,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556320647] [2020-10-09 15:29:41,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:41,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:41,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:41,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:41,089 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:41,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 440 transitions, 1016 flow. Second operand 3 states. [2020-10-09 15:29:41,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:41,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:41,091 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:41,199 INFO L129 PetriNetUnfolder]: 36/503 cut-off events. [2020-10-09 15:29:41,199 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:29:41,217 INFO L80 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 503 events. 36/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2001 event pairs, 0 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 586. Up to 18 conditions per place. [2020-10-09 15:29:41,221 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 8 selfloop transitions, 1 changer transitions 0/438 dead transitions. [2020-10-09 15:29:41,221 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 438 transitions, 1029 flow [2020-10-09 15:29:41,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1348 transitions. [2020-10-09 15:29:41,222 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9439775910364145 [2020-10-09 15:29:41,222 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1348 transitions. [2020-10-09 15:29:41,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1348 transitions. [2020-10-09 15:29:41,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:41,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1348 transitions. [2020-10-09 15:29:41,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:41,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:41,224 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:41,224 INFO L185 Difference]: Start difference. First operand has 459 places, 440 transitions, 1016 flow. Second operand 3 states and 1348 transitions. [2020-10-09 15:29:41,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 438 transitions, 1029 flow [2020-10-09 15:29:41,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 438 transitions, 1028 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:41,277 INFO L241 Difference]: Finished difference. Result has 458 places, 438 transitions, 1012 flow [2020-10-09 15:29:41,277 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1010, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1012, PETRI_PLACES=458, PETRI_TRANSITIONS=438} [2020-10-09 15:29:41,277 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 16 predicate places. [2020-10-09 15:29:41,277 INFO L481 AbstractCegarLoop]: Abstraction has has 458 places, 438 transitions, 1012 flow [2020-10-09 15:29:41,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:41,277 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:41,277 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:41,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 350 mathsat -unsat_core_generation=3 [2020-10-09 15:29:41,478 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:41,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:41,479 INFO L82 PathProgramCache]: Analyzing trace with hash 594786919, now seen corresponding path program 1 times [2020-10-09 15:29:41,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:41,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049297134] [2020-10-09 15:29:41,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 351 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 351 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:41,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:41,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:29:41,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:29:41,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049297134] [2020-10-09 15:29:41,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:41,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:41,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197058791] [2020-10-09 15:29:41,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:41,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:41,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:41,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:41,771 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:41,772 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 438 transitions, 1012 flow. Second operand 3 states. [2020-10-09 15:29:41,772 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:41,772 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:41,773 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:41,888 INFO L129 PetriNetUnfolder]: 35/511 cut-off events. [2020-10-09 15:29:41,888 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:41,907 INFO L80 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 511 events. 35/511 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2072 event pairs, 0 based on Foata normal form. 0/458 useless extension candidates. Maximal degree in co-relation 598. Up to 18 conditions per place. [2020-10-09 15:29:41,911 INFO L132 encePairwiseOnDemand]: 471/476 looper letters, 10 selfloop transitions, 3 changer transitions 0/440 dead transitions. [2020-10-09 15:29:41,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 440 transitions, 1042 flow [2020-10-09 15:29:41,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:41,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1353 transitions. [2020-10-09 15:29:41,912 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474789915966386 [2020-10-09 15:29:41,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1353 transitions. [2020-10-09 15:29:41,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1353 transitions. [2020-10-09 15:29:41,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:41,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1353 transitions. [2020-10-09 15:29:41,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:41,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:41,914 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:41,914 INFO L185 Difference]: Start difference. First operand has 458 places, 438 transitions, 1012 flow. Second operand 3 states and 1353 transitions. [2020-10-09 15:29:41,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 440 transitions, 1042 flow [2020-10-09 15:29:41,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 440 transitions, 1041 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:41,918 INFO L241 Difference]: Finished difference. Result has 461 places, 440 transitions, 1035 flow [2020-10-09 15:29:41,918 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1035, PETRI_PLACES=461, PETRI_TRANSITIONS=440} [2020-10-09 15:29:41,919 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 19 predicate places. [2020-10-09 15:29:41,919 INFO L481 AbstractCegarLoop]: Abstraction has has 461 places, 440 transitions, 1035 flow [2020-10-09 15:29:41,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:41,919 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:41,919 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:42,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 351 mathsat -unsat_core_generation=3 [2020-10-09 15:29:42,120 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:42,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:42,120 INFO L82 PathProgramCache]: Analyzing trace with hash 594785896, now seen corresponding path program 1 times [2020-10-09 15:29:42,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:42,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218613465] [2020-10-09 15:29:42,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 352 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 352 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:42,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:42,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:42,380 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:29:42,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:29:42,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218613465] [2020-10-09 15:29:42,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:42,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:42,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753335295] [2020-10-09 15:29:42,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:42,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:42,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:42,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:42,396 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 476 [2020-10-09 15:29:42,397 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 440 transitions, 1035 flow. Second operand 3 states. [2020-10-09 15:29:42,397 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:42,397 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 476 [2020-10-09 15:29:42,397 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:42,525 INFO L129 PetriNetUnfolder]: 33/512 cut-off events. [2020-10-09 15:29:42,525 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:29:42,546 INFO L80 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 512 events. 33/512 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2094 event pairs, 0 based on Foata normal form. 1/464 useless extension candidates. Maximal degree in co-relation 596. Up to 18 conditions per place. [2020-10-09 15:29:42,551 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 4 selfloop transitions, 1 changer transitions 0/439 dead transitions. [2020-10-09 15:29:42,551 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 439 transitions, 1041 flow [2020-10-09 15:29:42,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2020-10-09 15:29:42,552 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9537815126050421 [2020-10-09 15:29:42,552 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1362 transitions. [2020-10-09 15:29:42,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1362 transitions. [2020-10-09 15:29:42,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:42,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1362 transitions. [2020-10-09 15:29:42,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:42,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:42,554 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:42,554 INFO L185 Difference]: Start difference. First operand has 461 places, 440 transitions, 1035 flow. Second operand 3 states and 1362 transitions. [2020-10-09 15:29:42,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 439 transitions, 1041 flow [2020-10-09 15:29:42,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 439 transitions, 1036 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:42,559 INFO L241 Difference]: Finished difference. Result has 463 places, 439 transitions, 1031 flow [2020-10-09 15:29:42,559 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1031, PETRI_PLACES=463, PETRI_TRANSITIONS=439} [2020-10-09 15:29:42,560 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 21 predicate places. [2020-10-09 15:29:42,560 INFO L481 AbstractCegarLoop]: Abstraction has has 463 places, 439 transitions, 1031 flow [2020-10-09 15:29:42,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:42,560 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:42,560 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:42,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 352 mathsat -unsat_core_generation=3 [2020-10-09 15:29:42,761 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:42,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:42,761 INFO L82 PathProgramCache]: Analyzing trace with hash 593833607, now seen corresponding path program 1 times [2020-10-09 15:29:42,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:42,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179602876] [2020-10-09 15:29:42,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 353 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 353 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:43,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:43,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:29:43,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:29:43,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179602876] [2020-10-09 15:29:43,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:43,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:43,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844909545] [2020-10-09 15:29:43,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:43,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:43,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:43,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:43,047 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 476 [2020-10-09 15:29:43,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 439 transitions, 1031 flow. Second operand 3 states. [2020-10-09 15:29:43,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:43,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 476 [2020-10-09 15:29:43,048 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:43,165 INFO L129 PetriNetUnfolder]: 33/505 cut-off events. [2020-10-09 15:29:43,165 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:29:43,185 INFO L80 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 505 events. 33/505 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2036 event pairs, 0 based on Foata normal form. 1/457 useless extension candidates. Maximal degree in co-relation 592. Up to 18 conditions per place. [2020-10-09 15:29:43,188 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 5 selfloop transitions, 1 changer transitions 0/437 dead transitions. [2020-10-09 15:29:43,189 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 437 transitions, 1034 flow [2020-10-09 15:29:43,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:43,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:43,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2020-10-09 15:29:43,190 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2020-10-09 15:29:43,190 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2020-10-09 15:29:43,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2020-10-09 15:29:43,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:43,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2020-10-09 15:29:43,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:43,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:43,191 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:43,192 INFO L185 Difference]: Start difference. First operand has 463 places, 439 transitions, 1031 flow. Second operand 3 states and 1360 transitions. [2020-10-09 15:29:43,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 437 transitions, 1034 flow [2020-10-09 15:29:43,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 437 transitions, 1027 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:43,196 INFO L241 Difference]: Finished difference. Result has 463 places, 437 transitions, 1020 flow [2020-10-09 15:29:43,196 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1020, PETRI_PLACES=463, PETRI_TRANSITIONS=437} [2020-10-09 15:29:43,197 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 21 predicate places. [2020-10-09 15:29:43,197 INFO L481 AbstractCegarLoop]: Abstraction has has 463 places, 437 transitions, 1020 flow [2020-10-09 15:29:43,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:43,197 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:43,197 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:43,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 353 mathsat -unsat_core_generation=3 [2020-10-09 15:29:43,398 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:43,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:43,398 INFO L82 PathProgramCache]: Analyzing trace with hash 593832584, now seen corresponding path program 1 times [2020-10-09 15:29:43,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:43,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969544866] [2020-10-09 15:29:43,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 354 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 354 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:43,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:43,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:29:43,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:29:43,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969544866] [2020-10-09 15:29:43,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:43,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:43,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759814648] [2020-10-09 15:29:43,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:43,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:43,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:43,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:43,693 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:43,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 437 transitions, 1020 flow. Second operand 3 states. [2020-10-09 15:29:43,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:43,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:43,694 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:43,812 INFO L129 PetriNetUnfolder]: 33/503 cut-off events. [2020-10-09 15:29:43,812 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:29:43,831 INFO L80 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 503 events. 33/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2022 event pairs, 0 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 592. Up to 18 conditions per place. [2020-10-09 15:29:43,835 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 8 selfloop transitions, 1 changer transitions 0/435 dead transitions. [2020-10-09 15:29:43,835 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 435 transitions, 1033 flow [2020-10-09 15:29:43,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1348 transitions. [2020-10-09 15:29:43,836 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9439775910364145 [2020-10-09 15:29:43,837 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1348 transitions. [2020-10-09 15:29:43,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1348 transitions. [2020-10-09 15:29:43,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:43,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1348 transitions. [2020-10-09 15:29:43,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:43,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:43,838 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:43,838 INFO L185 Difference]: Start difference. First operand has 463 places, 437 transitions, 1020 flow. Second operand 3 states and 1348 transitions. [2020-10-09 15:29:43,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 435 transitions, 1033 flow [2020-10-09 15:29:43,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 435 transitions, 1032 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:43,843 INFO L241 Difference]: Finished difference. Result has 462 places, 435 transitions, 1016 flow [2020-10-09 15:29:43,843 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1016, PETRI_PLACES=462, PETRI_TRANSITIONS=435} [2020-10-09 15:29:43,843 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 20 predicate places. [2020-10-09 15:29:43,843 INFO L481 AbstractCegarLoop]: Abstraction has has 462 places, 435 transitions, 1016 flow [2020-10-09 15:29:43,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:43,843 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:43,844 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:44,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 354 mathsat -unsat_core_generation=3 [2020-10-09 15:29:44,044 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:44,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:44,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1104883934, now seen corresponding path program 1 times [2020-10-09 15:29:44,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:44,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204639897] [2020-10-09 15:29:44,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 355 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 355 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:44,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:44,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:44,312 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:29:44,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:29:44,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204639897] [2020-10-09 15:29:44,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:44,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:44,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645782743] [2020-10-09 15:29:44,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:44,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:44,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:44,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:44,352 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 476 [2020-10-09 15:29:44,353 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 435 transitions, 1016 flow. Second operand 3 states. [2020-10-09 15:29:44,353 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:44,353 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 476 [2020-10-09 15:29:44,353 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:44,470 INFO L129 PetriNetUnfolder]: 31/508 cut-off events. [2020-10-09 15:29:44,471 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:44,490 INFO L80 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 508 events. 31/508 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2073 event pairs, 0 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 595. Up to 18 conditions per place. [2020-10-09 15:29:44,493 INFO L132 encePairwiseOnDemand]: 473/476 looper letters, 5 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2020-10-09 15:29:44,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 436 transitions, 1032 flow [2020-10-09 15:29:44,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1361 transitions. [2020-10-09 15:29:44,495 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9530812324929971 [2020-10-09 15:29:44,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1361 transitions. [2020-10-09 15:29:44,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1361 transitions. [2020-10-09 15:29:44,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:44,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1361 transitions. [2020-10-09 15:29:44,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:44,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:44,496 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:44,496 INFO L185 Difference]: Start difference. First operand has 462 places, 435 transitions, 1016 flow. Second operand 3 states and 1361 transitions. [2020-10-09 15:29:44,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 436 transitions, 1032 flow [2020-10-09 15:29:44,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 436 transitions, 1031 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:44,501 INFO L241 Difference]: Finished difference. Result has 465 places, 436 transitions, 1029 flow [2020-10-09 15:29:44,501 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1029, PETRI_PLACES=465, PETRI_TRANSITIONS=436} [2020-10-09 15:29:44,501 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 23 predicate places. [2020-10-09 15:29:44,501 INFO L481 AbstractCegarLoop]: Abstraction has has 465 places, 436 transitions, 1029 flow [2020-10-09 15:29:44,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:44,502 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:44,502 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:44,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 355 mathsat -unsat_core_generation=3 [2020-10-09 15:29:44,702 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:44,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:44,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1104884957, now seen corresponding path program 1 times [2020-10-09 15:29:44,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:44,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009989494] [2020-10-09 15:29:44,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 356 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 356 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:44,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:44,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:29:44,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:29:44,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009989494] [2020-10-09 15:29:44,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:44,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:44,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942499098] [2020-10-09 15:29:44,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:44,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:44,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:44,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:45,004 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:45,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 436 transitions, 1029 flow. Second operand 3 states. [2020-10-09 15:29:45,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:45,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:45,005 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:45,121 INFO L129 PetriNetUnfolder]: 31/509 cut-off events. [2020-10-09 15:29:45,121 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:29:45,140 INFO L80 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 509 events. 31/509 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2078 event pairs, 0 based on Foata normal form. 0/460 useless extension candidates. Maximal degree in co-relation 603. Up to 18 conditions per place. [2020-10-09 15:29:45,143 INFO L132 encePairwiseOnDemand]: 472/476 looper letters, 9 selfloop transitions, 3 changer transitions 0/437 dead transitions. [2020-10-09 15:29:45,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 437 transitions, 1055 flow [2020-10-09 15:29:45,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1351 transitions. [2020-10-09 15:29:45,145 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.946078431372549 [2020-10-09 15:29:45,145 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1351 transitions. [2020-10-09 15:29:45,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1351 transitions. [2020-10-09 15:29:45,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:45,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1351 transitions. [2020-10-09 15:29:45,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:45,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:45,147 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:45,147 INFO L185 Difference]: Start difference. First operand has 465 places, 436 transitions, 1029 flow. Second operand 3 states and 1351 transitions. [2020-10-09 15:29:45,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 437 transitions, 1055 flow [2020-10-09 15:29:45,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 437 transitions, 1053 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:45,151 INFO L241 Difference]: Finished difference. Result has 468 places, 437 transitions, 1045 flow [2020-10-09 15:29:45,151 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=468, PETRI_TRANSITIONS=437} [2020-10-09 15:29:45,151 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 26 predicate places. [2020-10-09 15:29:45,151 INFO L481 AbstractCegarLoop]: Abstraction has has 468 places, 437 transitions, 1045 flow [2020-10-09 15:29:45,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:45,151 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:45,152 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:45,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 356 mathsat -unsat_core_generation=3 [2020-10-09 15:29:45,352 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:45,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:45,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1103930622, now seen corresponding path program 1 times [2020-10-09 15:29:45,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:45,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88567584] [2020-10-09 15:29:45,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 357 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 357 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:45,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:45,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:45,615 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:29:45,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:29:45,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88567584] [2020-10-09 15:29:45,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:45,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:45,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108436945] [2020-10-09 15:29:45,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:45,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:45,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:45,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:45,636 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:45,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 437 transitions, 1045 flow. Second operand 3 states. [2020-10-09 15:29:45,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:45,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:45,637 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:45,753 INFO L129 PetriNetUnfolder]: 30/506 cut-off events. [2020-10-09 15:29:45,754 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:29:45,772 INFO L80 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 506 events. 30/506 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2061 event pairs, 0 based on Foata normal form. 2/461 useless extension candidates. Maximal degree in co-relation 602. Up to 18 conditions per place. [2020-10-09 15:29:45,775 INFO L132 encePairwiseOnDemand]: 473/476 looper letters, 9 selfloop transitions, 1 changer transitions 0/435 dead transitions. [2020-10-09 15:29:45,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 435 transitions, 1053 flow [2020-10-09 15:29:45,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1350 transitions. [2020-10-09 15:29:45,777 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9453781512605042 [2020-10-09 15:29:45,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1350 transitions. [2020-10-09 15:29:45,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1350 transitions. [2020-10-09 15:29:45,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:45,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1350 transitions. [2020-10-09 15:29:45,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:45,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:45,778 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:45,778 INFO L185 Difference]: Start difference. First operand has 468 places, 437 transitions, 1045 flow. Second operand 3 states and 1350 transitions. [2020-10-09 15:29:45,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 435 transitions, 1053 flow [2020-10-09 15:29:45,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 435 transitions, 1052 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:45,783 INFO L241 Difference]: Finished difference. Result has 469 places, 435 transitions, 1034 flow [2020-10-09 15:29:45,783 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1034, PETRI_PLACES=469, PETRI_TRANSITIONS=435} [2020-10-09 15:29:45,783 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 27 predicate places. [2020-10-09 15:29:45,783 INFO L481 AbstractCegarLoop]: Abstraction has has 469 places, 435 transitions, 1034 flow [2020-10-09 15:29:45,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:45,783 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:45,783 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:45,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 357 mathsat -unsat_core_generation=3 [2020-10-09 15:29:45,984 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:45,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:45,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1103931645, now seen corresponding path program 1 times [2020-10-09 15:29:45,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:45,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788093308] [2020-10-09 15:29:45,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 358 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 358 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:46,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:46,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:29:46,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:29:46,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788093308] [2020-10-09 15:29:46,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:46,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:46,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787832929] [2020-10-09 15:29:46,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:46,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:46,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:46,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:46,265 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 476 [2020-10-09 15:29:46,266 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 435 transitions, 1034 flow. Second operand 3 states. [2020-10-09 15:29:46,266 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:46,266 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 476 [2020-10-09 15:29:46,266 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:46,380 INFO L129 PetriNetUnfolder]: 30/503 cut-off events. [2020-10-09 15:29:46,380 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:29:46,399 INFO L80 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 503 events. 30/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2037 event pairs, 0 based on Foata normal form. 1/458 useless extension candidates. Maximal degree in co-relation 596. Up to 18 conditions per place. [2020-10-09 15:29:46,402 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 4 selfloop transitions, 1 changer transitions 0/432 dead transitions. [2020-10-09 15:29:46,402 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 432 transitions, 1033 flow [2020-10-09 15:29:46,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2020-10-09 15:29:46,404 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9537815126050421 [2020-10-09 15:29:46,404 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1362 transitions. [2020-10-09 15:29:46,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1362 transitions. [2020-10-09 15:29:46,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:46,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1362 transitions. [2020-10-09 15:29:46,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:46,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:46,406 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:46,406 INFO L185 Difference]: Start difference. First operand has 469 places, 435 transitions, 1034 flow. Second operand 3 states and 1362 transitions. [2020-10-09 15:29:46,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 432 transitions, 1033 flow [2020-10-09 15:29:46,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 432 transitions, 1028 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:46,411 INFO L241 Difference]: Finished difference. Result has 466 places, 432 transitions, 1020 flow [2020-10-09 15:29:46,411 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1020, PETRI_PLACES=466, PETRI_TRANSITIONS=432} [2020-10-09 15:29:46,411 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 24 predicate places. [2020-10-09 15:29:46,411 INFO L481 AbstractCegarLoop]: Abstraction has has 466 places, 432 transitions, 1020 flow [2020-10-09 15:29:46,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:46,411 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:46,411 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:46,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 358 mathsat -unsat_core_generation=3 [2020-10-09 15:29:46,612 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:46,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:46,612 INFO L82 PathProgramCache]: Analyzing trace with hash -160250306, now seen corresponding path program 1 times [2020-10-09 15:29:46,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:46,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506247698] [2020-10-09 15:29:46,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 359 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 359 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:46,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:46,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:29:46,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:29:46,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506247698] [2020-10-09 15:29:46,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:46,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:46,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527154496] [2020-10-09 15:29:46,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:46,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:46,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:46,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:46,896 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 476 [2020-10-09 15:29:46,897 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 432 transitions, 1020 flow. Second operand 3 states. [2020-10-09 15:29:46,897 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:46,897 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 476 [2020-10-09 15:29:46,897 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:47,011 INFO L129 PetriNetUnfolder]: 28/508 cut-off events. [2020-10-09 15:29:47,012 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:47,030 INFO L80 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 508 events. 28/508 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2089 event pairs, 0 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 604. Up to 18 conditions per place. [2020-10-09 15:29:47,034 INFO L132 encePairwiseOnDemand]: 473/476 looper letters, 5 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2020-10-09 15:29:47,034 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 433 transitions, 1036 flow [2020-10-09 15:29:47,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1361 transitions. [2020-10-09 15:29:47,035 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9530812324929971 [2020-10-09 15:29:47,035 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1361 transitions. [2020-10-09 15:29:47,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1361 transitions. [2020-10-09 15:29:47,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:47,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1361 transitions. [2020-10-09 15:29:47,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:47,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:47,038 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:47,038 INFO L185 Difference]: Start difference. First operand has 466 places, 432 transitions, 1020 flow. Second operand 3 states and 1361 transitions. [2020-10-09 15:29:47,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 433 transitions, 1036 flow [2020-10-09 15:29:47,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 433 transitions, 1035 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:47,042 INFO L241 Difference]: Finished difference. Result has 469 places, 433 transitions, 1033 flow [2020-10-09 15:29:47,043 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1033, PETRI_PLACES=469, PETRI_TRANSITIONS=433} [2020-10-09 15:29:47,043 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 27 predicate places. [2020-10-09 15:29:47,043 INFO L481 AbstractCegarLoop]: Abstraction has has 469 places, 433 transitions, 1033 flow [2020-10-09 15:29:47,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:47,043 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:47,043 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:47,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 359 mathsat -unsat_core_generation=3 [2020-10-09 15:29:47,244 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:47,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:47,244 INFO L82 PathProgramCache]: Analyzing trace with hash -160251329, now seen corresponding path program 1 times [2020-10-09 15:29:47,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:47,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064092023] [2020-10-09 15:29:47,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 360 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 360 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:47,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:47,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:29:47,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:29:47,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064092023] [2020-10-09 15:29:47,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:47,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:47,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657514008] [2020-10-09 15:29:47,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:47,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:47,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:47,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:47,575 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:47,576 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 433 transitions, 1033 flow. Second operand 3 states. [2020-10-09 15:29:47,576 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:47,576 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:47,576 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:47,702 INFO L129 PetriNetUnfolder]: 28/509 cut-off events. [2020-10-09 15:29:47,702 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:29:47,721 INFO L80 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 509 events. 28/509 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2095 event pairs, 0 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 610. Up to 18 conditions per place. [2020-10-09 15:29:47,724 INFO L132 encePairwiseOnDemand]: 472/476 looper letters, 9 selfloop transitions, 3 changer transitions 0/434 dead transitions. [2020-10-09 15:29:47,725 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 434 transitions, 1059 flow [2020-10-09 15:29:47,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1351 transitions. [2020-10-09 15:29:47,726 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.946078431372549 [2020-10-09 15:29:47,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1351 transitions. [2020-10-09 15:29:47,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1351 transitions. [2020-10-09 15:29:47,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:47,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1351 transitions. [2020-10-09 15:29:47,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:47,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:47,728 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:47,728 INFO L185 Difference]: Start difference. First operand has 469 places, 433 transitions, 1033 flow. Second operand 3 states and 1351 transitions. [2020-10-09 15:29:47,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 434 transitions, 1059 flow [2020-10-09 15:29:47,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 434 transitions, 1057 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:47,732 INFO L241 Difference]: Finished difference. Result has 472 places, 434 transitions, 1049 flow [2020-10-09 15:29:47,732 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1049, PETRI_PLACES=472, PETRI_TRANSITIONS=434} [2020-10-09 15:29:47,732 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 30 predicate places. [2020-10-09 15:29:47,732 INFO L481 AbstractCegarLoop]: Abstraction has has 472 places, 434 transitions, 1049 flow [2020-10-09 15:29:47,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:47,733 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:47,733 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:47,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 360 mathsat -unsat_core_generation=3 [2020-10-09 15:29:47,933 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:47,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:47,934 INFO L82 PathProgramCache]: Analyzing trace with hash -159296994, now seen corresponding path program 1 times [2020-10-09 15:29:47,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:47,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050021933] [2020-10-09 15:29:47,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 361 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 361 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:48,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:48,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:29:48,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:29:48,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050021933] [2020-10-09 15:29:48,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:48,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:48,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364232377] [2020-10-09 15:29:48,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:48,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:48,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:48,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:48,227 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:48,228 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 434 transitions, 1049 flow. Second operand 3 states. [2020-10-09 15:29:48,228 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:48,228 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:48,228 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:48,355 INFO L129 PetriNetUnfolder]: 27/506 cut-off events. [2020-10-09 15:29:48,355 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:29:48,374 INFO L80 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 506 events. 27/506 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2080 event pairs, 0 based on Foata normal form. 2/464 useless extension candidates. Maximal degree in co-relation 609. Up to 18 conditions per place. [2020-10-09 15:29:48,377 INFO L132 encePairwiseOnDemand]: 473/476 looper letters, 9 selfloop transitions, 1 changer transitions 0/432 dead transitions. [2020-10-09 15:29:48,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 432 transitions, 1057 flow [2020-10-09 15:29:48,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:48,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1350 transitions. [2020-10-09 15:29:48,378 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9453781512605042 [2020-10-09 15:29:48,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1350 transitions. [2020-10-09 15:29:48,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1350 transitions. [2020-10-09 15:29:48,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:48,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1350 transitions. [2020-10-09 15:29:48,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:48,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:48,380 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:48,381 INFO L185 Difference]: Start difference. First operand has 472 places, 434 transitions, 1049 flow. Second operand 3 states and 1350 transitions. [2020-10-09 15:29:48,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 432 transitions, 1057 flow [2020-10-09 15:29:48,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 432 transitions, 1056 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:48,385 INFO L241 Difference]: Finished difference. Result has 473 places, 432 transitions, 1038 flow [2020-10-09 15:29:48,385 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=471, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1038, PETRI_PLACES=473, PETRI_TRANSITIONS=432} [2020-10-09 15:29:48,385 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 31 predicate places. [2020-10-09 15:29:48,386 INFO L481 AbstractCegarLoop]: Abstraction has has 473 places, 432 transitions, 1038 flow [2020-10-09 15:29:48,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:48,386 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:48,386 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:48,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 361 mathsat -unsat_core_generation=3 [2020-10-09 15:29:48,586 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:48,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:48,587 INFO L82 PathProgramCache]: Analyzing trace with hash -159298017, now seen corresponding path program 1 times [2020-10-09 15:29:48,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:48,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565964285] [2020-10-09 15:29:48,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 362 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 362 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:48,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:48,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:29:48,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:29:48,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565964285] [2020-10-09 15:29:48,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:48,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:48,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063910305] [2020-10-09 15:29:48,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:48,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:48,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:48,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:48,877 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 476 [2020-10-09 15:29:48,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 432 transitions, 1038 flow. Second operand 3 states. [2020-10-09 15:29:48,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:48,879 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 476 [2020-10-09 15:29:48,879 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:49,000 INFO L129 PetriNetUnfolder]: 27/503 cut-off events. [2020-10-09 15:29:49,000 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:29:49,020 INFO L80 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 503 events. 27/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2058 event pairs, 0 based on Foata normal form. 1/461 useless extension candidates. Maximal degree in co-relation 603. Up to 18 conditions per place. [2020-10-09 15:29:49,023 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 4 selfloop transitions, 1 changer transitions 0/429 dead transitions. [2020-10-09 15:29:49,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 429 transitions, 1037 flow [2020-10-09 15:29:49,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2020-10-09 15:29:49,025 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9537815126050421 [2020-10-09 15:29:49,025 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1362 transitions. [2020-10-09 15:29:49,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1362 transitions. [2020-10-09 15:29:49,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:49,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1362 transitions. [2020-10-09 15:29:49,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:49,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:49,027 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:49,027 INFO L185 Difference]: Start difference. First operand has 473 places, 432 transitions, 1038 flow. Second operand 3 states and 1362 transitions. [2020-10-09 15:29:49,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 429 transitions, 1037 flow [2020-10-09 15:29:49,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 429 transitions, 1032 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:49,031 INFO L241 Difference]: Finished difference. Result has 470 places, 429 transitions, 1024 flow [2020-10-09 15:29:49,032 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1024, PETRI_PLACES=470, PETRI_TRANSITIONS=429} [2020-10-09 15:29:49,032 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 28 predicate places. [2020-10-09 15:29:49,032 INFO L481 AbstractCegarLoop]: Abstraction has has 470 places, 429 transitions, 1024 flow [2020-10-09 15:29:49,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:49,032 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:49,032 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:49,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 362 mathsat -unsat_core_generation=3 [2020-10-09 15:29:49,233 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:49,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:49,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1005735772, now seen corresponding path program 1 times [2020-10-09 15:29:49,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:49,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740611699] [2020-10-09 15:29:49,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 363 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 363 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:49,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:49,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:29:49,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:29:49,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740611699] [2020-10-09 15:29:49,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:49,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:49,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526243323] [2020-10-09 15:29:49,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:49,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:49,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:49,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:49,528 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:49,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 429 transitions, 1024 flow. Second operand 3 states. [2020-10-09 15:29:49,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:49,529 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:49,529 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:49,656 INFO L129 PetriNetUnfolder]: 26/511 cut-off events. [2020-10-09 15:29:49,656 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:49,677 INFO L80 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 511 events. 26/511 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2123 event pairs, 0 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 620. Up to 18 conditions per place. [2020-10-09 15:29:49,680 INFO L132 encePairwiseOnDemand]: 471/476 looper letters, 10 selfloop transitions, 3 changer transitions 0/431 dead transitions. [2020-10-09 15:29:49,680 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 431 transitions, 1054 flow [2020-10-09 15:29:49,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1353 transitions. [2020-10-09 15:29:49,682 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474789915966386 [2020-10-09 15:29:49,682 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1353 transitions. [2020-10-09 15:29:49,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1353 transitions. [2020-10-09 15:29:49,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:49,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1353 transitions. [2020-10-09 15:29:49,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:49,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:49,683 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:49,683 INFO L185 Difference]: Start difference. First operand has 470 places, 429 transitions, 1024 flow. Second operand 3 states and 1353 transitions. [2020-10-09 15:29:49,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 431 transitions, 1054 flow [2020-10-09 15:29:49,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 431 transitions, 1053 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:49,688 INFO L241 Difference]: Finished difference. Result has 473 places, 431 transitions, 1047 flow [2020-10-09 15:29:49,688 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1047, PETRI_PLACES=473, PETRI_TRANSITIONS=431} [2020-10-09 15:29:49,688 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 31 predicate places. [2020-10-09 15:29:49,688 INFO L481 AbstractCegarLoop]: Abstraction has has 473 places, 431 transitions, 1047 flow [2020-10-09 15:29:49,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:49,689 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:49,689 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:49,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 363 mathsat -unsat_core_generation=3 [2020-10-09 15:29:49,889 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:49,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:49,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1005736795, now seen corresponding path program 1 times [2020-10-09 15:29:49,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:49,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671169411] [2020-10-09 15:29:49,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 364 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 364 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:50,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:50,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:29:50,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:29:50,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671169411] [2020-10-09 15:29:50,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:50,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:50,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939718820] [2020-10-09 15:29:50,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:50,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:50,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:50,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:50,212 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 476 [2020-10-09 15:29:50,213 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 431 transitions, 1047 flow. Second operand 3 states. [2020-10-09 15:29:50,213 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:50,213 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 476 [2020-10-09 15:29:50,213 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:50,339 INFO L129 PetriNetUnfolder]: 25/509 cut-off events. [2020-10-09 15:29:50,340 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:29:50,361 INFO L80 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 509 events. 25/509 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2112 event pairs, 0 based on Foata normal form. 0/468 useless extension candidates. Maximal degree in co-relation 615. Up to 18 conditions per place. [2020-10-09 15:29:50,364 INFO L132 encePairwiseOnDemand]: 473/476 looper letters, 5 selfloop transitions, 2 changer transitions 0/431 dead transitions. [2020-10-09 15:29:50,364 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 431 transitions, 1059 flow [2020-10-09 15:29:50,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1361 transitions. [2020-10-09 15:29:50,365 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9530812324929971 [2020-10-09 15:29:50,365 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1361 transitions. [2020-10-09 15:29:50,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1361 transitions. [2020-10-09 15:29:50,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:50,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1361 transitions. [2020-10-09 15:29:50,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:50,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:50,367 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:50,367 INFO L185 Difference]: Start difference. First operand has 473 places, 431 transitions, 1047 flow. Second operand 3 states and 1361 transitions. [2020-10-09 15:29:50,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 431 transitions, 1059 flow [2020-10-09 15:29:50,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 431 transitions, 1054 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:50,372 INFO L241 Difference]: Finished difference. Result has 476 places, 431 transitions, 1052 flow [2020-10-09 15:29:50,372 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1052, PETRI_PLACES=476, PETRI_TRANSITIONS=431} [2020-10-09 15:29:50,372 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 34 predicate places. [2020-10-09 15:29:50,372 INFO L481 AbstractCegarLoop]: Abstraction has has 476 places, 431 transitions, 1052 flow [2020-10-09 15:29:50,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:50,372 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:50,372 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:50,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 364 mathsat -unsat_core_generation=3 [2020-10-09 15:29:50,573 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:50,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:50,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1006689084, now seen corresponding path program 1 times [2020-10-09 15:29:50,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:50,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786796421] [2020-10-09 15:29:50,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 365 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 365 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:50,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:50,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:50,845 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:29:50,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:50,848 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:29:50,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786796421] [2020-10-09 15:29:50,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:50,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:50,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343788739] [2020-10-09 15:29:50,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:50,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:50,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:50,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:50,870 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 476 [2020-10-09 15:29:50,871 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 431 transitions, 1052 flow. Second operand 3 states. [2020-10-09 15:29:50,871 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:50,871 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 476 [2020-10-09 15:29:50,871 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:50,992 INFO L129 PetriNetUnfolder]: 24/505 cut-off events. [2020-10-09 15:29:50,992 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:29:51,013 INFO L80 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 505 events. 24/505 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2088 event pairs, 0 based on Foata normal form. 1/466 useless extension candidates. Maximal degree in co-relation 611. Up to 18 conditions per place. [2020-10-09 15:29:51,016 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 4 selfloop transitions, 1 changer transitions 0/428 dead transitions. [2020-10-09 15:29:51,016 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 428 transitions, 1047 flow [2020-10-09 15:29:51,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:51,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2020-10-09 15:29:51,017 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9537815126050421 [2020-10-09 15:29:51,017 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1362 transitions. [2020-10-09 15:29:51,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1362 transitions. [2020-10-09 15:29:51,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:51,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1362 transitions. [2020-10-09 15:29:51,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:51,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:51,019 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:51,020 INFO L185 Difference]: Start difference. First operand has 476 places, 431 transitions, 1052 flow. Second operand 3 states and 1362 transitions. [2020-10-09 15:29:51,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 428 transitions, 1047 flow [2020-10-09 15:29:51,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 428 transitions, 1040 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:51,024 INFO L241 Difference]: Finished difference. Result has 475 places, 428 transitions, 1032 flow [2020-10-09 15:29:51,025 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1032, PETRI_PLACES=475, PETRI_TRANSITIONS=428} [2020-10-09 15:29:51,025 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 33 predicate places. [2020-10-09 15:29:51,025 INFO L481 AbstractCegarLoop]: Abstraction has has 475 places, 428 transitions, 1032 flow [2020-10-09 15:29:51,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:51,025 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:51,025 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:51,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 365 mathsat -unsat_core_generation=3 [2020-10-09 15:29:51,226 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:51,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:51,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1006690107, now seen corresponding path program 1 times [2020-10-09 15:29:51,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:51,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595467116] [2020-10-09 15:29:51,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 366 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 366 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:51,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:51,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:51,494 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:29:51,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:29:51,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595467116] [2020-10-09 15:29:51,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:51,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:51,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756555979] [2020-10-09 15:29:51,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:51,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:51,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:51,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:51,525 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:51,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 428 transitions, 1032 flow. Second operand 3 states. [2020-10-09 15:29:51,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:51,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:51,526 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:51,651 INFO L129 PetriNetUnfolder]: 24/503 cut-off events. [2020-10-09 15:29:51,651 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:51,671 INFO L80 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 503 events. 24/503 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2071 event pairs, 0 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 613. Up to 18 conditions per place. [2020-10-09 15:29:51,674 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 8 selfloop transitions, 1 changer transitions 0/426 dead transitions. [2020-10-09 15:29:51,674 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 426 transitions, 1045 flow [2020-10-09 15:29:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:51,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1348 transitions. [2020-10-09 15:29:51,675 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9439775910364145 [2020-10-09 15:29:51,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1348 transitions. [2020-10-09 15:29:51,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1348 transitions. [2020-10-09 15:29:51,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:51,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1348 transitions. [2020-10-09 15:29:51,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:51,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:51,677 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:51,677 INFO L185 Difference]: Start difference. First operand has 475 places, 428 transitions, 1032 flow. Second operand 3 states and 1348 transitions. [2020-10-09 15:29:51,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 426 transitions, 1045 flow [2020-10-09 15:29:51,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 426 transitions, 1044 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:51,682 INFO L241 Difference]: Finished difference. Result has 474 places, 426 transitions, 1028 flow [2020-10-09 15:29:51,682 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1028, PETRI_PLACES=474, PETRI_TRANSITIONS=426} [2020-10-09 15:29:51,682 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 32 predicate places. [2020-10-09 15:29:51,682 INFO L481 AbstractCegarLoop]: Abstraction has has 474 places, 426 transitions, 1028 flow [2020-10-09 15:29:51,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:51,682 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:51,682 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:51,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 366 mathsat -unsat_core_generation=3 [2020-10-09 15:29:51,883 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:51,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:51,883 INFO L82 PathProgramCache]: Analyzing trace with hash -671931943, now seen corresponding path program 1 times [2020-10-09 15:29:51,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:51,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312267029] [2020-10-09 15:29:51,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 367 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 367 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:52,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:52,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:29:52,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:29:52,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312267029] [2020-10-09 15:29:52,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:52,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:52,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259957772] [2020-10-09 15:29:52,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:52,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:52,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:52,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:52,182 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:52,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 426 transitions, 1028 flow. Second operand 3 states. [2020-10-09 15:29:52,183 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:52,183 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:52,183 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:52,306 INFO L129 PetriNetUnfolder]: 23/511 cut-off events. [2020-10-09 15:29:52,307 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:52,326 INFO L80 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 511 events. 23/511 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2147 event pairs, 0 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 625. Up to 18 conditions per place. [2020-10-09 15:29:52,329 INFO L132 encePairwiseOnDemand]: 471/476 looper letters, 10 selfloop transitions, 3 changer transitions 0/428 dead transitions. [2020-10-09 15:29:52,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 428 transitions, 1058 flow [2020-10-09 15:29:52,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1353 transitions. [2020-10-09 15:29:52,330 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474789915966386 [2020-10-09 15:29:52,330 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1353 transitions. [2020-10-09 15:29:52,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1353 transitions. [2020-10-09 15:29:52,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:52,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1353 transitions. [2020-10-09 15:29:52,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:52,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:52,332 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:52,332 INFO L185 Difference]: Start difference. First operand has 474 places, 426 transitions, 1028 flow. Second operand 3 states and 1353 transitions. [2020-10-09 15:29:52,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 428 transitions, 1058 flow [2020-10-09 15:29:52,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 428 transitions, 1057 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:52,336 INFO L241 Difference]: Finished difference. Result has 477 places, 428 transitions, 1051 flow [2020-10-09 15:29:52,336 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1051, PETRI_PLACES=477, PETRI_TRANSITIONS=428} [2020-10-09 15:29:52,337 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 35 predicate places. [2020-10-09 15:29:52,337 INFO L481 AbstractCegarLoop]: Abstraction has has 477 places, 428 transitions, 1051 flow [2020-10-09 15:29:52,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:52,337 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:52,337 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:52,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 367 mathsat -unsat_core_generation=3 [2020-10-09 15:29:52,538 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:52,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:52,538 INFO L82 PathProgramCache]: Analyzing trace with hash -671932966, now seen corresponding path program 1 times [2020-10-09 15:29:52,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:52,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417221878] [2020-10-09 15:29:52,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 368 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 368 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:52,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:52,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:52,810 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:29:52,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:52,814 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:29:52,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417221878] [2020-10-09 15:29:52,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:52,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:52,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193895544] [2020-10-09 15:29:52,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:52,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:52,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:52,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:52,827 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 476 [2020-10-09 15:29:52,828 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 428 transitions, 1051 flow. Second operand 3 states. [2020-10-09 15:29:52,828 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:52,828 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 476 [2020-10-09 15:29:52,828 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:52,948 INFO L129 PetriNetUnfolder]: 21/512 cut-off events. [2020-10-09 15:29:52,948 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:29:52,969 INFO L80 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 512 events. 21/512 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2167 event pairs, 0 based on Foata normal form. 1/476 useless extension candidates. Maximal degree in co-relation 623. Up to 18 conditions per place. [2020-10-09 15:29:52,971 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 4 selfloop transitions, 1 changer transitions 0/427 dead transitions. [2020-10-09 15:29:52,971 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 427 transitions, 1057 flow [2020-10-09 15:29:52,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2020-10-09 15:29:52,972 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9537815126050421 [2020-10-09 15:29:52,973 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1362 transitions. [2020-10-09 15:29:52,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1362 transitions. [2020-10-09 15:29:52,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:52,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1362 transitions. [2020-10-09 15:29:52,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:52,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:52,974 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:52,974 INFO L185 Difference]: Start difference. First operand has 477 places, 428 transitions, 1051 flow. Second operand 3 states and 1362 transitions. [2020-10-09 15:29:52,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 427 transitions, 1057 flow [2020-10-09 15:29:52,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 427 transitions, 1052 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:52,979 INFO L241 Difference]: Finished difference. Result has 479 places, 427 transitions, 1047 flow [2020-10-09 15:29:52,979 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1047, PETRI_PLACES=479, PETRI_TRANSITIONS=427} [2020-10-09 15:29:52,979 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 37 predicate places. [2020-10-09 15:29:52,979 INFO L481 AbstractCegarLoop]: Abstraction has has 479 places, 427 transitions, 1047 flow [2020-10-09 15:29:52,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:52,979 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:52,979 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:53,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 368 mathsat -unsat_core_generation=3 [2020-10-09 15:29:53,180 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:53,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:53,180 INFO L82 PathProgramCache]: Analyzing trace with hash -672885255, now seen corresponding path program 1 times [2020-10-09 15:29:53,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:53,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130066212] [2020-10-09 15:29:53,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 369 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 369 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:53,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:53,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:29:53,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:53,482 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:29:53,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130066212] [2020-10-09 15:29:53,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:53,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:53,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126544165] [2020-10-09 15:29:53,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:53,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:53,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:53,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:53,500 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 476 [2020-10-09 15:29:53,501 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 427 transitions, 1047 flow. Second operand 3 states. [2020-10-09 15:29:53,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:53,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 476 [2020-10-09 15:29:53,501 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:53,619 INFO L129 PetriNetUnfolder]: 21/505 cut-off events. [2020-10-09 15:29:53,620 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:29:53,638 INFO L80 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 505 events. 21/505 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2106 event pairs, 0 based on Foata normal form. 1/469 useless extension candidates. Maximal degree in co-relation 619. Up to 18 conditions per place. [2020-10-09 15:29:53,641 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 5 selfloop transitions, 1 changer transitions 0/425 dead transitions. [2020-10-09 15:29:53,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 425 transitions, 1050 flow [2020-10-09 15:29:53,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2020-10-09 15:29:53,642 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2020-10-09 15:29:53,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2020-10-09 15:29:53,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2020-10-09 15:29:53,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:53,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2020-10-09 15:29:53,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:53,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:53,644 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:53,644 INFO L185 Difference]: Start difference. First operand has 479 places, 427 transitions, 1047 flow. Second operand 3 states and 1360 transitions. [2020-10-09 15:29:53,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 425 transitions, 1050 flow [2020-10-09 15:29:53,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 425 transitions, 1043 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:53,648 INFO L241 Difference]: Finished difference. Result has 479 places, 425 transitions, 1036 flow [2020-10-09 15:29:53,648 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=479, PETRI_TRANSITIONS=425} [2020-10-09 15:29:53,648 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 37 predicate places. [2020-10-09 15:29:53,648 INFO L481 AbstractCegarLoop]: Abstraction has has 479 places, 425 transitions, 1036 flow [2020-10-09 15:29:53,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:53,648 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:53,649 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:53,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 369 mathsat -unsat_core_generation=3 [2020-10-09 15:29:53,849 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:53,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:53,850 INFO L82 PathProgramCache]: Analyzing trace with hash -672886278, now seen corresponding path program 1 times [2020-10-09 15:29:53,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:53,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526299732] [2020-10-09 15:29:53,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 370 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 370 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:54,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:54,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:29:54,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:54,123 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:29:54,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526299732] [2020-10-09 15:29:54,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:54,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:54,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687551169] [2020-10-09 15:29:54,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:54,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:54,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:54,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:54,152 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:54,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 425 transitions, 1036 flow. Second operand 3 states. [2020-10-09 15:29:54,153 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:54,153 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:54,153 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:54,272 INFO L129 PetriNetUnfolder]: 21/503 cut-off events. [2020-10-09 15:29:54,272 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:29:54,290 INFO L80 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 503 events. 21/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2091 event pairs, 0 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 619. Up to 18 conditions per place. [2020-10-09 15:29:54,293 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 8 selfloop transitions, 1 changer transitions 0/423 dead transitions. [2020-10-09 15:29:54,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 423 transitions, 1049 flow [2020-10-09 15:29:54,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:54,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1348 transitions. [2020-10-09 15:29:54,294 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9439775910364145 [2020-10-09 15:29:54,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1348 transitions. [2020-10-09 15:29:54,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1348 transitions. [2020-10-09 15:29:54,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:54,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1348 transitions. [2020-10-09 15:29:54,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:54,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:54,296 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:54,296 INFO L185 Difference]: Start difference. First operand has 479 places, 425 transitions, 1036 flow. Second operand 3 states and 1348 transitions. [2020-10-09 15:29:54,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 423 transitions, 1049 flow [2020-10-09 15:29:54,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 423 transitions, 1048 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:54,300 INFO L241 Difference]: Finished difference. Result has 478 places, 423 transitions, 1032 flow [2020-10-09 15:29:54,300 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1032, PETRI_PLACES=478, PETRI_TRANSITIONS=423} [2020-10-09 15:29:54,300 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 36 predicate places. [2020-10-09 15:29:54,301 INFO L481 AbstractCegarLoop]: Abstraction has has 478 places, 423 transitions, 1032 flow [2020-10-09 15:29:54,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:54,301 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:54,301 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:54,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 370 mathsat -unsat_core_generation=3 [2020-10-09 15:29:54,501 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:54,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:54,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1184862344, now seen corresponding path program 1 times [2020-10-09 15:29:54,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:54,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619008868] [2020-10-09 15:29:54,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 371 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 371 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:54,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:54,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:29:54,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:54,776 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:29:54,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619008868] [2020-10-09 15:29:54,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:54,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:54,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950485550] [2020-10-09 15:29:54,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:54,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:54,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:54,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:54,796 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:54,796 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 423 transitions, 1032 flow. Second operand 3 states. [2020-10-09 15:29:54,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:54,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:54,797 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:54,927 INFO L129 PetriNetUnfolder]: 20/511 cut-off events. [2020-10-09 15:29:54,927 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:54,947 INFO L80 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 511 events. 20/511 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2160 event pairs, 0 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 631. Up to 18 conditions per place. [2020-10-09 15:29:54,949 INFO L132 encePairwiseOnDemand]: 471/476 looper letters, 10 selfloop transitions, 3 changer transitions 0/425 dead transitions. [2020-10-09 15:29:54,949 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 425 transitions, 1062 flow [2020-10-09 15:29:54,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1353 transitions. [2020-10-09 15:29:54,951 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474789915966386 [2020-10-09 15:29:54,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1353 transitions. [2020-10-09 15:29:54,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1353 transitions. [2020-10-09 15:29:54,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:54,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1353 transitions. [2020-10-09 15:29:54,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:54,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:54,952 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:54,952 INFO L185 Difference]: Start difference. First operand has 478 places, 423 transitions, 1032 flow. Second operand 3 states and 1353 transitions. [2020-10-09 15:29:54,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 425 transitions, 1062 flow [2020-10-09 15:29:54,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 425 transitions, 1061 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:54,957 INFO L241 Difference]: Finished difference. Result has 481 places, 425 transitions, 1055 flow [2020-10-09 15:29:54,957 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1055, PETRI_PLACES=481, PETRI_TRANSITIONS=425} [2020-10-09 15:29:54,957 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 39 predicate places. [2020-10-09 15:29:54,957 INFO L481 AbstractCegarLoop]: Abstraction has has 481 places, 425 transitions, 1055 flow [2020-10-09 15:29:54,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:54,957 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:54,957 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:55,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 371 mathsat -unsat_core_generation=3 [2020-10-09 15:29:55,158 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:55,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:55,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1184863367, now seen corresponding path program 1 times [2020-10-09 15:29:55,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:55,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229187151] [2020-10-09 15:29:55,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 372 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 372 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:55,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:55,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:55,434 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:29:55,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:29:55,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229187151] [2020-10-09 15:29:55,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:55,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:55,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092481499] [2020-10-09 15:29:55,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:55,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:55,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:55,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:55,453 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 476 [2020-10-09 15:29:55,454 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 425 transitions, 1055 flow. Second operand 3 states. [2020-10-09 15:29:55,454 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:55,454 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 476 [2020-10-09 15:29:55,454 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:55,590 INFO L129 PetriNetUnfolder]: 18/512 cut-off events. [2020-10-09 15:29:55,590 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:29:55,612 INFO L80 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 512 events. 18/512 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2186 event pairs, 0 based on Foata normal form. 1/479 useless extension candidates. Maximal degree in co-relation 629. Up to 18 conditions per place. [2020-10-09 15:29:55,614 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 4 selfloop transitions, 1 changer transitions 0/424 dead transitions. [2020-10-09 15:29:55,614 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 424 transitions, 1061 flow [2020-10-09 15:29:55,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2020-10-09 15:29:55,615 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9537815126050421 [2020-10-09 15:29:55,616 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1362 transitions. [2020-10-09 15:29:55,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1362 transitions. [2020-10-09 15:29:55,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:55,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1362 transitions. [2020-10-09 15:29:55,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:55,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:55,617 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:55,617 INFO L185 Difference]: Start difference. First operand has 481 places, 425 transitions, 1055 flow. Second operand 3 states and 1362 transitions. [2020-10-09 15:29:55,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 424 transitions, 1061 flow [2020-10-09 15:29:55,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 424 transitions, 1056 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:55,622 INFO L241 Difference]: Finished difference. Result has 483 places, 424 transitions, 1051 flow [2020-10-09 15:29:55,623 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1051, PETRI_PLACES=483, PETRI_TRANSITIONS=424} [2020-10-09 15:29:55,623 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 41 predicate places. [2020-10-09 15:29:55,623 INFO L481 AbstractCegarLoop]: Abstraction has has 483 places, 424 transitions, 1051 flow [2020-10-09 15:29:55,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:55,623 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:55,623 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:55,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 372 mathsat -unsat_core_generation=3 [2020-10-09 15:29:55,824 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:55,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:55,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1185815656, now seen corresponding path program 1 times [2020-10-09 15:29:55,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:55,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464229385] [2020-10-09 15:29:55,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 373 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 373 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:56,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:56,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:29:56,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:29:56,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464229385] [2020-10-09 15:29:56,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:56,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:56,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674533792] [2020-10-09 15:29:56,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:56,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:56,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:56,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:56,119 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 476 [2020-10-09 15:29:56,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 424 transitions, 1051 flow. Second operand 3 states. [2020-10-09 15:29:56,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:56,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 476 [2020-10-09 15:29:56,121 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:56,277 INFO L129 PetriNetUnfolder]: 18/505 cut-off events. [2020-10-09 15:29:56,278 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:29:56,297 INFO L80 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 505 events. 18/505 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2125 event pairs, 0 based on Foata normal form. 1/472 useless extension candidates. Maximal degree in co-relation 625. Up to 18 conditions per place. [2020-10-09 15:29:56,299 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 5 selfloop transitions, 1 changer transitions 0/422 dead transitions. [2020-10-09 15:29:56,299 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 422 transitions, 1054 flow [2020-10-09 15:29:56,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2020-10-09 15:29:56,301 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2020-10-09 15:29:56,301 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2020-10-09 15:29:56,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2020-10-09 15:29:56,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:56,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2020-10-09 15:29:56,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:56,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:56,302 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:56,303 INFO L185 Difference]: Start difference. First operand has 483 places, 424 transitions, 1051 flow. Second operand 3 states and 1360 transitions. [2020-10-09 15:29:56,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 422 transitions, 1054 flow [2020-10-09 15:29:56,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 422 transitions, 1047 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:56,307 INFO L241 Difference]: Finished difference. Result has 483 places, 422 transitions, 1040 flow [2020-10-09 15:29:56,307 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1040, PETRI_PLACES=483, PETRI_TRANSITIONS=422} [2020-10-09 15:29:56,307 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 41 predicate places. [2020-10-09 15:29:56,308 INFO L481 AbstractCegarLoop]: Abstraction has has 483 places, 422 transitions, 1040 flow [2020-10-09 15:29:56,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:56,308 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:56,308 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:56,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 373 mathsat -unsat_core_generation=3 [2020-10-09 15:29:56,508 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:56,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:56,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1185816679, now seen corresponding path program 1 times [2020-10-09 15:29:56,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:56,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883780493] [2020-10-09 15:29:56,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 374 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 374 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:56,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:56,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:29:56,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:29:56,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883780493] [2020-10-09 15:29:56,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:56,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:56,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190925164] [2020-10-09 15:29:56,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:56,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:56,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:56,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:56,809 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:56,810 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 422 transitions, 1040 flow. Second operand 3 states. [2020-10-09 15:29:56,810 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:56,810 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:56,810 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:56,944 INFO L129 PetriNetUnfolder]: 18/503 cut-off events. [2020-10-09 15:29:56,944 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:29:56,964 INFO L80 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 503 events. 18/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2107 event pairs, 0 based on Foata normal form. 0/468 useless extension candidates. Maximal degree in co-relation 625. Up to 18 conditions per place. [2020-10-09 15:29:56,967 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 8 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2020-10-09 15:29:56,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 420 transitions, 1053 flow [2020-10-09 15:29:56,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:56,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1348 transitions. [2020-10-09 15:29:56,968 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9439775910364145 [2020-10-09 15:29:56,968 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1348 transitions. [2020-10-09 15:29:56,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1348 transitions. [2020-10-09 15:29:56,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:56,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1348 transitions. [2020-10-09 15:29:56,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:56,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:56,970 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:56,970 INFO L185 Difference]: Start difference. First operand has 483 places, 422 transitions, 1040 flow. Second operand 3 states and 1348 transitions. [2020-10-09 15:29:56,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 420 transitions, 1053 flow [2020-10-09 15:29:56,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 420 transitions, 1052 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:56,975 INFO L241 Difference]: Finished difference. Result has 482 places, 420 transitions, 1036 flow [2020-10-09 15:29:56,975 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=482, PETRI_TRANSITIONS=420} [2020-10-09 15:29:56,975 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 40 predicate places. [2020-10-09 15:29:56,975 INFO L481 AbstractCegarLoop]: Abstraction has has 482 places, 420 transitions, 1036 flow [2020-10-09 15:29:56,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:56,975 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:56,975 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:57,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 374 mathsat -unsat_core_generation=3 [2020-10-09 15:29:57,176 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:57,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:57,177 INFO L82 PathProgramCache]: Analyzing trace with hash 142922137, now seen corresponding path program 1 times [2020-10-09 15:29:57,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:57,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126011650] [2020-10-09 15:29:57,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 375 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 375 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:57,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:29:57,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:29:57,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:57,458 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:29:57,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126011650] [2020-10-09 15:29:57,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:57,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:57,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262470033] [2020-10-09 15:29:57,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:57,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:57,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:57,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:57,480 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 476 [2020-10-09 15:29:57,481 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 420 transitions, 1036 flow. Second operand 3 states. [2020-10-09 15:29:57,481 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:57,482 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 476 [2020-10-09 15:29:57,482 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:57,607 INFO L129 PetriNetUnfolder]: 17/510 cut-off events. [2020-10-09 15:29:57,608 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:29:57,628 INFO L80 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 510 events. 17/510 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2172 event pairs, 0 based on Foata normal form. 1/477 useless extension candidates. Maximal degree in co-relation 628. Up to 18 conditions per place. [2020-10-09 15:29:57,630 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 4 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2020-10-09 15:29:57,630 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 420 transitions, 1046 flow [2020-10-09 15:29:57,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:57,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2020-10-09 15:29:57,632 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9537815126050421 [2020-10-09 15:29:57,632 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1362 transitions. [2020-10-09 15:29:57,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1362 transitions. [2020-10-09 15:29:57,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:57,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1362 transitions. [2020-10-09 15:29:57,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:57,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:57,633 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:57,633 INFO L185 Difference]: Start difference. First operand has 482 places, 420 transitions, 1036 flow. Second operand 3 states and 1362 transitions. [2020-10-09 15:29:57,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 420 transitions, 1046 flow [2020-10-09 15:29:57,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 420 transitions, 1045 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:57,638 INFO L241 Difference]: Finished difference. Result has 484 places, 420 transitions, 1040 flow [2020-10-09 15:29:57,639 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1040, PETRI_PLACES=484, PETRI_TRANSITIONS=420} [2020-10-09 15:29:57,639 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 42 predicate places. [2020-10-09 15:29:57,639 INFO L481 AbstractCegarLoop]: Abstraction has has 484 places, 420 transitions, 1040 flow [2020-10-09 15:29:57,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:57,639 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:57,639 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:57,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 375 mathsat -unsat_core_generation=3 [2020-10-09 15:29:57,845 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:57,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:57,845 INFO L82 PathProgramCache]: Analyzing trace with hash 142923160, now seen corresponding path program 1 times [2020-10-09 15:29:57,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:57,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014142262] [2020-10-09 15:29:57,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 376 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 376 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:58,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:58,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:58,122 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:29:58,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:29:58,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014142262] [2020-10-09 15:29:58,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:58,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:58,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986899534] [2020-10-09 15:29:58,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:58,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:58,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:58,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:58,160 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:58,160 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 420 transitions, 1040 flow. Second operand 3 states. [2020-10-09 15:29:58,161 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:58,161 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:58,161 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:58,295 INFO L129 PetriNetUnfolder]: 15/512 cut-off events. [2020-10-09 15:29:58,295 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:29:58,316 INFO L80 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 512 events. 15/512 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2203 event pairs, 0 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 641. Up to 18 conditions per place. [2020-10-09 15:29:58,318 INFO L132 encePairwiseOnDemand]: 472/476 looper letters, 9 selfloop transitions, 3 changer transitions 0/421 dead transitions. [2020-10-09 15:29:58,318 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 421 transitions, 1066 flow [2020-10-09 15:29:58,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1351 transitions. [2020-10-09 15:29:58,319 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.946078431372549 [2020-10-09 15:29:58,319 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1351 transitions. [2020-10-09 15:29:58,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1351 transitions. [2020-10-09 15:29:58,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:58,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1351 transitions. [2020-10-09 15:29:58,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:58,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:58,321 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:58,321 INFO L185 Difference]: Start difference. First operand has 484 places, 420 transitions, 1040 flow. Second operand 3 states and 1351 transitions. [2020-10-09 15:29:58,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 421 transitions, 1066 flow [2020-10-09 15:29:58,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 421 transitions, 1065 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:58,325 INFO L241 Difference]: Finished difference. Result has 487 places, 421 transitions, 1057 flow [2020-10-09 15:29:58,326 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1057, PETRI_PLACES=487, PETRI_TRANSITIONS=421} [2020-10-09 15:29:58,326 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 45 predicate places. [2020-10-09 15:29:58,326 INFO L481 AbstractCegarLoop]: Abstraction has has 487 places, 421 transitions, 1057 flow [2020-10-09 15:29:58,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:58,326 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:58,326 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:58,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 376 mathsat -unsat_core_generation=3 [2020-10-09 15:29:58,527 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:58,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:58,527 INFO L82 PathProgramCache]: Analyzing trace with hash 141969848, now seen corresponding path program 1 times [2020-10-09 15:29:58,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:58,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129462566] [2020-10-09 15:29:58,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 377 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 377 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:58,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:58,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:29:58,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:58,802 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:29:58,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129462566] [2020-10-09 15:29:58,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:58,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:58,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554673594] [2020-10-09 15:29:58,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:58,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:58,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:58,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:58,813 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 476 [2020-10-09 15:29:58,814 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 421 transitions, 1057 flow. Second operand 3 states. [2020-10-09 15:29:58,814 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:58,814 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 476 [2020-10-09 15:29:58,814 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:58,939 INFO L129 PetriNetUnfolder]: 15/505 cut-off events. [2020-10-09 15:29:58,939 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:29:58,957 INFO L80 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 505 events. 15/505 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2144 event pairs, 0 based on Foata normal form. 1/475 useless extension candidates. Maximal degree in co-relation 627. Up to 18 conditions per place. [2020-10-09 15:29:58,959 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 5 selfloop transitions, 1 changer transitions 0/419 dead transitions. [2020-10-09 15:29:58,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 419 transitions, 1059 flow [2020-10-09 15:29:58,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:58,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:58,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2020-10-09 15:29:58,960 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2020-10-09 15:29:58,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2020-10-09 15:29:58,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2020-10-09 15:29:58,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:58,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2020-10-09 15:29:58,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:58,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:58,962 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:58,962 INFO L185 Difference]: Start difference. First operand has 487 places, 421 transitions, 1057 flow. Second operand 3 states and 1360 transitions. [2020-10-09 15:29:58,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 419 transitions, 1059 flow [2020-10-09 15:29:58,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 419 transitions, 1051 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:29:58,966 INFO L241 Difference]: Finished difference. Result has 487 places, 419 transitions, 1044 flow [2020-10-09 15:29:58,966 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1044, PETRI_PLACES=487, PETRI_TRANSITIONS=419} [2020-10-09 15:29:58,967 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 45 predicate places. [2020-10-09 15:29:58,967 INFO L481 AbstractCegarLoop]: Abstraction has has 487 places, 419 transitions, 1044 flow [2020-10-09 15:29:58,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:58,967 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:58,967 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:59,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 377 mathsat -unsat_core_generation=3 [2020-10-09 15:29:59,167 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:59,168 INFO L82 PathProgramCache]: Analyzing trace with hash 141968825, now seen corresponding path program 1 times [2020-10-09 15:29:59,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:59,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764857316] [2020-10-09 15:29:59,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 378 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 378 with mathsat -unsat_core_generation=3 [2020-10-09 15:29:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:29:59,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:29:59,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:29:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:29:59,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:29:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:29:59,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764857316] [2020-10-09 15:29:59,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:29:59,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:29:59,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188499286] [2020-10-09 15:29:59,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:29:59,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:29:59,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:29:59,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:29:59,493 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:29:59,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 419 transitions, 1044 flow. Second operand 3 states. [2020-10-09 15:29:59,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:29:59,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:29:59,494 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:29:59,621 INFO L129 PetriNetUnfolder]: 15/503 cut-off events. [2020-10-09 15:29:59,621 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:29:59,641 INFO L80 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 503 events. 15/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2131 event pairs, 0 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 631. Up to 18 conditions per place. [2020-10-09 15:29:59,642 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 8 selfloop transitions, 1 changer transitions 0/417 dead transitions. [2020-10-09 15:29:59,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 417 transitions, 1057 flow [2020-10-09 15:29:59,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:29:59,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:29:59,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1348 transitions. [2020-10-09 15:29:59,644 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9439775910364145 [2020-10-09 15:29:59,644 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1348 transitions. [2020-10-09 15:29:59,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1348 transitions. [2020-10-09 15:29:59,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:29:59,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1348 transitions. [2020-10-09 15:29:59,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:29:59,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:29:59,645 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:29:59,645 INFO L185 Difference]: Start difference. First operand has 487 places, 419 transitions, 1044 flow. Second operand 3 states and 1348 transitions. [2020-10-09 15:29:59,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 417 transitions, 1057 flow [2020-10-09 15:29:59,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 417 transitions, 1056 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:29:59,650 INFO L241 Difference]: Finished difference. Result has 486 places, 417 transitions, 1040 flow [2020-10-09 15:29:59,650 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1040, PETRI_PLACES=486, PETRI_TRANSITIONS=417} [2020-10-09 15:29:59,650 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 44 predicate places. [2020-10-09 15:29:59,650 INFO L481 AbstractCegarLoop]: Abstraction has has 486 places, 417 transitions, 1040 flow [2020-10-09 15:29:59,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:29:59,650 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:29:59,650 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:29:59,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 378 mathsat -unsat_core_generation=3 [2020-10-09 15:29:59,851 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:29:59,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:29:59,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1482613287, now seen corresponding path program 1 times [2020-10-09 15:29:59,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:29:59,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535127581] [2020-10-09 15:29:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 379 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 379 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:00,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:00,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:30:00,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:30:00,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535127581] [2020-10-09 15:30:00,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:00,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:00,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359607587] [2020-10-09 15:30:00,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:00,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:00,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:00,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:00,143 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 476 [2020-10-09 15:30:00,144 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 417 transitions, 1040 flow. Second operand 3 states. [2020-10-09 15:30:00,144 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:00,144 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 476 [2020-10-09 15:30:00,144 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:00,270 INFO L129 PetriNetUnfolder]: 13/508 cut-off events. [2020-10-09 15:30:00,270 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:30:00,289 INFO L80 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 508 events. 13/508 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2181 event pairs, 0 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 634. Up to 18 conditions per place. [2020-10-09 15:30:00,291 INFO L132 encePairwiseOnDemand]: 473/476 looper letters, 5 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2020-10-09 15:30:00,291 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 418 transitions, 1056 flow [2020-10-09 15:30:00,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1361 transitions. [2020-10-09 15:30:00,292 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9530812324929971 [2020-10-09 15:30:00,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1361 transitions. [2020-10-09 15:30:00,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1361 transitions. [2020-10-09 15:30:00,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:00,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1361 transitions. [2020-10-09 15:30:00,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:00,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:00,294 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:00,294 INFO L185 Difference]: Start difference. First operand has 486 places, 417 transitions, 1040 flow. Second operand 3 states and 1361 transitions. [2020-10-09 15:30:00,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 418 transitions, 1056 flow [2020-10-09 15:30:00,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 418 transitions, 1055 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:00,298 INFO L241 Difference]: Finished difference. Result has 489 places, 418 transitions, 1053 flow [2020-10-09 15:30:00,298 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1053, PETRI_PLACES=489, PETRI_TRANSITIONS=418} [2020-10-09 15:30:00,298 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 47 predicate places. [2020-10-09 15:30:00,299 INFO L481 AbstractCegarLoop]: Abstraction has has 489 places, 418 transitions, 1053 flow [2020-10-09 15:30:00,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:00,299 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:00,299 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:00,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 379 mathsat -unsat_core_generation=3 [2020-10-09 15:30:00,499 INFO L429 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:00,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:00,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1482614310, now seen corresponding path program 1 times [2020-10-09 15:30:00,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:00,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971753530] [2020-10-09 15:30:00,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 380 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 380 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:00,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:00,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:00,776 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:30:00,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:30:00,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971753530] [2020-10-09 15:30:00,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:00,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:00,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246129629] [2020-10-09 15:30:00,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:00,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:00,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:00,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:00,815 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:30:00,815 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 418 transitions, 1053 flow. Second operand 3 states. [2020-10-09 15:30:00,816 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:00,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:30:00,816 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:00,948 INFO L129 PetriNetUnfolder]: 13/509 cut-off events. [2020-10-09 15:30:00,949 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:00,968 INFO L80 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 509 events. 13/509 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2186 event pairs, 0 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 642. Up to 18 conditions per place. [2020-10-09 15:30:00,970 INFO L132 encePairwiseOnDemand]: 472/476 looper letters, 9 selfloop transitions, 3 changer transitions 0/419 dead transitions. [2020-10-09 15:30:00,970 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 419 transitions, 1079 flow [2020-10-09 15:30:00,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:00,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1351 transitions. [2020-10-09 15:30:00,971 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.946078431372549 [2020-10-09 15:30:00,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1351 transitions. [2020-10-09 15:30:00,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1351 transitions. [2020-10-09 15:30:00,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:00,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1351 transitions. [2020-10-09 15:30:00,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:00,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:00,972 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:00,973 INFO L185 Difference]: Start difference. First operand has 489 places, 418 transitions, 1053 flow. Second operand 3 states and 1351 transitions. [2020-10-09 15:30:00,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 419 transitions, 1079 flow [2020-10-09 15:30:00,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 419 transitions, 1077 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:00,977 INFO L241 Difference]: Finished difference. Result has 492 places, 419 transitions, 1069 flow [2020-10-09 15:30:00,977 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=488, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1069, PETRI_PLACES=492, PETRI_TRANSITIONS=419} [2020-10-09 15:30:00,977 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 50 predicate places. [2020-10-09 15:30:00,977 INFO L481 AbstractCegarLoop]: Abstraction has has 492 places, 419 transitions, 1069 flow [2020-10-09 15:30:00,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:00,978 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:00,978 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:01,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 380 mathsat -unsat_core_generation=3 [2020-10-09 15:30:01,178 INFO L429 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:01,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:01,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1481660998, now seen corresponding path program 1 times [2020-10-09 15:30:01,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:01,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446454962] [2020-10-09 15:30:01,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 381 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 381 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:01,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:01,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:30:01,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:01,461 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:30:01,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446454962] [2020-10-09 15:30:01,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:01,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:01,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598063134] [2020-10-09 15:30:01,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:01,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:01,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:01,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:01,481 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 476 [2020-10-09 15:30:01,482 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 419 transitions, 1069 flow. Second operand 3 states. [2020-10-09 15:30:01,482 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:01,482 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 476 [2020-10-09 15:30:01,482 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:01,605 INFO L129 PetriNetUnfolder]: 12/505 cut-off events. [2020-10-09 15:30:01,605 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:30:01,623 INFO L80 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 505 events. 12/505 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2161 event pairs, 0 based on Foata normal form. 1/478 useless extension candidates. Maximal degree in co-relation 634. Up to 18 conditions per place. [2020-10-09 15:30:01,625 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 4 selfloop transitions, 1 changer transitions 0/416 dead transitions. [2020-10-09 15:30:01,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 416 transitions, 1064 flow [2020-10-09 15:30:01,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:01,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:01,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2020-10-09 15:30:01,626 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9537815126050421 [2020-10-09 15:30:01,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1362 transitions. [2020-10-09 15:30:01,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1362 transitions. [2020-10-09 15:30:01,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:01,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1362 transitions. [2020-10-09 15:30:01,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:01,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:01,628 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:01,628 INFO L185 Difference]: Start difference. First operand has 492 places, 419 transitions, 1069 flow. Second operand 3 states and 1362 transitions. [2020-10-09 15:30:01,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 416 transitions, 1064 flow [2020-10-09 15:30:01,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 416 transitions, 1056 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:01,633 INFO L241 Difference]: Finished difference. Result has 491 places, 416 transitions, 1048 flow [2020-10-09 15:30:01,633 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1048, PETRI_PLACES=491, PETRI_TRANSITIONS=416} [2020-10-09 15:30:01,633 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 49 predicate places. [2020-10-09 15:30:01,633 INFO L481 AbstractCegarLoop]: Abstraction has has 491 places, 416 transitions, 1048 flow [2020-10-09 15:30:01,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:01,633 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:01,633 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:01,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 381 mathsat -unsat_core_generation=3 [2020-10-09 15:30:01,834 INFO L429 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:01,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:01,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1481659975, now seen corresponding path program 1 times [2020-10-09 15:30:01,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:01,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587299138] [2020-10-09 15:30:01,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 382 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 382 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:02,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:02,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:02,109 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:30:02,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:02,112 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:30:02,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587299138] [2020-10-09 15:30:02,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:02,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:02,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598613789] [2020-10-09 15:30:02,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:02,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:02,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:02,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:02,144 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 476 [2020-10-09 15:30:02,145 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 416 transitions, 1048 flow. Second operand 3 states. [2020-10-09 15:30:02,145 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:02,145 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 476 [2020-10-09 15:30:02,145 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:02,305 INFO L129 PetriNetUnfolder]: 12/503 cut-off events. [2020-10-09 15:30:02,306 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:30:02,322 INFO L80 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 503 events. 12/503 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2147 event pairs, 0 based on Foata normal form. 0/474 useless extension candidates. Maximal degree in co-relation 638. Up to 18 conditions per place. [2020-10-09 15:30:02,324 INFO L132 encePairwiseOnDemand]: 474/476 looper letters, 8 selfloop transitions, 1 changer transitions 0/414 dead transitions. [2020-10-09 15:30:02,324 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 414 transitions, 1061 flow [2020-10-09 15:30:02,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1348 transitions. [2020-10-09 15:30:02,325 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9439775910364145 [2020-10-09 15:30:02,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1348 transitions. [2020-10-09 15:30:02,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1348 transitions. [2020-10-09 15:30:02,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:02,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1348 transitions. [2020-10-09 15:30:02,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:02,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:02,327 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:02,327 INFO L185 Difference]: Start difference. First operand has 491 places, 416 transitions, 1048 flow. Second operand 3 states and 1348 transitions. [2020-10-09 15:30:02,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 414 transitions, 1061 flow [2020-10-09 15:30:02,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 414 transitions, 1060 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:02,331 INFO L241 Difference]: Finished difference. Result has 490 places, 414 transitions, 1044 flow [2020-10-09 15:30:02,331 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=488, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1044, PETRI_PLACES=490, PETRI_TRANSITIONS=414} [2020-10-09 15:30:02,332 INFO L341 CegarLoopForPetriNet]: 442 programPoint places, 48 predicate places. [2020-10-09 15:30:02,332 INFO L481 AbstractCegarLoop]: Abstraction has has 490 places, 414 transitions, 1044 flow [2020-10-09 15:30:02,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:02,332 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:02,332 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:02,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 382 mathsat -unsat_core_generation=3 [2020-10-09 15:30:02,533 INFO L429 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:02,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:02,533 INFO L82 PathProgramCache]: Analyzing trace with hash -879462736, now seen corresponding path program 1 times [2020-10-09 15:30:02,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:02,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831527481] [2020-10-09 15:30:02,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 383 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 383 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:30:02,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:30:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:30:02,838 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:30:02,882 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:30:02,883 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:30:03,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 383 mathsat -unsat_core_generation=3 [2020-10-09 15:30:03,083 WARN L371 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:30:03,084 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2020-10-09 15:30:03,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,119 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,119 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,119 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,119 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,119 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,124 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,124 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,124 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,124 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,124 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,124 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,124 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,139 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,151 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,151 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,151 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,151 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,153 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,156 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,156 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,156 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,156 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,157 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,157 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,157 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,159 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,159 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,159 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,159 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,159 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,159 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,160 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,160 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,160 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,160 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,160 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,160 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,161 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,162 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,162 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,162 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,162 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,162 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,162 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,162 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,162 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,163 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,163 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,163 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,164 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,164 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,164 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,164 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,166 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,171 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,171 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,173 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,174 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,174 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,174 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,174 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,174 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,174 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,174 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,175 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,175 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,175 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,175 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,175 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,175 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,176 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,176 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,176 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,176 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,176 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,177 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,177 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,177 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,177 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,177 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,177 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,177 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,177 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,177 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,177 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,177 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,179 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,179 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,180 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,180 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,180 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,180 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,180 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,181 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,181 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,181 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,181 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,181 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,181 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,181 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,181 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,181 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,181 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,182 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,182 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,182 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,182 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,182 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,182 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,182 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,183 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,183 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,183 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,183 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,183 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,183 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,184 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,184 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,184 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,184 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,184 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,184 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,184 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,184 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,184 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,185 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,185 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,187 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,187 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,187 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,188 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,188 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,188 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,190 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,190 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,190 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,193 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,193 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,193 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,193 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:03,202 INFO L253 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2020-10-09 15:30:03,202 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:30:03,202 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:30:03,202 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:30:03,202 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:30:03,202 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:30:03,202 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:30:03,202 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:30:03,202 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:30:03,205 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 467 places, 503 transitions, 1402 flow [2020-10-09 15:30:03,334 INFO L129 PetriNetUnfolder]: 91/664 cut-off events. [2020-10-09 15:30:03,334 INFO L130 PetriNetUnfolder]: For 1122/1122 co-relation queries the response was YES. [2020-10-09 15:30:03,362 INFO L80 FinitePrefix]: Finished finitePrefix Result has 890 conditions, 664 events. 91/664 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2690 event pairs, 0 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 827. Up to 38 conditions per place. [2020-10-09 15:30:03,362 INFO L82 GeneralOperation]: Start removeDead. Operand has 467 places, 503 transitions, 1402 flow [2020-10-09 15:30:03,373 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 467 places, 503 transitions, 1402 flow [2020-10-09 15:30:03,378 INFO L129 PetriNetUnfolder]: 9/96 cut-off events. [2020-10-09 15:30:03,378 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:03,378 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:03,378 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:03,378 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:03,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:03,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1324291574, now seen corresponding path program 1 times [2020-10-09 15:30:03,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:03,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520932950] [2020-10-09 15:30:03,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 384 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 384 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:03,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:03,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:30:03,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:30:03,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520932950] [2020-10-09 15:30:03,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:03,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:03,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517795586] [2020-10-09 15:30:03,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:03,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:03,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:03,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:03,701 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:03,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 503 transitions, 1402 flow. Second operand 3 states. [2020-10-09 15:30:03,703 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:03,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:03,703 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:03,824 INFO L129 PetriNetUnfolder]: 53/540 cut-off events. [2020-10-09 15:30:03,824 INFO L130 PetriNetUnfolder]: For 1123/1123 co-relation queries the response was YES. [2020-10-09 15:30:03,848 INFO L80 FinitePrefix]: Finished finitePrefix Result has 780 conditions, 540 events. 53/540 cut-off events. For 1123/1123 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2105 event pairs, 0 based on Foata normal form. 80/547 useless extension candidates. Maximal degree in co-relation 715. Up to 19 conditions per place. [2020-10-09 15:30:03,854 INFO L132 encePairwiseOnDemand]: 478/503 looper letters, 10 selfloop transitions, 3 changer transitions 0/481 dead transitions. [2020-10-09 15:30:03,854 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 481 transitions, 1384 flow [2020-10-09 15:30:03,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1471 transitions. [2020-10-09 15:30:03,856 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9748177601060305 [2020-10-09 15:30:03,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1471 transitions. [2020-10-09 15:30:03,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1471 transitions. [2020-10-09 15:30:03,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:03,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1471 transitions. [2020-10-09 15:30:03,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:03,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:03,857 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:03,857 INFO L185 Difference]: Start difference. First operand has 467 places, 503 transitions, 1402 flow. Second operand 3 states and 1471 transitions. [2020-10-09 15:30:03,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 481 transitions, 1384 flow [2020-10-09 15:30:03,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 481 transitions, 1078 flow, removed 153 selfloop flow, removed 0 redundant places. [2020-10-09 15:30:03,863 INFO L241 Difference]: Finished difference. Result has 466 places, 481 transitions, 1072 flow [2020-10-09 15:30:03,863 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=462, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1072, PETRI_PLACES=466, PETRI_TRANSITIONS=481} [2020-10-09 15:30:03,864 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, -1 predicate places. [2020-10-09 15:30:03,864 INFO L481 AbstractCegarLoop]: Abstraction has has 466 places, 481 transitions, 1072 flow [2020-10-09 15:30:03,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:03,864 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:03,864 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:04,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 384 mathsat -unsat_core_generation=3 [2020-10-09 15:30:04,072 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:04,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:04,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1323337239, now seen corresponding path program 1 times [2020-10-09 15:30:04,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:04,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011450198] [2020-10-09 15:30:04,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 385 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 385 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:04,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:04,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:30:04,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:30:04,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011450198] [2020-10-09 15:30:04,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:04,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:04,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908072890] [2020-10-09 15:30:04,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:04,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:04,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:04,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:04,387 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:04,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 481 transitions, 1072 flow. Second operand 3 states. [2020-10-09 15:30:04,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:04,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:04,389 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:04,502 INFO L129 PetriNetUnfolder]: 51/538 cut-off events. [2020-10-09 15:30:04,502 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:30:04,522 INFO L80 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 538 events. 51/538 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2106 event pairs, 0 based on Foata normal form. 2/470 useless extension candidates. Maximal degree in co-relation 592. Up to 19 conditions per place. [2020-10-09 15:30:04,528 INFO L132 encePairwiseOnDemand]: 500/503 looper letters, 10 selfloop transitions, 1 changer transitions 0/479 dead transitions. [2020-10-09 15:30:04,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 479 transitions, 1082 flow [2020-10-09 15:30:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:04,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:04,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1429 transitions. [2020-10-09 15:30:04,529 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9469847581179589 [2020-10-09 15:30:04,529 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1429 transitions. [2020-10-09 15:30:04,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1429 transitions. [2020-10-09 15:30:04,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:04,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1429 transitions. [2020-10-09 15:30:04,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:04,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:04,531 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:04,531 INFO L185 Difference]: Start difference. First operand has 466 places, 481 transitions, 1072 flow. Second operand 3 states and 1429 transitions. [2020-10-09 15:30:04,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 479 transitions, 1082 flow [2020-10-09 15:30:04,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 479 transitions, 1081 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:04,536 INFO L241 Difference]: Finished difference. Result has 467 places, 479 transitions, 1061 flow [2020-10-09 15:30:04,536 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1061, PETRI_PLACES=467, PETRI_TRANSITIONS=479} [2020-10-09 15:30:04,536 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 0 predicate places. [2020-10-09 15:30:04,536 INFO L481 AbstractCegarLoop]: Abstraction has has 467 places, 479 transitions, 1061 flow [2020-10-09 15:30:04,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:04,536 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:04,536 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:04,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 385 mathsat -unsat_core_generation=3 [2020-10-09 15:30:04,739 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:04,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:04,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1324290551, now seen corresponding path program 1 times [2020-10-09 15:30:04,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:04,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596546743] [2020-10-09 15:30:04,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 386 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 386 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:05,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:05,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:30:05,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:30:05,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596546743] [2020-10-09 15:30:05,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:05,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:05,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828852366] [2020-10-09 15:30:05,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:05,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:05,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:05,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:05,031 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 503 [2020-10-09 15:30:05,032 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 479 transitions, 1061 flow. Second operand 3 states. [2020-10-09 15:30:05,032 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:05,032 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 503 [2020-10-09 15:30:05,032 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:05,144 INFO L129 PetriNetUnfolder]: 51/535 cut-off events. [2020-10-09 15:30:05,144 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-09 15:30:05,164 INFO L80 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 535 events. 51/535 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2081 event pairs, 0 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 586. Up to 19 conditions per place. [2020-10-09 15:30:05,170 INFO L132 encePairwiseOnDemand]: 500/503 looper letters, 5 selfloop transitions, 2 changer transitions 0/479 dead transitions. [2020-10-09 15:30:05,170 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 479 transitions, 1073 flow [2020-10-09 15:30:05,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:05,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1439 transitions. [2020-10-09 15:30:05,171 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.953611663353214 [2020-10-09 15:30:05,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1439 transitions. [2020-10-09 15:30:05,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1439 transitions. [2020-10-09 15:30:05,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:05,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1439 transitions. [2020-10-09 15:30:05,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:05,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:05,173 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:05,173 INFO L185 Difference]: Start difference. First operand has 467 places, 479 transitions, 1061 flow. Second operand 3 states and 1439 transitions. [2020-10-09 15:30:05,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 479 transitions, 1073 flow [2020-10-09 15:30:05,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 479 transitions, 1070 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:05,177 INFO L241 Difference]: Finished difference. Result has 470 places, 479 transitions, 1068 flow [2020-10-09 15:30:05,177 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1068, PETRI_PLACES=470, PETRI_TRANSITIONS=479} [2020-10-09 15:30:05,177 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 3 predicate places. [2020-10-09 15:30:05,177 INFO L481 AbstractCegarLoop]: Abstraction has has 470 places, 479 transitions, 1068 flow [2020-10-09 15:30:05,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:05,178 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:05,178 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:05,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 386 mathsat -unsat_core_generation=3 [2020-10-09 15:30:05,378 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:05,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:05,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1323338262, now seen corresponding path program 1 times [2020-10-09 15:30:05,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:05,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737275689] [2020-10-09 15:30:05,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 387 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 387 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:05,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:05,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:30:05,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:05,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:30:05,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737275689] [2020-10-09 15:30:05,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:05,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:05,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062384619] [2020-10-09 15:30:05,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:05,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:05,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:05,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:05,710 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 503 [2020-10-09 15:30:05,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 479 transitions, 1068 flow. Second operand 3 states. [2020-10-09 15:30:05,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:05,712 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 503 [2020-10-09 15:30:05,712 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:05,821 INFO L129 PetriNetUnfolder]: 51/532 cut-off events. [2020-10-09 15:30:05,821 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:30:05,841 INFO L80 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 532 events. 51/532 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2064 event pairs, 0 based on Foata normal form. 1/465 useless extension candidates. Maximal degree in co-relation 587. Up to 19 conditions per place. [2020-10-09 15:30:05,847 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 4 selfloop transitions, 1 changer transitions 0/476 dead transitions. [2020-10-09 15:30:05,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 476 transitions, 1066 flow [2020-10-09 15:30:05,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2020-10-09 15:30:05,849 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9542743538767395 [2020-10-09 15:30:05,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1440 transitions. [2020-10-09 15:30:05,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1440 transitions. [2020-10-09 15:30:05,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:05,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1440 transitions. [2020-10-09 15:30:05,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:05,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:05,850 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:05,850 INFO L185 Difference]: Start difference. First operand has 470 places, 479 transitions, 1068 flow. Second operand 3 states and 1440 transitions. [2020-10-09 15:30:05,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 476 transitions, 1066 flow [2020-10-09 15:30:05,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 476 transitions, 1061 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:05,855 INFO L241 Difference]: Finished difference. Result has 467 places, 476 transitions, 1053 flow [2020-10-09 15:30:05,855 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1053, PETRI_PLACES=467, PETRI_TRANSITIONS=476} [2020-10-09 15:30:05,855 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 0 predicate places. [2020-10-09 15:30:05,855 INFO L481 AbstractCegarLoop]: Abstraction has has 467 places, 476 transitions, 1053 flow [2020-10-09 15:30:05,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:05,855 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:05,855 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:30:06,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 387 mathsat -unsat_core_generation=3 [2020-10-09 15:30:06,056 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:06,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2043982502, now seen corresponding path program 1 times [2020-10-09 15:30:06,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:06,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754595573] [2020-10-09 15:30:06,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 388 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 388 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:06,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:06,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:06,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:30:06,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:06,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:30:06,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754595573] [2020-10-09 15:30:06,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:06,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:06,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507770003] [2020-10-09 15:30:06,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:06,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:06,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:06,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:06,361 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 503 [2020-10-09 15:30:06,362 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 476 transitions, 1053 flow. Second operand 3 states. [2020-10-09 15:30:06,362 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:06,362 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 503 [2020-10-09 15:30:06,362 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:06,473 INFO L129 PetriNetUnfolder]: 50/539 cut-off events. [2020-10-09 15:30:06,473 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:30:06,493 INFO L80 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 539 events. 50/539 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2117 event pairs, 0 based on Foata normal form. 1/471 useless extension candidates. Maximal degree in co-relation 597. Up to 19 conditions per place. [2020-10-09 15:30:06,499 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 4 selfloop transitions, 1 changer transitions 0/476 dead transitions. [2020-10-09 15:30:06,499 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 476 transitions, 1063 flow [2020-10-09 15:30:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2020-10-09 15:30:06,501 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9542743538767395 [2020-10-09 15:30:06,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1440 transitions. [2020-10-09 15:30:06,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1440 transitions. [2020-10-09 15:30:06,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:06,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1440 transitions. [2020-10-09 15:30:06,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:06,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:06,502 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:06,502 INFO L185 Difference]: Start difference. First operand has 467 places, 476 transitions, 1053 flow. Second operand 3 states and 1440 transitions. [2020-10-09 15:30:06,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 476 transitions, 1063 flow [2020-10-09 15:30:06,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 476 transitions, 1062 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:06,507 INFO L241 Difference]: Finished difference. Result has 469 places, 476 transitions, 1057 flow [2020-10-09 15:30:06,507 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1057, PETRI_PLACES=469, PETRI_TRANSITIONS=476} [2020-10-09 15:30:06,507 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 2 predicate places. [2020-10-09 15:30:06,507 INFO L481 AbstractCegarLoop]: Abstraction has has 469 places, 476 transitions, 1057 flow [2020-10-09 15:30:06,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:06,507 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:06,507 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:30:06,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 388 mathsat -unsat_core_generation=3 [2020-10-09 15:30:06,708 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:06,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:06,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2043981479, now seen corresponding path program 1 times [2020-10-09 15:30:06,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:06,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [570675408] [2020-10-09 15:30:06,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 389 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 389 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:06,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:06,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:06,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:30:06,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:30:06,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [570675408] [2020-10-09 15:30:06,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:06,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:06,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170610633] [2020-10-09 15:30:06,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:06,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:06,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:06,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:07,018 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:07,018 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 476 transitions, 1057 flow. Second operand 3 states. [2020-10-09 15:30:07,019 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:07,019 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:07,019 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:07,134 INFO L129 PetriNetUnfolder]: 48/541 cut-off events. [2020-10-09 15:30:07,134 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:07,155 INFO L80 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 541 events. 48/541 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2154 event pairs, 0 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 608. Up to 19 conditions per place. [2020-10-09 15:30:07,161 INFO L132 encePairwiseOnDemand]: 499/503 looper letters, 9 selfloop transitions, 3 changer transitions 0/477 dead transitions. [2020-10-09 15:30:07,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 477 transitions, 1083 flow [2020-10-09 15:30:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1429 transitions. [2020-10-09 15:30:07,162 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9469847581179589 [2020-10-09 15:30:07,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1429 transitions. [2020-10-09 15:30:07,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1429 transitions. [2020-10-09 15:30:07,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:07,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1429 transitions. [2020-10-09 15:30:07,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:07,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:07,164 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:07,164 INFO L185 Difference]: Start difference. First operand has 469 places, 476 transitions, 1057 flow. Second operand 3 states and 1429 transitions. [2020-10-09 15:30:07,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 477 transitions, 1083 flow [2020-10-09 15:30:07,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 477 transitions, 1082 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:07,169 INFO L241 Difference]: Finished difference. Result has 472 places, 477 transitions, 1074 flow [2020-10-09 15:30:07,169 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1074, PETRI_PLACES=472, PETRI_TRANSITIONS=477} [2020-10-09 15:30:07,169 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 5 predicate places. [2020-10-09 15:30:07,169 INFO L481 AbstractCegarLoop]: Abstraction has has 472 places, 477 transitions, 1074 flow [2020-10-09 15:30:07,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:07,169 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:07,169 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:30:07,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 389 mathsat -unsat_core_generation=3 [2020-10-09 15:30:07,370 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:07,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:07,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2044934791, now seen corresponding path program 1 times [2020-10-09 15:30:07,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:07,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844991016] [2020-10-09 15:30:07,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 390 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 390 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:07,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:07,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:30:07,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:30:07,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844991016] [2020-10-09 15:30:07,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:07,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:07,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169472171] [2020-10-09 15:30:07,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:07,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:07,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:07,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:07,668 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 503 [2020-10-09 15:30:07,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 477 transitions, 1074 flow. Second operand 3 states. [2020-10-09 15:30:07,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:07,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 503 [2020-10-09 15:30:07,670 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:07,781 INFO L129 PetriNetUnfolder]: 48/534 cut-off events. [2020-10-09 15:30:07,781 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:30:07,800 INFO L80 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 534 events. 48/534 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2093 event pairs, 0 based on Foata normal form. 1/470 useless extension candidates. Maximal degree in co-relation 593. Up to 19 conditions per place. [2020-10-09 15:30:07,805 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 5 selfloop transitions, 1 changer transitions 0/475 dead transitions. [2020-10-09 15:30:07,806 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 475 transitions, 1076 flow [2020-10-09 15:30:07,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2020-10-09 15:30:07,807 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9529489728296885 [2020-10-09 15:30:07,807 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2020-10-09 15:30:07,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2020-10-09 15:30:07,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:07,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2020-10-09 15:30:07,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:07,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:07,808 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:07,808 INFO L185 Difference]: Start difference. First operand has 472 places, 477 transitions, 1074 flow. Second operand 3 states and 1438 transitions. [2020-10-09 15:30:07,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 475 transitions, 1076 flow [2020-10-09 15:30:07,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 475 transitions, 1068 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:07,813 INFO L241 Difference]: Finished difference. Result has 472 places, 475 transitions, 1061 flow [2020-10-09 15:30:07,813 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1061, PETRI_PLACES=472, PETRI_TRANSITIONS=475} [2020-10-09 15:30:07,813 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 5 predicate places. [2020-10-09 15:30:07,813 INFO L481 AbstractCegarLoop]: Abstraction has has 472 places, 475 transitions, 1061 flow [2020-10-09 15:30:07,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:07,813 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:07,813 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:30:08,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 390 mathsat -unsat_core_generation=3 [2020-10-09 15:30:08,014 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:08,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:08,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2044935814, now seen corresponding path program 1 times [2020-10-09 15:30:08,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:08,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470436145] [2020-10-09 15:30:08,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 391 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 391 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:08,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:08,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:30:08,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:08,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:30:08,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470436145] [2020-10-09 15:30:08,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:08,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:08,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126602515] [2020-10-09 15:30:08,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:08,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:08,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:08,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:08,323 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:08,324 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 475 transitions, 1061 flow. Second operand 3 states. [2020-10-09 15:30:08,324 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:08,324 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:08,324 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:08,437 INFO L129 PetriNetUnfolder]: 48/532 cut-off events. [2020-10-09 15:30:08,437 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:08,458 INFO L80 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 532 events. 48/532 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2078 event pairs, 0 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 598. Up to 19 conditions per place. [2020-10-09 15:30:08,463 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 8 selfloop transitions, 1 changer transitions 0/473 dead transitions. [2020-10-09 15:30:08,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 473 transitions, 1074 flow [2020-10-09 15:30:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1426 transitions. [2020-10-09 15:30:08,465 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9449966865473823 [2020-10-09 15:30:08,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1426 transitions. [2020-10-09 15:30:08,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1426 transitions. [2020-10-09 15:30:08,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:08,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1426 transitions. [2020-10-09 15:30:08,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:08,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:08,467 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:08,467 INFO L185 Difference]: Start difference. First operand has 472 places, 475 transitions, 1061 flow. Second operand 3 states and 1426 transitions. [2020-10-09 15:30:08,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 473 transitions, 1074 flow [2020-10-09 15:30:08,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 473 transitions, 1073 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:08,471 INFO L241 Difference]: Finished difference. Result has 471 places, 473 transitions, 1057 flow [2020-10-09 15:30:08,471 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1057, PETRI_PLACES=471, PETRI_TRANSITIONS=473} [2020-10-09 15:30:08,471 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 4 predicate places. [2020-10-09 15:30:08,471 INFO L481 AbstractCegarLoop]: Abstraction has has 471 places, 473 transitions, 1057 flow [2020-10-09 15:30:08,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:08,471 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:08,471 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:30:08,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 391 mathsat -unsat_core_generation=3 [2020-10-09 15:30:08,672 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:08,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:08,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1645248821, now seen corresponding path program 1 times [2020-10-09 15:30:08,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:08,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722519482] [2020-10-09 15:30:08,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 392 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 392 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:08,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:08,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:30:08,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:30:08,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722519482] [2020-10-09 15:30:08,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:08,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:08,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819412549] [2020-10-09 15:30:08,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:08,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:08,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:08,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:09,010 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 503 [2020-10-09 15:30:09,011 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 473 transitions, 1057 flow. Second operand 3 states. [2020-10-09 15:30:09,011 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:09,011 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 503 [2020-10-09 15:30:09,012 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:09,125 INFO L129 PetriNetUnfolder]: 47/539 cut-off events. [2020-10-09 15:30:09,125 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:30:09,145 INFO L80 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 539 events. 47/539 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2139 event pairs, 0 based on Foata normal form. 1/475 useless extension candidates. Maximal degree in co-relation 601. Up to 19 conditions per place. [2020-10-09 15:30:09,150 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 4 selfloop transitions, 1 changer transitions 0/473 dead transitions. [2020-10-09 15:30:09,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 473 transitions, 1067 flow [2020-10-09 15:30:09,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:09,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2020-10-09 15:30:09,152 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9542743538767395 [2020-10-09 15:30:09,152 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1440 transitions. [2020-10-09 15:30:09,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1440 transitions. [2020-10-09 15:30:09,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:09,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1440 transitions. [2020-10-09 15:30:09,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:09,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:09,153 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:09,153 INFO L185 Difference]: Start difference. First operand has 471 places, 473 transitions, 1057 flow. Second operand 3 states and 1440 transitions. [2020-10-09 15:30:09,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 473 transitions, 1067 flow [2020-10-09 15:30:09,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 473 transitions, 1066 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:09,158 INFO L241 Difference]: Finished difference. Result has 473 places, 473 transitions, 1061 flow [2020-10-09 15:30:09,158 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1061, PETRI_PLACES=473, PETRI_TRANSITIONS=473} [2020-10-09 15:30:09,158 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 6 predicate places. [2020-10-09 15:30:09,158 INFO L481 AbstractCegarLoop]: Abstraction has has 473 places, 473 transitions, 1061 flow [2020-10-09 15:30:09,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:09,158 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:09,158 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:30:09,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 392 mathsat -unsat_core_generation=3 [2020-10-09 15:30:09,359 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:09,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:09,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1645247798, now seen corresponding path program 1 times [2020-10-09 15:30:09,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:09,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368452845] [2020-10-09 15:30:09,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 393 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 393 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:09,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:09,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:09,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:30:09,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:09,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:30:09,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368452845] [2020-10-09 15:30:09,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:09,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:09,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682699076] [2020-10-09 15:30:09,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:09,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:09,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:09,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:09,669 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:09,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 473 transitions, 1061 flow. Second operand 3 states. [2020-10-09 15:30:09,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:09,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:09,670 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:09,795 INFO L129 PetriNetUnfolder]: 45/541 cut-off events. [2020-10-09 15:30:09,795 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:09,816 INFO L80 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 541 events. 45/541 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2172 event pairs, 0 based on Foata normal form. 0/476 useless extension candidates. Maximal degree in co-relation 614. Up to 19 conditions per place. [2020-10-09 15:30:09,821 INFO L132 encePairwiseOnDemand]: 499/503 looper letters, 9 selfloop transitions, 3 changer transitions 0/474 dead transitions. [2020-10-09 15:30:09,821 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 474 transitions, 1087 flow [2020-10-09 15:30:09,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:09,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:09,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1429 transitions. [2020-10-09 15:30:09,822 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9469847581179589 [2020-10-09 15:30:09,823 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1429 transitions. [2020-10-09 15:30:09,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1429 transitions. [2020-10-09 15:30:09,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:09,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1429 transitions. [2020-10-09 15:30:09,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:09,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:09,824 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:09,824 INFO L185 Difference]: Start difference. First operand has 473 places, 473 transitions, 1061 flow. Second operand 3 states and 1429 transitions. [2020-10-09 15:30:09,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 474 transitions, 1087 flow [2020-10-09 15:30:09,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 474 transitions, 1086 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:09,829 INFO L241 Difference]: Finished difference. Result has 476 places, 474 transitions, 1078 flow [2020-10-09 15:30:09,829 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1078, PETRI_PLACES=476, PETRI_TRANSITIONS=474} [2020-10-09 15:30:09,829 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 9 predicate places. [2020-10-09 15:30:09,829 INFO L481 AbstractCegarLoop]: Abstraction has has 476 places, 474 transitions, 1078 flow [2020-10-09 15:30:09,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:09,829 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:09,829 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:30:10,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 393 mathsat -unsat_core_generation=3 [2020-10-09 15:30:10,030 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:10,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:10,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1646201110, now seen corresponding path program 1 times [2020-10-09 15:30:10,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:10,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612699318] [2020-10-09 15:30:10,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 394 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 394 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:10,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:10,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:30:10,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:30:10,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612699318] [2020-10-09 15:30:10,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:10,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:10,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549382327] [2020-10-09 15:30:10,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:10,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:10,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:10,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:10,323 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 503 [2020-10-09 15:30:10,324 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 474 transitions, 1078 flow. Second operand 3 states. [2020-10-09 15:30:10,324 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:10,324 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 503 [2020-10-09 15:30:10,324 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:10,437 INFO L129 PetriNetUnfolder]: 45/534 cut-off events. [2020-10-09 15:30:10,437 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:30:10,458 INFO L80 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 534 events. 45/534 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2113 event pairs, 0 based on Foata normal form. 1/473 useless extension candidates. Maximal degree in co-relation 600. Up to 19 conditions per place. [2020-10-09 15:30:10,463 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 5 selfloop transitions, 1 changer transitions 0/472 dead transitions. [2020-10-09 15:30:10,463 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 472 transitions, 1080 flow [2020-10-09 15:30:10,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2020-10-09 15:30:10,464 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9529489728296885 [2020-10-09 15:30:10,464 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2020-10-09 15:30:10,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2020-10-09 15:30:10,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:10,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2020-10-09 15:30:10,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:10,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:10,466 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:10,466 INFO L185 Difference]: Start difference. First operand has 476 places, 474 transitions, 1078 flow. Second operand 3 states and 1438 transitions. [2020-10-09 15:30:10,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 472 transitions, 1080 flow [2020-10-09 15:30:10,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 472 transitions, 1072 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:10,470 INFO L241 Difference]: Finished difference. Result has 476 places, 472 transitions, 1065 flow [2020-10-09 15:30:10,470 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1065, PETRI_PLACES=476, PETRI_TRANSITIONS=472} [2020-10-09 15:30:10,470 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 9 predicate places. [2020-10-09 15:30:10,470 INFO L481 AbstractCegarLoop]: Abstraction has has 476 places, 472 transitions, 1065 flow [2020-10-09 15:30:10,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:10,471 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:10,471 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:30:10,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 394 mathsat -unsat_core_generation=3 [2020-10-09 15:30:10,671 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:10,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:10,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1646202133, now seen corresponding path program 1 times [2020-10-09 15:30:10,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:10,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966605851] [2020-10-09 15:30:10,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 395 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 395 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:10,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:10,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:30:10,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:10,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:30:10,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966605851] [2020-10-09 15:30:10,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:10,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:10,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844140060] [2020-10-09 15:30:10,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:10,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:10,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:10,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:10,989 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:10,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 472 transitions, 1065 flow. Second operand 3 states. [2020-10-09 15:30:10,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:10,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:10,990 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:11,102 INFO L129 PetriNetUnfolder]: 45/532 cut-off events. [2020-10-09 15:30:11,102 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:11,121 INFO L80 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 532 events. 45/532 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2099 event pairs, 0 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 604. Up to 19 conditions per place. [2020-10-09 15:30:11,125 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 8 selfloop transitions, 1 changer transitions 0/470 dead transitions. [2020-10-09 15:30:11,126 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 470 transitions, 1078 flow [2020-10-09 15:30:11,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1426 transitions. [2020-10-09 15:30:11,127 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9449966865473823 [2020-10-09 15:30:11,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1426 transitions. [2020-10-09 15:30:11,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1426 transitions. [2020-10-09 15:30:11,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:11,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1426 transitions. [2020-10-09 15:30:11,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:11,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:11,128 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:11,128 INFO L185 Difference]: Start difference. First operand has 476 places, 472 transitions, 1065 flow. Second operand 3 states and 1426 transitions. [2020-10-09 15:30:11,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 470 transitions, 1078 flow [2020-10-09 15:30:11,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 470 transitions, 1077 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:11,133 INFO L241 Difference]: Finished difference. Result has 475 places, 470 transitions, 1061 flow [2020-10-09 15:30:11,133 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1061, PETRI_PLACES=475, PETRI_TRANSITIONS=470} [2020-10-09 15:30:11,133 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 8 predicate places. [2020-10-09 15:30:11,133 INFO L481 AbstractCegarLoop]: Abstraction has has 475 places, 470 transitions, 1061 flow [2020-10-09 15:30:11,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:11,133 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:11,133 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:30:11,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 395 mathsat -unsat_core_generation=3 [2020-10-09 15:30:11,334 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:11,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:11,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1649618397, now seen corresponding path program 1 times [2020-10-09 15:30:11,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:11,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144247540] [2020-10-09 15:30:11,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 396 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 396 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:11,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:11,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:30:11,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:30:11,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144247540] [2020-10-09 15:30:11,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:11,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:11,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827191889] [2020-10-09 15:30:11,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:11,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:11,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:11,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:11,641 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:11,642 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 470 transitions, 1061 flow. Second operand 3 states. [2020-10-09 15:30:11,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:11,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:11,642 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:11,762 INFO L129 PetriNetUnfolder]: 44/540 cut-off events. [2020-10-09 15:30:11,762 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:30:11,782 INFO L80 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 540 events. 44/540 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2166 event pairs, 0 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 616. Up to 19 conditions per place. [2020-10-09 15:30:11,787 INFO L132 encePairwiseOnDemand]: 498/503 looper letters, 10 selfloop transitions, 3 changer transitions 0/472 dead transitions. [2020-10-09 15:30:11,787 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 472 transitions, 1091 flow [2020-10-09 15:30:11,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:11,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1431 transitions. [2020-10-09 15:30:11,789 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.94831013916501 [2020-10-09 15:30:11,789 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1431 transitions. [2020-10-09 15:30:11,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1431 transitions. [2020-10-09 15:30:11,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:11,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1431 transitions. [2020-10-09 15:30:11,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:11,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:11,790 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:11,790 INFO L185 Difference]: Start difference. First operand has 475 places, 470 transitions, 1061 flow. Second operand 3 states and 1431 transitions. [2020-10-09 15:30:11,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 472 transitions, 1091 flow [2020-10-09 15:30:11,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 472 transitions, 1090 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:11,795 INFO L241 Difference]: Finished difference. Result has 478 places, 472 transitions, 1084 flow [2020-10-09 15:30:11,795 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1084, PETRI_PLACES=478, PETRI_TRANSITIONS=472} [2020-10-09 15:30:11,795 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 11 predicate places. [2020-10-09 15:30:11,795 INFO L481 AbstractCegarLoop]: Abstraction has has 478 places, 472 transitions, 1084 flow [2020-10-09 15:30:11,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:11,795 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:11,795 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:30:11,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 396 mathsat -unsat_core_generation=3 [2020-10-09 15:30:11,996 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:11,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:11,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1649619420, now seen corresponding path program 1 times [2020-10-09 15:30:11,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:11,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964450533] [2020-10-09 15:30:11,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 397 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 397 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:12,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:12,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:30:12,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:30:12,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964450533] [2020-10-09 15:30:12,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:12,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:12,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367032398] [2020-10-09 15:30:12,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:12,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:12,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:12,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:12,327 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 503 [2020-10-09 15:30:12,327 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 472 transitions, 1084 flow. Second operand 3 states. [2020-10-09 15:30:12,328 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:12,328 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 503 [2020-10-09 15:30:12,328 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:12,448 INFO L129 PetriNetUnfolder]: 43/538 cut-off events. [2020-10-09 15:30:12,448 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:30:12,470 INFO L80 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 538 events. 43/538 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2154 event pairs, 0 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 613. Up to 19 conditions per place. [2020-10-09 15:30:12,475 INFO L132 encePairwiseOnDemand]: 500/503 looper letters, 5 selfloop transitions, 2 changer transitions 0/472 dead transitions. [2020-10-09 15:30:12,475 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 472 transitions, 1096 flow [2020-10-09 15:30:12,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1439 transitions. [2020-10-09 15:30:12,476 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.953611663353214 [2020-10-09 15:30:12,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1439 transitions. [2020-10-09 15:30:12,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1439 transitions. [2020-10-09 15:30:12,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:12,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1439 transitions. [2020-10-09 15:30:12,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:12,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:12,479 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:12,479 INFO L185 Difference]: Start difference. First operand has 478 places, 472 transitions, 1084 flow. Second operand 3 states and 1439 transitions. [2020-10-09 15:30:12,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 472 transitions, 1096 flow [2020-10-09 15:30:12,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 472 transitions, 1091 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:12,484 INFO L241 Difference]: Finished difference. Result has 481 places, 472 transitions, 1089 flow [2020-10-09 15:30:12,484 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1089, PETRI_PLACES=481, PETRI_TRANSITIONS=472} [2020-10-09 15:30:12,484 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 14 predicate places. [2020-10-09 15:30:12,484 INFO L481 AbstractCegarLoop]: Abstraction has has 481 places, 472 transitions, 1089 flow [2020-10-09 15:30:12,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:12,484 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:12,484 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:30:12,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 397 mathsat -unsat_core_generation=3 [2020-10-09 15:30:12,685 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:12,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:12,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1650571709, now seen corresponding path program 1 times [2020-10-09 15:30:12,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:12,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745045314] [2020-10-09 15:30:12,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 398 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 398 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:12,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:12,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:30:12,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:30:12,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745045314] [2020-10-09 15:30:12,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:12,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:12,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781035976] [2020-10-09 15:30:12,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:12,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:12,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:12,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:12,995 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 503 [2020-10-09 15:30:12,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 472 transitions, 1089 flow. Second operand 3 states. [2020-10-09 15:30:12,996 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:12,996 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 503 [2020-10-09 15:30:12,996 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:13,112 INFO L129 PetriNetUnfolder]: 42/534 cut-off events. [2020-10-09 15:30:13,112 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:30:13,133 INFO L80 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 534 events. 42/534 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2130 event pairs, 0 based on Foata normal form. 1/476 useless extension candidates. Maximal degree in co-relation 609. Up to 19 conditions per place. [2020-10-09 15:30:13,138 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 4 selfloop transitions, 1 changer transitions 0/469 dead transitions. [2020-10-09 15:30:13,138 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 469 transitions, 1084 flow [2020-10-09 15:30:13,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2020-10-09 15:30:13,139 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9542743538767395 [2020-10-09 15:30:13,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1440 transitions. [2020-10-09 15:30:13,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1440 transitions. [2020-10-09 15:30:13,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:13,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1440 transitions. [2020-10-09 15:30:13,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:13,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:13,141 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:13,141 INFO L185 Difference]: Start difference. First operand has 481 places, 472 transitions, 1089 flow. Second operand 3 states and 1440 transitions. [2020-10-09 15:30:13,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 469 transitions, 1084 flow [2020-10-09 15:30:13,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 469 transitions, 1077 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:13,145 INFO L241 Difference]: Finished difference. Result has 480 places, 469 transitions, 1069 flow [2020-10-09 15:30:13,145 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1069, PETRI_PLACES=480, PETRI_TRANSITIONS=469} [2020-10-09 15:30:13,145 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 13 predicate places. [2020-10-09 15:30:13,146 INFO L481 AbstractCegarLoop]: Abstraction has has 480 places, 469 transitions, 1069 flow [2020-10-09 15:30:13,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:13,146 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:13,146 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:30:13,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 398 mathsat -unsat_core_generation=3 [2020-10-09 15:30:13,346 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:13,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:13,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1650572732, now seen corresponding path program 1 times [2020-10-09 15:30:13,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:13,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141888392] [2020-10-09 15:30:13,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 399 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 399 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:13,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:13,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:30:13,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:30:13,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141888392] [2020-10-09 15:30:13,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:13,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:13,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458601124] [2020-10-09 15:30:13,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:13,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:13,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:13,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:13,668 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:13,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 469 transitions, 1069 flow. Second operand 3 states. [2020-10-09 15:30:13,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:13,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:13,669 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:13,786 INFO L129 PetriNetUnfolder]: 42/532 cut-off events. [2020-10-09 15:30:13,786 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:30:13,807 INFO L80 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 532 events. 42/532 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2116 event pairs, 0 based on Foata normal form. 0/472 useless extension candidates. Maximal degree in co-relation 611. Up to 19 conditions per place. [2020-10-09 15:30:13,811 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 8 selfloop transitions, 1 changer transitions 0/467 dead transitions. [2020-10-09 15:30:13,811 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 467 transitions, 1082 flow [2020-10-09 15:30:13,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1426 transitions. [2020-10-09 15:30:13,812 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9449966865473823 [2020-10-09 15:30:13,813 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1426 transitions. [2020-10-09 15:30:13,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1426 transitions. [2020-10-09 15:30:13,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:13,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1426 transitions. [2020-10-09 15:30:13,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:13,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:13,814 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:13,814 INFO L185 Difference]: Start difference. First operand has 480 places, 469 transitions, 1069 flow. Second operand 3 states and 1426 transitions. [2020-10-09 15:30:13,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 467 transitions, 1082 flow [2020-10-09 15:30:13,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 467 transitions, 1081 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:13,818 INFO L241 Difference]: Finished difference. Result has 479 places, 467 transitions, 1065 flow [2020-10-09 15:30:13,819 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1065, PETRI_PLACES=479, PETRI_TRANSITIONS=467} [2020-10-09 15:30:13,819 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 12 predicate places. [2020-10-09 15:30:13,819 INFO L481 AbstractCegarLoop]: Abstraction has has 479 places, 467 transitions, 1065 flow [2020-10-09 15:30:13,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:13,819 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:13,819 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:14,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 399 mathsat -unsat_core_generation=3 [2020-10-09 15:30:14,020 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:14,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:14,020 INFO L82 PathProgramCache]: Analyzing trace with hash -846815280, now seen corresponding path program 1 times [2020-10-09 15:30:14,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:14,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494548718] [2020-10-09 15:30:14,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 400 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 400 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:14,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:14,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:30:14,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:30:14,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494548718] [2020-10-09 15:30:14,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:14,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:14,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277477766] [2020-10-09 15:30:14,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:14,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:14,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:14,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:14,344 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:14,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 467 transitions, 1065 flow. Second operand 3 states. [2020-10-09 15:30:14,345 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:14,345 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:14,345 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:14,469 INFO L129 PetriNetUnfolder]: 41/540 cut-off events. [2020-10-09 15:30:14,470 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:30:14,490 INFO L80 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 540 events. 41/540 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2186 event pairs, 0 based on Foata normal form. 0/480 useless extension candidates. Maximal degree in co-relation 623. Up to 19 conditions per place. [2020-10-09 15:30:14,495 INFO L132 encePairwiseOnDemand]: 498/503 looper letters, 10 selfloop transitions, 3 changer transitions 0/469 dead transitions. [2020-10-09 15:30:14,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 469 transitions, 1095 flow [2020-10-09 15:30:14,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1431 transitions. [2020-10-09 15:30:14,496 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.94831013916501 [2020-10-09 15:30:14,496 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1431 transitions. [2020-10-09 15:30:14,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1431 transitions. [2020-10-09 15:30:14,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:14,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1431 transitions. [2020-10-09 15:30:14,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:14,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:14,498 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:14,498 INFO L185 Difference]: Start difference. First operand has 479 places, 467 transitions, 1065 flow. Second operand 3 states and 1431 transitions. [2020-10-09 15:30:14,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 469 transitions, 1095 flow [2020-10-09 15:30:14,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 469 transitions, 1094 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:14,502 INFO L241 Difference]: Finished difference. Result has 482 places, 469 transitions, 1088 flow [2020-10-09 15:30:14,503 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1088, PETRI_PLACES=482, PETRI_TRANSITIONS=469} [2020-10-09 15:30:14,503 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 15 predicate places. [2020-10-09 15:30:14,503 INFO L481 AbstractCegarLoop]: Abstraction has has 482 places, 469 transitions, 1088 flow [2020-10-09 15:30:14,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:14,503 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:14,503 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:14,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 400 mathsat -unsat_core_generation=3 [2020-10-09 15:30:14,704 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:14,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:14,704 INFO L82 PathProgramCache]: Analyzing trace with hash -846814257, now seen corresponding path program 1 times [2020-10-09 15:30:14,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:14,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800657064] [2020-10-09 15:30:14,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 401 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 401 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:14,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:14,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:14,990 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:30:14,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:30:14,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800657064] [2020-10-09 15:30:14,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:14,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:14,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115560664] [2020-10-09 15:30:14,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:14,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:14,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:14,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:15,013 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 503 [2020-10-09 15:30:15,014 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 469 transitions, 1088 flow. Second operand 3 states. [2020-10-09 15:30:15,014 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:15,014 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 503 [2020-10-09 15:30:15,014 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:15,132 INFO L129 PetriNetUnfolder]: 40/538 cut-off events. [2020-10-09 15:30:15,132 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:30:15,152 INFO L80 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 538 events. 40/538 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2173 event pairs, 0 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 620. Up to 19 conditions per place. [2020-10-09 15:30:15,157 INFO L132 encePairwiseOnDemand]: 500/503 looper letters, 5 selfloop transitions, 2 changer transitions 0/469 dead transitions. [2020-10-09 15:30:15,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 469 transitions, 1100 flow [2020-10-09 15:30:15,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:15,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1439 transitions. [2020-10-09 15:30:15,158 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.953611663353214 [2020-10-09 15:30:15,158 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1439 transitions. [2020-10-09 15:30:15,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1439 transitions. [2020-10-09 15:30:15,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:15,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1439 transitions. [2020-10-09 15:30:15,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:15,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:15,160 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:15,160 INFO L185 Difference]: Start difference. First operand has 482 places, 469 transitions, 1088 flow. Second operand 3 states and 1439 transitions. [2020-10-09 15:30:15,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 469 transitions, 1100 flow [2020-10-09 15:30:15,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 469 transitions, 1095 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:15,165 INFO L241 Difference]: Finished difference. Result has 485 places, 469 transitions, 1093 flow [2020-10-09 15:30:15,165 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1079, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1093, PETRI_PLACES=485, PETRI_TRANSITIONS=469} [2020-10-09 15:30:15,165 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 18 predicate places. [2020-10-09 15:30:15,165 INFO L481 AbstractCegarLoop]: Abstraction has has 485 places, 469 transitions, 1093 flow [2020-10-09 15:30:15,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:15,165 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:15,165 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:15,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 401 mathsat -unsat_core_generation=3 [2020-10-09 15:30:15,366 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:15,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:15,367 INFO L82 PathProgramCache]: Analyzing trace with hash -845861968, now seen corresponding path program 1 times [2020-10-09 15:30:15,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:15,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052955326] [2020-10-09 15:30:15,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 402 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 402 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:15,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:15,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:15,709 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:30:15,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:30:15,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052955326] [2020-10-09 15:30:15,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:15,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:15,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350869263] [2020-10-09 15:30:15,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:15,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:15,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:15,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:15,729 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 503 [2020-10-09 15:30:15,730 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 469 transitions, 1093 flow. Second operand 3 states. [2020-10-09 15:30:15,730 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:15,730 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 503 [2020-10-09 15:30:15,730 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:15,850 INFO L129 PetriNetUnfolder]: 39/534 cut-off events. [2020-10-09 15:30:15,850 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:30:15,871 INFO L80 FinitePrefix]: Finished finitePrefix Result has 657 conditions, 534 events. 39/534 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2147 event pairs, 0 based on Foata normal form. 1/479 useless extension candidates. Maximal degree in co-relation 616. Up to 19 conditions per place. [2020-10-09 15:30:15,875 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 4 selfloop transitions, 1 changer transitions 0/466 dead transitions. [2020-10-09 15:30:15,875 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 466 transitions, 1088 flow [2020-10-09 15:30:15,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:15,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:15,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2020-10-09 15:30:15,877 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9542743538767395 [2020-10-09 15:30:15,877 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1440 transitions. [2020-10-09 15:30:15,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1440 transitions. [2020-10-09 15:30:15,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:15,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1440 transitions. [2020-10-09 15:30:15,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:15,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:15,880 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:15,880 INFO L185 Difference]: Start difference. First operand has 485 places, 469 transitions, 1093 flow. Second operand 3 states and 1440 transitions. [2020-10-09 15:30:15,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 466 transitions, 1088 flow [2020-10-09 15:30:15,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 466 transitions, 1081 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:15,886 INFO L241 Difference]: Finished difference. Result has 484 places, 466 transitions, 1073 flow [2020-10-09 15:30:15,886 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1073, PETRI_PLACES=484, PETRI_TRANSITIONS=466} [2020-10-09 15:30:15,886 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 17 predicate places. [2020-10-09 15:30:15,886 INFO L481 AbstractCegarLoop]: Abstraction has has 484 places, 466 transitions, 1073 flow [2020-10-09 15:30:15,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:15,887 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:15,887 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:16,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 402 mathsat -unsat_core_generation=3 [2020-10-09 15:30:16,095 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:16,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:16,096 INFO L82 PathProgramCache]: Analyzing trace with hash -845860945, now seen corresponding path program 1 times [2020-10-09 15:30:16,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:16,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654674590] [2020-10-09 15:30:16,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 403 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 403 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:16,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:16,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:30:16,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:30:16,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654674590] [2020-10-09 15:30:16,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:16,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:16,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213426729] [2020-10-09 15:30:16,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:16,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:16,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:16,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:16,418 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:16,419 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 466 transitions, 1073 flow. Second operand 3 states. [2020-10-09 15:30:16,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:16,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:16,419 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:16,539 INFO L129 PetriNetUnfolder]: 39/532 cut-off events. [2020-10-09 15:30:16,539 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:30:16,559 INFO L80 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 532 events. 39/532 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2134 event pairs, 0 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 618. Up to 19 conditions per place. [2020-10-09 15:30:16,563 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 8 selfloop transitions, 1 changer transitions 0/464 dead transitions. [2020-10-09 15:30:16,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 464 transitions, 1086 flow [2020-10-09 15:30:16,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:16,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:16,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1426 transitions. [2020-10-09 15:30:16,565 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9449966865473823 [2020-10-09 15:30:16,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1426 transitions. [2020-10-09 15:30:16,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1426 transitions. [2020-10-09 15:30:16,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:16,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1426 transitions. [2020-10-09 15:30:16,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:16,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:16,567 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:16,567 INFO L185 Difference]: Start difference. First operand has 484 places, 466 transitions, 1073 flow. Second operand 3 states and 1426 transitions. [2020-10-09 15:30:16,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 464 transitions, 1086 flow [2020-10-09 15:30:16,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 464 transitions, 1085 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:16,571 INFO L241 Difference]: Finished difference. Result has 483 places, 464 transitions, 1069 flow [2020-10-09 15:30:16,571 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1069, PETRI_PLACES=483, PETRI_TRANSITIONS=464} [2020-10-09 15:30:16,571 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 16 predicate places. [2020-10-09 15:30:16,571 INFO L481 AbstractCegarLoop]: Abstraction has has 483 places, 464 transitions, 1069 flow [2020-10-09 15:30:16,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:16,572 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:16,572 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:16,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 403 mathsat -unsat_core_generation=3 [2020-10-09 15:30:16,772 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:16,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:16,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2098931748, now seen corresponding path program 1 times [2020-10-09 15:30:16,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:16,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663792486] [2020-10-09 15:30:16,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 404 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 404 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:17,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:17,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:30:17,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:30:17,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663792486] [2020-10-09 15:30:17,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:17,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:17,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685644009] [2020-10-09 15:30:17,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:17,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:17,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:17,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:17,088 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 503 [2020-10-09 15:30:17,089 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 464 transitions, 1069 flow. Second operand 3 states. [2020-10-09 15:30:17,089 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:17,089 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 503 [2020-10-09 15:30:17,089 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:17,204 INFO L129 PetriNetUnfolder]: 38/539 cut-off events. [2020-10-09 15:30:17,205 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:30:17,224 INFO L80 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 539 events. 38/539 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2192 event pairs, 0 based on Foata normal form. 1/484 useless extension candidates. Maximal degree in co-relation 621. Up to 19 conditions per place. [2020-10-09 15:30:17,229 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 4 selfloop transitions, 1 changer transitions 0/464 dead transitions. [2020-10-09 15:30:17,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 464 transitions, 1079 flow [2020-10-09 15:30:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2020-10-09 15:30:17,230 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9542743538767395 [2020-10-09 15:30:17,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1440 transitions. [2020-10-09 15:30:17,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1440 transitions. [2020-10-09 15:30:17,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:17,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1440 transitions. [2020-10-09 15:30:17,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:17,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:17,232 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:17,232 INFO L185 Difference]: Start difference. First operand has 483 places, 464 transitions, 1069 flow. Second operand 3 states and 1440 transitions. [2020-10-09 15:30:17,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 464 transitions, 1079 flow [2020-10-09 15:30:17,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 464 transitions, 1078 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:17,236 INFO L241 Difference]: Finished difference. Result has 485 places, 464 transitions, 1073 flow [2020-10-09 15:30:17,236 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1073, PETRI_PLACES=485, PETRI_TRANSITIONS=464} [2020-10-09 15:30:17,236 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 18 predicate places. [2020-10-09 15:30:17,237 INFO L481 AbstractCegarLoop]: Abstraction has has 485 places, 464 transitions, 1073 flow [2020-10-09 15:30:17,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:17,237 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:17,237 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:17,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 404 mathsat -unsat_core_generation=3 [2020-10-09 15:30:17,437 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:17,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:17,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2098932771, now seen corresponding path program 1 times [2020-10-09 15:30:17,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:17,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476338569] [2020-10-09 15:30:17,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 405 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 405 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:17,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:17,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:30:17,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:30:17,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476338569] [2020-10-09 15:30:17,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:17,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:17,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252264031] [2020-10-09 15:30:17,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:17,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:17,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:17,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:17,757 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:17,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 464 transitions, 1073 flow. Second operand 3 states. [2020-10-09 15:30:17,758 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:17,758 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:17,758 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:17,883 INFO L129 PetriNetUnfolder]: 36/541 cut-off events. [2020-10-09 15:30:17,883 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:17,904 INFO L80 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 541 events. 36/541 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2224 event pairs, 0 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 634. Up to 19 conditions per place. [2020-10-09 15:30:17,908 INFO L132 encePairwiseOnDemand]: 499/503 looper letters, 9 selfloop transitions, 3 changer transitions 0/465 dead transitions. [2020-10-09 15:30:17,909 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 465 transitions, 1099 flow [2020-10-09 15:30:17,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1429 transitions. [2020-10-09 15:30:17,910 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9469847581179589 [2020-10-09 15:30:17,910 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1429 transitions. [2020-10-09 15:30:17,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1429 transitions. [2020-10-09 15:30:17,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:17,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1429 transitions. [2020-10-09 15:30:17,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:17,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:17,911 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:17,912 INFO L185 Difference]: Start difference. First operand has 485 places, 464 transitions, 1073 flow. Second operand 3 states and 1429 transitions. [2020-10-09 15:30:17,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 465 transitions, 1099 flow [2020-10-09 15:30:17,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 465 transitions, 1098 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:17,916 INFO L241 Difference]: Finished difference. Result has 488 places, 465 transitions, 1090 flow [2020-10-09 15:30:17,916 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1090, PETRI_PLACES=488, PETRI_TRANSITIONS=465} [2020-10-09 15:30:17,916 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 21 predicate places. [2020-10-09 15:30:17,916 INFO L481 AbstractCegarLoop]: Abstraction has has 488 places, 465 transitions, 1090 flow [2020-10-09 15:30:17,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:17,917 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:17,917 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:18,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 405 mathsat -unsat_core_generation=3 [2020-10-09 15:30:18,117 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:18,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:18,118 INFO L82 PathProgramCache]: Analyzing trace with hash 2097979459, now seen corresponding path program 1 times [2020-10-09 15:30:18,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:18,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353426170] [2020-10-09 15:30:18,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 406 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 406 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:18,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:18,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:30:18,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:30:18,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353426170] [2020-10-09 15:30:18,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:18,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:18,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145760149] [2020-10-09 15:30:18,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:18,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:18,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:18,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:18,429 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 503 [2020-10-09 15:30:18,430 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 465 transitions, 1090 flow. Second operand 3 states. [2020-10-09 15:30:18,430 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:18,430 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 503 [2020-10-09 15:30:18,430 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:18,551 INFO L129 PetriNetUnfolder]: 36/534 cut-off events. [2020-10-09 15:30:18,551 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:30:18,572 INFO L80 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 534 events. 36/534 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2164 event pairs, 0 based on Foata normal form. 1/482 useless extension candidates. Maximal degree in co-relation 620. Up to 19 conditions per place. [2020-10-09 15:30:18,576 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 5 selfloop transitions, 1 changer transitions 0/463 dead transitions. [2020-10-09 15:30:18,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 463 transitions, 1092 flow [2020-10-09 15:30:18,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2020-10-09 15:30:18,577 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9529489728296885 [2020-10-09 15:30:18,578 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2020-10-09 15:30:18,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2020-10-09 15:30:18,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:18,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2020-10-09 15:30:18,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:18,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:18,579 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:18,579 INFO L185 Difference]: Start difference. First operand has 488 places, 465 transitions, 1090 flow. Second operand 3 states and 1438 transitions. [2020-10-09 15:30:18,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 490 places, 463 transitions, 1092 flow [2020-10-09 15:30:18,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 463 transitions, 1084 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:18,584 INFO L241 Difference]: Finished difference. Result has 488 places, 463 transitions, 1077 flow [2020-10-09 15:30:18,584 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1077, PETRI_PLACES=488, PETRI_TRANSITIONS=463} [2020-10-09 15:30:18,584 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 21 predicate places. [2020-10-09 15:30:18,584 INFO L481 AbstractCegarLoop]: Abstraction has has 488 places, 463 transitions, 1077 flow [2020-10-09 15:30:18,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:18,584 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:18,584 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:18,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 406 mathsat -unsat_core_generation=3 [2020-10-09 15:30:18,785 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:18,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:18,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2097978436, now seen corresponding path program 1 times [2020-10-09 15:30:18,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:18,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159313301] [2020-10-09 15:30:18,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 407 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 407 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:19,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:19,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:30:19,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:30:19,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159313301] [2020-10-09 15:30:19,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:19,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:19,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651042161] [2020-10-09 15:30:19,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:19,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:19,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:19,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:19,102 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:19,103 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 463 transitions, 1077 flow. Second operand 3 states. [2020-10-09 15:30:19,103 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:19,103 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:19,103 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:19,243 INFO L129 PetriNetUnfolder]: 36/532 cut-off events. [2020-10-09 15:30:19,243 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:19,263 INFO L80 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 532 events. 36/532 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2147 event pairs, 0 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 624. Up to 19 conditions per place. [2020-10-09 15:30:19,267 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 8 selfloop transitions, 1 changer transitions 0/461 dead transitions. [2020-10-09 15:30:19,267 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 461 transitions, 1090 flow [2020-10-09 15:30:19,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1426 transitions. [2020-10-09 15:30:19,268 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9449966865473823 [2020-10-09 15:30:19,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1426 transitions. [2020-10-09 15:30:19,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1426 transitions. [2020-10-09 15:30:19,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:19,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1426 transitions. [2020-10-09 15:30:19,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:19,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:19,270 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:19,270 INFO L185 Difference]: Start difference. First operand has 488 places, 463 transitions, 1077 flow. Second operand 3 states and 1426 transitions. [2020-10-09 15:30:19,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 461 transitions, 1090 flow [2020-10-09 15:30:19,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 461 transitions, 1089 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:19,275 INFO L241 Difference]: Finished difference. Result has 487 places, 461 transitions, 1073 flow [2020-10-09 15:30:19,275 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1073, PETRI_PLACES=487, PETRI_TRANSITIONS=461} [2020-10-09 15:30:19,275 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 20 predicate places. [2020-10-09 15:30:19,275 INFO L481 AbstractCegarLoop]: Abstraction has has 487 places, 461 transitions, 1073 flow [2020-10-09 15:30:19,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:19,275 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:19,275 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:19,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 407 mathsat -unsat_core_generation=3 [2020-10-09 15:30:19,476 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:19,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:19,476 INFO L82 PathProgramCache]: Analyzing trace with hash 687990425, now seen corresponding path program 1 times [2020-10-09 15:30:19,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:19,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621034658] [2020-10-09 15:30:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 408 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 408 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:19,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:19,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:30:19,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:30:19,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621034658] [2020-10-09 15:30:19,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:19,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:19,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766622646] [2020-10-09 15:30:19,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:19,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:19,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:19,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:19,787 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 503 [2020-10-09 15:30:19,787 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 461 transitions, 1073 flow. Second operand 3 states. [2020-10-09 15:30:19,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:19,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 503 [2020-10-09 15:30:19,788 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:19,921 INFO L129 PetriNetUnfolder]: 35/539 cut-off events. [2020-10-09 15:30:19,921 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:30:19,941 INFO L80 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 539 events. 35/539 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2211 event pairs, 0 based on Foata normal form. 1/487 useless extension candidates. Maximal degree in co-relation 627. Up to 19 conditions per place. [2020-10-09 15:30:19,945 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 4 selfloop transitions, 1 changer transitions 0/461 dead transitions. [2020-10-09 15:30:19,945 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 461 transitions, 1083 flow [2020-10-09 15:30:19,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2020-10-09 15:30:19,946 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9542743538767395 [2020-10-09 15:30:19,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1440 transitions. [2020-10-09 15:30:19,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1440 transitions. [2020-10-09 15:30:19,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:19,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1440 transitions. [2020-10-09 15:30:19,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:19,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:19,948 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:19,948 INFO L185 Difference]: Start difference. First operand has 487 places, 461 transitions, 1073 flow. Second operand 3 states and 1440 transitions. [2020-10-09 15:30:19,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 461 transitions, 1083 flow [2020-10-09 15:30:19,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 461 transitions, 1082 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:19,952 INFO L241 Difference]: Finished difference. Result has 489 places, 461 transitions, 1077 flow [2020-10-09 15:30:19,953 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1077, PETRI_PLACES=489, PETRI_TRANSITIONS=461} [2020-10-09 15:30:19,953 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 22 predicate places. [2020-10-09 15:30:19,953 INFO L481 AbstractCegarLoop]: Abstraction has has 489 places, 461 transitions, 1077 flow [2020-10-09 15:30:19,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:19,953 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:19,953 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:20,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 408 mathsat -unsat_core_generation=3 [2020-10-09 15:30:20,154 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:20,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:20,154 INFO L82 PathProgramCache]: Analyzing trace with hash 687991448, now seen corresponding path program 1 times [2020-10-09 15:30:20,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:20,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494374697] [2020-10-09 15:30:20,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 409 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 409 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:20,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:20,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:20,444 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:30:20,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:30:20,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494374697] [2020-10-09 15:30:20,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:20,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:20,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63461795] [2020-10-09 15:30:20,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:20,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:20,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:20,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:20,465 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:20,466 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 461 transitions, 1077 flow. Second operand 3 states. [2020-10-09 15:30:20,466 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:20,467 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:20,467 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:20,596 INFO L129 PetriNetUnfolder]: 33/541 cut-off events. [2020-10-09 15:30:20,596 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:20,617 INFO L80 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 541 events. 33/541 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2241 event pairs, 0 based on Foata normal form. 0/488 useless extension candidates. Maximal degree in co-relation 640. Up to 19 conditions per place. [2020-10-09 15:30:20,621 INFO L132 encePairwiseOnDemand]: 499/503 looper letters, 9 selfloop transitions, 3 changer transitions 0/462 dead transitions. [2020-10-09 15:30:20,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 462 transitions, 1103 flow [2020-10-09 15:30:20,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1429 transitions. [2020-10-09 15:30:20,622 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9469847581179589 [2020-10-09 15:30:20,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1429 transitions. [2020-10-09 15:30:20,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1429 transitions. [2020-10-09 15:30:20,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:20,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1429 transitions. [2020-10-09 15:30:20,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:20,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:20,624 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:20,624 INFO L185 Difference]: Start difference. First operand has 489 places, 461 transitions, 1077 flow. Second operand 3 states and 1429 transitions. [2020-10-09 15:30:20,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 462 transitions, 1103 flow [2020-10-09 15:30:20,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 462 transitions, 1102 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:20,628 INFO L241 Difference]: Finished difference. Result has 492 places, 462 transitions, 1094 flow [2020-10-09 15:30:20,629 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=488, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1094, PETRI_PLACES=492, PETRI_TRANSITIONS=462} [2020-10-09 15:30:20,629 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 25 predicate places. [2020-10-09 15:30:20,629 INFO L481 AbstractCegarLoop]: Abstraction has has 492 places, 462 transitions, 1094 flow [2020-10-09 15:30:20,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:20,629 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:20,629 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:20,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 409 mathsat -unsat_core_generation=3 [2020-10-09 15:30:20,830 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:20,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:20,830 INFO L82 PathProgramCache]: Analyzing trace with hash 687038136, now seen corresponding path program 1 times [2020-10-09 15:30:20,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:20,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998759563] [2020-10-09 15:30:20,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 410 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 410 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:21,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:21,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:30:21,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:30:21,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998759563] [2020-10-09 15:30:21,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:21,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:21,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671305908] [2020-10-09 15:30:21,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:21,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:21,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:21,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:21,131 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 503 [2020-10-09 15:30:21,132 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 462 transitions, 1094 flow. Second operand 3 states. [2020-10-09 15:30:21,132 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:21,133 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 503 [2020-10-09 15:30:21,133 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:21,254 INFO L129 PetriNetUnfolder]: 33/534 cut-off events. [2020-10-09 15:30:21,255 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:30:21,275 INFO L80 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 534 events. 33/534 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2180 event pairs, 0 based on Foata normal form. 1/485 useless extension candidates. Maximal degree in co-relation 626. Up to 19 conditions per place. [2020-10-09 15:30:21,279 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 5 selfloop transitions, 1 changer transitions 0/460 dead transitions. [2020-10-09 15:30:21,279 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 460 transitions, 1096 flow [2020-10-09 15:30:21,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:21,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:21,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2020-10-09 15:30:21,280 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9529489728296885 [2020-10-09 15:30:21,280 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2020-10-09 15:30:21,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2020-10-09 15:30:21,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:21,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2020-10-09 15:30:21,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:21,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:21,283 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:21,283 INFO L185 Difference]: Start difference. First operand has 492 places, 462 transitions, 1094 flow. Second operand 3 states and 1438 transitions. [2020-10-09 15:30:21,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 460 transitions, 1096 flow [2020-10-09 15:30:21,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 460 transitions, 1088 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:21,287 INFO L241 Difference]: Finished difference. Result has 492 places, 460 transitions, 1081 flow [2020-10-09 15:30:21,287 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1081, PETRI_PLACES=492, PETRI_TRANSITIONS=460} [2020-10-09 15:30:21,288 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 25 predicate places. [2020-10-09 15:30:21,288 INFO L481 AbstractCegarLoop]: Abstraction has has 492 places, 460 transitions, 1081 flow [2020-10-09 15:30:21,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:21,288 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:21,288 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:21,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 410 mathsat -unsat_core_generation=3 [2020-10-09 15:30:21,489 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:21,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:21,489 INFO L82 PathProgramCache]: Analyzing trace with hash 687037113, now seen corresponding path program 1 times [2020-10-09 15:30:21,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:21,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995041464] [2020-10-09 15:30:21,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 411 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 411 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:21,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:21,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:30:21,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:30:21,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995041464] [2020-10-09 15:30:21,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:21,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:21,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004568742] [2020-10-09 15:30:21,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:21,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:21,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:21,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:21,818 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:21,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 460 transitions, 1081 flow. Second operand 3 states. [2020-10-09 15:30:21,819 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:21,819 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:21,819 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:21,945 INFO L129 PetriNetUnfolder]: 33/532 cut-off events. [2020-10-09 15:30:21,945 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:21,965 INFO L80 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 532 events. 33/532 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2165 event pairs, 0 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 630. Up to 19 conditions per place. [2020-10-09 15:30:21,969 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 8 selfloop transitions, 1 changer transitions 0/458 dead transitions. [2020-10-09 15:30:21,969 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 458 transitions, 1094 flow [2020-10-09 15:30:21,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:21,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1426 transitions. [2020-10-09 15:30:21,971 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9449966865473823 [2020-10-09 15:30:21,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1426 transitions. [2020-10-09 15:30:21,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1426 transitions. [2020-10-09 15:30:21,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:21,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1426 transitions. [2020-10-09 15:30:21,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:21,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:21,972 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:21,972 INFO L185 Difference]: Start difference. First operand has 492 places, 460 transitions, 1081 flow. Second operand 3 states and 1426 transitions. [2020-10-09 15:30:21,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 458 transitions, 1094 flow [2020-10-09 15:30:21,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 458 transitions, 1093 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:21,977 INFO L241 Difference]: Finished difference. Result has 491 places, 458 transitions, 1077 flow [2020-10-09 15:30:21,977 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1077, PETRI_PLACES=491, PETRI_TRANSITIONS=458} [2020-10-09 15:30:21,977 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 24 predicate places. [2020-10-09 15:30:21,977 INFO L481 AbstractCegarLoop]: Abstraction has has 491 places, 458 transitions, 1077 flow [2020-10-09 15:30:21,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:21,977 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:21,977 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:22,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 411 mathsat -unsat_core_generation=3 [2020-10-09 15:30:22,178 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:22,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:22,178 INFO L82 PathProgramCache]: Analyzing trace with hash -486771025, now seen corresponding path program 1 times [2020-10-09 15:30:22,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:22,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91962166] [2020-10-09 15:30:22,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 412 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 412 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:22,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:22,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:30:22,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:22,477 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:30:22,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91962166] [2020-10-09 15:30:22,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:22,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:22,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834908356] [2020-10-09 15:30:22,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:22,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:22,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:22,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:22,497 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:22,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 458 transitions, 1077 flow. Second operand 3 states. [2020-10-09 15:30:22,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:22,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:22,498 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:22,660 INFO L129 PetriNetUnfolder]: 32/540 cut-off events. [2020-10-09 15:30:22,660 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:30:22,677 INFO L80 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 540 events. 32/540 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2235 event pairs, 0 based on Foata normal form. 0/489 useless extension candidates. Maximal degree in co-relation 642. Up to 19 conditions per place. [2020-10-09 15:30:22,681 INFO L132 encePairwiseOnDemand]: 498/503 looper letters, 10 selfloop transitions, 3 changer transitions 0/460 dead transitions. [2020-10-09 15:30:22,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 460 transitions, 1107 flow [2020-10-09 15:30:22,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1431 transitions. [2020-10-09 15:30:22,682 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.94831013916501 [2020-10-09 15:30:22,682 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1431 transitions. [2020-10-09 15:30:22,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1431 transitions. [2020-10-09 15:30:22,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:22,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1431 transitions. [2020-10-09 15:30:22,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:22,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:22,684 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:22,684 INFO L185 Difference]: Start difference. First operand has 491 places, 458 transitions, 1077 flow. Second operand 3 states and 1431 transitions. [2020-10-09 15:30:22,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 460 transitions, 1107 flow [2020-10-09 15:30:22,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 460 transitions, 1106 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:22,688 INFO L241 Difference]: Finished difference. Result has 494 places, 460 transitions, 1100 flow [2020-10-09 15:30:22,689 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1100, PETRI_PLACES=494, PETRI_TRANSITIONS=460} [2020-10-09 15:30:22,689 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 27 predicate places. [2020-10-09 15:30:22,689 INFO L481 AbstractCegarLoop]: Abstraction has has 494 places, 460 transitions, 1100 flow [2020-10-09 15:30:22,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:22,689 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:22,689 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:22,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 412 mathsat -unsat_core_generation=3 [2020-10-09 15:30:22,890 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:22,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:22,890 INFO L82 PathProgramCache]: Analyzing trace with hash -486770002, now seen corresponding path program 1 times [2020-10-09 15:30:22,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:22,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51182876] [2020-10-09 15:30:22,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 413 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 413 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:23,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:23,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:30:23,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:30:23,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51182876] [2020-10-09 15:30:23,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:23,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:23,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569419852] [2020-10-09 15:30:23,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:23,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:23,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:23,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:23,195 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 503 [2020-10-09 15:30:23,196 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 460 transitions, 1100 flow. Second operand 3 states. [2020-10-09 15:30:23,196 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:23,196 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 503 [2020-10-09 15:30:23,196 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:23,323 INFO L129 PetriNetUnfolder]: 31/538 cut-off events. [2020-10-09 15:30:23,323 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:30:23,343 INFO L80 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 538 events. 31/538 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2225 event pairs, 0 based on Foata normal form. 0/490 useless extension candidates. Maximal degree in co-relation 639. Up to 19 conditions per place. [2020-10-09 15:30:23,347 INFO L132 encePairwiseOnDemand]: 500/503 looper letters, 5 selfloop transitions, 2 changer transitions 0/460 dead transitions. [2020-10-09 15:30:23,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 460 transitions, 1112 flow [2020-10-09 15:30:23,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:23,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1439 transitions. [2020-10-09 15:30:23,348 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.953611663353214 [2020-10-09 15:30:23,348 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1439 transitions. [2020-10-09 15:30:23,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1439 transitions. [2020-10-09 15:30:23,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:23,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1439 transitions. [2020-10-09 15:30:23,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:23,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:23,350 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:23,350 INFO L185 Difference]: Start difference. First operand has 494 places, 460 transitions, 1100 flow. Second operand 3 states and 1439 transitions. [2020-10-09 15:30:23,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 460 transitions, 1112 flow [2020-10-09 15:30:23,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 460 transitions, 1107 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:23,354 INFO L241 Difference]: Finished difference. Result has 497 places, 460 transitions, 1105 flow [2020-10-09 15:30:23,355 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1105, PETRI_PLACES=497, PETRI_TRANSITIONS=460} [2020-10-09 15:30:23,355 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 30 predicate places. [2020-10-09 15:30:23,355 INFO L481 AbstractCegarLoop]: Abstraction has has 497 places, 460 transitions, 1105 flow [2020-10-09 15:30:23,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:23,355 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:23,355 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:23,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 413 mathsat -unsat_core_generation=3 [2020-10-09 15:30:23,556 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:23,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:23,556 INFO L82 PathProgramCache]: Analyzing trace with hash -485817713, now seen corresponding path program 1 times [2020-10-09 15:30:23,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:23,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91172184] [2020-10-09 15:30:23,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 414 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 414 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:23,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:23,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:30:23,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:30:23,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91172184] [2020-10-09 15:30:23,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:23,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:23,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530796683] [2020-10-09 15:30:23,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:23,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:23,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:23,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:23,877 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 503 [2020-10-09 15:30:23,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 460 transitions, 1105 flow. Second operand 3 states. [2020-10-09 15:30:23,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:23,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 503 [2020-10-09 15:30:23,878 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:24,004 INFO L129 PetriNetUnfolder]: 30/534 cut-off events. [2020-10-09 15:30:24,005 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:30:24,026 INFO L80 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 534 events. 30/534 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2202 event pairs, 0 based on Foata normal form. 1/488 useless extension candidates. Maximal degree in co-relation 635. Up to 19 conditions per place. [2020-10-09 15:30:24,029 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 4 selfloop transitions, 1 changer transitions 0/457 dead transitions. [2020-10-09 15:30:24,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 457 transitions, 1100 flow [2020-10-09 15:30:24,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2020-10-09 15:30:24,031 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9542743538767395 [2020-10-09 15:30:24,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1440 transitions. [2020-10-09 15:30:24,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1440 transitions. [2020-10-09 15:30:24,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:24,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1440 transitions. [2020-10-09 15:30:24,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:24,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:24,032 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:24,032 INFO L185 Difference]: Start difference. First operand has 497 places, 460 transitions, 1105 flow. Second operand 3 states and 1440 transitions. [2020-10-09 15:30:24,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 457 transitions, 1100 flow [2020-10-09 15:30:24,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 457 transitions, 1093 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:24,037 INFO L241 Difference]: Finished difference. Result has 496 places, 457 transitions, 1085 flow [2020-10-09 15:30:24,037 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1083, PETRI_DIFFERENCE_MINUEND_PLACES=494, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1085, PETRI_PLACES=496, PETRI_TRANSITIONS=457} [2020-10-09 15:30:24,037 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 29 predicate places. [2020-10-09 15:30:24,037 INFO L481 AbstractCegarLoop]: Abstraction has has 496 places, 457 transitions, 1085 flow [2020-10-09 15:30:24,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:24,037 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:24,037 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:24,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 414 mathsat -unsat_core_generation=3 [2020-10-09 15:30:24,238 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:24,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:24,239 INFO L82 PathProgramCache]: Analyzing trace with hash -485816690, now seen corresponding path program 1 times [2020-10-09 15:30:24,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:24,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153146775] [2020-10-09 15:30:24,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 415 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 415 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:24,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:24,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:30:24,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:24,531 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:30:24,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153146775] [2020-10-09 15:30:24,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:24,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:24,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609958090] [2020-10-09 15:30:24,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:24,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:24,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:24,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:24,566 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:24,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 457 transitions, 1085 flow. Second operand 3 states. [2020-10-09 15:30:24,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:24,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:24,567 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:24,727 INFO L129 PetriNetUnfolder]: 30/532 cut-off events. [2020-10-09 15:30:24,727 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:30:24,749 INFO L80 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 532 events. 30/532 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2187 event pairs, 0 based on Foata normal form. 0/484 useless extension candidates. Maximal degree in co-relation 637. Up to 19 conditions per place. [2020-10-09 15:30:24,752 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 8 selfloop transitions, 1 changer transitions 0/455 dead transitions. [2020-10-09 15:30:24,752 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 455 transitions, 1098 flow [2020-10-09 15:30:24,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1426 transitions. [2020-10-09 15:30:24,753 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9449966865473823 [2020-10-09 15:30:24,753 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1426 transitions. [2020-10-09 15:30:24,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1426 transitions. [2020-10-09 15:30:24,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:24,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1426 transitions. [2020-10-09 15:30:24,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:24,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:24,755 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:24,755 INFO L185 Difference]: Start difference. First operand has 496 places, 457 transitions, 1085 flow. Second operand 3 states and 1426 transitions. [2020-10-09 15:30:24,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 455 transitions, 1098 flow [2020-10-09 15:30:24,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 455 transitions, 1097 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:24,759 INFO L241 Difference]: Finished difference. Result has 495 places, 455 transitions, 1081 flow [2020-10-09 15:30:24,760 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1079, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1081, PETRI_PLACES=495, PETRI_TRANSITIONS=455} [2020-10-09 15:30:24,760 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 28 predicate places. [2020-10-09 15:30:24,760 INFO L481 AbstractCegarLoop]: Abstraction has has 495 places, 455 transitions, 1081 flow [2020-10-09 15:30:24,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:24,760 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:24,760 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:24,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 415 mathsat -unsat_core_generation=3 [2020-10-09 15:30:24,961 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:24,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:24,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2124413051, now seen corresponding path program 1 times [2020-10-09 15:30:24,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:24,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268012961] [2020-10-09 15:30:24,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 416 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 416 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:25,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:25,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:30:25,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:30:25,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268012961] [2020-10-09 15:30:25,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:25,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:25,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44158593] [2020-10-09 15:30:25,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:25,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:25,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:25,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:25,295 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:25,295 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 455 transitions, 1081 flow. Second operand 3 states. [2020-10-09 15:30:25,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:25,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:25,296 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:25,427 INFO L129 PetriNetUnfolder]: 29/540 cut-off events. [2020-10-09 15:30:25,428 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:30:25,449 INFO L80 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 540 events. 29/540 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2257 event pairs, 0 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 649. Up to 19 conditions per place. [2020-10-09 15:30:25,452 INFO L132 encePairwiseOnDemand]: 498/503 looper letters, 10 selfloop transitions, 3 changer transitions 0/457 dead transitions. [2020-10-09 15:30:25,452 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 457 transitions, 1111 flow [2020-10-09 15:30:25,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1431 transitions. [2020-10-09 15:30:25,453 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.94831013916501 [2020-10-09 15:30:25,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1431 transitions. [2020-10-09 15:30:25,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1431 transitions. [2020-10-09 15:30:25,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:25,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1431 transitions. [2020-10-09 15:30:25,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:25,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:25,455 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:25,455 INFO L185 Difference]: Start difference. First operand has 495 places, 455 transitions, 1081 flow. Second operand 3 states and 1431 transitions. [2020-10-09 15:30:25,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 497 places, 457 transitions, 1111 flow [2020-10-09 15:30:25,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 457 transitions, 1110 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:25,460 INFO L241 Difference]: Finished difference. Result has 498 places, 457 transitions, 1104 flow [2020-10-09 15:30:25,460 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=494, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1104, PETRI_PLACES=498, PETRI_TRANSITIONS=457} [2020-10-09 15:30:25,460 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 31 predicate places. [2020-10-09 15:30:25,460 INFO L481 AbstractCegarLoop]: Abstraction has has 498 places, 457 transitions, 1104 flow [2020-10-09 15:30:25,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:25,460 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:25,460 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:25,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 416 mathsat -unsat_core_generation=3 [2020-10-09 15:30:25,661 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:25,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:25,661 INFO L82 PathProgramCache]: Analyzing trace with hash -2124414074, now seen corresponding path program 1 times [2020-10-09 15:30:25,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:25,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166484099] [2020-10-09 15:30:25,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 417 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 417 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:25,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:25,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:25,956 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:30:25,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:30:25,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166484099] [2020-10-09 15:30:25,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:25,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:25,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355014601] [2020-10-09 15:30:25,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:25,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:25,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:25,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:25,983 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 503 [2020-10-09 15:30:25,984 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 457 transitions, 1104 flow. Second operand 3 states. [2020-10-09 15:30:25,984 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:25,985 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 503 [2020-10-09 15:30:25,985 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:26,131 INFO L129 PetriNetUnfolder]: 27/541 cut-off events. [2020-10-09 15:30:26,131 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:30:26,145 INFO L80 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 541 events. 27/541 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2274 event pairs, 0 based on Foata normal form. 1/498 useless extension candidates. Maximal degree in co-relation 647. Up to 19 conditions per place. [2020-10-09 15:30:26,148 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 4 selfloop transitions, 1 changer transitions 0/456 dead transitions. [2020-10-09 15:30:26,148 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 456 transitions, 1110 flow [2020-10-09 15:30:26,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2020-10-09 15:30:26,149 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9542743538767395 [2020-10-09 15:30:26,149 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1440 transitions. [2020-10-09 15:30:26,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1440 transitions. [2020-10-09 15:30:26,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:26,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1440 transitions. [2020-10-09 15:30:26,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:26,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:26,151 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:26,151 INFO L185 Difference]: Start difference. First operand has 498 places, 457 transitions, 1104 flow. Second operand 3 states and 1440 transitions. [2020-10-09 15:30:26,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 500 places, 456 transitions, 1110 flow [2020-10-09 15:30:26,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 456 transitions, 1105 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:26,155 INFO L241 Difference]: Finished difference. Result has 500 places, 456 transitions, 1100 flow [2020-10-09 15:30:26,155 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1100, PETRI_PLACES=500, PETRI_TRANSITIONS=456} [2020-10-09 15:30:26,155 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 33 predicate places. [2020-10-09 15:30:26,155 INFO L481 AbstractCegarLoop]: Abstraction has has 500 places, 456 transitions, 1100 flow [2020-10-09 15:30:26,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:26,156 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:26,156 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:26,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 417 mathsat -unsat_core_generation=3 [2020-10-09 15:30:26,356 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:26,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:26,357 INFO L82 PathProgramCache]: Analyzing trace with hash -2125366363, now seen corresponding path program 1 times [2020-10-09 15:30:26,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:26,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216739095] [2020-10-09 15:30:26,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 418 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 418 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:26,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:26,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:30:26,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:30:26,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216739095] [2020-10-09 15:30:26,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:26,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:26,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534004401] [2020-10-09 15:30:26,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:26,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:26,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:26,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:26,660 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 503 [2020-10-09 15:30:26,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 456 transitions, 1100 flow. Second operand 3 states. [2020-10-09 15:30:26,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:26,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 503 [2020-10-09 15:30:26,661 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:26,781 INFO L129 PetriNetUnfolder]: 27/534 cut-off events. [2020-10-09 15:30:26,781 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:30:26,801 INFO L80 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 534 events. 27/534 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2218 event pairs, 0 based on Foata normal form. 1/491 useless extension candidates. Maximal degree in co-relation 643. Up to 19 conditions per place. [2020-10-09 15:30:26,804 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 5 selfloop transitions, 1 changer transitions 0/454 dead transitions. [2020-10-09 15:30:26,804 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 454 transitions, 1103 flow [2020-10-09 15:30:26,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2020-10-09 15:30:26,805 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9529489728296885 [2020-10-09 15:30:26,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2020-10-09 15:30:26,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2020-10-09 15:30:26,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:26,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2020-10-09 15:30:26,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:26,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:26,807 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:26,807 INFO L185 Difference]: Start difference. First operand has 500 places, 456 transitions, 1100 flow. Second operand 3 states and 1438 transitions. [2020-10-09 15:30:26,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 502 places, 454 transitions, 1103 flow [2020-10-09 15:30:26,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 454 transitions, 1096 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:26,811 INFO L241 Difference]: Finished difference. Result has 500 places, 454 transitions, 1089 flow [2020-10-09 15:30:26,811 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1089, PETRI_PLACES=500, PETRI_TRANSITIONS=454} [2020-10-09 15:30:26,811 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 33 predicate places. [2020-10-09 15:30:26,812 INFO L481 AbstractCegarLoop]: Abstraction has has 500 places, 454 transitions, 1089 flow [2020-10-09 15:30:26,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:26,812 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:26,812 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:27,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 418 mathsat -unsat_core_generation=3 [2020-10-09 15:30:27,012 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:27,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:27,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2125367386, now seen corresponding path program 1 times [2020-10-09 15:30:27,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:27,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079494250] [2020-10-09 15:30:27,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 419 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 419 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:27,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:27,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:27,306 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:30:27,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:30:27,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079494250] [2020-10-09 15:30:27,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:27,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:27,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072248772] [2020-10-09 15:30:27,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:27,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:27,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:27,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:27,342 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:27,343 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 454 transitions, 1089 flow. Second operand 3 states. [2020-10-09 15:30:27,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:27,343 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:27,344 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:27,465 INFO L129 PetriNetUnfolder]: 27/532 cut-off events. [2020-10-09 15:30:27,465 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:27,484 INFO L80 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 532 events. 27/532 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2201 event pairs, 0 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 643. Up to 19 conditions per place. [2020-10-09 15:30:27,487 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 8 selfloop transitions, 1 changer transitions 0/452 dead transitions. [2020-10-09 15:30:27,487 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 452 transitions, 1102 flow [2020-10-09 15:30:27,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1426 transitions. [2020-10-09 15:30:27,488 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9449966865473823 [2020-10-09 15:30:27,489 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1426 transitions. [2020-10-09 15:30:27,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1426 transitions. [2020-10-09 15:30:27,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:27,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1426 transitions. [2020-10-09 15:30:27,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:27,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:27,490 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:27,490 INFO L185 Difference]: Start difference. First operand has 500 places, 454 transitions, 1089 flow. Second operand 3 states and 1426 transitions. [2020-10-09 15:30:27,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 500 places, 452 transitions, 1102 flow [2020-10-09 15:30:27,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 452 transitions, 1101 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:27,495 INFO L241 Difference]: Finished difference. Result has 499 places, 452 transitions, 1085 flow [2020-10-09 15:30:27,495 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1083, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1085, PETRI_PLACES=499, PETRI_TRANSITIONS=452} [2020-10-09 15:30:27,495 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 32 predicate places. [2020-10-09 15:30:27,495 INFO L481 AbstractCegarLoop]: Abstraction has has 499 places, 452 transitions, 1085 flow [2020-10-09 15:30:27,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:27,495 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:27,495 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:27,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 419 mathsat -unsat_core_generation=3 [2020-10-09 15:30:27,696 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:27,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:27,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1392901859, now seen corresponding path program 1 times [2020-10-09 15:30:27,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:27,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353298800] [2020-10-09 15:30:27,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 420 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 420 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:27,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:27,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:27,993 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:30:27,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:30:27,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353298800] [2020-10-09 15:30:27,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:27,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:27,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265551766] [2020-10-09 15:30:27,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:27,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:27,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:27,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:28,012 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 503 [2020-10-09 15:30:28,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 452 transitions, 1085 flow. Second operand 3 states. [2020-10-09 15:30:28,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:28,014 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 503 [2020-10-09 15:30:28,014 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:28,143 INFO L129 PetriNetUnfolder]: 25/537 cut-off events. [2020-10-09 15:30:28,144 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:30:28,164 INFO L80 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 537 events. 25/537 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2252 event pairs, 0 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 646. Up to 19 conditions per place. [2020-10-09 15:30:28,167 INFO L132 encePairwiseOnDemand]: 500/503 looper letters, 5 selfloop transitions, 2 changer transitions 0/453 dead transitions. [2020-10-09 15:30:28,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 501 places, 453 transitions, 1101 flow [2020-10-09 15:30:28,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1439 transitions. [2020-10-09 15:30:28,169 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.953611663353214 [2020-10-09 15:30:28,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1439 transitions. [2020-10-09 15:30:28,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1439 transitions. [2020-10-09 15:30:28,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:28,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1439 transitions. [2020-10-09 15:30:28,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:28,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:28,170 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:28,170 INFO L185 Difference]: Start difference. First operand has 499 places, 452 transitions, 1085 flow. Second operand 3 states and 1439 transitions. [2020-10-09 15:30:28,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 501 places, 453 transitions, 1101 flow [2020-10-09 15:30:28,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 500 places, 453 transitions, 1100 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:28,175 INFO L241 Difference]: Finished difference. Result has 502 places, 453 transitions, 1098 flow [2020-10-09 15:30:28,175 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1098, PETRI_PLACES=502, PETRI_TRANSITIONS=453} [2020-10-09 15:30:28,175 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 35 predicate places. [2020-10-09 15:30:28,175 INFO L481 AbstractCegarLoop]: Abstraction has has 502 places, 453 transitions, 1098 flow [2020-10-09 15:30:28,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:28,175 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:28,176 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:28,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 420 mathsat -unsat_core_generation=3 [2020-10-09 15:30:28,376 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:28,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:28,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1392902882, now seen corresponding path program 1 times [2020-10-09 15:30:28,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:28,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561706126] [2020-10-09 15:30:28,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 421 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 421 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:28,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:28,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:30:28,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:28,675 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:30:28,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561706126] [2020-10-09 15:30:28,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:28,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:28,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192075335] [2020-10-09 15:30:28,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:28,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:28,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:28,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:28,704 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:28,705 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 453 transitions, 1098 flow. Second operand 3 states. [2020-10-09 15:30:28,705 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:28,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:28,705 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:28,836 INFO L129 PetriNetUnfolder]: 25/538 cut-off events. [2020-10-09 15:30:28,837 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:30:28,858 INFO L80 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 538 events. 25/538 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2260 event pairs, 0 based on Foata normal form. 0/494 useless extension candidates. Maximal degree in co-relation 654. Up to 19 conditions per place. [2020-10-09 15:30:28,861 INFO L132 encePairwiseOnDemand]: 499/503 looper letters, 9 selfloop transitions, 3 changer transitions 0/454 dead transitions. [2020-10-09 15:30:28,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 454 transitions, 1124 flow [2020-10-09 15:30:28,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1429 transitions. [2020-10-09 15:30:28,862 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9469847581179589 [2020-10-09 15:30:28,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1429 transitions. [2020-10-09 15:30:28,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1429 transitions. [2020-10-09 15:30:28,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:28,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1429 transitions. [2020-10-09 15:30:28,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:28,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:28,864 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:28,864 INFO L185 Difference]: Start difference. First operand has 502 places, 453 transitions, 1098 flow. Second operand 3 states and 1429 transitions. [2020-10-09 15:30:28,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 454 transitions, 1124 flow [2020-10-09 15:30:28,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 454 transitions, 1122 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:28,869 INFO L241 Difference]: Finished difference. Result has 505 places, 454 transitions, 1114 flow [2020-10-09 15:30:28,869 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=501, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1114, PETRI_PLACES=505, PETRI_TRANSITIONS=454} [2020-10-09 15:30:28,869 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 38 predicate places. [2020-10-09 15:30:28,869 INFO L481 AbstractCegarLoop]: Abstraction has has 505 places, 454 transitions, 1114 flow [2020-10-09 15:30:28,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:28,869 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:28,869 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:29,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 421 mathsat -unsat_core_generation=3 [2020-10-09 15:30:29,070 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:29,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:29,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1391948547, now seen corresponding path program 1 times [2020-10-09 15:30:29,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:29,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165933074] [2020-10-09 15:30:29,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 422 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 422 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:29,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:29,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:30:29,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:30:29,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165933074] [2020-10-09 15:30:29,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:29,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:29,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147293079] [2020-10-09 15:30:29,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:29,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:29,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:29,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:29,399 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:29,400 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 454 transitions, 1114 flow. Second operand 3 states. [2020-10-09 15:30:29,400 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:29,400 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:29,400 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:29,537 INFO L129 PetriNetUnfolder]: 24/535 cut-off events. [2020-10-09 15:30:29,538 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:30:29,600 INFO L80 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 535 events. 24/535 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2242 event pairs, 0 based on Foata normal form. 2/495 useless extension candidates. Maximal degree in co-relation 653. Up to 19 conditions per place. [2020-10-09 15:30:29,603 INFO L132 encePairwiseOnDemand]: 500/503 looper letters, 9 selfloop transitions, 1 changer transitions 0/452 dead transitions. [2020-10-09 15:30:29,603 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 452 transitions, 1122 flow [2020-10-09 15:30:29,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:29,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1428 transitions. [2020-10-09 15:30:29,604 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9463220675944334 [2020-10-09 15:30:29,604 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1428 transitions. [2020-10-09 15:30:29,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1428 transitions. [2020-10-09 15:30:29,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:29,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1428 transitions. [2020-10-09 15:30:29,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:29,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:29,606 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:29,606 INFO L185 Difference]: Start difference. First operand has 505 places, 454 transitions, 1114 flow. Second operand 3 states and 1428 transitions. [2020-10-09 15:30:29,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 452 transitions, 1122 flow [2020-10-09 15:30:29,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 452 transitions, 1121 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:29,610 INFO L241 Difference]: Finished difference. Result has 506 places, 452 transitions, 1103 flow [2020-10-09 15:30:29,611 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1103, PETRI_PLACES=506, PETRI_TRANSITIONS=452} [2020-10-09 15:30:29,611 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 39 predicate places. [2020-10-09 15:30:29,611 INFO L481 AbstractCegarLoop]: Abstraction has has 506 places, 452 transitions, 1103 flow [2020-10-09 15:30:29,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:29,611 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:29,611 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:29,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 422 mathsat -unsat_core_generation=3 [2020-10-09 15:30:29,812 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:29,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:29,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1391949570, now seen corresponding path program 1 times [2020-10-09 15:30:29,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:29,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854496131] [2020-10-09 15:30:29,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 423 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 423 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:30,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:30,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:30:30,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:30:30,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854496131] [2020-10-09 15:30:30,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:30,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:30,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998417891] [2020-10-09 15:30:30,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:30,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:30,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:30,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:30,135 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 503 [2020-10-09 15:30:30,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 452 transitions, 1103 flow. Second operand 3 states. [2020-10-09 15:30:30,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:30,137 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 503 [2020-10-09 15:30:30,137 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:30,264 INFO L129 PetriNetUnfolder]: 24/532 cut-off events. [2020-10-09 15:30:30,264 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:30,285 INFO L80 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 532 events. 24/532 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2220 event pairs, 0 based on Foata normal form. 1/492 useless extension candidates. Maximal degree in co-relation 647. Up to 19 conditions per place. [2020-10-09 15:30:30,288 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 4 selfloop transitions, 1 changer transitions 0/449 dead transitions. [2020-10-09 15:30:30,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 449 transitions, 1102 flow [2020-10-09 15:30:30,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:30,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2020-10-09 15:30:30,289 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9542743538767395 [2020-10-09 15:30:30,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1440 transitions. [2020-10-09 15:30:30,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1440 transitions. [2020-10-09 15:30:30,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:30,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1440 transitions. [2020-10-09 15:30:30,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:30,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:30,291 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:30,291 INFO L185 Difference]: Start difference. First operand has 506 places, 452 transitions, 1103 flow. Second operand 3 states and 1440 transitions. [2020-10-09 15:30:30,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 449 transitions, 1102 flow [2020-10-09 15:30:30,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 449 transitions, 1097 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:30,298 INFO L241 Difference]: Finished difference. Result has 503 places, 449 transitions, 1089 flow [2020-10-09 15:30:30,299 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=501, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1089, PETRI_PLACES=503, PETRI_TRANSITIONS=449} [2020-10-09 15:30:30,299 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 36 predicate places. [2020-10-09 15:30:30,299 INFO L481 AbstractCegarLoop]: Abstraction has has 503 places, 449 transitions, 1089 flow [2020-10-09 15:30:30,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:30,299 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:30,299 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:30,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 423 mathsat -unsat_core_generation=3 [2020-10-09 15:30:30,510 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:30,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:30,511 INFO L82 PathProgramCache]: Analyzing trace with hash -358747529, now seen corresponding path program 1 times [2020-10-09 15:30:30,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:30,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599726075] [2020-10-09 15:30:30,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 424 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 424 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:30,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:30,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:30:30,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:30,813 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:30:30,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599726075] [2020-10-09 15:30:30,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:30,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:30,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415732861] [2020-10-09 15:30:30,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:30,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:30,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:30,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:30,826 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 503 [2020-10-09 15:30:30,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 449 transitions, 1089 flow. Second operand 3 states. [2020-10-09 15:30:30,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:30,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 503 [2020-10-09 15:30:30,827 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:30,956 INFO L129 PetriNetUnfolder]: 23/539 cut-off events. [2020-10-09 15:30:30,956 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:30:30,978 INFO L80 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 539 events. 23/539 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2275 event pairs, 0 based on Foata normal form. 1/498 useless extension candidates. Maximal degree in co-relation 655. Up to 19 conditions per place. [2020-10-09 15:30:30,981 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 4 selfloop transitions, 1 changer transitions 0/449 dead transitions. [2020-10-09 15:30:30,981 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 449 transitions, 1099 flow [2020-10-09 15:30:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2020-10-09 15:30:30,982 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9542743538767395 [2020-10-09 15:30:30,982 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1440 transitions. [2020-10-09 15:30:30,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1440 transitions. [2020-10-09 15:30:30,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:30,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1440 transitions. [2020-10-09 15:30:30,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:30,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:30,984 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:30,984 INFO L185 Difference]: Start difference. First operand has 503 places, 449 transitions, 1089 flow. Second operand 3 states and 1440 transitions. [2020-10-09 15:30:30,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 449 transitions, 1099 flow [2020-10-09 15:30:30,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 449 transitions, 1098 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:30,988 INFO L241 Difference]: Finished difference. Result has 505 places, 449 transitions, 1093 flow [2020-10-09 15:30:30,989 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1093, PETRI_PLACES=505, PETRI_TRANSITIONS=449} [2020-10-09 15:30:30,989 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 38 predicate places. [2020-10-09 15:30:30,989 INFO L481 AbstractCegarLoop]: Abstraction has has 505 places, 449 transitions, 1093 flow [2020-10-09 15:30:30,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:30,989 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:30,989 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:31,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 424 mathsat -unsat_core_generation=3 [2020-10-09 15:30:31,190 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:31,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:31,190 INFO L82 PathProgramCache]: Analyzing trace with hash -358746506, now seen corresponding path program 1 times [2020-10-09 15:30:31,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:31,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56070827] [2020-10-09 15:30:31,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 425 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 425 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:31,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:31,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:30:31,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:30:31,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56070827] [2020-10-09 15:30:31,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:31,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:31,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23526590] [2020-10-09 15:30:31,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:31,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:31,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:31,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:31,513 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:31,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 449 transitions, 1093 flow. Second operand 3 states. [2020-10-09 15:30:31,514 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:31,514 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:31,514 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:31,656 INFO L129 PetriNetUnfolder]: 21/541 cut-off events. [2020-10-09 15:30:31,657 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:31,679 INFO L80 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 541 events. 21/541 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2311 event pairs, 0 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 666. Up to 19 conditions per place. [2020-10-09 15:30:31,681 INFO L132 encePairwiseOnDemand]: 499/503 looper letters, 9 selfloop transitions, 3 changer transitions 0/450 dead transitions. [2020-10-09 15:30:31,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 450 transitions, 1119 flow [2020-10-09 15:30:31,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1429 transitions. [2020-10-09 15:30:31,683 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9469847581179589 [2020-10-09 15:30:31,683 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1429 transitions. [2020-10-09 15:30:31,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1429 transitions. [2020-10-09 15:30:31,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:31,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1429 transitions. [2020-10-09 15:30:31,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:31,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:31,684 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:31,684 INFO L185 Difference]: Start difference. First operand has 505 places, 449 transitions, 1093 flow. Second operand 3 states and 1429 transitions. [2020-10-09 15:30:31,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 450 transitions, 1119 flow [2020-10-09 15:30:31,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 450 transitions, 1118 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:31,689 INFO L241 Difference]: Finished difference. Result has 508 places, 450 transitions, 1110 flow [2020-10-09 15:30:31,690 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1110, PETRI_PLACES=508, PETRI_TRANSITIONS=450} [2020-10-09 15:30:31,690 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 41 predicate places. [2020-10-09 15:30:31,690 INFO L481 AbstractCegarLoop]: Abstraction has has 508 places, 450 transitions, 1110 flow [2020-10-09 15:30:31,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:31,690 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:31,690 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:31,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 425 mathsat -unsat_core_generation=3 [2020-10-09 15:30:31,891 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:31,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:31,891 INFO L82 PathProgramCache]: Analyzing trace with hash -359699818, now seen corresponding path program 1 times [2020-10-09 15:30:31,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:31,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630841058] [2020-10-09 15:30:31,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 426 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 426 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:32,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:32,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:30:32,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:32,195 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:30:32,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630841058] [2020-10-09 15:30:32,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:32,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:32,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778057136] [2020-10-09 15:30:32,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:32,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:32,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:32,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:32,207 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 503 [2020-10-09 15:30:32,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 450 transitions, 1110 flow. Second operand 3 states. [2020-10-09 15:30:32,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:32,208 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 503 [2020-10-09 15:30:32,208 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:32,343 INFO L129 PetriNetUnfolder]: 21/534 cut-off events. [2020-10-09 15:30:32,343 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:30:32,366 INFO L80 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 534 events. 21/534 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2250 event pairs, 0 based on Foata normal form. 1/497 useless extension candidates. Maximal degree in co-relation 652. Up to 19 conditions per place. [2020-10-09 15:30:32,368 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 5 selfloop transitions, 1 changer transitions 0/448 dead transitions. [2020-10-09 15:30:32,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 448 transitions, 1112 flow [2020-10-09 15:30:32,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:32,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:32,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2020-10-09 15:30:32,370 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9529489728296885 [2020-10-09 15:30:32,370 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2020-10-09 15:30:32,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2020-10-09 15:30:32,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:32,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2020-10-09 15:30:32,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:32,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:32,372 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:32,372 INFO L185 Difference]: Start difference. First operand has 508 places, 450 transitions, 1110 flow. Second operand 3 states and 1438 transitions. [2020-10-09 15:30:32,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 510 places, 448 transitions, 1112 flow [2020-10-09 15:30:32,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 507 places, 448 transitions, 1104 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:32,377 INFO L241 Difference]: Finished difference. Result has 508 places, 448 transitions, 1097 flow [2020-10-09 15:30:32,377 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=505, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1097, PETRI_PLACES=508, PETRI_TRANSITIONS=448} [2020-10-09 15:30:32,377 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 41 predicate places. [2020-10-09 15:30:32,377 INFO L481 AbstractCegarLoop]: Abstraction has has 508 places, 448 transitions, 1097 flow [2020-10-09 15:30:32,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:32,377 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:32,377 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:32,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 426 mathsat -unsat_core_generation=3 [2020-10-09 15:30:32,578 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:32,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:32,579 INFO L82 PathProgramCache]: Analyzing trace with hash -359700841, now seen corresponding path program 1 times [2020-10-09 15:30:32,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:32,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052140350] [2020-10-09 15:30:32,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 427 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 427 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:32,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:32,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:30:32,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:32,885 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:30:32,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052140350] [2020-10-09 15:30:32,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:32,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:32,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886700782] [2020-10-09 15:30:32,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:32,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:32,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:32,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:32,922 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:32,922 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 448 transitions, 1097 flow. Second operand 3 states. [2020-10-09 15:30:32,922 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:32,922 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:32,922 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:33,059 INFO L129 PetriNetUnfolder]: 21/532 cut-off events. [2020-10-09 15:30:33,059 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:33,081 INFO L80 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 532 events. 21/532 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2237 event pairs, 0 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 656. Up to 19 conditions per place. [2020-10-09 15:30:33,083 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 8 selfloop transitions, 1 changer transitions 0/446 dead transitions. [2020-10-09 15:30:33,084 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 446 transitions, 1110 flow [2020-10-09 15:30:33,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1426 transitions. [2020-10-09 15:30:33,085 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9449966865473823 [2020-10-09 15:30:33,085 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1426 transitions. [2020-10-09 15:30:33,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1426 transitions. [2020-10-09 15:30:33,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:33,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1426 transitions. [2020-10-09 15:30:33,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:33,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:33,087 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:33,087 INFO L185 Difference]: Start difference. First operand has 508 places, 448 transitions, 1097 flow. Second operand 3 states and 1426 transitions. [2020-10-09 15:30:33,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 446 transitions, 1110 flow [2020-10-09 15:30:33,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 507 places, 446 transitions, 1109 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:33,092 INFO L241 Difference]: Finished difference. Result has 507 places, 446 transitions, 1093 flow [2020-10-09 15:30:33,092 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=505, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1093, PETRI_PLACES=507, PETRI_TRANSITIONS=446} [2020-10-09 15:30:33,092 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 40 predicate places. [2020-10-09 15:30:33,092 INFO L481 AbstractCegarLoop]: Abstraction has has 507 places, 446 transitions, 1093 flow [2020-10-09 15:30:33,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:33,092 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:33,092 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:33,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 427 mathsat -unsat_core_generation=3 [2020-10-09 15:30:33,293 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:33,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:33,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1651384176, now seen corresponding path program 1 times [2020-10-09 15:30:33,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:33,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071339490] [2020-10-09 15:30:33,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 428 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 428 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:33,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:33,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:30:33,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:30:33,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071339490] [2020-10-09 15:30:33,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:33,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:33,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226805824] [2020-10-09 15:30:33,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:33,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:33,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:33,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:33,633 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:33,634 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 446 transitions, 1093 flow. Second operand 3 states. [2020-10-09 15:30:33,634 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:33,634 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:33,634 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:33,787 INFO L129 PetriNetUnfolder]: 20/540 cut-off events. [2020-10-09 15:30:33,787 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:30:33,810 INFO L80 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 540 events. 20/540 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2307 event pairs, 0 based on Foata normal form. 0/501 useless extension candidates. Maximal degree in co-relation 668. Up to 19 conditions per place. [2020-10-09 15:30:33,813 INFO L132 encePairwiseOnDemand]: 498/503 looper letters, 10 selfloop transitions, 3 changer transitions 0/448 dead transitions. [2020-10-09 15:30:33,813 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 448 transitions, 1123 flow [2020-10-09 15:30:33,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:33,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1431 transitions. [2020-10-09 15:30:33,814 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.94831013916501 [2020-10-09 15:30:33,814 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1431 transitions. [2020-10-09 15:30:33,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1431 transitions. [2020-10-09 15:30:33,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:33,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1431 transitions. [2020-10-09 15:30:33,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:33,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:33,816 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:33,816 INFO L185 Difference]: Start difference. First operand has 507 places, 446 transitions, 1093 flow. Second operand 3 states and 1431 transitions. [2020-10-09 15:30:33,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 448 transitions, 1123 flow [2020-10-09 15:30:33,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 448 transitions, 1122 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:33,821 INFO L241 Difference]: Finished difference. Result has 510 places, 448 transitions, 1116 flow [2020-10-09 15:30:33,821 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1116, PETRI_PLACES=510, PETRI_TRANSITIONS=448} [2020-10-09 15:30:33,821 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 43 predicate places. [2020-10-09 15:30:33,821 INFO L481 AbstractCegarLoop]: Abstraction has has 510 places, 448 transitions, 1116 flow [2020-10-09 15:30:33,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:33,821 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:33,821 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:34,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 428 mathsat -unsat_core_generation=3 [2020-10-09 15:30:34,022 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:34,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:34,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1651383153, now seen corresponding path program 1 times [2020-10-09 15:30:34,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:34,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968959398] [2020-10-09 15:30:34,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 429 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 429 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:34,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:34,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:30:34,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:30:34,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968959398] [2020-10-09 15:30:34,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:34,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:34,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011486244] [2020-10-09 15:30:34,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:34,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:34,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:34,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:34,345 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 503 [2020-10-09 15:30:34,346 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 448 transitions, 1116 flow. Second operand 3 states. [2020-10-09 15:30:34,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:34,346 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 503 [2020-10-09 15:30:34,347 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:34,483 INFO L129 PetriNetUnfolder]: 18/541 cut-off events. [2020-10-09 15:30:34,483 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:30:34,504 INFO L80 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 541 events. 18/541 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2333 event pairs, 0 based on Foata normal form. 1/507 useless extension candidates. Maximal degree in co-relation 666. Up to 19 conditions per place. [2020-10-09 15:30:34,507 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 4 selfloop transitions, 1 changer transitions 0/447 dead transitions. [2020-10-09 15:30:34,507 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 447 transitions, 1122 flow [2020-10-09 15:30:34,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2020-10-09 15:30:34,508 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9542743538767395 [2020-10-09 15:30:34,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1440 transitions. [2020-10-09 15:30:34,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1440 transitions. [2020-10-09 15:30:34,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:34,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1440 transitions. [2020-10-09 15:30:34,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:34,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:34,510 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:34,510 INFO L185 Difference]: Start difference. First operand has 510 places, 448 transitions, 1116 flow. Second operand 3 states and 1440 transitions. [2020-10-09 15:30:34,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 447 transitions, 1122 flow [2020-10-09 15:30:34,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 447 transitions, 1117 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:34,515 INFO L241 Difference]: Finished difference. Result has 512 places, 447 transitions, 1112 flow [2020-10-09 15:30:34,515 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1112, PETRI_PLACES=512, PETRI_TRANSITIONS=447} [2020-10-09 15:30:34,515 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 45 predicate places. [2020-10-09 15:30:34,515 INFO L481 AbstractCegarLoop]: Abstraction has has 512 places, 447 transitions, 1112 flow [2020-10-09 15:30:34,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:34,515 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:34,515 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:34,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 429 mathsat -unsat_core_generation=3 [2020-10-09 15:30:34,716 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:34,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:34,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1650430864, now seen corresponding path program 1 times [2020-10-09 15:30:34,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:34,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087021932] [2020-10-09 15:30:34,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 430 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 430 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:35,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:35,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:35,018 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:30:35,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:30:35,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087021932] [2020-10-09 15:30:35,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:35,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:35,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389271412] [2020-10-09 15:30:35,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:35,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:35,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:35,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:35,039 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 503 [2020-10-09 15:30:35,039 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 447 transitions, 1112 flow. Second operand 3 states. [2020-10-09 15:30:35,039 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:35,039 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 503 [2020-10-09 15:30:35,040 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:35,172 INFO L129 PetriNetUnfolder]: 18/534 cut-off events. [2020-10-09 15:30:35,173 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:30:35,194 INFO L80 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 534 events. 18/534 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2271 event pairs, 0 based on Foata normal form. 1/500 useless extension candidates. Maximal degree in co-relation 662. Up to 19 conditions per place. [2020-10-09 15:30:35,196 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 5 selfloop transitions, 1 changer transitions 0/445 dead transitions. [2020-10-09 15:30:35,196 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 445 transitions, 1115 flow [2020-10-09 15:30:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2020-10-09 15:30:35,197 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9529489728296885 [2020-10-09 15:30:35,197 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2020-10-09 15:30:35,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2020-10-09 15:30:35,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:35,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2020-10-09 15:30:35,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:35,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:35,199 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:35,199 INFO L185 Difference]: Start difference. First operand has 512 places, 447 transitions, 1112 flow. Second operand 3 states and 1438 transitions. [2020-10-09 15:30:35,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 445 transitions, 1115 flow [2020-10-09 15:30:35,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 445 transitions, 1108 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:35,204 INFO L241 Difference]: Finished difference. Result has 512 places, 445 transitions, 1101 flow [2020-10-09 15:30:35,204 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1101, PETRI_PLACES=512, PETRI_TRANSITIONS=445} [2020-10-09 15:30:35,204 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 45 predicate places. [2020-10-09 15:30:35,204 INFO L481 AbstractCegarLoop]: Abstraction has has 512 places, 445 transitions, 1101 flow [2020-10-09 15:30:35,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:35,204 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:35,204 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:35,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 430 mathsat -unsat_core_generation=3 [2020-10-09 15:30:35,405 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:35,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:35,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1650429841, now seen corresponding path program 1 times [2020-10-09 15:30:35,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:35,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424331980] [2020-10-09 15:30:35,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 431 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 431 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:35,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:35,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:35,707 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:30:35,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:30:35,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424331980] [2020-10-09 15:30:35,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:35,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:35,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394623946] [2020-10-09 15:30:35,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:35,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:35,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:35,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:35,744 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:35,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 445 transitions, 1101 flow. Second operand 3 states. [2020-10-09 15:30:35,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:35,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:35,745 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:35,879 INFO L129 PetriNetUnfolder]: 18/532 cut-off events. [2020-10-09 15:30:35,880 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:35,900 INFO L80 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 532 events. 18/532 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2255 event pairs, 0 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 662. Up to 19 conditions per place. [2020-10-09 15:30:35,902 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 8 selfloop transitions, 1 changer transitions 0/443 dead transitions. [2020-10-09 15:30:35,903 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 443 transitions, 1114 flow [2020-10-09 15:30:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1426 transitions. [2020-10-09 15:30:35,904 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9449966865473823 [2020-10-09 15:30:35,904 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1426 transitions. [2020-10-09 15:30:35,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1426 transitions. [2020-10-09 15:30:35,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:35,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1426 transitions. [2020-10-09 15:30:35,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:35,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:35,905 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:35,906 INFO L185 Difference]: Start difference. First operand has 512 places, 445 transitions, 1101 flow. Second operand 3 states and 1426 transitions. [2020-10-09 15:30:35,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 443 transitions, 1114 flow [2020-10-09 15:30:35,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 443 transitions, 1113 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:35,910 INFO L241 Difference]: Finished difference. Result has 511 places, 443 transitions, 1097 flow [2020-10-09 15:30:35,910 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1097, PETRI_PLACES=511, PETRI_TRANSITIONS=443} [2020-10-09 15:30:35,911 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 44 predicate places. [2020-10-09 15:30:35,911 INFO L481 AbstractCegarLoop]: Abstraction has has 511 places, 443 transitions, 1097 flow [2020-10-09 15:30:35,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:35,911 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:35,911 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:36,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 431 mathsat -unsat_core_generation=3 [2020-10-09 15:30:36,112 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:36,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:36,112 INFO L82 PathProgramCache]: Analyzing trace with hash 698574187, now seen corresponding path program 1 times [2020-10-09 15:30:36,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:36,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592011057] [2020-10-09 15:30:36,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 432 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 432 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:36,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:36,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:30:36,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:30:36,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592011057] [2020-10-09 15:30:36,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:36,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:36,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264745385] [2020-10-09 15:30:36,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:36,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:36,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:36,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:36,453 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:36,453 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 443 transitions, 1097 flow. Second operand 3 states. [2020-10-09 15:30:36,453 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:36,454 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:36,454 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:36,596 INFO L129 PetriNetUnfolder]: 17/540 cut-off events. [2020-10-09 15:30:36,596 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:30:36,618 INFO L80 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 540 events. 17/540 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2323 event pairs, 0 based on Foata normal form. 0/504 useless extension candidates. Maximal degree in co-relation 674. Up to 19 conditions per place. [2020-10-09 15:30:36,620 INFO L132 encePairwiseOnDemand]: 498/503 looper letters, 10 selfloop transitions, 3 changer transitions 0/445 dead transitions. [2020-10-09 15:30:36,620 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 445 transitions, 1127 flow [2020-10-09 15:30:36,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1431 transitions. [2020-10-09 15:30:36,621 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.94831013916501 [2020-10-09 15:30:36,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1431 transitions. [2020-10-09 15:30:36,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1431 transitions. [2020-10-09 15:30:36,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:36,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1431 transitions. [2020-10-09 15:30:36,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:36,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:36,623 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:36,623 INFO L185 Difference]: Start difference. First operand has 511 places, 443 transitions, 1097 flow. Second operand 3 states and 1431 transitions. [2020-10-09 15:30:36,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 445 transitions, 1127 flow [2020-10-09 15:30:36,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 445 transitions, 1126 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:36,628 INFO L241 Difference]: Finished difference. Result has 514 places, 445 transitions, 1120 flow [2020-10-09 15:30:36,628 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1120, PETRI_PLACES=514, PETRI_TRANSITIONS=445} [2020-10-09 15:30:36,628 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 47 predicate places. [2020-10-09 15:30:36,628 INFO L481 AbstractCegarLoop]: Abstraction has has 514 places, 445 transitions, 1120 flow [2020-10-09 15:30:36,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:36,628 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:36,629 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:36,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 432 mathsat -unsat_core_generation=3 [2020-10-09 15:30:36,829 INFO L429 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:36,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:36,830 INFO L82 PathProgramCache]: Analyzing trace with hash 698573164, now seen corresponding path program 1 times [2020-10-09 15:30:36,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:36,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93421762] [2020-10-09 15:30:36,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 433 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 433 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:37,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:37,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:30:37,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:30:37,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93421762] [2020-10-09 15:30:37,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:37,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:37,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460213078] [2020-10-09 15:30:37,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:37,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:37,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:37,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:37,172 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 503 [2020-10-09 15:30:37,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 445 transitions, 1120 flow. Second operand 3 states. [2020-10-09 15:30:37,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:37,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 503 [2020-10-09 15:30:37,173 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:37,307 INFO L129 PetriNetUnfolder]: 15/541 cut-off events. [2020-10-09 15:30:37,307 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:30:37,329 INFO L80 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 541 events. 15/541 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2348 event pairs, 0 based on Foata normal form. 1/510 useless extension candidates. Maximal degree in co-relation 672. Up to 19 conditions per place. [2020-10-09 15:30:37,331 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 4 selfloop transitions, 1 changer transitions 0/444 dead transitions. [2020-10-09 15:30:37,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 444 transitions, 1126 flow [2020-10-09 15:30:37,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:37,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:37,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2020-10-09 15:30:37,332 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9542743538767395 [2020-10-09 15:30:37,332 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1440 transitions. [2020-10-09 15:30:37,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1440 transitions. [2020-10-09 15:30:37,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:37,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1440 transitions. [2020-10-09 15:30:37,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:37,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:37,333 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:37,334 INFO L185 Difference]: Start difference. First operand has 514 places, 445 transitions, 1120 flow. Second operand 3 states and 1440 transitions. [2020-10-09 15:30:37,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 444 transitions, 1126 flow [2020-10-09 15:30:37,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 444 transitions, 1121 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:37,338 INFO L241 Difference]: Finished difference. Result has 516 places, 444 transitions, 1116 flow [2020-10-09 15:30:37,338 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1116, PETRI_PLACES=516, PETRI_TRANSITIONS=444} [2020-10-09 15:30:37,338 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 49 predicate places. [2020-10-09 15:30:37,339 INFO L481 AbstractCegarLoop]: Abstraction has has 516 places, 444 transitions, 1116 flow [2020-10-09 15:30:37,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:37,339 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:37,339 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:37,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 433 mathsat -unsat_core_generation=3 [2020-10-09 15:30:37,539 INFO L429 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:37,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:37,540 INFO L82 PathProgramCache]: Analyzing trace with hash 697620875, now seen corresponding path program 1 times [2020-10-09 15:30:37,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:37,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840919588] [2020-10-09 15:30:37,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 434 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 434 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:37,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:37,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:30:37,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:30:37,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840919588] [2020-10-09 15:30:37,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:37,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:37,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704603138] [2020-10-09 15:30:37,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:37,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:37,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:37,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:37,860 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 503 [2020-10-09 15:30:37,861 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 444 transitions, 1116 flow. Second operand 3 states. [2020-10-09 15:30:37,861 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:37,861 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 503 [2020-10-09 15:30:37,861 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:38,006 INFO L129 PetriNetUnfolder]: 15/534 cut-off events. [2020-10-09 15:30:38,006 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:30:38,029 INFO L80 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 534 events. 15/534 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2285 event pairs, 0 based on Foata normal form. 1/503 useless extension candidates. Maximal degree in co-relation 668. Up to 19 conditions per place. [2020-10-09 15:30:38,031 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 5 selfloop transitions, 1 changer transitions 0/442 dead transitions. [2020-10-09 15:30:38,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 442 transitions, 1119 flow [2020-10-09 15:30:38,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2020-10-09 15:30:38,033 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9529489728296885 [2020-10-09 15:30:38,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2020-10-09 15:30:38,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2020-10-09 15:30:38,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:38,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2020-10-09 15:30:38,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:38,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:38,034 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:38,034 INFO L185 Difference]: Start difference. First operand has 516 places, 444 transitions, 1116 flow. Second operand 3 states and 1438 transitions. [2020-10-09 15:30:38,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 442 transitions, 1119 flow [2020-10-09 15:30:38,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 442 transitions, 1112 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:38,039 INFO L241 Difference]: Finished difference. Result has 516 places, 442 transitions, 1105 flow [2020-10-09 15:30:38,040 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1100, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1105, PETRI_PLACES=516, PETRI_TRANSITIONS=442} [2020-10-09 15:30:38,040 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 49 predicate places. [2020-10-09 15:30:38,040 INFO L481 AbstractCegarLoop]: Abstraction has has 516 places, 442 transitions, 1105 flow [2020-10-09 15:30:38,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:38,040 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:38,040 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:38,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 434 mathsat -unsat_core_generation=3 [2020-10-09 15:30:38,241 INFO L429 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:38,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:38,241 INFO L82 PathProgramCache]: Analyzing trace with hash 697619852, now seen corresponding path program 1 times [2020-10-09 15:30:38,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:38,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732116536] [2020-10-09 15:30:38,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 435 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 435 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:38,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:38,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:38,549 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:30:38,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:38,552 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:30:38,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732116536] [2020-10-09 15:30:38,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:38,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:38,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969283346] [2020-10-09 15:30:38,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:38,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:38,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:38,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:38,588 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:38,589 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 442 transitions, 1105 flow. Second operand 3 states. [2020-10-09 15:30:38,589 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:38,590 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:38,590 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:38,736 INFO L129 PetriNetUnfolder]: 15/532 cut-off events. [2020-10-09 15:30:38,736 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:38,760 INFO L80 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 532 events. 15/532 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2271 event pairs, 0 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 668. Up to 19 conditions per place. [2020-10-09 15:30:38,762 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 8 selfloop transitions, 1 changer transitions 0/440 dead transitions. [2020-10-09 15:30:38,762 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 440 transitions, 1118 flow [2020-10-09 15:30:38,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:38,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1426 transitions. [2020-10-09 15:30:38,763 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9449966865473823 [2020-10-09 15:30:38,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1426 transitions. [2020-10-09 15:30:38,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1426 transitions. [2020-10-09 15:30:38,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:38,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1426 transitions. [2020-10-09 15:30:38,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:38,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:38,766 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:38,766 INFO L185 Difference]: Start difference. First operand has 516 places, 442 transitions, 1105 flow. Second operand 3 states and 1426 transitions. [2020-10-09 15:30:38,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 440 transitions, 1118 flow [2020-10-09 15:30:38,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 440 transitions, 1117 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:38,772 INFO L241 Difference]: Finished difference. Result has 515 places, 440 transitions, 1101 flow [2020-10-09 15:30:38,772 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1101, PETRI_PLACES=515, PETRI_TRANSITIONS=440} [2020-10-09 15:30:38,772 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 48 predicate places. [2020-10-09 15:30:38,772 INFO L481 AbstractCegarLoop]: Abstraction has has 515 places, 440 transitions, 1101 flow [2020-10-09 15:30:38,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:38,772 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:38,772 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:38,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 435 mathsat -unsat_core_generation=3 [2020-10-09 15:30:38,973 INFO L429 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:38,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:38,974 INFO L82 PathProgramCache]: Analyzing trace with hash 528883176, now seen corresponding path program 1 times [2020-10-09 15:30:38,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:38,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335295746] [2020-10-09 15:30:38,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 436 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 436 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:39,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:39,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:30:39,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:30:39,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335295746] [2020-10-09 15:30:39,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:39,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:39,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388537572] [2020-10-09 15:30:39,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:39,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:39,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:39,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:39,313 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 503 [2020-10-09 15:30:39,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 440 transitions, 1101 flow. Second operand 3 states. [2020-10-09 15:30:39,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:39,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 503 [2020-10-09 15:30:39,314 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:39,460 INFO L129 PetriNetUnfolder]: 14/539 cut-off events. [2020-10-09 15:30:39,461 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-09 15:30:39,484 INFO L80 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 539 events. 14/539 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2330 event pairs, 0 based on Foata normal form. 1/508 useless extension candidates. Maximal degree in co-relation 671. Up to 19 conditions per place. [2020-10-09 15:30:39,486 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 4 selfloop transitions, 1 changer transitions 0/440 dead transitions. [2020-10-09 15:30:39,486 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 440 transitions, 1111 flow [2020-10-09 15:30:39,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:39,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:39,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2020-10-09 15:30:39,488 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9542743538767395 [2020-10-09 15:30:39,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1440 transitions. [2020-10-09 15:30:39,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1440 transitions. [2020-10-09 15:30:39,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:39,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1440 transitions. [2020-10-09 15:30:39,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:39,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:39,489 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:39,489 INFO L185 Difference]: Start difference. First operand has 515 places, 440 transitions, 1101 flow. Second operand 3 states and 1440 transitions. [2020-10-09 15:30:39,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 440 transitions, 1111 flow [2020-10-09 15:30:39,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 440 transitions, 1110 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:39,494 INFO L241 Difference]: Finished difference. Result has 517 places, 440 transitions, 1105 flow [2020-10-09 15:30:39,495 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1100, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1105, PETRI_PLACES=517, PETRI_TRANSITIONS=440} [2020-10-09 15:30:39,495 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 50 predicate places. [2020-10-09 15:30:39,495 INFO L481 AbstractCegarLoop]: Abstraction has has 517 places, 440 transitions, 1105 flow [2020-10-09 15:30:39,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:39,495 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:39,495 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:39,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 436 mathsat -unsat_core_generation=3 [2020-10-09 15:30:39,696 INFO L429 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:39,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:39,696 INFO L82 PathProgramCache]: Analyzing trace with hash 528884199, now seen corresponding path program 1 times [2020-10-09 15:30:39,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:39,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130664958] [2020-10-09 15:30:39,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 437 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 437 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:39,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:39,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:30:40,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:30:40,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130664958] [2020-10-09 15:30:40,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:40,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:40,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213223072] [2020-10-09 15:30:40,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:40,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:40,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:40,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:40,038 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:40,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 440 transitions, 1105 flow. Second operand 3 states. [2020-10-09 15:30:40,039 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:40,039 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:40,039 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:40,216 INFO L129 PetriNetUnfolder]: 12/541 cut-off events. [2020-10-09 15:30:40,216 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:40,232 INFO L80 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 541 events. 12/541 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2364 event pairs, 0 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 684. Up to 19 conditions per place. [2020-10-09 15:30:40,233 INFO L132 encePairwiseOnDemand]: 499/503 looper letters, 9 selfloop transitions, 3 changer transitions 0/441 dead transitions. [2020-10-09 15:30:40,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 441 transitions, 1131 flow [2020-10-09 15:30:40,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1429 transitions. [2020-10-09 15:30:40,235 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9469847581179589 [2020-10-09 15:30:40,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1429 transitions. [2020-10-09 15:30:40,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1429 transitions. [2020-10-09 15:30:40,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:40,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1429 transitions. [2020-10-09 15:30:40,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:40,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:40,236 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:40,236 INFO L185 Difference]: Start difference. First operand has 517 places, 440 transitions, 1105 flow. Second operand 3 states and 1429 transitions. [2020-10-09 15:30:40,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 441 transitions, 1131 flow [2020-10-09 15:30:40,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 441 transitions, 1130 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:40,241 INFO L241 Difference]: Finished difference. Result has 520 places, 441 transitions, 1122 flow [2020-10-09 15:30:40,241 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1122, PETRI_PLACES=520, PETRI_TRANSITIONS=441} [2020-10-09 15:30:40,241 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 53 predicate places. [2020-10-09 15:30:40,241 INFO L481 AbstractCegarLoop]: Abstraction has has 520 places, 441 transitions, 1122 flow [2020-10-09 15:30:40,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:40,241 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:40,241 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:40,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 437 mathsat -unsat_core_generation=3 [2020-10-09 15:30:40,442 INFO L429 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:40,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:40,442 INFO L82 PathProgramCache]: Analyzing trace with hash 527930887, now seen corresponding path program 1 times [2020-10-09 15:30:40,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:40,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954494003] [2020-10-09 15:30:40,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 438 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 438 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:40,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:40,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:30:40,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:30:40,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954494003] [2020-10-09 15:30:40,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:40,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:40,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236518563] [2020-10-09 15:30:40,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:40,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:40,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:40,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:40,768 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 503 [2020-10-09 15:30:40,769 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 441 transitions, 1122 flow. Second operand 3 states. [2020-10-09 15:30:40,769 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:40,770 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 503 [2020-10-09 15:30:40,770 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:40,908 INFO L129 PetriNetUnfolder]: 12/534 cut-off events. [2020-10-09 15:30:40,908 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:30:40,929 INFO L80 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 534 events. 12/534 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2305 event pairs, 0 based on Foata normal form. 1/506 useless extension candidates. Maximal degree in co-relation 670. Up to 19 conditions per place. [2020-10-09 15:30:40,931 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 5 selfloop transitions, 1 changer transitions 0/439 dead transitions. [2020-10-09 15:30:40,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 439 transitions, 1124 flow [2020-10-09 15:30:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2020-10-09 15:30:40,932 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9529489728296885 [2020-10-09 15:30:40,932 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2020-10-09 15:30:40,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2020-10-09 15:30:40,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:40,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2020-10-09 15:30:40,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:40,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:40,935 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:40,935 INFO L185 Difference]: Start difference. First operand has 520 places, 441 transitions, 1122 flow. Second operand 3 states and 1438 transitions. [2020-10-09 15:30:40,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 439 transitions, 1124 flow [2020-10-09 15:30:40,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 439 transitions, 1116 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:40,940 INFO L241 Difference]: Finished difference. Result has 520 places, 439 transitions, 1109 flow [2020-10-09 15:30:40,940 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1109, PETRI_PLACES=520, PETRI_TRANSITIONS=439} [2020-10-09 15:30:40,940 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 53 predicate places. [2020-10-09 15:30:40,940 INFO L481 AbstractCegarLoop]: Abstraction has has 520 places, 439 transitions, 1109 flow [2020-10-09 15:30:40,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:40,940 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:40,940 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:41,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 438 mathsat -unsat_core_generation=3 [2020-10-09 15:30:41,141 INFO L429 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:41,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:41,142 INFO L82 PathProgramCache]: Analyzing trace with hash 527929864, now seen corresponding path program 1 times [2020-10-09 15:30:41,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:41,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663226419] [2020-10-09 15:30:41,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 439 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 439 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:41,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:41,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:30:41,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:41,448 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:30:41,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663226419] [2020-10-09 15:30:41,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:41,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:41,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781468950] [2020-10-09 15:30:41,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:41,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:41,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:41,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:41,477 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 503 [2020-10-09 15:30:41,478 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 439 transitions, 1109 flow. Second operand 3 states. [2020-10-09 15:30:41,478 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:41,478 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 503 [2020-10-09 15:30:41,478 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:41,618 INFO L129 PetriNetUnfolder]: 12/532 cut-off events. [2020-10-09 15:30:41,618 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:41,640 INFO L80 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 532 events. 12/532 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2289 event pairs, 0 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 674. Up to 19 conditions per place. [2020-10-09 15:30:41,641 INFO L132 encePairwiseOnDemand]: 501/503 looper letters, 8 selfloop transitions, 1 changer transitions 0/437 dead transitions. [2020-10-09 15:30:41,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 437 transitions, 1122 flow [2020-10-09 15:30:41,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:41,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1426 transitions. [2020-10-09 15:30:41,643 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9449966865473823 [2020-10-09 15:30:41,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1426 transitions. [2020-10-09 15:30:41,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1426 transitions. [2020-10-09 15:30:41,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:41,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1426 transitions. [2020-10-09 15:30:41,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:41,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:41,644 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:41,644 INFO L185 Difference]: Start difference. First operand has 520 places, 439 transitions, 1109 flow. Second operand 3 states and 1426 transitions. [2020-10-09 15:30:41,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 437 transitions, 1122 flow [2020-10-09 15:30:41,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 437 transitions, 1121 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:41,650 INFO L241 Difference]: Finished difference. Result has 519 places, 437 transitions, 1105 flow [2020-10-09 15:30:41,650 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1105, PETRI_PLACES=519, PETRI_TRANSITIONS=437} [2020-10-09 15:30:41,650 INFO L341 CegarLoopForPetriNet]: 467 programPoint places, 52 predicate places. [2020-10-09 15:30:41,650 INFO L481 AbstractCegarLoop]: Abstraction has has 519 places, 437 transitions, 1105 flow [2020-10-09 15:30:41,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:41,650 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:41,650 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:41,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 439 mathsat -unsat_core_generation=3 [2020-10-09 15:30:41,851 INFO L429 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:41,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:41,852 INFO L82 PathProgramCache]: Analyzing trace with hash -704036572, now seen corresponding path program 1 times [2020-10-09 15:30:41,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:41,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115088837] [2020-10-09 15:30:41,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 440 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 440 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:30:42,159 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:30:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:30:42,191 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:30:42,239 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:30:42,239 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:30:42,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 440 mathsat -unsat_core_generation=3 [2020-10-09 15:30:42,440 WARN L371 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:30:42,440 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2020-10-09 15:30:42,478 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,478 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,481 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,481 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,481 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,481 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,481 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,486 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,486 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,486 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,488 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,489 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,489 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,489 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,489 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,489 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,492 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,494 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,494 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,496 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,496 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,496 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,496 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,496 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,496 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,496 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,499 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,499 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,499 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,499 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,499 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,499 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,500 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,502 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,502 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,502 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,507 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,507 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,507 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,507 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,507 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,507 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:30:42,561 INFO L253 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2020-10-09 15:30:42,561 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:30:42,561 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:30:42,561 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:30:42,561 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:30:42,561 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:30:42,562 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:30:42,562 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:30:42,562 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:30:42,565 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 492 places, 530 transitions, 1497 flow [2020-10-09 15:30:42,704 INFO L129 PetriNetUnfolder]: 96/700 cut-off events. [2020-10-09 15:30:42,704 INFO L130 PetriNetUnfolder]: For 1311/1311 co-relation queries the response was YES. [2020-10-09 15:30:42,735 INFO L80 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 700 events. 96/700 cut-off events. For 1311/1311 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2883 event pairs, 0 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 884. Up to 40 conditions per place. [2020-10-09 15:30:42,735 INFO L82 GeneralOperation]: Start removeDead. Operand has 492 places, 530 transitions, 1497 flow [2020-10-09 15:30:42,747 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 492 places, 530 transitions, 1497 flow [2020-10-09 15:30:42,752 INFO L129 PetriNetUnfolder]: 10/98 cut-off events. [2020-10-09 15:30:42,752 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:42,752 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:42,752 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:42,752 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:42,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:42,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1684901188, now seen corresponding path program 1 times [2020-10-09 15:30:42,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:42,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131707250] [2020-10-09 15:30:42,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 441 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 441 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:43,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:43,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:43,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:30:43,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:30:43,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131707250] [2020-10-09 15:30:43,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:43,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:43,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353274543] [2020-10-09 15:30:43,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:43,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:43,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:43,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:43,075 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 530 [2020-10-09 15:30:43,076 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 530 transitions, 1497 flow. Second operand 3 states. [2020-10-09 15:30:43,076 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:43,076 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 530 [2020-10-09 15:30:43,076 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:43,206 INFO L129 PetriNetUnfolder]: 56/568 cut-off events. [2020-10-09 15:30:43,206 INFO L130 PetriNetUnfolder]: For 1312/1312 co-relation queries the response was YES. [2020-10-09 15:30:43,231 INFO L80 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 568 events. 56/568 cut-off events. For 1312/1312 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2222 event pairs, 0 based on Foata normal form. 78/570 useless extension candidates. Maximal degree in co-relation 761. Up to 20 conditions per place. [2020-10-09 15:30:43,238 INFO L132 encePairwiseOnDemand]: 507/530 looper letters, 4 selfloop transitions, 1 changer transitions 0/505 dead transitions. [2020-10-09 15:30:43,238 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 505 transitions, 1457 flow [2020-10-09 15:30:43,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1560 transitions. [2020-10-09 15:30:43,239 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9811320754716981 [2020-10-09 15:30:43,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1560 transitions. [2020-10-09 15:30:43,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1560 transitions. [2020-10-09 15:30:43,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:43,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1560 transitions. [2020-10-09 15:30:43,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:43,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:43,242 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:43,242 INFO L185 Difference]: Start difference. First operand has 492 places, 530 transitions, 1497 flow. Second operand 3 states and 1560 transitions. [2020-10-09 15:30:43,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 505 transitions, 1457 flow [2020-10-09 15:30:43,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 505 transitions, 1115 flow, removed 171 selfloop flow, removed 0 redundant places. [2020-10-09 15:30:43,249 INFO L241 Difference]: Finished difference. Result has 490 places, 505 transitions, 1110 flow [2020-10-09 15:30:43,249 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=487, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1110, PETRI_PLACES=490, PETRI_TRANSITIONS=505} [2020-10-09 15:30:43,249 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, -2 predicate places. [2020-10-09 15:30:43,249 INFO L481 AbstractCegarLoop]: Abstraction has has 490 places, 505 transitions, 1110 flow [2020-10-09 15:30:43,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:43,249 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:43,249 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:43,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 441 mathsat -unsat_core_generation=3 [2020-10-09 15:30:43,450 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:43,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:43,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1683948899, now seen corresponding path program 1 times [2020-10-09 15:30:43,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:43,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357578485] [2020-10-09 15:30:43,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 442 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 442 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:43,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:43,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:43,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:30:43,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:30:43,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357578485] [2020-10-09 15:30:43,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:43,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:43,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298353728] [2020-10-09 15:30:43,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:43,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:43,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:43,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:43,788 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 530 [2020-10-09 15:30:43,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 505 transitions, 1110 flow. Second operand 3 states. [2020-10-09 15:30:43,789 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:43,789 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 530 [2020-10-09 15:30:43,789 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:43,919 INFO L129 PetriNetUnfolder]: 54/565 cut-off events. [2020-10-09 15:30:43,919 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:30:43,944 INFO L80 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 565 events. 54/565 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2212 event pairs, 0 based on Foata normal form. 1/491 useless extension candidates. Maximal degree in co-relation 619. Up to 20 conditions per place. [2020-10-09 15:30:43,951 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 5 selfloop transitions, 1 changer transitions 0/505 dead transitions. [2020-10-09 15:30:43,951 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 505 transitions, 1122 flow [2020-10-09 15:30:43,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:43,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2020-10-09 15:30:43,953 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9534591194968554 [2020-10-09 15:30:43,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2020-10-09 15:30:43,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2020-10-09 15:30:43,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:43,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2020-10-09 15:30:43,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:43,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:43,954 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:43,954 INFO L185 Difference]: Start difference. First operand has 490 places, 505 transitions, 1110 flow. Second operand 3 states and 1516 transitions. [2020-10-09 15:30:43,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 505 transitions, 1122 flow [2020-10-09 15:30:43,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 505 transitions, 1121 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:43,959 INFO L241 Difference]: Finished difference. Result has 492 places, 505 transitions, 1114 flow [2020-10-09 15:30:43,960 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1114, PETRI_PLACES=492, PETRI_TRANSITIONS=505} [2020-10-09 15:30:43,960 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 0 predicate places. [2020-10-09 15:30:43,960 INFO L481 AbstractCegarLoop]: Abstraction has has 492 places, 505 transitions, 1114 flow [2020-10-09 15:30:43,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:43,960 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:43,960 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:44,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 442 mathsat -unsat_core_generation=3 [2020-10-09 15:30:44,161 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:44,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:44,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1683947876, now seen corresponding path program 1 times [2020-10-09 15:30:44,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:44,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759219747] [2020-10-09 15:30:44,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 443 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 443 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:44,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:44,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:44,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:30:44,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:30:44,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759219747] [2020-10-09 15:30:44,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:44,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:44,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592099292] [2020-10-09 15:30:44,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:44,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:44,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:44,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:44,508 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:30:44,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 505 transitions, 1114 flow. Second operand 3 states. [2020-10-09 15:30:44,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:44,509 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:30:44,509 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:44,637 INFO L129 PetriNetUnfolder]: 54/563 cut-off events. [2020-10-09 15:30:44,638 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:44,661 INFO L80 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 563 events. 54/563 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2197 event pairs, 0 based on Foata normal form. 0/489 useless extension candidates. Maximal degree in co-relation 625. Up to 20 conditions per place. [2020-10-09 15:30:44,668 INFO L132 encePairwiseOnDemand]: 527/530 looper letters, 8 selfloop transitions, 2 changer transitions 0/504 dead transitions. [2020-10-09 15:30:44,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 504 transitions, 1132 flow [2020-10-09 15:30:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1505 transitions. [2020-10-09 15:30:44,670 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9465408805031447 [2020-10-09 15:30:44,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1505 transitions. [2020-10-09 15:30:44,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1505 transitions. [2020-10-09 15:30:44,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:44,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1505 transitions. [2020-10-09 15:30:44,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:44,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:44,672 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:44,672 INFO L185 Difference]: Start difference. First operand has 492 places, 505 transitions, 1114 flow. Second operand 3 states and 1505 transitions. [2020-10-09 15:30:44,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 504 transitions, 1132 flow [2020-10-09 15:30:44,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 504 transitions, 1131 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:44,677 INFO L241 Difference]: Finished difference. Result has 493 places, 504 transitions, 1115 flow [2020-10-09 15:30:44,677 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1115, PETRI_PLACES=493, PETRI_TRANSITIONS=504} [2020-10-09 15:30:44,677 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 1 predicate places. [2020-10-09 15:30:44,677 INFO L481 AbstractCegarLoop]: Abstraction has has 493 places, 504 transitions, 1115 flow [2020-10-09 15:30:44,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:44,677 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:44,677 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:44,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 443 mathsat -unsat_core_generation=3 [2020-10-09 15:30:44,878 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:44,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:44,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1684902211, now seen corresponding path program 1 times [2020-10-09 15:30:44,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:44,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368453825] [2020-10-09 15:30:44,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 444 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 444 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:45,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:45,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:30:45,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:30:45,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368453825] [2020-10-09 15:30:45,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:45,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:45,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458232942] [2020-10-09 15:30:45,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:45,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:45,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:45,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:45,215 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:30:45,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 504 transitions, 1115 flow. Second operand 3 states. [2020-10-09 15:30:45,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:45,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:30:45,217 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:45,345 INFO L129 PetriNetUnfolder]: 54/561 cut-off events. [2020-10-09 15:30:45,345 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:30:45,369 INFO L80 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 561 events. 54/561 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2182 event pairs, 0 based on Foata normal form. 1/490 useless extension candidates. Maximal degree in co-relation 620. Up to 20 conditions per place. [2020-10-09 15:30:45,376 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 8 selfloop transitions, 1 changer transitions 0/502 dead transitions. [2020-10-09 15:30:45,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 502 transitions, 1127 flow [2020-10-09 15:30:45,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:45,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:45,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1504 transitions. [2020-10-09 15:30:45,377 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9459119496855346 [2020-10-09 15:30:45,377 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1504 transitions. [2020-10-09 15:30:45,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1504 transitions. [2020-10-09 15:30:45,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:45,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1504 transitions. [2020-10-09 15:30:45,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:45,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:45,379 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:45,379 INFO L185 Difference]: Start difference. First operand has 493 places, 504 transitions, 1115 flow. Second operand 3 states and 1504 transitions. [2020-10-09 15:30:45,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 502 transitions, 1127 flow [2020-10-09 15:30:45,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 502 transitions, 1126 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:45,384 INFO L241 Difference]: Finished difference. Result has 492 places, 502 transitions, 1110 flow [2020-10-09 15:30:45,385 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1110, PETRI_PLACES=492, PETRI_TRANSITIONS=502} [2020-10-09 15:30:45,385 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 0 predicate places. [2020-10-09 15:30:45,385 INFO L481 AbstractCegarLoop]: Abstraction has has 492 places, 502 transitions, 1110 flow [2020-10-09 15:30:45,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:45,385 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:45,385 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:30:45,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 444 mathsat -unsat_core_generation=3 [2020-10-09 15:30:45,586 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:45,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:45,586 INFO L82 PathProgramCache]: Analyzing trace with hash -840606642, now seen corresponding path program 1 times [2020-10-09 15:30:45,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:45,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108374213] [2020-10-09 15:30:45,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 445 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 445 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:45,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:45,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:30:45,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:30:45,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108374213] [2020-10-09 15:30:45,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:45,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:45,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971839733] [2020-10-09 15:30:45,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:45,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:45,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:45,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:45,922 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 530 [2020-10-09 15:30:45,922 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 502 transitions, 1110 flow. Second operand 3 states. [2020-10-09 15:30:45,923 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:45,923 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 530 [2020-10-09 15:30:45,923 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:46,049 INFO L129 PetriNetUnfolder]: 53/568 cut-off events. [2020-10-09 15:30:46,049 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:46,073 INFO L80 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 568 events. 53/568 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2246 event pairs, 0 based on Foata normal form. 1/497 useless extension candidates. Maximal degree in co-relation 626. Up to 20 conditions per place. [2020-10-09 15:30:46,080 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 4 selfloop transitions, 1 changer transitions 0/502 dead transitions. [2020-10-09 15:30:46,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 502 transitions, 1120 flow [2020-10-09 15:30:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2020-10-09 15:30:46,081 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2020-10-09 15:30:46,081 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1518 transitions. [2020-10-09 15:30:46,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1518 transitions. [2020-10-09 15:30:46,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:46,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1518 transitions. [2020-10-09 15:30:46,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:46,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:46,083 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:46,083 INFO L185 Difference]: Start difference. First operand has 492 places, 502 transitions, 1110 flow. Second operand 3 states and 1518 transitions. [2020-10-09 15:30:46,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 502 transitions, 1120 flow [2020-10-09 15:30:46,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 502 transitions, 1119 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:46,089 INFO L241 Difference]: Finished difference. Result has 494 places, 502 transitions, 1114 flow [2020-10-09 15:30:46,089 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1114, PETRI_PLACES=494, PETRI_TRANSITIONS=502} [2020-10-09 15:30:46,089 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 2 predicate places. [2020-10-09 15:30:46,089 INFO L481 AbstractCegarLoop]: Abstraction has has 494 places, 502 transitions, 1114 flow [2020-10-09 15:30:46,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:46,089 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:46,089 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:30:46,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 445 mathsat -unsat_core_generation=3 [2020-10-09 15:30:46,290 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:46,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:46,291 INFO L82 PathProgramCache]: Analyzing trace with hash -840605619, now seen corresponding path program 1 times [2020-10-09 15:30:46,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:46,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025253335] [2020-10-09 15:30:46,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 446 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 446 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:46,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:46,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:30:46,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:46,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:30:46,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025253335] [2020-10-09 15:30:46,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:46,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:46,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676669980] [2020-10-09 15:30:46,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:46,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:46,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:46,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:46,630 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:30:46,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 502 transitions, 1114 flow. Second operand 3 states. [2020-10-09 15:30:46,631 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:46,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:30:46,632 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:46,763 INFO L129 PetriNetUnfolder]: 51/570 cut-off events. [2020-10-09 15:30:46,763 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:30:46,785 INFO L80 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 570 events. 51/570 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2275 event pairs, 0 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 639. Up to 20 conditions per place. [2020-10-09 15:30:46,791 INFO L132 encePairwiseOnDemand]: 526/530 looper letters, 9 selfloop transitions, 3 changer transitions 0/503 dead transitions. [2020-10-09 15:30:46,792 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 503 transitions, 1140 flow [2020-10-09 15:30:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1507 transitions. [2020-10-09 15:30:46,793 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9477987421383648 [2020-10-09 15:30:46,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1507 transitions. [2020-10-09 15:30:46,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1507 transitions. [2020-10-09 15:30:46,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:46,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1507 transitions. [2020-10-09 15:30:46,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:46,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:46,795 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:46,795 INFO L185 Difference]: Start difference. First operand has 494 places, 502 transitions, 1114 flow. Second operand 3 states and 1507 transitions. [2020-10-09 15:30:46,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 503 transitions, 1140 flow [2020-10-09 15:30:46,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 503 transitions, 1139 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:46,800 INFO L241 Difference]: Finished difference. Result has 497 places, 503 transitions, 1131 flow [2020-10-09 15:30:46,800 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1131, PETRI_PLACES=497, PETRI_TRANSITIONS=503} [2020-10-09 15:30:46,800 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 5 predicate places. [2020-10-09 15:30:46,800 INFO L481 AbstractCegarLoop]: Abstraction has has 497 places, 503 transitions, 1131 flow [2020-10-09 15:30:46,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:46,800 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:46,801 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:30:47,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 446 mathsat -unsat_core_generation=3 [2020-10-09 15:30:47,001 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:47,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:47,002 INFO L82 PathProgramCache]: Analyzing trace with hash -841558931, now seen corresponding path program 1 times [2020-10-09 15:30:47,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:47,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840376014] [2020-10-09 15:30:47,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 447 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 447 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:47,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:47,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:30:47,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:30:47,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840376014] [2020-10-09 15:30:47,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:47,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:47,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108544802] [2020-10-09 15:30:47,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:47,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:47,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:47,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:47,328 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 530 [2020-10-09 15:30:47,328 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 503 transitions, 1131 flow. Second operand 3 states. [2020-10-09 15:30:47,329 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:47,329 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 530 [2020-10-09 15:30:47,329 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:47,467 INFO L129 PetriNetUnfolder]: 51/563 cut-off events. [2020-10-09 15:30:47,468 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:30:47,488 INFO L80 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 563 events. 51/563 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2215 event pairs, 0 based on Foata normal form. 1/495 useless extension candidates. Maximal degree in co-relation 625. Up to 20 conditions per place. [2020-10-09 15:30:47,494 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 5 selfloop transitions, 1 changer transitions 0/501 dead transitions. [2020-10-09 15:30:47,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 501 transitions, 1133 flow [2020-10-09 15:30:47,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2020-10-09 15:30:47,495 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9534591194968554 [2020-10-09 15:30:47,496 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2020-10-09 15:30:47,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2020-10-09 15:30:47,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:47,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2020-10-09 15:30:47,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:47,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:47,497 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:47,497 INFO L185 Difference]: Start difference. First operand has 497 places, 503 transitions, 1131 flow. Second operand 3 states and 1516 transitions. [2020-10-09 15:30:47,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 501 transitions, 1133 flow [2020-10-09 15:30:47,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 501 transitions, 1125 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:47,502 INFO L241 Difference]: Finished difference. Result has 497 places, 501 transitions, 1118 flow [2020-10-09 15:30:47,502 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=494, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=497, PETRI_TRANSITIONS=501} [2020-10-09 15:30:47,502 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 5 predicate places. [2020-10-09 15:30:47,502 INFO L481 AbstractCegarLoop]: Abstraction has has 497 places, 501 transitions, 1118 flow [2020-10-09 15:30:47,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:47,502 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:47,502 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:30:47,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 447 mathsat -unsat_core_generation=3 [2020-10-09 15:30:47,703 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:47,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:47,703 INFO L82 PathProgramCache]: Analyzing trace with hash -841559954, now seen corresponding path program 1 times [2020-10-09 15:30:47,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:47,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881241664] [2020-10-09 15:30:47,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 448 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 448 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:48,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:48,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:30:48,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:30:48,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881241664] [2020-10-09 15:30:48,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:48,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:48,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937813765] [2020-10-09 15:30:48,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:48,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:48,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:48,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:48,038 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:30:48,039 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 501 transitions, 1118 flow. Second operand 3 states. [2020-10-09 15:30:48,039 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:48,039 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:30:48,039 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:48,163 INFO L129 PetriNetUnfolder]: 51/561 cut-off events. [2020-10-09 15:30:48,164 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:30:48,186 INFO L80 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 561 events. 51/561 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2200 event pairs, 0 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 629. Up to 20 conditions per place. [2020-10-09 15:30:48,192 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 8 selfloop transitions, 1 changer transitions 0/499 dead transitions. [2020-10-09 15:30:48,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 499 transitions, 1131 flow [2020-10-09 15:30:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:48,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1504 transitions. [2020-10-09 15:30:48,193 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9459119496855346 [2020-10-09 15:30:48,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1504 transitions. [2020-10-09 15:30:48,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1504 transitions. [2020-10-09 15:30:48,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:48,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1504 transitions. [2020-10-09 15:30:48,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:48,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:48,195 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:48,195 INFO L185 Difference]: Start difference. First operand has 497 places, 501 transitions, 1118 flow. Second operand 3 states and 1504 transitions. [2020-10-09 15:30:48,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 497 places, 499 transitions, 1131 flow [2020-10-09 15:30:48,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 499 transitions, 1130 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:48,199 INFO L241 Difference]: Finished difference. Result has 496 places, 499 transitions, 1114 flow [2020-10-09 15:30:48,200 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=494, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1114, PETRI_PLACES=496, PETRI_TRANSITIONS=499} [2020-10-09 15:30:48,200 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 4 predicate places. [2020-10-09 15:30:48,200 INFO L481 AbstractCegarLoop]: Abstraction has has 496 places, 499 transitions, 1114 flow [2020-10-09 15:30:48,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:48,200 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:48,200 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:30:48,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 448 mathsat -unsat_core_generation=3 [2020-10-09 15:30:48,401 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:48,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:48,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1315577255, now seen corresponding path program 1 times [2020-10-09 15:30:48,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:48,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424303959] [2020-10-09 15:30:48,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 449 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 449 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:48,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:48,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:48,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:30:48,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:30:48,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424303959] [2020-10-09 15:30:48,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:48,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:48,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20872957] [2020-10-09 15:30:48,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:48,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:48,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:48,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:48,727 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 530 [2020-10-09 15:30:48,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 499 transitions, 1114 flow. Second operand 3 states. [2020-10-09 15:30:48,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:48,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 530 [2020-10-09 15:30:48,729 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:48,856 INFO L129 PetriNetUnfolder]: 50/568 cut-off events. [2020-10-09 15:30:48,856 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:48,879 INFO L80 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 568 events. 50/568 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2260 event pairs, 0 based on Foata normal form. 1/500 useless extension candidates. Maximal degree in co-relation 632. Up to 20 conditions per place. [2020-10-09 15:30:48,885 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 4 selfloop transitions, 1 changer transitions 0/499 dead transitions. [2020-10-09 15:30:48,885 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 499 transitions, 1124 flow [2020-10-09 15:30:48,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2020-10-09 15:30:48,886 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2020-10-09 15:30:48,886 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1518 transitions. [2020-10-09 15:30:48,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1518 transitions. [2020-10-09 15:30:48,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:48,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1518 transitions. [2020-10-09 15:30:48,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:48,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:48,888 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:48,888 INFO L185 Difference]: Start difference. First operand has 496 places, 499 transitions, 1114 flow. Second operand 3 states and 1518 transitions. [2020-10-09 15:30:48,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 499 transitions, 1124 flow [2020-10-09 15:30:48,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 499 transitions, 1123 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:48,893 INFO L241 Difference]: Finished difference. Result has 498 places, 499 transitions, 1118 flow [2020-10-09 15:30:48,893 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=498, PETRI_TRANSITIONS=499} [2020-10-09 15:30:48,893 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 6 predicate places. [2020-10-09 15:30:48,893 INFO L481 AbstractCegarLoop]: Abstraction has has 498 places, 499 transitions, 1118 flow [2020-10-09 15:30:48,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:48,893 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:48,893 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:30:49,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 449 mathsat -unsat_core_generation=3 [2020-10-09 15:30:49,094 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:49,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:49,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1315576232, now seen corresponding path program 1 times [2020-10-09 15:30:49,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:49,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853910600] [2020-10-09 15:30:49,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 450 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 450 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:49,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:49,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:30:49,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:49,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:30:49,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853910600] [2020-10-09 15:30:49,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:49,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:49,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025549760] [2020-10-09 15:30:49,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:49,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:49,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:49,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:49,440 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:30:49,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 499 transitions, 1118 flow. Second operand 3 states. [2020-10-09 15:30:49,441 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:49,441 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:30:49,441 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:49,571 INFO L129 PetriNetUnfolder]: 48/570 cut-off events. [2020-10-09 15:30:49,571 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:30:49,594 INFO L80 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 570 events. 48/570 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2293 event pairs, 0 based on Foata normal form. 0/501 useless extension candidates. Maximal degree in co-relation 645. Up to 20 conditions per place. [2020-10-09 15:30:49,600 INFO L132 encePairwiseOnDemand]: 526/530 looper letters, 9 selfloop transitions, 3 changer transitions 0/500 dead transitions. [2020-10-09 15:30:49,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 500 transitions, 1144 flow [2020-10-09 15:30:49,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:49,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1507 transitions. [2020-10-09 15:30:49,601 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9477987421383648 [2020-10-09 15:30:49,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1507 transitions. [2020-10-09 15:30:49,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1507 transitions. [2020-10-09 15:30:49,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:49,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1507 transitions. [2020-10-09 15:30:49,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:49,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:49,603 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:49,603 INFO L185 Difference]: Start difference. First operand has 498 places, 499 transitions, 1118 flow. Second operand 3 states and 1507 transitions. [2020-10-09 15:30:49,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 500 places, 500 transitions, 1144 flow [2020-10-09 15:30:49,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 500 transitions, 1143 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:49,607 INFO L241 Difference]: Finished difference. Result has 501 places, 500 transitions, 1135 flow [2020-10-09 15:30:49,608 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1135, PETRI_PLACES=501, PETRI_TRANSITIONS=500} [2020-10-09 15:30:49,608 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 9 predicate places. [2020-10-09 15:30:49,608 INFO L481 AbstractCegarLoop]: Abstraction has has 501 places, 500 transitions, 1135 flow [2020-10-09 15:30:49,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:49,608 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:49,608 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:30:49,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 450 mathsat -unsat_core_generation=3 [2020-10-09 15:30:49,809 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:49,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:49,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1316529544, now seen corresponding path program 1 times [2020-10-09 15:30:49,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:49,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106700725] [2020-10-09 15:30:49,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 451 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 451 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:50,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:50,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:30:50,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:30:50,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106700725] [2020-10-09 15:30:50,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:50,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:50,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508161333] [2020-10-09 15:30:50,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:50,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:50,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:50,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:50,129 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 530 [2020-10-09 15:30:50,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 500 transitions, 1135 flow. Second operand 3 states. [2020-10-09 15:30:50,130 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:50,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 530 [2020-10-09 15:30:50,131 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:50,257 INFO L129 PetriNetUnfolder]: 48/563 cut-off events. [2020-10-09 15:30:50,257 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:30:50,280 INFO L80 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 563 events. 48/563 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2236 event pairs, 0 based on Foata normal form. 1/498 useless extension candidates. Maximal degree in co-relation 631. Up to 20 conditions per place. [2020-10-09 15:30:50,285 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 5 selfloop transitions, 1 changer transitions 0/498 dead transitions. [2020-10-09 15:30:50,285 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 498 transitions, 1137 flow [2020-10-09 15:30:50,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:50,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2020-10-09 15:30:50,287 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9534591194968554 [2020-10-09 15:30:50,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2020-10-09 15:30:50,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2020-10-09 15:30:50,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:50,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2020-10-09 15:30:50,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:50,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:50,288 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:50,288 INFO L185 Difference]: Start difference. First operand has 501 places, 500 transitions, 1135 flow. Second operand 3 states and 1516 transitions. [2020-10-09 15:30:50,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 503 places, 498 transitions, 1137 flow [2020-10-09 15:30:50,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 500 places, 498 transitions, 1129 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:50,293 INFO L241 Difference]: Finished difference. Result has 501 places, 498 transitions, 1122 flow [2020-10-09 15:30:50,293 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1122, PETRI_PLACES=501, PETRI_TRANSITIONS=498} [2020-10-09 15:30:50,293 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 9 predicate places. [2020-10-09 15:30:50,294 INFO L481 AbstractCegarLoop]: Abstraction has has 501 places, 498 transitions, 1122 flow [2020-10-09 15:30:50,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:50,294 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:50,294 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:30:50,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 451 mathsat -unsat_core_generation=3 [2020-10-09 15:30:50,495 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:50,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:50,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1316530567, now seen corresponding path program 1 times [2020-10-09 15:30:50,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:50,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123832771] [2020-10-09 15:30:50,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 452 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 452 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:50,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:50,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:30:50,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:30:50,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123832771] [2020-10-09 15:30:50,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:50,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:50,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419197407] [2020-10-09 15:30:50,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:50,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:50,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:50,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:50,845 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:30:50,845 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 498 transitions, 1122 flow. Second operand 3 states. [2020-10-09 15:30:50,845 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:50,845 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:30:50,845 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:50,981 INFO L129 PetriNetUnfolder]: 48/561 cut-off events. [2020-10-09 15:30:50,982 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:30:51,006 INFO L80 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 561 events. 48/561 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2221 event pairs, 0 based on Foata normal form. 0/494 useless extension candidates. Maximal degree in co-relation 635. Up to 20 conditions per place. [2020-10-09 15:30:51,012 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 8 selfloop transitions, 1 changer transitions 0/496 dead transitions. [2020-10-09 15:30:51,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 501 places, 496 transitions, 1135 flow [2020-10-09 15:30:51,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:51,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1504 transitions. [2020-10-09 15:30:51,014 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9459119496855346 [2020-10-09 15:30:51,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1504 transitions. [2020-10-09 15:30:51,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1504 transitions. [2020-10-09 15:30:51,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:51,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1504 transitions. [2020-10-09 15:30:51,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:51,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:51,015 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:51,015 INFO L185 Difference]: Start difference. First operand has 501 places, 498 transitions, 1122 flow. Second operand 3 states and 1504 transitions. [2020-10-09 15:30:51,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 501 places, 496 transitions, 1135 flow [2020-10-09 15:30:51,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 500 places, 496 transitions, 1134 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:51,020 INFO L241 Difference]: Finished difference. Result has 500 places, 496 transitions, 1118 flow [2020-10-09 15:30:51,021 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=500, PETRI_TRANSITIONS=496} [2020-10-09 15:30:51,021 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 8 predicate places. [2020-10-09 15:30:51,021 INFO L481 AbstractCegarLoop]: Abstraction has has 500 places, 496 transitions, 1118 flow [2020-10-09 15:30:51,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:51,021 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:51,021 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:30:51,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 452 mathsat -unsat_core_generation=3 [2020-10-09 15:30:51,222 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:51,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:51,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1221061380, now seen corresponding path program 1 times [2020-10-09 15:30:51,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:51,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357774107] [2020-10-09 15:30:51,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 453 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 453 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:51,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:51,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:30:51,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:30:51,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357774107] [2020-10-09 15:30:51,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:51,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:51,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886212030] [2020-10-09 15:30:51,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:51,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:51,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:51,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:51,554 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 530 [2020-10-09 15:30:51,555 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 496 transitions, 1118 flow. Second operand 3 states. [2020-10-09 15:30:51,555 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:51,555 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 530 [2020-10-09 15:30:51,555 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:51,693 INFO L129 PetriNetUnfolder]: 46/566 cut-off events. [2020-10-09 15:30:51,694 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:51,719 INFO L80 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 566 events. 46/566 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2269 event pairs, 0 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 638. Up to 20 conditions per place. [2020-10-09 15:30:51,725 INFO L132 encePairwiseOnDemand]: 527/530 looper letters, 5 selfloop transitions, 2 changer transitions 0/497 dead transitions. [2020-10-09 15:30:51,725 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 497 transitions, 1134 flow [2020-10-09 15:30:51,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:51,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1517 transitions. [2020-10-09 15:30:51,726 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9540880503144654 [2020-10-09 15:30:51,727 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1517 transitions. [2020-10-09 15:30:51,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1517 transitions. [2020-10-09 15:30:51,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:51,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1517 transitions. [2020-10-09 15:30:51,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:51,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:51,728 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:51,728 INFO L185 Difference]: Start difference. First operand has 500 places, 496 transitions, 1118 flow. Second operand 3 states and 1517 transitions. [2020-10-09 15:30:51,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 502 places, 497 transitions, 1134 flow [2020-10-09 15:30:51,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 497 transitions, 1133 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:51,733 INFO L241 Difference]: Finished difference. Result has 503 places, 497 transitions, 1131 flow [2020-10-09 15:30:51,734 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=499, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1131, PETRI_PLACES=503, PETRI_TRANSITIONS=497} [2020-10-09 15:30:51,734 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 11 predicate places. [2020-10-09 15:30:51,734 INFO L481 AbstractCegarLoop]: Abstraction has has 503 places, 497 transitions, 1131 flow [2020-10-09 15:30:51,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:51,734 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:51,734 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:30:51,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 453 mathsat -unsat_core_generation=3 [2020-10-09 15:30:51,935 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:51,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:51,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1221060357, now seen corresponding path program 1 times [2020-10-09 15:30:51,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:51,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992483395] [2020-10-09 15:30:51,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 454 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 454 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:52,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:52,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:30:52,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:30:52,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992483395] [2020-10-09 15:30:52,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:52,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:52,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820464715] [2020-10-09 15:30:52,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:52,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:52,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:52,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:52,283 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:30:52,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 497 transitions, 1131 flow. Second operand 3 states. [2020-10-09 15:30:52,284 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:52,284 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:30:52,284 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:52,427 INFO L129 PetriNetUnfolder]: 46/567 cut-off events. [2020-10-09 15:30:52,427 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:30:52,453 INFO L80 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 567 events. 46/567 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2280 event pairs, 0 based on Foata normal form. 0/501 useless extension candidates. Maximal degree in co-relation 646. Up to 20 conditions per place. [2020-10-09 15:30:52,459 INFO L132 encePairwiseOnDemand]: 526/530 looper letters, 9 selfloop transitions, 3 changer transitions 0/498 dead transitions. [2020-10-09 15:30:52,459 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 498 transitions, 1157 flow [2020-10-09 15:30:52,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1507 transitions. [2020-10-09 15:30:52,460 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9477987421383648 [2020-10-09 15:30:52,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1507 transitions. [2020-10-09 15:30:52,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1507 transitions. [2020-10-09 15:30:52,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:52,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1507 transitions. [2020-10-09 15:30:52,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:52,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:52,462 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:52,462 INFO L185 Difference]: Start difference. First operand has 503 places, 497 transitions, 1131 flow. Second operand 3 states and 1507 transitions. [2020-10-09 15:30:52,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 498 transitions, 1157 flow [2020-10-09 15:30:52,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 498 transitions, 1155 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:52,467 INFO L241 Difference]: Finished difference. Result has 506 places, 498 transitions, 1147 flow [2020-10-09 15:30:52,467 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1147, PETRI_PLACES=506, PETRI_TRANSITIONS=498} [2020-10-09 15:30:52,467 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 14 predicate places. [2020-10-09 15:30:52,468 INFO L481 AbstractCegarLoop]: Abstraction has has 506 places, 498 transitions, 1147 flow [2020-10-09 15:30:52,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:52,468 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:52,468 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:30:52,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 454 mathsat -unsat_core_generation=3 [2020-10-09 15:30:52,668 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:52,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:52,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1222014692, now seen corresponding path program 1 times [2020-10-09 15:30:52,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:52,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328365528] [2020-10-09 15:30:52,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 455 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 455 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:52,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:52,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:30:52,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:52,985 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:30:52,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328365528] [2020-10-09 15:30:52,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:52,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:52,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181652903] [2020-10-09 15:30:52,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:52,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:52,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:52,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:53,011 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:30:53,012 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 498 transitions, 1147 flow. Second operand 3 states. [2020-10-09 15:30:53,012 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:53,012 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:30:53,012 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:53,151 INFO L129 PetriNetUnfolder]: 45/564 cut-off events. [2020-10-09 15:30:53,151 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:30:53,176 INFO L80 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 564 events. 45/564 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2258 event pairs, 0 based on Foata normal form. 2/502 useless extension candidates. Maximal degree in co-relation 645. Up to 20 conditions per place. [2020-10-09 15:30:53,181 INFO L132 encePairwiseOnDemand]: 527/530 looper letters, 9 selfloop transitions, 1 changer transitions 0/496 dead transitions. [2020-10-09 15:30:53,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 496 transitions, 1155 flow [2020-10-09 15:30:53,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1506 transitions. [2020-10-09 15:30:53,183 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9471698113207547 [2020-10-09 15:30:53,183 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1506 transitions. [2020-10-09 15:30:53,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1506 transitions. [2020-10-09 15:30:53,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:53,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1506 transitions. [2020-10-09 15:30:53,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:53,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:53,185 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:53,185 INFO L185 Difference]: Start difference. First operand has 506 places, 498 transitions, 1147 flow. Second operand 3 states and 1506 transitions. [2020-10-09 15:30:53,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 496 transitions, 1155 flow [2020-10-09 15:30:53,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 507 places, 496 transitions, 1154 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:53,189 INFO L241 Difference]: Finished difference. Result has 507 places, 496 transitions, 1136 flow [2020-10-09 15:30:53,190 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=505, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1136, PETRI_PLACES=507, PETRI_TRANSITIONS=496} [2020-10-09 15:30:53,190 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 15 predicate places. [2020-10-09 15:30:53,190 INFO L481 AbstractCegarLoop]: Abstraction has has 507 places, 496 transitions, 1136 flow [2020-10-09 15:30:53,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:53,190 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:53,190 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:30:53,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 455 mathsat -unsat_core_generation=3 [2020-10-09 15:30:53,391 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:53,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:53,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1222013669, now seen corresponding path program 1 times [2020-10-09 15:30:53,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:53,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132191649] [2020-10-09 15:30:53,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 456 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 456 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:53,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:53,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:53,704 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:30:53,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:30:53,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132191649] [2020-10-09 15:30:53,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:53,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:53,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209576956] [2020-10-09 15:30:53,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:53,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:53,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:53,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:53,724 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 530 [2020-10-09 15:30:53,725 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 496 transitions, 1136 flow. Second operand 3 states. [2020-10-09 15:30:53,725 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:53,725 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 530 [2020-10-09 15:30:53,725 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:53,891 INFO L129 PetriNetUnfolder]: 45/561 cut-off events. [2020-10-09 15:30:53,891 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:30:53,915 INFO L80 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 561 events. 45/561 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2239 event pairs, 0 based on Foata normal form. 1/499 useless extension candidates. Maximal degree in co-relation 639. Up to 20 conditions per place. [2020-10-09 15:30:53,921 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 4 selfloop transitions, 1 changer transitions 0/493 dead transitions. [2020-10-09 15:30:53,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 493 transitions, 1135 flow [2020-10-09 15:30:53,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2020-10-09 15:30:53,922 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2020-10-09 15:30:53,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1518 transitions. [2020-10-09 15:30:53,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1518 transitions. [2020-10-09 15:30:53,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:53,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1518 transitions. [2020-10-09 15:30:53,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:53,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:53,925 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:53,925 INFO L185 Difference]: Start difference. First operand has 507 places, 496 transitions, 1136 flow. Second operand 3 states and 1518 transitions. [2020-10-09 15:30:53,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 493 transitions, 1135 flow [2020-10-09 15:30:53,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 493 transitions, 1130 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:53,930 INFO L241 Difference]: Finished difference. Result has 504 places, 493 transitions, 1122 flow [2020-10-09 15:30:53,930 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1122, PETRI_PLACES=504, PETRI_TRANSITIONS=493} [2020-10-09 15:30:53,930 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 12 predicate places. [2020-10-09 15:30:53,931 INFO L481 AbstractCegarLoop]: Abstraction has has 504 places, 493 transitions, 1122 flow [2020-10-09 15:30:53,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:53,931 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:53,931 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:54,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 456 mathsat -unsat_core_generation=3 [2020-10-09 15:30:54,131 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:54,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:54,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1334888818, now seen corresponding path program 1 times [2020-10-09 15:30:54,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:54,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789927441] [2020-10-09 15:30:54,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 457 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 457 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:54,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:54,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:30:54,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:30:54,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789927441] [2020-10-09 15:30:54,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:54,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:54,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202054165] [2020-10-09 15:30:54,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:54,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:54,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:54,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:54,475 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 530 [2020-10-09 15:30:54,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 493 transitions, 1122 flow. Second operand 3 states. [2020-10-09 15:30:54,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:54,477 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 530 [2020-10-09 15:30:54,477 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:54,611 INFO L129 PetriNetUnfolder]: 44/568 cut-off events. [2020-10-09 15:30:54,612 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:54,635 INFO L80 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 568 events. 44/568 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2297 event pairs, 0 based on Foata normal form. 1/505 useless extension candidates. Maximal degree in co-relation 647. Up to 20 conditions per place. [2020-10-09 15:30:54,640 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 4 selfloop transitions, 1 changer transitions 0/493 dead transitions. [2020-10-09 15:30:54,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 493 transitions, 1132 flow [2020-10-09 15:30:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2020-10-09 15:30:54,642 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2020-10-09 15:30:54,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1518 transitions. [2020-10-09 15:30:54,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1518 transitions. [2020-10-09 15:30:54,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:54,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1518 transitions. [2020-10-09 15:30:54,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:54,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:54,643 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:54,643 INFO L185 Difference]: Start difference. First operand has 504 places, 493 transitions, 1122 flow. Second operand 3 states and 1518 transitions. [2020-10-09 15:30:54,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 493 transitions, 1132 flow [2020-10-09 15:30:54,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 505 places, 493 transitions, 1131 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:54,648 INFO L241 Difference]: Finished difference. Result has 506 places, 493 transitions, 1126 flow [2020-10-09 15:30:54,648 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=503, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=506, PETRI_TRANSITIONS=493} [2020-10-09 15:30:54,648 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 14 predicate places. [2020-10-09 15:30:54,648 INFO L481 AbstractCegarLoop]: Abstraction has has 506 places, 493 transitions, 1126 flow [2020-10-09 15:30:54,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:54,648 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:54,648 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:54,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 457 mathsat -unsat_core_generation=3 [2020-10-09 15:30:54,849 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:54,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:54,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1334889841, now seen corresponding path program 1 times [2020-10-09 15:30:54,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:54,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748028710] [2020-10-09 15:30:54,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 458 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 458 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:55,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:55,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:30:55,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:30:55,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748028710] [2020-10-09 15:30:55,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:55,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:55,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660962954] [2020-10-09 15:30:55,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:55,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:55,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:55,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:55,197 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:30:55,198 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 493 transitions, 1126 flow. Second operand 3 states. [2020-10-09 15:30:55,198 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:55,198 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:30:55,198 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:55,335 INFO L129 PetriNetUnfolder]: 42/570 cut-off events. [2020-10-09 15:30:55,335 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:30:55,359 INFO L80 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 570 events. 42/570 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2333 event pairs, 0 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 658. Up to 20 conditions per place. [2020-10-09 15:30:55,364 INFO L132 encePairwiseOnDemand]: 526/530 looper letters, 9 selfloop transitions, 3 changer transitions 0/494 dead transitions. [2020-10-09 15:30:55,364 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 494 transitions, 1152 flow [2020-10-09 15:30:55,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:55,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1507 transitions. [2020-10-09 15:30:55,365 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9477987421383648 [2020-10-09 15:30:55,365 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1507 transitions. [2020-10-09 15:30:55,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1507 transitions. [2020-10-09 15:30:55,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:55,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1507 transitions. [2020-10-09 15:30:55,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:55,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:55,368 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:55,368 INFO L185 Difference]: Start difference. First operand has 506 places, 493 transitions, 1126 flow. Second operand 3 states and 1507 transitions. [2020-10-09 15:30:55,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 494 transitions, 1152 flow [2020-10-09 15:30:55,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 507 places, 494 transitions, 1151 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:55,373 INFO L241 Difference]: Finished difference. Result has 509 places, 494 transitions, 1143 flow [2020-10-09 15:30:55,373 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=505, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1143, PETRI_PLACES=509, PETRI_TRANSITIONS=494} [2020-10-09 15:30:55,373 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 17 predicate places. [2020-10-09 15:30:55,373 INFO L481 AbstractCegarLoop]: Abstraction has has 509 places, 494 transitions, 1143 flow [2020-10-09 15:30:55,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:55,373 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:55,373 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:55,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 458 mathsat -unsat_core_generation=3 [2020-10-09 15:30:55,574 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:55,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:55,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1333936529, now seen corresponding path program 1 times [2020-10-09 15:30:55,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:55,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130169468] [2020-10-09 15:30:55,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 459 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 459 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:55,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:55,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:55,887 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:30:55,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:55,889 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:30:55,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130169468] [2020-10-09 15:30:55,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:55,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:55,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87704122] [2020-10-09 15:30:55,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:55,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:55,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:55,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:55,906 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 530 [2020-10-09 15:30:55,907 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 494 transitions, 1143 flow. Second operand 3 states. [2020-10-09 15:30:55,907 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:55,907 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 530 [2020-10-09 15:30:55,907 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:56,037 INFO L129 PetriNetUnfolder]: 42/563 cut-off events. [2020-10-09 15:30:56,038 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:30:56,061 INFO L80 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 563 events. 42/563 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2269 event pairs, 0 based on Foata normal form. 1/504 useless extension candidates. Maximal degree in co-relation 644. Up to 20 conditions per place. [2020-10-09 15:30:56,065 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 5 selfloop transitions, 1 changer transitions 0/492 dead transitions. [2020-10-09 15:30:56,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 492 transitions, 1145 flow [2020-10-09 15:30:56,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:56,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2020-10-09 15:30:56,067 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9534591194968554 [2020-10-09 15:30:56,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2020-10-09 15:30:56,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2020-10-09 15:30:56,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:56,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2020-10-09 15:30:56,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:56,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:56,069 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:56,069 INFO L185 Difference]: Start difference. First operand has 509 places, 494 transitions, 1143 flow. Second operand 3 states and 1516 transitions. [2020-10-09 15:30:56,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 492 transitions, 1145 flow [2020-10-09 15:30:56,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 492 transitions, 1137 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:56,073 INFO L241 Difference]: Finished difference. Result has 509 places, 492 transitions, 1130 flow [2020-10-09 15:30:56,073 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1130, PETRI_PLACES=509, PETRI_TRANSITIONS=492} [2020-10-09 15:30:56,074 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 17 predicate places. [2020-10-09 15:30:56,074 INFO L481 AbstractCegarLoop]: Abstraction has has 509 places, 492 transitions, 1130 flow [2020-10-09 15:30:56,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:56,074 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:56,074 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:56,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 459 mathsat -unsat_core_generation=3 [2020-10-09 15:30:56,275 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:56,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:56,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1333935506, now seen corresponding path program 1 times [2020-10-09 15:30:56,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:56,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615207984] [2020-10-09 15:30:56,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 460 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 460 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:56,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:56,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:30:56,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:56,592 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:30:56,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615207984] [2020-10-09 15:30:56,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:56,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:56,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758953801] [2020-10-09 15:30:56,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:56,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:56,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:56,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:56,620 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:30:56,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 492 transitions, 1130 flow. Second operand 3 states. [2020-10-09 15:30:56,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:56,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:30:56,621 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:56,753 INFO L129 PetriNetUnfolder]: 42/561 cut-off events. [2020-10-09 15:30:56,753 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:30:56,776 INFO L80 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 561 events. 42/561 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2252 event pairs, 0 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 648. Up to 20 conditions per place. [2020-10-09 15:30:56,781 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 8 selfloop transitions, 1 changer transitions 0/490 dead transitions. [2020-10-09 15:30:56,781 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 490 transitions, 1143 flow [2020-10-09 15:30:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1504 transitions. [2020-10-09 15:30:56,782 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9459119496855346 [2020-10-09 15:30:56,782 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1504 transitions. [2020-10-09 15:30:56,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1504 transitions. [2020-10-09 15:30:56,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:56,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1504 transitions. [2020-10-09 15:30:56,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:56,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:56,785 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:56,785 INFO L185 Difference]: Start difference. First operand has 509 places, 492 transitions, 1130 flow. Second operand 3 states and 1504 transitions. [2020-10-09 15:30:56,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 490 transitions, 1143 flow [2020-10-09 15:30:56,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 490 transitions, 1142 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:56,789 INFO L241 Difference]: Finished difference. Result has 508 places, 490 transitions, 1126 flow [2020-10-09 15:30:56,790 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=508, PETRI_TRANSITIONS=490} [2020-10-09 15:30:56,790 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 16 predicate places. [2020-10-09 15:30:56,790 INFO L481 AbstractCegarLoop]: Abstraction has has 508 places, 490 transitions, 1126 flow [2020-10-09 15:30:56,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:56,790 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:56,790 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:56,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 460 mathsat -unsat_core_generation=3 [2020-10-09 15:30:56,991 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:56,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:56,991 INFO L82 PathProgramCache]: Analyzing trace with hash -58875488, now seen corresponding path program 1 times [2020-10-09 15:30:56,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:56,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573959304] [2020-10-09 15:30:56,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 461 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 461 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:57,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:57,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:30:57,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:30:57,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573959304] [2020-10-09 15:30:57,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:57,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:57,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277580736] [2020-10-09 15:30:57,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:57,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:57,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:57,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:57,351 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:30:57,352 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 490 transitions, 1126 flow. Second operand 3 states. [2020-10-09 15:30:57,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:57,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:30:57,352 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:57,500 INFO L129 PetriNetUnfolder]: 41/569 cut-off events. [2020-10-09 15:30:57,501 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:57,528 INFO L80 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 569 events. 41/569 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2326 event pairs, 0 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 660. Up to 20 conditions per place. [2020-10-09 15:30:57,533 INFO L132 encePairwiseOnDemand]: 525/530 looper letters, 10 selfloop transitions, 3 changer transitions 0/492 dead transitions. [2020-10-09 15:30:57,533 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 492 transitions, 1156 flow [2020-10-09 15:30:57,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1509 transitions. [2020-10-09 15:30:57,534 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9490566037735849 [2020-10-09 15:30:57,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1509 transitions. [2020-10-09 15:30:57,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1509 transitions. [2020-10-09 15:30:57,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:57,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1509 transitions. [2020-10-09 15:30:57,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:57,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:57,536 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:57,536 INFO L185 Difference]: Start difference. First operand has 508 places, 490 transitions, 1126 flow. Second operand 3 states and 1509 transitions. [2020-10-09 15:30:57,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 510 places, 492 transitions, 1156 flow [2020-10-09 15:30:57,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 509 places, 492 transitions, 1155 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:57,541 INFO L241 Difference]: Finished difference. Result has 511 places, 492 transitions, 1149 flow [2020-10-09 15:30:57,542 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1149, PETRI_PLACES=511, PETRI_TRANSITIONS=492} [2020-10-09 15:30:57,542 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 19 predicate places. [2020-10-09 15:30:57,542 INFO L481 AbstractCegarLoop]: Abstraction has has 511 places, 492 transitions, 1149 flow [2020-10-09 15:30:57,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:57,542 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:57,542 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:57,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 461 mathsat -unsat_core_generation=3 [2020-10-09 15:30:57,743 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:57,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:57,743 INFO L82 PathProgramCache]: Analyzing trace with hash -58874465, now seen corresponding path program 1 times [2020-10-09 15:30:57,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:57,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238618553] [2020-10-09 15:30:57,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 462 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 462 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:58,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:58,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:30:58,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:58,066 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:30:58,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238618553] [2020-10-09 15:30:58,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:58,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:58,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464334923] [2020-10-09 15:30:58,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:58,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:58,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:58,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:58,077 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 530 [2020-10-09 15:30:58,078 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 492 transitions, 1149 flow. Second operand 3 states. [2020-10-09 15:30:58,079 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:58,079 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 530 [2020-10-09 15:30:58,079 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:58,223 INFO L129 PetriNetUnfolder]: 40/567 cut-off events. [2020-10-09 15:30:58,223 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:30:58,249 INFO L80 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 567 events. 40/567 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2316 event pairs, 0 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 657. Up to 20 conditions per place. [2020-10-09 15:30:58,255 INFO L132 encePairwiseOnDemand]: 527/530 looper letters, 5 selfloop transitions, 2 changer transitions 0/492 dead transitions. [2020-10-09 15:30:58,255 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 492 transitions, 1161 flow [2020-10-09 15:30:58,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:58,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1517 transitions. [2020-10-09 15:30:58,256 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9540880503144654 [2020-10-09 15:30:58,256 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1517 transitions. [2020-10-09 15:30:58,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1517 transitions. [2020-10-09 15:30:58,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:58,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1517 transitions. [2020-10-09 15:30:58,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:58,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:58,258 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:58,258 INFO L185 Difference]: Start difference. First operand has 511 places, 492 transitions, 1149 flow. Second operand 3 states and 1517 transitions. [2020-10-09 15:30:58,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 492 transitions, 1161 flow [2020-10-09 15:30:58,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 492 transitions, 1156 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:58,263 INFO L241 Difference]: Finished difference. Result has 514 places, 492 transitions, 1154 flow [2020-10-09 15:30:58,263 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=514, PETRI_TRANSITIONS=492} [2020-10-09 15:30:58,263 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 22 predicate places. [2020-10-09 15:30:58,263 INFO L481 AbstractCegarLoop]: Abstraction has has 514 places, 492 transitions, 1154 flow [2020-10-09 15:30:58,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:58,264 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:58,264 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:58,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 462 mathsat -unsat_core_generation=3 [2020-10-09 15:30:58,464 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:58,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:58,465 INFO L82 PathProgramCache]: Analyzing trace with hash -57922176, now seen corresponding path program 1 times [2020-10-09 15:30:58,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:58,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008370560] [2020-10-09 15:30:58,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 463 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 463 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:58,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:30:58,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:58,784 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:30:58,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:30:58,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008370560] [2020-10-09 15:30:58,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:58,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:58,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091644728] [2020-10-09 15:30:58,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:58,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:58,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:58,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:58,809 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 530 [2020-10-09 15:30:58,810 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 492 transitions, 1154 flow. Second operand 3 states. [2020-10-09 15:30:58,810 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:58,810 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 530 [2020-10-09 15:30:58,810 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:58,952 INFO L129 PetriNetUnfolder]: 39/563 cut-off events. [2020-10-09 15:30:58,952 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:30:58,978 INFO L80 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 563 events. 39/563 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2287 event pairs, 0 based on Foata normal form. 1/507 useless extension candidates. Maximal degree in co-relation 653. Up to 20 conditions per place. [2020-10-09 15:30:58,983 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 4 selfloop transitions, 1 changer transitions 0/489 dead transitions. [2020-10-09 15:30:58,983 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 489 transitions, 1149 flow [2020-10-09 15:30:58,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2020-10-09 15:30:58,984 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2020-10-09 15:30:58,984 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1518 transitions. [2020-10-09 15:30:58,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1518 transitions. [2020-10-09 15:30:58,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:58,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1518 transitions. [2020-10-09 15:30:58,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:58,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:58,986 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:58,986 INFO L185 Difference]: Start difference. First operand has 514 places, 492 transitions, 1154 flow. Second operand 3 states and 1518 transitions. [2020-10-09 15:30:58,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 489 transitions, 1149 flow [2020-10-09 15:30:58,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 489 transitions, 1142 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:30:58,991 INFO L241 Difference]: Finished difference. Result has 513 places, 489 transitions, 1134 flow [2020-10-09 15:30:58,991 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1134, PETRI_PLACES=513, PETRI_TRANSITIONS=489} [2020-10-09 15:30:58,991 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 21 predicate places. [2020-10-09 15:30:58,992 INFO L481 AbstractCegarLoop]: Abstraction has has 513 places, 489 transitions, 1134 flow [2020-10-09 15:30:58,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:58,992 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:58,992 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:59,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 463 mathsat -unsat_core_generation=3 [2020-10-09 15:30:59,192 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:59,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:59,193 INFO L82 PathProgramCache]: Analyzing trace with hash -57921153, now seen corresponding path program 1 times [2020-10-09 15:30:59,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:59,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906969618] [2020-10-09 15:30:59,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 464 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 464 with mathsat -unsat_core_generation=3 [2020-10-09 15:30:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:30:59,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:30:59,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:30:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:30:59,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:30:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:30:59,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906969618] [2020-10-09 15:30:59,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:30:59,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:30:59,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410651831] [2020-10-09 15:30:59,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:30:59,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:30:59,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:30:59,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:30:59,545 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:30:59,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 489 transitions, 1134 flow. Second operand 3 states. [2020-10-09 15:30:59,546 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:30:59,546 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:30:59,546 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:30:59,684 INFO L129 PetriNetUnfolder]: 39/561 cut-off events. [2020-10-09 15:30:59,684 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:30:59,708 INFO L80 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 561 events. 39/561 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2273 event pairs, 0 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 655. Up to 20 conditions per place. [2020-10-09 15:30:59,713 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 8 selfloop transitions, 1 changer transitions 0/487 dead transitions. [2020-10-09 15:30:59,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 487 transitions, 1147 flow [2020-10-09 15:30:59,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:30:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:30:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1504 transitions. [2020-10-09 15:30:59,714 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9459119496855346 [2020-10-09 15:30:59,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1504 transitions. [2020-10-09 15:30:59,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1504 transitions. [2020-10-09 15:30:59,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:30:59,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1504 transitions. [2020-10-09 15:30:59,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:30:59,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:30:59,716 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:30:59,716 INFO L185 Difference]: Start difference. First operand has 513 places, 489 transitions, 1134 flow. Second operand 3 states and 1504 transitions. [2020-10-09 15:30:59,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 487 transitions, 1147 flow [2020-10-09 15:30:59,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 487 transitions, 1146 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:30:59,721 INFO L241 Difference]: Finished difference. Result has 512 places, 487 transitions, 1130 flow [2020-10-09 15:30:59,722 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1130, PETRI_PLACES=512, PETRI_TRANSITIONS=487} [2020-10-09 15:30:59,722 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 20 predicate places. [2020-10-09 15:30:59,722 INFO L481 AbstractCegarLoop]: Abstraction has has 512 places, 487 transitions, 1130 flow [2020-10-09 15:30:59,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:30:59,722 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:30:59,722 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:30:59,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 464 mathsat -unsat_core_generation=3 [2020-10-09 15:30:59,923 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:30:59,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:30:59,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1319310990, now seen corresponding path program 1 times [2020-10-09 15:30:59,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:30:59,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022318466] [2020-10-09 15:30:59,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 465 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 465 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:00,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:00,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:31:00,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:31:00,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022318466] [2020-10-09 15:31:00,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:00,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:00,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243557220] [2020-10-09 15:31:00,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:00,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:00,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:00,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:00,279 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:31:00,280 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 487 transitions, 1130 flow. Second operand 3 states. [2020-10-09 15:31:00,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:00,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:31:00,280 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:00,426 INFO L129 PetriNetUnfolder]: 38/569 cut-off events. [2020-10-09 15:31:00,426 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:31:00,451 INFO L80 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 569 events. 38/569 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2342 event pairs, 0 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 667. Up to 20 conditions per place. [2020-10-09 15:31:00,455 INFO L132 encePairwiseOnDemand]: 525/530 looper letters, 10 selfloop transitions, 3 changer transitions 0/489 dead transitions. [2020-10-09 15:31:00,455 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 489 transitions, 1160 flow [2020-10-09 15:31:00,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:00,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1509 transitions. [2020-10-09 15:31:00,457 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9490566037735849 [2020-10-09 15:31:00,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1509 transitions. [2020-10-09 15:31:00,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1509 transitions. [2020-10-09 15:31:00,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:00,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1509 transitions. [2020-10-09 15:31:00,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:00,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:00,458 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:00,458 INFO L185 Difference]: Start difference. First operand has 512 places, 487 transitions, 1130 flow. Second operand 3 states and 1509 transitions. [2020-10-09 15:31:00,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 489 transitions, 1160 flow [2020-10-09 15:31:00,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 489 transitions, 1159 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:00,463 INFO L241 Difference]: Finished difference. Result has 515 places, 489 transitions, 1153 flow [2020-10-09 15:31:00,464 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1153, PETRI_PLACES=515, PETRI_TRANSITIONS=489} [2020-10-09 15:31:00,464 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 23 predicate places. [2020-10-09 15:31:00,464 INFO L481 AbstractCegarLoop]: Abstraction has has 515 places, 489 transitions, 1153 flow [2020-10-09 15:31:00,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:00,464 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:00,464 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:00,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 465 mathsat -unsat_core_generation=3 [2020-10-09 15:31:00,665 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:00,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:00,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1319309967, now seen corresponding path program 1 times [2020-10-09 15:31:00,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:00,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184624012] [2020-10-09 15:31:00,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 466 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 466 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:00,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:00,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:31:00,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:00,993 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:31:00,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184624012] [2020-10-09 15:31:00,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:00,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:00,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756364938] [2020-10-09 15:31:00,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:00,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:00,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:00,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:01,006 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 530 [2020-10-09 15:31:01,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 489 transitions, 1153 flow. Second operand 3 states. [2020-10-09 15:31:01,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:01,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 530 [2020-10-09 15:31:01,007 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:01,154 INFO L129 PetriNetUnfolder]: 36/570 cut-off events. [2020-10-09 15:31:01,154 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:31:01,180 INFO L80 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 570 events. 36/570 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2364 event pairs, 0 based on Foata normal form. 1/517 useless extension candidates. Maximal degree in co-relation 665. Up to 20 conditions per place. [2020-10-09 15:31:01,185 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 4 selfloop transitions, 1 changer transitions 0/488 dead transitions. [2020-10-09 15:31:01,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 488 transitions, 1159 flow [2020-10-09 15:31:01,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2020-10-09 15:31:01,186 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2020-10-09 15:31:01,186 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1518 transitions. [2020-10-09 15:31:01,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1518 transitions. [2020-10-09 15:31:01,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:01,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1518 transitions. [2020-10-09 15:31:01,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:01,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:01,189 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:01,189 INFO L185 Difference]: Start difference. First operand has 515 places, 489 transitions, 1153 flow. Second operand 3 states and 1518 transitions. [2020-10-09 15:31:01,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 488 transitions, 1159 flow [2020-10-09 15:31:01,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 488 transitions, 1154 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:01,194 INFO L241 Difference]: Finished difference. Result has 517 places, 488 transitions, 1149 flow [2020-10-09 15:31:01,194 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1149, PETRI_PLACES=517, PETRI_TRANSITIONS=488} [2020-10-09 15:31:01,194 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 25 predicate places. [2020-10-09 15:31:01,194 INFO L481 AbstractCegarLoop]: Abstraction has has 517 places, 488 transitions, 1149 flow [2020-10-09 15:31:01,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:01,194 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:01,195 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:01,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 466 mathsat -unsat_core_generation=3 [2020-10-09 15:31:01,395 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:01,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:01,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1318357678, now seen corresponding path program 1 times [2020-10-09 15:31:01,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:01,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680119990] [2020-10-09 15:31:01,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 467 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 467 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:01,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:01,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:31:01,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:31:01,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680119990] [2020-10-09 15:31:01,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:01,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:01,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758580158] [2020-10-09 15:31:01,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:01,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:01,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:01,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:01,726 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 530 [2020-10-09 15:31:01,727 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 488 transitions, 1149 flow. Second operand 3 states. [2020-10-09 15:31:01,727 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:01,727 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 530 [2020-10-09 15:31:01,727 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:01,862 INFO L129 PetriNetUnfolder]: 36/563 cut-off events. [2020-10-09 15:31:01,862 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:31:01,885 INFO L80 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 563 events. 36/563 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2306 event pairs, 0 based on Foata normal form. 1/510 useless extension candidates. Maximal degree in co-relation 661. Up to 20 conditions per place. [2020-10-09 15:31:01,890 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 5 selfloop transitions, 1 changer transitions 0/486 dead transitions. [2020-10-09 15:31:01,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 486 transitions, 1152 flow [2020-10-09 15:31:01,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2020-10-09 15:31:01,891 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9534591194968554 [2020-10-09 15:31:01,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2020-10-09 15:31:01,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2020-10-09 15:31:01,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:01,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2020-10-09 15:31:01,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:01,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:01,893 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:01,893 INFO L185 Difference]: Start difference. First operand has 517 places, 488 transitions, 1149 flow. Second operand 3 states and 1516 transitions. [2020-10-09 15:31:01,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 486 transitions, 1152 flow [2020-10-09 15:31:01,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 486 transitions, 1145 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:01,898 INFO L241 Difference]: Finished difference. Result has 517 places, 486 transitions, 1138 flow [2020-10-09 15:31:01,898 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1138, PETRI_PLACES=517, PETRI_TRANSITIONS=486} [2020-10-09 15:31:01,898 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 25 predicate places. [2020-10-09 15:31:01,898 INFO L481 AbstractCegarLoop]: Abstraction has has 517 places, 486 transitions, 1138 flow [2020-10-09 15:31:01,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:01,898 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:01,898 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:02,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 467 mathsat -unsat_core_generation=3 [2020-10-09 15:31:02,099 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:02,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:02,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1318356655, now seen corresponding path program 1 times [2020-10-09 15:31:02,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:02,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628005592] [2020-10-09 15:31:02,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 468 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 468 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:02,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:02,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:31:02,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:31:02,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628005592] [2020-10-09 15:31:02,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:02,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:02,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632734533] [2020-10-09 15:31:02,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:02,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:02,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:02,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:02,439 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:31:02,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 486 transitions, 1138 flow. Second operand 3 states. [2020-10-09 15:31:02,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:02,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:31:02,440 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:02,580 INFO L129 PetriNetUnfolder]: 36/561 cut-off events. [2020-10-09 15:31:02,581 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:02,604 INFO L80 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 561 events. 36/561 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2292 event pairs, 0 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 661. Up to 20 conditions per place. [2020-10-09 15:31:02,608 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 8 selfloop transitions, 1 changer transitions 0/484 dead transitions. [2020-10-09 15:31:02,608 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 484 transitions, 1151 flow [2020-10-09 15:31:02,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:02,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:02,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1504 transitions. [2020-10-09 15:31:02,609 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9459119496855346 [2020-10-09 15:31:02,609 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1504 transitions. [2020-10-09 15:31:02,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1504 transitions. [2020-10-09 15:31:02,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:02,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1504 transitions. [2020-10-09 15:31:02,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:02,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:02,611 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:02,611 INFO L185 Difference]: Start difference. First operand has 517 places, 486 transitions, 1138 flow. Second operand 3 states and 1504 transitions. [2020-10-09 15:31:02,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 484 transitions, 1151 flow [2020-10-09 15:31:02,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 484 transitions, 1150 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:02,616 INFO L241 Difference]: Finished difference. Result has 516 places, 484 transitions, 1134 flow [2020-10-09 15:31:02,616 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1134, PETRI_PLACES=516, PETRI_TRANSITIONS=484} [2020-10-09 15:31:02,616 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 24 predicate places. [2020-10-09 15:31:02,616 INFO L481 AbstractCegarLoop]: Abstraction has has 516 places, 484 transitions, 1134 flow [2020-10-09 15:31:02,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:02,616 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:02,616 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:02,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 468 mathsat -unsat_core_generation=3 [2020-10-09 15:31:02,817 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:02,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:02,817 INFO L82 PathProgramCache]: Analyzing trace with hash -931654626, now seen corresponding path program 1 times [2020-10-09 15:31:02,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:02,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888664743] [2020-10-09 15:31:02,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 469 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 469 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:03,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:03,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:03,150 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:31:03,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:31:03,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888664743] [2020-10-09 15:31:03,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:03,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:03,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398810859] [2020-10-09 15:31:03,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:03,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:03,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:03,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:03,188 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:31:03,188 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 484 transitions, 1134 flow. Second operand 3 states. [2020-10-09 15:31:03,189 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:03,189 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:31:03,189 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:03,331 INFO L129 PetriNetUnfolder]: 35/569 cut-off events. [2020-10-09 15:31:03,332 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:31:03,356 INFO L80 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 569 events. 35/569 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2359 event pairs, 0 based on Foata normal form. 0/514 useless extension candidates. Maximal degree in co-relation 673. Up to 20 conditions per place. [2020-10-09 15:31:03,360 INFO L132 encePairwiseOnDemand]: 525/530 looper letters, 10 selfloop transitions, 3 changer transitions 0/486 dead transitions. [2020-10-09 15:31:03,360 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 486 transitions, 1164 flow [2020-10-09 15:31:03,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:03,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1509 transitions. [2020-10-09 15:31:03,361 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9490566037735849 [2020-10-09 15:31:03,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1509 transitions. [2020-10-09 15:31:03,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1509 transitions. [2020-10-09 15:31:03,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:03,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1509 transitions. [2020-10-09 15:31:03,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:03,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:03,363 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:03,363 INFO L185 Difference]: Start difference. First operand has 516 places, 484 transitions, 1134 flow. Second operand 3 states and 1509 transitions. [2020-10-09 15:31:03,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 486 transitions, 1164 flow [2020-10-09 15:31:03,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 486 transitions, 1163 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:03,368 INFO L241 Difference]: Finished difference. Result has 519 places, 486 transitions, 1157 flow [2020-10-09 15:31:03,368 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1157, PETRI_PLACES=519, PETRI_TRANSITIONS=486} [2020-10-09 15:31:03,368 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 27 predicate places. [2020-10-09 15:31:03,368 INFO L481 AbstractCegarLoop]: Abstraction has has 519 places, 486 transitions, 1157 flow [2020-10-09 15:31:03,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:03,368 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:03,368 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:03,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 469 mathsat -unsat_core_generation=3 [2020-10-09 15:31:03,569 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:03,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:03,569 INFO L82 PathProgramCache]: Analyzing trace with hash -931655649, now seen corresponding path program 1 times [2020-10-09 15:31:03,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:03,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953800285] [2020-10-09 15:31:03,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 470 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 470 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:03,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:03,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:31:03,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:03,891 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:31:03,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953800285] [2020-10-09 15:31:03,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:03,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:03,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773875329] [2020-10-09 15:31:03,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:03,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:03,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:03,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:03,903 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 530 [2020-10-09 15:31:03,904 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 486 transitions, 1157 flow. Second operand 3 states. [2020-10-09 15:31:03,904 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:03,904 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 530 [2020-10-09 15:31:03,904 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:04,044 INFO L129 PetriNetUnfolder]: 33/570 cut-off events. [2020-10-09 15:31:04,044 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:31:04,068 INFO L80 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 570 events. 33/570 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2382 event pairs, 0 based on Foata normal form. 1/520 useless extension candidates. Maximal degree in co-relation 671. Up to 20 conditions per place. [2020-10-09 15:31:04,072 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 4 selfloop transitions, 1 changer transitions 0/485 dead transitions. [2020-10-09 15:31:04,072 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 485 transitions, 1163 flow [2020-10-09 15:31:04,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2020-10-09 15:31:04,073 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2020-10-09 15:31:04,073 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1518 transitions. [2020-10-09 15:31:04,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1518 transitions. [2020-10-09 15:31:04,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:04,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1518 transitions. [2020-10-09 15:31:04,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:04,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:04,075 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:04,075 INFO L185 Difference]: Start difference. First operand has 519 places, 486 transitions, 1157 flow. Second operand 3 states and 1518 transitions. [2020-10-09 15:31:04,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 485 transitions, 1163 flow [2020-10-09 15:31:04,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 485 transitions, 1158 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:04,080 INFO L241 Difference]: Finished difference. Result has 521 places, 485 transitions, 1153 flow [2020-10-09 15:31:04,080 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1153, PETRI_PLACES=521, PETRI_TRANSITIONS=485} [2020-10-09 15:31:04,080 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 29 predicate places. [2020-10-09 15:31:04,080 INFO L481 AbstractCegarLoop]: Abstraction has has 521 places, 485 transitions, 1153 flow [2020-10-09 15:31:04,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:04,080 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:04,080 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:04,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 470 mathsat -unsat_core_generation=3 [2020-10-09 15:31:04,281 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:04,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:04,282 INFO L82 PathProgramCache]: Analyzing trace with hash -932607938, now seen corresponding path program 1 times [2020-10-09 15:31:04,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:04,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415687054] [2020-10-09 15:31:04,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 471 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 471 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:04,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:04,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:31:04,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:31:04,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415687054] [2020-10-09 15:31:04,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:04,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:04,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664539882] [2020-10-09 15:31:04,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:04,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:04,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:04,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:04,613 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 530 [2020-10-09 15:31:04,614 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 485 transitions, 1153 flow. Second operand 3 states. [2020-10-09 15:31:04,615 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:04,615 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 530 [2020-10-09 15:31:04,615 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:04,755 INFO L129 PetriNetUnfolder]: 33/563 cut-off events. [2020-10-09 15:31:04,755 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:31:04,778 INFO L80 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 563 events. 33/563 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2319 event pairs, 0 based on Foata normal form. 1/513 useless extension candidates. Maximal degree in co-relation 667. Up to 20 conditions per place. [2020-10-09 15:31:04,782 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 5 selfloop transitions, 1 changer transitions 0/483 dead transitions. [2020-10-09 15:31:04,782 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 483 transitions, 1156 flow [2020-10-09 15:31:04,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2020-10-09 15:31:04,783 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9534591194968554 [2020-10-09 15:31:04,783 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2020-10-09 15:31:04,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2020-10-09 15:31:04,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:04,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2020-10-09 15:31:04,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:04,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:04,785 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:04,785 INFO L185 Difference]: Start difference. First operand has 521 places, 485 transitions, 1153 flow. Second operand 3 states and 1516 transitions. [2020-10-09 15:31:04,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 483 transitions, 1156 flow [2020-10-09 15:31:04,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 483 transitions, 1149 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:04,790 INFO L241 Difference]: Finished difference. Result has 521 places, 483 transitions, 1142 flow [2020-10-09 15:31:04,790 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=521, PETRI_TRANSITIONS=483} [2020-10-09 15:31:04,790 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 29 predicate places. [2020-10-09 15:31:04,790 INFO L481 AbstractCegarLoop]: Abstraction has has 521 places, 483 transitions, 1142 flow [2020-10-09 15:31:04,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:04,790 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:04,790 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:04,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 471 mathsat -unsat_core_generation=3 [2020-10-09 15:31:04,991 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:04,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:04,992 INFO L82 PathProgramCache]: Analyzing trace with hash -932608961, now seen corresponding path program 1 times [2020-10-09 15:31:04,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:04,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030702791] [2020-10-09 15:31:04,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 472 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 472 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:05,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:05,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:31:05,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:31:05,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030702791] [2020-10-09 15:31:05,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:05,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:05,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359897182] [2020-10-09 15:31:05,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:05,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:05,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:05,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:05,333 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:31:05,334 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 483 transitions, 1142 flow. Second operand 3 states. [2020-10-09 15:31:05,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:05,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:31:05,334 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:05,484 INFO L129 PetriNetUnfolder]: 33/561 cut-off events. [2020-10-09 15:31:05,484 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:05,509 INFO L80 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 561 events. 33/561 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2305 event pairs, 0 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 667. Up to 20 conditions per place. [2020-10-09 15:31:05,513 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 8 selfloop transitions, 1 changer transitions 0/481 dead transitions. [2020-10-09 15:31:05,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 481 transitions, 1155 flow [2020-10-09 15:31:05,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:05,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:05,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1504 transitions. [2020-10-09 15:31:05,514 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9459119496855346 [2020-10-09 15:31:05,515 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1504 transitions. [2020-10-09 15:31:05,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1504 transitions. [2020-10-09 15:31:05,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:05,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1504 transitions. [2020-10-09 15:31:05,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:05,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:05,516 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:05,516 INFO L185 Difference]: Start difference. First operand has 521 places, 483 transitions, 1142 flow. Second operand 3 states and 1504 transitions. [2020-10-09 15:31:05,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 481 transitions, 1155 flow [2020-10-09 15:31:05,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 481 transitions, 1154 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:05,521 INFO L241 Difference]: Finished difference. Result has 520 places, 481 transitions, 1138 flow [2020-10-09 15:31:05,522 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1138, PETRI_PLACES=520, PETRI_TRANSITIONS=481} [2020-10-09 15:31:05,522 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 28 predicate places. [2020-10-09 15:31:05,522 INFO L481 AbstractCegarLoop]: Abstraction has has 520 places, 481 transitions, 1138 flow [2020-10-09 15:31:05,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:05,522 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:05,522 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:05,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 472 mathsat -unsat_core_generation=3 [2020-10-09 15:31:05,723 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:05,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:05,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1207052751, now seen corresponding path program 1 times [2020-10-09 15:31:05,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:05,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491661708] [2020-10-09 15:31:05,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 473 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 473 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:06,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:06,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:31:06,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:31:06,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491661708] [2020-10-09 15:31:06,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:06,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:06,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779013978] [2020-10-09 15:31:06,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:06,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:06,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:06,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:06,073 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 530 [2020-10-09 15:31:06,074 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 481 transitions, 1138 flow. Second operand 3 states. [2020-10-09 15:31:06,074 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:06,074 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 530 [2020-10-09 15:31:06,074 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:06,221 INFO L129 PetriNetUnfolder]: 31/566 cut-off events. [2020-10-09 15:31:06,221 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:31:06,246 INFO L80 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 566 events. 31/566 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2354 event pairs, 0 based on Foata normal form. 0/515 useless extension candidates. Maximal degree in co-relation 670. Up to 20 conditions per place. [2020-10-09 15:31:06,250 INFO L132 encePairwiseOnDemand]: 527/530 looper letters, 5 selfloop transitions, 2 changer transitions 0/482 dead transitions. [2020-10-09 15:31:06,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 482 transitions, 1154 flow [2020-10-09 15:31:06,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:06,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1517 transitions. [2020-10-09 15:31:06,252 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9540880503144654 [2020-10-09 15:31:06,252 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1517 transitions. [2020-10-09 15:31:06,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1517 transitions. [2020-10-09 15:31:06,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:06,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1517 transitions. [2020-10-09 15:31:06,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:06,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:06,253 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:06,253 INFO L185 Difference]: Start difference. First operand has 520 places, 481 transitions, 1138 flow. Second operand 3 states and 1517 transitions. [2020-10-09 15:31:06,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 482 transitions, 1154 flow [2020-10-09 15:31:06,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 482 transitions, 1153 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:06,259 INFO L241 Difference]: Finished difference. Result has 523 places, 482 transitions, 1151 flow [2020-10-09 15:31:06,259 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1151, PETRI_PLACES=523, PETRI_TRANSITIONS=482} [2020-10-09 15:31:06,259 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 31 predicate places. [2020-10-09 15:31:06,259 INFO L481 AbstractCegarLoop]: Abstraction has has 523 places, 482 transitions, 1151 flow [2020-10-09 15:31:06,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:06,259 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:06,259 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:06,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 473 mathsat -unsat_core_generation=3 [2020-10-09 15:31:06,460 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:06,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:06,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1207051728, now seen corresponding path program 1 times [2020-10-09 15:31:06,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:06,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632238599] [2020-10-09 15:31:06,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 474 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 474 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:06,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:06,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:31:06,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:31:06,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632238599] [2020-10-09 15:31:06,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:06,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:06,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254378999] [2020-10-09 15:31:06,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:06,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:06,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:06,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:06,820 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:31:06,821 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 482 transitions, 1151 flow. Second operand 3 states. [2020-10-09 15:31:06,821 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:06,821 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:31:06,821 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:06,973 INFO L129 PetriNetUnfolder]: 31/567 cut-off events. [2020-10-09 15:31:06,973 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:31:06,999 INFO L80 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 567 events. 31/567 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2364 event pairs, 0 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 678. Up to 20 conditions per place. [2020-10-09 15:31:07,003 INFO L132 encePairwiseOnDemand]: 526/530 looper letters, 9 selfloop transitions, 3 changer transitions 0/483 dead transitions. [2020-10-09 15:31:07,004 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 483 transitions, 1177 flow [2020-10-09 15:31:07,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:07,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:07,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1507 transitions. [2020-10-09 15:31:07,005 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9477987421383648 [2020-10-09 15:31:07,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1507 transitions. [2020-10-09 15:31:07,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1507 transitions. [2020-10-09 15:31:07,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:07,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1507 transitions. [2020-10-09 15:31:07,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:07,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:07,007 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:07,007 INFO L185 Difference]: Start difference. First operand has 523 places, 482 transitions, 1151 flow. Second operand 3 states and 1507 transitions. [2020-10-09 15:31:07,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 483 transitions, 1177 flow [2020-10-09 15:31:07,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 483 transitions, 1175 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:07,012 INFO L241 Difference]: Finished difference. Result has 526 places, 483 transitions, 1167 flow [2020-10-09 15:31:07,012 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1167, PETRI_PLACES=526, PETRI_TRANSITIONS=483} [2020-10-09 15:31:07,012 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 34 predicate places. [2020-10-09 15:31:07,012 INFO L481 AbstractCegarLoop]: Abstraction has has 526 places, 483 transitions, 1167 flow [2020-10-09 15:31:07,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:07,012 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:07,012 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:07,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 474 mathsat -unsat_core_generation=3 [2020-10-09 15:31:07,213 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:07,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:07,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1208005040, now seen corresponding path program 1 times [2020-10-09 15:31:07,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:07,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268402115] [2020-10-09 15:31:07,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 475 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 475 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:07,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:07,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:31:07,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:31:07,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268402115] [2020-10-09 15:31:07,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:07,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:07,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102359660] [2020-10-09 15:31:07,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:07,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:07,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:07,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:07,564 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 530 [2020-10-09 15:31:07,565 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 483 transitions, 1167 flow. Second operand 3 states. [2020-10-09 15:31:07,565 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:07,565 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 530 [2020-10-09 15:31:07,565 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:07,714 INFO L129 PetriNetUnfolder]: 30/563 cut-off events. [2020-10-09 15:31:07,714 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:31:07,740 INFO L80 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 563 events. 30/563 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2336 event pairs, 0 based on Foata normal form. 1/516 useless extension candidates. Maximal degree in co-relation 670. Up to 20 conditions per place. [2020-10-09 15:31:07,743 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 4 selfloop transitions, 1 changer transitions 0/480 dead transitions. [2020-10-09 15:31:07,743 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 480 transitions, 1162 flow [2020-10-09 15:31:07,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:07,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2020-10-09 15:31:07,745 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2020-10-09 15:31:07,745 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1518 transitions. [2020-10-09 15:31:07,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1518 transitions. [2020-10-09 15:31:07,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:07,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1518 transitions. [2020-10-09 15:31:07,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:07,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:07,746 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:07,746 INFO L185 Difference]: Start difference. First operand has 526 places, 483 transitions, 1167 flow. Second operand 3 states and 1518 transitions. [2020-10-09 15:31:07,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 480 transitions, 1162 flow [2020-10-09 15:31:07,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 480 transitions, 1154 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:07,751 INFO L241 Difference]: Finished difference. Result has 525 places, 480 transitions, 1146 flow [2020-10-09 15:31:07,752 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1146, PETRI_PLACES=525, PETRI_TRANSITIONS=480} [2020-10-09 15:31:07,752 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 33 predicate places. [2020-10-09 15:31:07,752 INFO L481 AbstractCegarLoop]: Abstraction has has 525 places, 480 transitions, 1146 flow [2020-10-09 15:31:07,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:07,752 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:07,752 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:07,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 475 mathsat -unsat_core_generation=3 [2020-10-09 15:31:07,953 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:07,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:07,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1208006063, now seen corresponding path program 1 times [2020-10-09 15:31:07,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:07,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477962986] [2020-10-09 15:31:07,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 476 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 476 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:08,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:08,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:31:08,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:31:08,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477962986] [2020-10-09 15:31:08,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:08,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:08,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687639024] [2020-10-09 15:31:08,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:08,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:08,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:08,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:08,322 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:31:08,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 480 transitions, 1146 flow. Second operand 3 states. [2020-10-09 15:31:08,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:08,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:31:08,323 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:08,470 INFO L129 PetriNetUnfolder]: 30/561 cut-off events. [2020-10-09 15:31:08,470 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:31:08,494 INFO L80 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 561 events. 30/561 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2320 event pairs, 0 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 674. Up to 20 conditions per place. [2020-10-09 15:31:08,497 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 8 selfloop transitions, 1 changer transitions 0/478 dead transitions. [2020-10-09 15:31:08,498 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 478 transitions, 1159 flow [2020-10-09 15:31:08,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:08,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:08,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1504 transitions. [2020-10-09 15:31:08,499 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9459119496855346 [2020-10-09 15:31:08,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1504 transitions. [2020-10-09 15:31:08,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1504 transitions. [2020-10-09 15:31:08,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:08,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1504 transitions. [2020-10-09 15:31:08,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:08,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:08,501 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:08,501 INFO L185 Difference]: Start difference. First operand has 525 places, 480 transitions, 1146 flow. Second operand 3 states and 1504 transitions. [2020-10-09 15:31:08,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 478 transitions, 1159 flow [2020-10-09 15:31:08,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 478 transitions, 1158 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:08,506 INFO L241 Difference]: Finished difference. Result has 524 places, 478 transitions, 1142 flow [2020-10-09 15:31:08,506 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=524, PETRI_TRANSITIONS=478} [2020-10-09 15:31:08,506 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 32 predicate places. [2020-10-09 15:31:08,506 INFO L481 AbstractCegarLoop]: Abstraction has has 524 places, 478 transitions, 1142 flow [2020-10-09 15:31:08,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:08,506 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:08,506 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:08,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 476 mathsat -unsat_core_generation=3 [2020-10-09 15:31:08,707 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:08,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:08,708 INFO L82 PathProgramCache]: Analyzing trace with hash 227544770, now seen corresponding path program 1 times [2020-10-09 15:31:08,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:08,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766839987] [2020-10-09 15:31:08,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 477 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 477 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:09,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:09,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:31:09,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:31:09,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766839987] [2020-10-09 15:31:09,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:09,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:09,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122067437] [2020-10-09 15:31:09,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:09,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:09,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:09,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:09,067 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 530 [2020-10-09 15:31:09,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 478 transitions, 1142 flow. Second operand 3 states. [2020-10-09 15:31:09,068 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:09,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 530 [2020-10-09 15:31:09,068 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:09,215 INFO L129 PetriNetUnfolder]: 29/568 cut-off events. [2020-10-09 15:31:09,215 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:31:09,241 INFO L80 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 568 events. 29/568 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2383 event pairs, 0 based on Foata normal form. 1/521 useless extension candidates. Maximal degree in co-relation 677. Up to 20 conditions per place. [2020-10-09 15:31:09,245 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 4 selfloop transitions, 1 changer transitions 0/478 dead transitions. [2020-10-09 15:31:09,245 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 478 transitions, 1152 flow [2020-10-09 15:31:09,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:09,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2020-10-09 15:31:09,246 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2020-10-09 15:31:09,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1518 transitions. [2020-10-09 15:31:09,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1518 transitions. [2020-10-09 15:31:09,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:09,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1518 transitions. [2020-10-09 15:31:09,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:09,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:09,248 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:09,248 INFO L185 Difference]: Start difference. First operand has 524 places, 478 transitions, 1142 flow. Second operand 3 states and 1518 transitions. [2020-10-09 15:31:09,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 478 transitions, 1152 flow [2020-10-09 15:31:09,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 478 transitions, 1151 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:09,253 INFO L241 Difference]: Finished difference. Result has 526 places, 478 transitions, 1146 flow [2020-10-09 15:31:09,253 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1146, PETRI_PLACES=526, PETRI_TRANSITIONS=478} [2020-10-09 15:31:09,253 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 34 predicate places. [2020-10-09 15:31:09,253 INFO L481 AbstractCegarLoop]: Abstraction has has 526 places, 478 transitions, 1146 flow [2020-10-09 15:31:09,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:09,254 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:09,254 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:09,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 477 mathsat -unsat_core_generation=3 [2020-10-09 15:31:09,454 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:09,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:09,455 INFO L82 PathProgramCache]: Analyzing trace with hash 227545793, now seen corresponding path program 1 times [2020-10-09 15:31:09,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:09,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235017614] [2020-10-09 15:31:09,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 478 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 478 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:09,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:09,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:31:09,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:31:09,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235017614] [2020-10-09 15:31:09,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:09,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:09,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069433862] [2020-10-09 15:31:09,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:09,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:09,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:09,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:09,807 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:31:09,807 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 478 transitions, 1146 flow. Second operand 3 states. [2020-10-09 15:31:09,808 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:09,808 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:31:09,808 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:09,954 INFO L129 PetriNetUnfolder]: 27/570 cut-off events. [2020-10-09 15:31:09,955 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:09,979 INFO L80 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 570 events. 27/570 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2416 event pairs, 0 based on Foata normal form. 0/522 useless extension candidates. Maximal degree in co-relation 690. Up to 20 conditions per place. [2020-10-09 15:31:09,982 INFO L132 encePairwiseOnDemand]: 526/530 looper letters, 9 selfloop transitions, 3 changer transitions 0/479 dead transitions. [2020-10-09 15:31:09,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 479 transitions, 1172 flow [2020-10-09 15:31:09,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1507 transitions. [2020-10-09 15:31:09,983 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9477987421383648 [2020-10-09 15:31:09,983 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1507 transitions. [2020-10-09 15:31:09,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1507 transitions. [2020-10-09 15:31:09,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:09,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1507 transitions. [2020-10-09 15:31:09,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:09,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:09,985 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:09,985 INFO L185 Difference]: Start difference. First operand has 526 places, 478 transitions, 1146 flow. Second operand 3 states and 1507 transitions. [2020-10-09 15:31:09,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 479 transitions, 1172 flow [2020-10-09 15:31:09,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 479 transitions, 1171 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:09,990 INFO L241 Difference]: Finished difference. Result has 529 places, 479 transitions, 1163 flow [2020-10-09 15:31:09,990 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1163, PETRI_PLACES=529, PETRI_TRANSITIONS=479} [2020-10-09 15:31:09,990 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 37 predicate places. [2020-10-09 15:31:09,990 INFO L481 AbstractCegarLoop]: Abstraction has has 529 places, 479 transitions, 1163 flow [2020-10-09 15:31:09,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:09,991 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:09,991 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:10,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 478 mathsat -unsat_core_generation=3 [2020-10-09 15:31:10,191 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:10,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:10,192 INFO L82 PathProgramCache]: Analyzing trace with hash 226592481, now seen corresponding path program 1 times [2020-10-09 15:31:10,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:10,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556703381] [2020-10-09 15:31:10,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 479 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 479 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:10,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:10,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:31:10,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:31:10,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556703381] [2020-10-09 15:31:10,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:10,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:10,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657010440] [2020-10-09 15:31:10,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:10,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:10,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:10,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:10,534 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 530 [2020-10-09 15:31:10,534 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 479 transitions, 1163 flow. Second operand 3 states. [2020-10-09 15:31:10,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:10,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 530 [2020-10-09 15:31:10,535 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:10,694 INFO L129 PetriNetUnfolder]: 27/563 cut-off events. [2020-10-09 15:31:10,694 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:31:10,713 INFO L80 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 563 events. 27/563 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2356 event pairs, 0 based on Foata normal form. 1/519 useless extension candidates. Maximal degree in co-relation 676. Up to 20 conditions per place. [2020-10-09 15:31:10,716 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 5 selfloop transitions, 1 changer transitions 0/477 dead transitions. [2020-10-09 15:31:10,716 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 477 transitions, 1165 flow [2020-10-09 15:31:10,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2020-10-09 15:31:10,717 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9534591194968554 [2020-10-09 15:31:10,717 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2020-10-09 15:31:10,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2020-10-09 15:31:10,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:10,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2020-10-09 15:31:10,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:10,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:10,719 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:10,719 INFO L185 Difference]: Start difference. First operand has 529 places, 479 transitions, 1163 flow. Second operand 3 states and 1516 transitions. [2020-10-09 15:31:10,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 477 transitions, 1165 flow [2020-10-09 15:31:10,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 477 transitions, 1157 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:10,724 INFO L241 Difference]: Finished difference. Result has 529 places, 477 transitions, 1150 flow [2020-10-09 15:31:10,724 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1150, PETRI_PLACES=529, PETRI_TRANSITIONS=477} [2020-10-09 15:31:10,724 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 37 predicate places. [2020-10-09 15:31:10,725 INFO L481 AbstractCegarLoop]: Abstraction has has 529 places, 477 transitions, 1150 flow [2020-10-09 15:31:10,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:10,725 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:10,725 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:10,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 479 mathsat -unsat_core_generation=3 [2020-10-09 15:31:10,926 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:10,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:10,926 INFO L82 PathProgramCache]: Analyzing trace with hash 226591458, now seen corresponding path program 1 times [2020-10-09 15:31:10,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:10,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469104669] [2020-10-09 15:31:10,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 480 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 480 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:11,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:11,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:31:11,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:11,253 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:31:11,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469104669] [2020-10-09 15:31:11,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:11,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:11,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701332987] [2020-10-09 15:31:11,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:11,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:11,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:11,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:11,283 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:31:11,283 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 477 transitions, 1150 flow. Second operand 3 states. [2020-10-09 15:31:11,284 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:11,284 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:31:11,284 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:11,428 INFO L129 PetriNetUnfolder]: 27/561 cut-off events. [2020-10-09 15:31:11,428 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:11,452 INFO L80 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 561 events. 27/561 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2339 event pairs, 0 based on Foata normal form. 0/515 useless extension candidates. Maximal degree in co-relation 680. Up to 20 conditions per place. [2020-10-09 15:31:11,455 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 8 selfloop transitions, 1 changer transitions 0/475 dead transitions. [2020-10-09 15:31:11,455 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 475 transitions, 1163 flow [2020-10-09 15:31:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:11,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1504 transitions. [2020-10-09 15:31:11,456 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9459119496855346 [2020-10-09 15:31:11,456 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1504 transitions. [2020-10-09 15:31:11,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1504 transitions. [2020-10-09 15:31:11,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:11,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1504 transitions. [2020-10-09 15:31:11,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:11,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:11,458 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:11,458 INFO L185 Difference]: Start difference. First operand has 529 places, 477 transitions, 1150 flow. Second operand 3 states and 1504 transitions. [2020-10-09 15:31:11,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 475 transitions, 1163 flow [2020-10-09 15:31:11,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 475 transitions, 1162 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:11,463 INFO L241 Difference]: Finished difference. Result has 528 places, 475 transitions, 1146 flow [2020-10-09 15:31:11,463 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1146, PETRI_PLACES=528, PETRI_TRANSITIONS=475} [2020-10-09 15:31:11,463 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 36 predicate places. [2020-10-09 15:31:11,463 INFO L481 AbstractCegarLoop]: Abstraction has has 528 places, 475 transitions, 1146 flow [2020-10-09 15:31:11,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:11,464 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:11,464 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:11,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 480 mathsat -unsat_core_generation=3 [2020-10-09 15:31:11,670 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:11,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:11,670 INFO L82 PathProgramCache]: Analyzing trace with hash -757933324, now seen corresponding path program 1 times [2020-10-09 15:31:11,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:11,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675872916] [2020-10-09 15:31:11,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 481 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 481 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:11,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:11,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:31:11,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:11,997 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:31:11,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675872916] [2020-10-09 15:31:11,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:11,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:11,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773469814] [2020-10-09 15:31:11,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:11,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:11,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:11,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:12,009 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 530 [2020-10-09 15:31:12,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 475 transitions, 1146 flow. Second operand 3 states. [2020-10-09 15:31:12,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:12,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 530 [2020-10-09 15:31:12,010 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:12,153 INFO L129 PetriNetUnfolder]: 25/566 cut-off events. [2020-10-09 15:31:12,153 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:31:12,176 INFO L80 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 566 events. 25/566 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2393 event pairs, 0 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 683. Up to 20 conditions per place. [2020-10-09 15:31:12,179 INFO L132 encePairwiseOnDemand]: 527/530 looper letters, 5 selfloop transitions, 2 changer transitions 0/476 dead transitions. [2020-10-09 15:31:12,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 476 transitions, 1162 flow [2020-10-09 15:31:12,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:12,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1517 transitions. [2020-10-09 15:31:12,181 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9540880503144654 [2020-10-09 15:31:12,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1517 transitions. [2020-10-09 15:31:12,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1517 transitions. [2020-10-09 15:31:12,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:12,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1517 transitions. [2020-10-09 15:31:12,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:12,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:12,182 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:12,183 INFO L185 Difference]: Start difference. First operand has 528 places, 475 transitions, 1146 flow. Second operand 3 states and 1517 transitions. [2020-10-09 15:31:12,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 476 transitions, 1162 flow [2020-10-09 15:31:12,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 476 transitions, 1161 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:12,187 INFO L241 Difference]: Finished difference. Result has 531 places, 476 transitions, 1159 flow [2020-10-09 15:31:12,188 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1159, PETRI_PLACES=531, PETRI_TRANSITIONS=476} [2020-10-09 15:31:12,188 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 39 predicate places. [2020-10-09 15:31:12,188 INFO L481 AbstractCegarLoop]: Abstraction has has 531 places, 476 transitions, 1159 flow [2020-10-09 15:31:12,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:12,188 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:12,188 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:12,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 481 mathsat -unsat_core_generation=3 [2020-10-09 15:31:12,389 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:12,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:12,389 INFO L82 PathProgramCache]: Analyzing trace with hash -757934347, now seen corresponding path program 1 times [2020-10-09 15:31:12,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:12,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760802847] [2020-10-09 15:31:12,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 482 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 482 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:12,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:12,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:31:12,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:31:12,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760802847] [2020-10-09 15:31:12,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:12,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:12,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432556946] [2020-10-09 15:31:12,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:12,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:12,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:12,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:12,750 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:31:12,751 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 476 transitions, 1159 flow. Second operand 3 states. [2020-10-09 15:31:12,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:12,752 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:31:12,752 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:12,924 INFO L129 PetriNetUnfolder]: 25/567 cut-off events. [2020-10-09 15:31:12,924 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:31:12,940 INFO L80 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 567 events. 25/567 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2399 event pairs, 0 based on Foata normal form. 0/522 useless extension candidates. Maximal degree in co-relation 691. Up to 20 conditions per place. [2020-10-09 15:31:12,943 INFO L132 encePairwiseOnDemand]: 526/530 looper letters, 9 selfloop transitions, 3 changer transitions 0/477 dead transitions. [2020-10-09 15:31:12,943 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 533 places, 477 transitions, 1185 flow [2020-10-09 15:31:12,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:12,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:12,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1507 transitions. [2020-10-09 15:31:12,945 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9477987421383648 [2020-10-09 15:31:12,945 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1507 transitions. [2020-10-09 15:31:12,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1507 transitions. [2020-10-09 15:31:12,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:12,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1507 transitions. [2020-10-09 15:31:12,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:12,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:12,946 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:12,946 INFO L185 Difference]: Start difference. First operand has 531 places, 476 transitions, 1159 flow. Second operand 3 states and 1507 transitions. [2020-10-09 15:31:12,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 533 places, 477 transitions, 1185 flow [2020-10-09 15:31:12,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 477 transitions, 1183 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:12,951 INFO L241 Difference]: Finished difference. Result has 534 places, 477 transitions, 1175 flow [2020-10-09 15:31:12,952 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1175, PETRI_PLACES=534, PETRI_TRANSITIONS=477} [2020-10-09 15:31:12,952 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 42 predicate places. [2020-10-09 15:31:12,952 INFO L481 AbstractCegarLoop]: Abstraction has has 534 places, 477 transitions, 1175 flow [2020-10-09 15:31:12,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:12,952 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:12,952 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:13,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 482 mathsat -unsat_core_generation=3 [2020-10-09 15:31:13,153 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:13,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:13,153 INFO L82 PathProgramCache]: Analyzing trace with hash -756980012, now seen corresponding path program 1 times [2020-10-09 15:31:13,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:13,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490440870] [2020-10-09 15:31:13,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 483 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 483 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:13,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:13,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:31:13,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:31:13,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490440870] [2020-10-09 15:31:13,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:13,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:13,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569855988] [2020-10-09 15:31:13,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:13,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:13,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:13,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:13,503 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:31:13,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 477 transitions, 1175 flow. Second operand 3 states. [2020-10-09 15:31:13,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:13,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:31:13,505 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:13,654 INFO L129 PetriNetUnfolder]: 24/564 cut-off events. [2020-10-09 15:31:13,654 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:31:13,677 INFO L80 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 564 events. 24/564 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2384 event pairs, 0 based on Foata normal form. 2/523 useless extension candidates. Maximal degree in co-relation 690. Up to 20 conditions per place. [2020-10-09 15:31:13,680 INFO L132 encePairwiseOnDemand]: 527/530 looper letters, 9 selfloop transitions, 1 changer transitions 0/475 dead transitions. [2020-10-09 15:31:13,680 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 475 transitions, 1183 flow [2020-10-09 15:31:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1506 transitions. [2020-10-09 15:31:13,682 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9471698113207547 [2020-10-09 15:31:13,682 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1506 transitions. [2020-10-09 15:31:13,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1506 transitions. [2020-10-09 15:31:13,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:13,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1506 transitions. [2020-10-09 15:31:13,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:13,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:13,683 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:13,683 INFO L185 Difference]: Start difference. First operand has 534 places, 477 transitions, 1175 flow. Second operand 3 states and 1506 transitions. [2020-10-09 15:31:13,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 536 places, 475 transitions, 1183 flow [2020-10-09 15:31:13,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 475 transitions, 1182 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:13,689 INFO L241 Difference]: Finished difference. Result has 535 places, 475 transitions, 1164 flow [2020-10-09 15:31:13,689 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1164, PETRI_PLACES=535, PETRI_TRANSITIONS=475} [2020-10-09 15:31:13,689 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 43 predicate places. [2020-10-09 15:31:13,689 INFO L481 AbstractCegarLoop]: Abstraction has has 535 places, 475 transitions, 1164 flow [2020-10-09 15:31:13,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:13,689 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:13,689 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:13,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 483 mathsat -unsat_core_generation=3 [2020-10-09 15:31:13,890 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:13,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:13,890 INFO L82 PathProgramCache]: Analyzing trace with hash -756981035, now seen corresponding path program 1 times [2020-10-09 15:31:13,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:13,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597755497] [2020-10-09 15:31:13,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 484 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 484 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:14,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:14,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:31:14,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:31:14,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597755497] [2020-10-09 15:31:14,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:14,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:14,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433550809] [2020-10-09 15:31:14,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:14,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:14,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:14,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:14,240 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 530 [2020-10-09 15:31:14,241 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 475 transitions, 1164 flow. Second operand 3 states. [2020-10-09 15:31:14,241 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:14,241 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 530 [2020-10-09 15:31:14,241 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:14,385 INFO L129 PetriNetUnfolder]: 24/561 cut-off events. [2020-10-09 15:31:14,386 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:14,410 INFO L80 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 561 events. 24/561 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2361 event pairs, 0 based on Foata normal form. 1/520 useless extension candidates. Maximal degree in co-relation 684. Up to 20 conditions per place. [2020-10-09 15:31:14,413 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 4 selfloop transitions, 1 changer transitions 0/472 dead transitions. [2020-10-09 15:31:14,413 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 472 transitions, 1163 flow [2020-10-09 15:31:14,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2020-10-09 15:31:14,414 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2020-10-09 15:31:14,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1518 transitions. [2020-10-09 15:31:14,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1518 transitions. [2020-10-09 15:31:14,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:14,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1518 transitions. [2020-10-09 15:31:14,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:14,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:14,416 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:14,416 INFO L185 Difference]: Start difference. First operand has 535 places, 475 transitions, 1164 flow. Second operand 3 states and 1518 transitions. [2020-10-09 15:31:14,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 472 transitions, 1163 flow [2020-10-09 15:31:14,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 472 transitions, 1158 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:14,421 INFO L241 Difference]: Finished difference. Result has 532 places, 472 transitions, 1150 flow [2020-10-09 15:31:14,421 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1150, PETRI_PLACES=532, PETRI_TRANSITIONS=472} [2020-10-09 15:31:14,421 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 40 predicate places. [2020-10-09 15:31:14,421 INFO L481 AbstractCegarLoop]: Abstraction has has 532 places, 472 transitions, 1150 flow [2020-10-09 15:31:14,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:14,421 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:14,422 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:14,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 484 mathsat -unsat_core_generation=3 [2020-10-09 15:31:14,622 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:14,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:14,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2063797096, now seen corresponding path program 1 times [2020-10-09 15:31:14,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:14,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364492324] [2020-10-09 15:31:14,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 485 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 485 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:14,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:14,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:31:14,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:31:14,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364492324] [2020-10-09 15:31:14,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:14,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:14,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761227532] [2020-10-09 15:31:14,952 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:14,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:14,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:14,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:14,986 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:31:14,987 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 472 transitions, 1150 flow. Second operand 3 states. [2020-10-09 15:31:14,987 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:14,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:31:14,988 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:15,140 INFO L129 PetriNetUnfolder]: 23/569 cut-off events. [2020-10-09 15:31:15,140 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:31:15,164 INFO L80 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 569 events. 23/569 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2427 event pairs, 0 based on Foata normal form. 0/525 useless extension candidates. Maximal degree in co-relation 701. Up to 20 conditions per place. [2020-10-09 15:31:15,167 INFO L132 encePairwiseOnDemand]: 525/530 looper letters, 10 selfloop transitions, 3 changer transitions 0/474 dead transitions. [2020-10-09 15:31:15,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 474 transitions, 1180 flow [2020-10-09 15:31:15,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:15,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1509 transitions. [2020-10-09 15:31:15,168 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9490566037735849 [2020-10-09 15:31:15,168 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1509 transitions. [2020-10-09 15:31:15,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1509 transitions. [2020-10-09 15:31:15,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:15,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1509 transitions. [2020-10-09 15:31:15,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:15,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:15,170 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:15,170 INFO L185 Difference]: Start difference. First operand has 532 places, 472 transitions, 1150 flow. Second operand 3 states and 1509 transitions. [2020-10-09 15:31:15,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 474 transitions, 1180 flow [2020-10-09 15:31:15,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 474 transitions, 1179 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:15,175 INFO L241 Difference]: Finished difference. Result has 535 places, 474 transitions, 1173 flow [2020-10-09 15:31:15,175 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1173, PETRI_PLACES=535, PETRI_TRANSITIONS=474} [2020-10-09 15:31:15,175 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 43 predicate places. [2020-10-09 15:31:15,175 INFO L481 AbstractCegarLoop]: Abstraction has has 535 places, 474 transitions, 1173 flow [2020-10-09 15:31:15,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:15,175 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:15,175 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:15,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 485 mathsat -unsat_core_generation=3 [2020-10-09 15:31:15,376 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:15,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:15,376 INFO L82 PathProgramCache]: Analyzing trace with hash 2063796073, now seen corresponding path program 1 times [2020-10-09 15:31:15,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:15,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844040234] [2020-10-09 15:31:15,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 486 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 486 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:15,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:15,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:31:15,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:31:15,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844040234] [2020-10-09 15:31:15,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:15,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:15,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241520471] [2020-10-09 15:31:15,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:15,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:15,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:15,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:15,737 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 530 [2020-10-09 15:31:15,738 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 474 transitions, 1173 flow. Second operand 3 states. [2020-10-09 15:31:15,738 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:15,738 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 530 [2020-10-09 15:31:15,738 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:15,887 INFO L129 PetriNetUnfolder]: 21/570 cut-off events. [2020-10-09 15:31:15,887 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:31:15,912 INFO L80 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 570 events. 21/570 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2450 event pairs, 0 based on Foata normal form. 1/532 useless extension candidates. Maximal degree in co-relation 697. Up to 20 conditions per place. [2020-10-09 15:31:15,914 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 4 selfloop transitions, 1 changer transitions 0/473 dead transitions. [2020-10-09 15:31:15,914 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 473 transitions, 1179 flow [2020-10-09 15:31:15,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:15,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2020-10-09 15:31:15,916 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2020-10-09 15:31:15,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1518 transitions. [2020-10-09 15:31:15,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1518 transitions. [2020-10-09 15:31:15,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:15,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1518 transitions. [2020-10-09 15:31:15,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:15,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:15,917 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:15,917 INFO L185 Difference]: Start difference. First operand has 535 places, 474 transitions, 1173 flow. Second operand 3 states and 1518 transitions. [2020-10-09 15:31:15,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 473 transitions, 1179 flow [2020-10-09 15:31:15,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 473 transitions, 1174 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:15,922 INFO L241 Difference]: Finished difference. Result has 537 places, 473 transitions, 1169 flow [2020-10-09 15:31:15,922 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1169, PETRI_PLACES=537, PETRI_TRANSITIONS=473} [2020-10-09 15:31:15,922 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 45 predicate places. [2020-10-09 15:31:15,923 INFO L481 AbstractCegarLoop]: Abstraction has has 537 places, 473 transitions, 1169 flow [2020-10-09 15:31:15,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:15,923 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:15,923 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:16,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 486 mathsat -unsat_core_generation=3 [2020-10-09 15:31:16,123 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:16,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:16,124 INFO L82 PathProgramCache]: Analyzing trace with hash 2062843784, now seen corresponding path program 1 times [2020-10-09 15:31:16,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:16,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289839692] [2020-10-09 15:31:16,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 487 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 487 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:16,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:16,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:31:16,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:31:16,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289839692] [2020-10-09 15:31:16,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:16,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:16,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484315963] [2020-10-09 15:31:16,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:16,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:16,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:16,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:16,465 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 530 [2020-10-09 15:31:16,466 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 473 transitions, 1169 flow. Second operand 3 states. [2020-10-09 15:31:16,466 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:16,466 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 530 [2020-10-09 15:31:16,467 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:16,611 INFO L129 PetriNetUnfolder]: 21/563 cut-off events. [2020-10-09 15:31:16,611 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:31:16,634 INFO L80 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 563 events. 21/563 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2388 event pairs, 0 based on Foata normal form. 1/525 useless extension candidates. Maximal degree in co-relation 693. Up to 20 conditions per place. [2020-10-09 15:31:16,637 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 5 selfloop transitions, 1 changer transitions 0/471 dead transitions. [2020-10-09 15:31:16,637 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 471 transitions, 1172 flow [2020-10-09 15:31:16,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:16,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:16,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2020-10-09 15:31:16,638 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9534591194968554 [2020-10-09 15:31:16,638 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2020-10-09 15:31:16,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2020-10-09 15:31:16,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:16,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2020-10-09 15:31:16,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:16,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:16,640 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:16,640 INFO L185 Difference]: Start difference. First operand has 537 places, 473 transitions, 1169 flow. Second operand 3 states and 1516 transitions. [2020-10-09 15:31:16,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 471 transitions, 1172 flow [2020-10-09 15:31:16,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 471 transitions, 1165 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:16,645 INFO L241 Difference]: Finished difference. Result has 537 places, 471 transitions, 1158 flow [2020-10-09 15:31:16,645 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1158, PETRI_PLACES=537, PETRI_TRANSITIONS=471} [2020-10-09 15:31:16,645 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 45 predicate places. [2020-10-09 15:31:16,645 INFO L481 AbstractCegarLoop]: Abstraction has has 537 places, 471 transitions, 1158 flow [2020-10-09 15:31:16,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:16,645 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:16,645 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:16,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 487 mathsat -unsat_core_generation=3 [2020-10-09 15:31:16,846 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:16,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:16,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2062842761, now seen corresponding path program 1 times [2020-10-09 15:31:16,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:16,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127373472] [2020-10-09 15:31:16,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 488 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 488 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:17,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:17,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:31:17,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:31:17,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127373472] [2020-10-09 15:31:17,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:17,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:17,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860028133] [2020-10-09 15:31:17,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:17,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:17,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:17,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:17,196 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:31:17,197 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 471 transitions, 1158 flow. Second operand 3 states. [2020-10-09 15:31:17,197 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:17,198 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:31:17,198 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:17,348 INFO L129 PetriNetUnfolder]: 21/561 cut-off events. [2020-10-09 15:31:17,348 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:17,371 INFO L80 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 561 events. 21/561 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2377 event pairs, 0 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 693. Up to 20 conditions per place. [2020-10-09 15:31:17,374 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 8 selfloop transitions, 1 changer transitions 0/469 dead transitions. [2020-10-09 15:31:17,374 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 469 transitions, 1171 flow [2020-10-09 15:31:17,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:17,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1504 transitions. [2020-10-09 15:31:17,375 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9459119496855346 [2020-10-09 15:31:17,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1504 transitions. [2020-10-09 15:31:17,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1504 transitions. [2020-10-09 15:31:17,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:17,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1504 transitions. [2020-10-09 15:31:17,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:17,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:17,377 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:17,377 INFO L185 Difference]: Start difference. First operand has 537 places, 471 transitions, 1158 flow. Second operand 3 states and 1504 transitions. [2020-10-09 15:31:17,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 469 transitions, 1171 flow [2020-10-09 15:31:17,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 469 transitions, 1170 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:17,382 INFO L241 Difference]: Finished difference. Result has 536 places, 469 transitions, 1154 flow [2020-10-09 15:31:17,382 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=536, PETRI_TRANSITIONS=469} [2020-10-09 15:31:17,382 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 44 predicate places. [2020-10-09 15:31:17,382 INFO L481 AbstractCegarLoop]: Abstraction has has 536 places, 469 transitions, 1154 flow [2020-10-09 15:31:17,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:17,382 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:17,383 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:17,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 488 mathsat -unsat_core_generation=3 [2020-10-09 15:31:17,583 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:17,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:17,584 INFO L82 PathProgramCache]: Analyzing trace with hash -751434754, now seen corresponding path program 1 times [2020-10-09 15:31:17,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:17,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525395933] [2020-10-09 15:31:17,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 489 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 489 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:17,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:17,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:17,924 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:31:17,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:31:17,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525395933] [2020-10-09 15:31:17,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:17,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:17,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625883585] [2020-10-09 15:31:17,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:17,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:17,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:17,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:17,941 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 530 [2020-10-09 15:31:17,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 469 transitions, 1154 flow. Second operand 3 states. [2020-10-09 15:31:17,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:17,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 530 [2020-10-09 15:31:17,943 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:18,089 INFO L129 PetriNetUnfolder]: 20/568 cut-off events. [2020-10-09 15:31:18,089 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:31:18,113 INFO L80 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 568 events. 20/568 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2438 event pairs, 0 based on Foata normal form. 1/530 useless extension candidates. Maximal degree in co-relation 696. Up to 20 conditions per place. [2020-10-09 15:31:18,115 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 4 selfloop transitions, 1 changer transitions 0/469 dead transitions. [2020-10-09 15:31:18,115 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 469 transitions, 1164 flow [2020-10-09 15:31:18,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2020-10-09 15:31:18,117 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2020-10-09 15:31:18,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1518 transitions. [2020-10-09 15:31:18,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1518 transitions. [2020-10-09 15:31:18,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:18,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1518 transitions. [2020-10-09 15:31:18,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:18,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:18,119 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:18,119 INFO L185 Difference]: Start difference. First operand has 536 places, 469 transitions, 1154 flow. Second operand 3 states and 1518 transitions. [2020-10-09 15:31:18,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 469 transitions, 1164 flow [2020-10-09 15:31:18,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 469 transitions, 1163 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:18,124 INFO L241 Difference]: Finished difference. Result has 538 places, 469 transitions, 1158 flow [2020-10-09 15:31:18,124 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1158, PETRI_PLACES=538, PETRI_TRANSITIONS=469} [2020-10-09 15:31:18,124 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 46 predicate places. [2020-10-09 15:31:18,124 INFO L481 AbstractCegarLoop]: Abstraction has has 538 places, 469 transitions, 1158 flow [2020-10-09 15:31:18,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:18,124 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:18,124 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:18,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 489 mathsat -unsat_core_generation=3 [2020-10-09 15:31:18,325 INFO L429 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:18,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:18,326 INFO L82 PathProgramCache]: Analyzing trace with hash -751433731, now seen corresponding path program 1 times [2020-10-09 15:31:18,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:18,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301432471] [2020-10-09 15:31:18,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 490 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 490 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:18,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:18,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:31:18,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:31:18,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301432471] [2020-10-09 15:31:18,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:18,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:18,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337072736] [2020-10-09 15:31:18,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:18,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:18,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:18,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:18,692 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:31:18,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 469 transitions, 1158 flow. Second operand 3 states. [2020-10-09 15:31:18,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:18,693 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:31:18,693 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:18,850 INFO L129 PetriNetUnfolder]: 18/570 cut-off events. [2020-10-09 15:31:18,850 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:18,876 INFO L80 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 570 events. 18/570 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2471 event pairs, 0 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 709. Up to 20 conditions per place. [2020-10-09 15:31:18,878 INFO L132 encePairwiseOnDemand]: 526/530 looper letters, 9 selfloop transitions, 3 changer transitions 0/470 dead transitions. [2020-10-09 15:31:18,878 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 470 transitions, 1184 flow [2020-10-09 15:31:18,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1507 transitions. [2020-10-09 15:31:18,880 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9477987421383648 [2020-10-09 15:31:18,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1507 transitions. [2020-10-09 15:31:18,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1507 transitions. [2020-10-09 15:31:18,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:18,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1507 transitions. [2020-10-09 15:31:18,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:18,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:18,881 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:18,881 INFO L185 Difference]: Start difference. First operand has 538 places, 469 transitions, 1158 flow. Second operand 3 states and 1507 transitions. [2020-10-09 15:31:18,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 470 transitions, 1184 flow [2020-10-09 15:31:18,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 470 transitions, 1183 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:18,886 INFO L241 Difference]: Finished difference. Result has 541 places, 470 transitions, 1175 flow [2020-10-09 15:31:18,886 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1175, PETRI_PLACES=541, PETRI_TRANSITIONS=470} [2020-10-09 15:31:18,887 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 49 predicate places. [2020-10-09 15:31:18,887 INFO L481 AbstractCegarLoop]: Abstraction has has 541 places, 470 transitions, 1175 flow [2020-10-09 15:31:18,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:18,887 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:18,887 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:19,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 490 mathsat -unsat_core_generation=3 [2020-10-09 15:31:19,087 INFO L429 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:19,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:19,088 INFO L82 PathProgramCache]: Analyzing trace with hash -752387043, now seen corresponding path program 1 times [2020-10-09 15:31:19,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:19,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512928531] [2020-10-09 15:31:19,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 491 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 491 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:19,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:19,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:19,417 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:31:19,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:31:19,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512928531] [2020-10-09 15:31:19,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:19,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:19,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458336981] [2020-10-09 15:31:19,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:19,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:19,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:19,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:19,438 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 530 [2020-10-09 15:31:19,439 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 470 transitions, 1175 flow. Second operand 3 states. [2020-10-09 15:31:19,439 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:19,439 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 530 [2020-10-09 15:31:19,440 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:19,614 INFO L129 PetriNetUnfolder]: 18/563 cut-off events. [2020-10-09 15:31:19,614 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:31:19,630 INFO L80 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 563 events. 18/563 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2412 event pairs, 0 based on Foata normal form. 1/528 useless extension candidates. Maximal degree in co-relation 695. Up to 20 conditions per place. [2020-10-09 15:31:19,632 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 5 selfloop transitions, 1 changer transitions 0/468 dead transitions. [2020-10-09 15:31:19,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 468 transitions, 1177 flow [2020-10-09 15:31:19,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:19,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:19,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2020-10-09 15:31:19,634 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9534591194968554 [2020-10-09 15:31:19,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2020-10-09 15:31:19,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2020-10-09 15:31:19,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:19,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2020-10-09 15:31:19,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:19,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:19,637 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:19,637 INFO L185 Difference]: Start difference. First operand has 541 places, 470 transitions, 1175 flow. Second operand 3 states and 1516 transitions. [2020-10-09 15:31:19,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 468 transitions, 1177 flow [2020-10-09 15:31:19,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 468 transitions, 1169 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:19,641 INFO L241 Difference]: Finished difference. Result has 541 places, 468 transitions, 1162 flow [2020-10-09 15:31:19,641 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1162, PETRI_PLACES=541, PETRI_TRANSITIONS=468} [2020-10-09 15:31:19,641 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 49 predicate places. [2020-10-09 15:31:19,642 INFO L481 AbstractCegarLoop]: Abstraction has has 541 places, 468 transitions, 1162 flow [2020-10-09 15:31:19,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:19,642 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:19,642 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:19,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 491 mathsat -unsat_core_generation=3 [2020-10-09 15:31:19,843 INFO L429 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:19,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:19,844 INFO L82 PathProgramCache]: Analyzing trace with hash -752388066, now seen corresponding path program 1 times [2020-10-09 15:31:19,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:19,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729173408] [2020-10-09 15:31:19,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 492 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 492 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:20,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:20,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:20,173 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:31:20,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:31:20,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729173408] [2020-10-09 15:31:20,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:20,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:20,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970253099] [2020-10-09 15:31:20,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:20,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:20,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:20,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:20,206 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:31:20,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 468 transitions, 1162 flow. Second operand 3 states. [2020-10-09 15:31:20,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:20,208 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:31:20,208 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:20,361 INFO L129 PetriNetUnfolder]: 18/561 cut-off events. [2020-10-09 15:31:20,361 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:20,384 INFO L80 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 561 events. 18/561 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2396 event pairs, 0 based on Foata normal form. 0/524 useless extension candidates. Maximal degree in co-relation 699. Up to 20 conditions per place. [2020-10-09 15:31:20,386 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 8 selfloop transitions, 1 changer transitions 0/466 dead transitions. [2020-10-09 15:31:20,387 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 466 transitions, 1175 flow [2020-10-09 15:31:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1504 transitions. [2020-10-09 15:31:20,388 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9459119496855346 [2020-10-09 15:31:20,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1504 transitions. [2020-10-09 15:31:20,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1504 transitions. [2020-10-09 15:31:20,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:20,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1504 transitions. [2020-10-09 15:31:20,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:20,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:20,389 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:20,390 INFO L185 Difference]: Start difference. First operand has 541 places, 468 transitions, 1162 flow. Second operand 3 states and 1504 transitions. [2020-10-09 15:31:20,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 466 transitions, 1175 flow [2020-10-09 15:31:20,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 466 transitions, 1174 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:20,394 INFO L241 Difference]: Finished difference. Result has 540 places, 466 transitions, 1158 flow [2020-10-09 15:31:20,395 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1158, PETRI_PLACES=540, PETRI_TRANSITIONS=466} [2020-10-09 15:31:20,395 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 48 predicate places. [2020-10-09 15:31:20,395 INFO L481 AbstractCegarLoop]: Abstraction has has 540 places, 466 transitions, 1158 flow [2020-10-09 15:31:20,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:20,395 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:20,395 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:20,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 492 mathsat -unsat_core_generation=3 [2020-10-09 15:31:20,596 INFO L429 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:20,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:20,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2070594100, now seen corresponding path program 1 times [2020-10-09 15:31:20,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:20,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218642692] [2020-10-09 15:31:20,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 493 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 493 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:20,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:20,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:31:20,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:31:20,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218642692] [2020-10-09 15:31:20,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:20,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:20,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118522084] [2020-10-09 15:31:20,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:20,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:20,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:20,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:20,958 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:31:20,959 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 466 transitions, 1158 flow. Second operand 3 states. [2020-10-09 15:31:20,959 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:20,959 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:31:20,959 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:21,118 INFO L129 PetriNetUnfolder]: 17/569 cut-off events. [2020-10-09 15:31:21,118 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:31:21,142 INFO L80 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 569 events. 17/569 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2463 event pairs, 0 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 711. Up to 20 conditions per place. [2020-10-09 15:31:21,144 INFO L132 encePairwiseOnDemand]: 525/530 looper letters, 10 selfloop transitions, 3 changer transitions 0/468 dead transitions. [2020-10-09 15:31:21,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 468 transitions, 1188 flow [2020-10-09 15:31:21,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1509 transitions. [2020-10-09 15:31:21,146 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9490566037735849 [2020-10-09 15:31:21,146 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1509 transitions. [2020-10-09 15:31:21,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1509 transitions. [2020-10-09 15:31:21,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:21,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1509 transitions. [2020-10-09 15:31:21,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:21,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:21,147 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:21,147 INFO L185 Difference]: Start difference. First operand has 540 places, 466 transitions, 1158 flow. Second operand 3 states and 1509 transitions. [2020-10-09 15:31:21,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 468 transitions, 1188 flow [2020-10-09 15:31:21,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 468 transitions, 1187 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:21,152 INFO L241 Difference]: Finished difference. Result has 543 places, 468 transitions, 1181 flow [2020-10-09 15:31:21,152 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1181, PETRI_PLACES=543, PETRI_TRANSITIONS=468} [2020-10-09 15:31:21,153 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 51 predicate places. [2020-10-09 15:31:21,153 INFO L481 AbstractCegarLoop]: Abstraction has has 543 places, 468 transitions, 1181 flow [2020-10-09 15:31:21,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:21,153 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:21,153 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:21,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 493 mathsat -unsat_core_generation=3 [2020-10-09 15:31:21,354 INFO L429 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:21,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:21,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2070595123, now seen corresponding path program 1 times [2020-10-09 15:31:21,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:21,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405278321] [2020-10-09 15:31:21,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 494 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 494 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:21,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:21,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:21,681 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:31:21,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:21,684 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:31:21,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405278321] [2020-10-09 15:31:21,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:21,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:21,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268949853] [2020-10-09 15:31:21,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:21,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:21,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:21,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:21,695 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 530 [2020-10-09 15:31:21,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 468 transitions, 1181 flow. Second operand 3 states. [2020-10-09 15:31:21,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:21,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 530 [2020-10-09 15:31:21,697 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:21,871 INFO L129 PetriNetUnfolder]: 16/567 cut-off events. [2020-10-09 15:31:21,872 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:31:21,890 INFO L80 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 567 events. 16/567 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2453 event pairs, 0 based on Foata normal form. 0/533 useless extension candidates. Maximal degree in co-relation 708. Up to 20 conditions per place. [2020-10-09 15:31:21,893 INFO L132 encePairwiseOnDemand]: 527/530 looper letters, 5 selfloop transitions, 2 changer transitions 0/468 dead transitions. [2020-10-09 15:31:21,893 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 468 transitions, 1193 flow [2020-10-09 15:31:21,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:21,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1517 transitions. [2020-10-09 15:31:21,894 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9540880503144654 [2020-10-09 15:31:21,894 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1517 transitions. [2020-10-09 15:31:21,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1517 transitions. [2020-10-09 15:31:21,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:21,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1517 transitions. [2020-10-09 15:31:21,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:21,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:21,896 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:21,896 INFO L185 Difference]: Start difference. First operand has 543 places, 468 transitions, 1181 flow. Second operand 3 states and 1517 transitions. [2020-10-09 15:31:21,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 468 transitions, 1193 flow [2020-10-09 15:31:21,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 468 transitions, 1188 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:21,900 INFO L241 Difference]: Finished difference. Result has 546 places, 468 transitions, 1186 flow [2020-10-09 15:31:21,901 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1172, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1186, PETRI_PLACES=546, PETRI_TRANSITIONS=468} [2020-10-09 15:31:21,901 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 54 predicate places. [2020-10-09 15:31:21,901 INFO L481 AbstractCegarLoop]: Abstraction has has 546 places, 468 transitions, 1186 flow [2020-10-09 15:31:21,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:21,901 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:21,901 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:22,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 494 mathsat -unsat_core_generation=3 [2020-10-09 15:31:22,102 INFO L429 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:22,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:22,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2071547412, now seen corresponding path program 1 times [2020-10-09 15:31:22,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:22,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999353412] [2020-10-09 15:31:22,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 495 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 495 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:22,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:22,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:31:22,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:31:22,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999353412] [2020-10-09 15:31:22,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:22,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:22,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184975574] [2020-10-09 15:31:22,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:22,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:22,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:22,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:22,460 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 530 [2020-10-09 15:31:22,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 468 transitions, 1186 flow. Second operand 3 states. [2020-10-09 15:31:22,461 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:22,461 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 530 [2020-10-09 15:31:22,461 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:22,610 INFO L129 PetriNetUnfolder]: 15/563 cut-off events. [2020-10-09 15:31:22,610 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:31:22,634 INFO L80 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 563 events. 15/563 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2425 event pairs, 0 based on Foata normal form. 1/531 useless extension candidates. Maximal degree in co-relation 704. Up to 20 conditions per place. [2020-10-09 15:31:22,636 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 4 selfloop transitions, 1 changer transitions 0/465 dead transitions. [2020-10-09 15:31:22,636 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 465 transitions, 1181 flow [2020-10-09 15:31:22,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2020-10-09 15:31:22,637 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2020-10-09 15:31:22,637 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1518 transitions. [2020-10-09 15:31:22,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1518 transitions. [2020-10-09 15:31:22,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:22,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1518 transitions. [2020-10-09 15:31:22,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:22,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:22,639 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:22,639 INFO L185 Difference]: Start difference. First operand has 546 places, 468 transitions, 1186 flow. Second operand 3 states and 1518 transitions. [2020-10-09 15:31:22,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 465 transitions, 1181 flow [2020-10-09 15:31:22,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 465 transitions, 1174 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:22,644 INFO L241 Difference]: Finished difference. Result has 545 places, 465 transitions, 1166 flow [2020-10-09 15:31:22,644 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1166, PETRI_PLACES=545, PETRI_TRANSITIONS=465} [2020-10-09 15:31:22,644 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 53 predicate places. [2020-10-09 15:31:22,644 INFO L481 AbstractCegarLoop]: Abstraction has has 545 places, 465 transitions, 1166 flow [2020-10-09 15:31:22,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:22,644 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:22,644 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:22,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 495 mathsat -unsat_core_generation=3 [2020-10-09 15:31:22,845 INFO L429 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:22,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:22,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2071548435, now seen corresponding path program 1 times [2020-10-09 15:31:22,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:22,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80882431] [2020-10-09 15:31:22,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 496 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 496 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:23,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:23,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:31:23,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:31:23,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80882431] [2020-10-09 15:31:23,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:23,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:23,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130421871] [2020-10-09 15:31:23,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:23,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:23,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:23,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:23,208 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:31:23,209 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 465 transitions, 1166 flow. Second operand 3 states. [2020-10-09 15:31:23,209 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:23,209 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:31:23,209 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:23,363 INFO L129 PetriNetUnfolder]: 15/561 cut-off events. [2020-10-09 15:31:23,363 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:31:23,387 INFO L80 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 561 events. 15/561 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2409 event pairs, 0 based on Foata normal form. 0/527 useless extension candidates. Maximal degree in co-relation 706. Up to 20 conditions per place. [2020-10-09 15:31:23,389 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 8 selfloop transitions, 1 changer transitions 0/463 dead transitions. [2020-10-09 15:31:23,389 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 463 transitions, 1179 flow [2020-10-09 15:31:23,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1504 transitions. [2020-10-09 15:31:23,390 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9459119496855346 [2020-10-09 15:31:23,390 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1504 transitions. [2020-10-09 15:31:23,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1504 transitions. [2020-10-09 15:31:23,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:23,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1504 transitions. [2020-10-09 15:31:23,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:23,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:23,392 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:23,392 INFO L185 Difference]: Start difference. First operand has 545 places, 465 transitions, 1166 flow. Second operand 3 states and 1504 transitions. [2020-10-09 15:31:23,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 463 transitions, 1179 flow [2020-10-09 15:31:23,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 463 transitions, 1178 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:23,397 INFO L241 Difference]: Finished difference. Result has 544 places, 463 transitions, 1162 flow [2020-10-09 15:31:23,397 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1160, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1162, PETRI_PLACES=544, PETRI_TRANSITIONS=463} [2020-10-09 15:31:23,397 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 52 predicate places. [2020-10-09 15:31:23,397 INFO L481 AbstractCegarLoop]: Abstraction has has 544 places, 463 transitions, 1162 flow [2020-10-09 15:31:23,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:23,398 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:23,398 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:23,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 496 mathsat -unsat_core_generation=3 [2020-10-09 15:31:23,598 INFO L429 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:23,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:23,599 INFO L82 PathProgramCache]: Analyzing trace with hash 205867339, now seen corresponding path program 1 times [2020-10-09 15:31:23,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:23,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636147539] [2020-10-09 15:31:23,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 497 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 497 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:23,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:23,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:31:23,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:31:23,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636147539] [2020-10-09 15:31:23,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:23,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:23,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817074838] [2020-10-09 15:31:23,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:23,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:23,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:23,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:23,951 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:31:23,952 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 463 transitions, 1162 flow. Second operand 3 states. [2020-10-09 15:31:23,952 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:23,952 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:31:23,952 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:24,134 INFO L129 PetriNetUnfolder]: 14/569 cut-off events. [2020-10-09 15:31:24,134 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:31:24,152 INFO L80 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 569 events. 14/569 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2482 event pairs, 0 based on Foata normal form. 0/535 useless extension candidates. Maximal degree in co-relation 718. Up to 20 conditions per place. [2020-10-09 15:31:24,154 INFO L132 encePairwiseOnDemand]: 525/530 looper letters, 10 selfloop transitions, 3 changer transitions 0/465 dead transitions. [2020-10-09 15:31:24,154 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 465 transitions, 1192 flow [2020-10-09 15:31:24,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1509 transitions. [2020-10-09 15:31:24,156 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9490566037735849 [2020-10-09 15:31:24,156 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1509 transitions. [2020-10-09 15:31:24,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1509 transitions. [2020-10-09 15:31:24,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:24,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1509 transitions. [2020-10-09 15:31:24,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:24,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:24,157 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:24,157 INFO L185 Difference]: Start difference. First operand has 544 places, 463 transitions, 1162 flow. Second operand 3 states and 1509 transitions. [2020-10-09 15:31:24,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 465 transitions, 1192 flow [2020-10-09 15:31:24,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 465 transitions, 1191 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:24,162 INFO L241 Difference]: Finished difference. Result has 547 places, 465 transitions, 1185 flow [2020-10-09 15:31:24,162 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1185, PETRI_PLACES=547, PETRI_TRANSITIONS=465} [2020-10-09 15:31:24,162 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 55 predicate places. [2020-10-09 15:31:24,162 INFO L481 AbstractCegarLoop]: Abstraction has has 547 places, 465 transitions, 1185 flow [2020-10-09 15:31:24,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:24,163 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:24,163 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:24,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 497 mathsat -unsat_core_generation=3 [2020-10-09 15:31:24,363 INFO L429 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:24,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:24,364 INFO L82 PathProgramCache]: Analyzing trace with hash 205868362, now seen corresponding path program 1 times [2020-10-09 15:31:24,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:24,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620974617] [2020-10-09 15:31:24,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 498 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 498 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:24,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:24,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:31:24,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:24,701 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:31:24,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620974617] [2020-10-09 15:31:24,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:24,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:24,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132075579] [2020-10-09 15:31:24,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:24,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:24,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:24,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:24,712 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 530 [2020-10-09 15:31:24,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 465 transitions, 1185 flow. Second operand 3 states. [2020-10-09 15:31:24,713 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:24,713 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 530 [2020-10-09 15:31:24,713 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:24,869 INFO L129 PetriNetUnfolder]: 13/567 cut-off events. [2020-10-09 15:31:24,870 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:31:24,897 INFO L80 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 567 events. 13/567 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2472 event pairs, 0 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 715. Up to 20 conditions per place. [2020-10-09 15:31:24,899 INFO L132 encePairwiseOnDemand]: 527/530 looper letters, 5 selfloop transitions, 2 changer transitions 0/465 dead transitions. [2020-10-09 15:31:24,899 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 465 transitions, 1197 flow [2020-10-09 15:31:24,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1517 transitions. [2020-10-09 15:31:24,901 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9540880503144654 [2020-10-09 15:31:24,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1517 transitions. [2020-10-09 15:31:24,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1517 transitions. [2020-10-09 15:31:24,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:24,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1517 transitions. [2020-10-09 15:31:24,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:24,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:24,902 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:24,902 INFO L185 Difference]: Start difference. First operand has 547 places, 465 transitions, 1185 flow. Second operand 3 states and 1517 transitions. [2020-10-09 15:31:24,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 465 transitions, 1197 flow [2020-10-09 15:31:24,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 465 transitions, 1192 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:24,907 INFO L241 Difference]: Finished difference. Result has 550 places, 465 transitions, 1190 flow [2020-10-09 15:31:24,907 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1190, PETRI_PLACES=550, PETRI_TRANSITIONS=465} [2020-10-09 15:31:24,907 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 58 predicate places. [2020-10-09 15:31:24,908 INFO L481 AbstractCegarLoop]: Abstraction has has 550 places, 465 transitions, 1190 flow [2020-10-09 15:31:24,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:24,908 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:24,908 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:25,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 498 mathsat -unsat_core_generation=3 [2020-10-09 15:31:25,108 INFO L429 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:25,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:25,109 INFO L82 PathProgramCache]: Analyzing trace with hash 206820651, now seen corresponding path program 1 times [2020-10-09 15:31:25,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:25,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955775639] [2020-10-09 15:31:25,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 499 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 499 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:25,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:25,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:31:25,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:31:25,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955775639] [2020-10-09 15:31:25,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:25,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:25,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606463792] [2020-10-09 15:31:25,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:25,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:25,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:25,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:25,464 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 530 [2020-10-09 15:31:25,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 465 transitions, 1190 flow. Second operand 3 states. [2020-10-09 15:31:25,465 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:25,465 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 530 [2020-10-09 15:31:25,466 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:25,623 INFO L129 PetriNetUnfolder]: 12/563 cut-off events. [2020-10-09 15:31:25,623 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:31:25,647 INFO L80 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 563 events. 12/563 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2444 event pairs, 0 based on Foata normal form. 1/534 useless extension candidates. Maximal degree in co-relation 711. Up to 20 conditions per place. [2020-10-09 15:31:25,649 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 4 selfloop transitions, 1 changer transitions 0/462 dead transitions. [2020-10-09 15:31:25,649 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 462 transitions, 1185 flow [2020-10-09 15:31:25,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:25,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:25,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2020-10-09 15:31:25,650 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2020-10-09 15:31:25,650 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1518 transitions. [2020-10-09 15:31:25,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1518 transitions. [2020-10-09 15:31:25,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:25,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1518 transitions. [2020-10-09 15:31:25,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:25,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:25,652 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:25,652 INFO L185 Difference]: Start difference. First operand has 550 places, 465 transitions, 1190 flow. Second operand 3 states and 1518 transitions. [2020-10-09 15:31:25,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 462 transitions, 1185 flow [2020-10-09 15:31:25,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 462 transitions, 1178 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:25,657 INFO L241 Difference]: Finished difference. Result has 549 places, 462 transitions, 1170 flow [2020-10-09 15:31:25,657 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1170, PETRI_PLACES=549, PETRI_TRANSITIONS=462} [2020-10-09 15:31:25,657 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 57 predicate places. [2020-10-09 15:31:25,657 INFO L481 AbstractCegarLoop]: Abstraction has has 549 places, 462 transitions, 1170 flow [2020-10-09 15:31:25,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:25,657 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:25,658 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:25,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 499 mathsat -unsat_core_generation=3 [2020-10-09 15:31:25,858 INFO L429 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:25,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:25,859 INFO L82 PathProgramCache]: Analyzing trace with hash 206821674, now seen corresponding path program 1 times [2020-10-09 15:31:25,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:25,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213463076] [2020-10-09 15:31:25,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 500 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 500 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:26,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:26,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:31:26,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:31:26,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213463076] [2020-10-09 15:31:26,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:26,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:26,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275015070] [2020-10-09 15:31:26,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:26,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:26,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:26,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:26,220 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 530 [2020-10-09 15:31:26,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 462 transitions, 1170 flow. Second operand 3 states. [2020-10-09 15:31:26,221 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:26,221 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 530 [2020-10-09 15:31:26,221 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:26,403 INFO L129 PetriNetUnfolder]: 12/561 cut-off events. [2020-10-09 15:31:26,403 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:31:26,419 INFO L80 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 561 events. 12/561 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2427 event pairs, 0 based on Foata normal form. 0/530 useless extension candidates. Maximal degree in co-relation 713. Up to 20 conditions per place. [2020-10-09 15:31:26,420 INFO L132 encePairwiseOnDemand]: 528/530 looper letters, 8 selfloop transitions, 1 changer transitions 0/460 dead transitions. [2020-10-09 15:31:26,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 460 transitions, 1183 flow [2020-10-09 15:31:26,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1504 transitions. [2020-10-09 15:31:26,421 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9459119496855346 [2020-10-09 15:31:26,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1504 transitions. [2020-10-09 15:31:26,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1504 transitions. [2020-10-09 15:31:26,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:26,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1504 transitions. [2020-10-09 15:31:26,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:26,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:26,423 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:26,423 INFO L185 Difference]: Start difference. First operand has 549 places, 462 transitions, 1170 flow. Second operand 3 states and 1504 transitions. [2020-10-09 15:31:26,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 460 transitions, 1183 flow [2020-10-09 15:31:26,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 460 transitions, 1182 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:26,428 INFO L241 Difference]: Finished difference. Result has 548 places, 460 transitions, 1166 flow [2020-10-09 15:31:26,428 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1166, PETRI_PLACES=548, PETRI_TRANSITIONS=460} [2020-10-09 15:31:26,428 INFO L341 CegarLoopForPetriNet]: 492 programPoint places, 56 predicate places. [2020-10-09 15:31:26,428 INFO L481 AbstractCegarLoop]: Abstraction has has 548 places, 460 transitions, 1166 flow [2020-10-09 15:31:26,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:26,428 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:26,428 INFO L255 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:26,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 500 mathsat -unsat_core_generation=3 [2020-10-09 15:31:26,629 INFO L429 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:26,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:26,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2062706413, now seen corresponding path program 1 times [2020-10-09 15:31:26,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:26,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257766278] [2020-10-09 15:31:26,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 501 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 501 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:31:26,963 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:31:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:31:26,996 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:31:27,048 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:31:27,049 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:31:27,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 501 mathsat -unsat_core_generation=3 [2020-10-09 15:31:27,249 WARN L371 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:31:27,250 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2020-10-09 15:31:27,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,290 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,359 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,359 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,359 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,365 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,365 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,366 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,366 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,370 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:31:27,398 INFO L253 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2020-10-09 15:31:27,398 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:31:27,398 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:31:27,398 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:31:27,399 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:31:27,399 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:31:27,399 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:31:27,399 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:31:27,399 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:31:27,402 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 517 places, 557 transitions, 1594 flow [2020-10-09 15:31:27,557 INFO L129 PetriNetUnfolder]: 101/736 cut-off events. [2020-10-09 15:31:27,557 INFO L130 PetriNetUnfolder]: For 1520/1520 co-relation queries the response was YES. [2020-10-09 15:31:27,593 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 736 events. 101/736 cut-off events. For 1520/1520 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3020 event pairs, 0 based on Foata normal form. 0/594 useless extension candidates. Maximal degree in co-relation 942. Up to 42 conditions per place. [2020-10-09 15:31:27,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 517 places, 557 transitions, 1594 flow [2020-10-09 15:31:27,606 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 517 places, 557 transitions, 1594 flow [2020-10-09 15:31:27,611 INFO L129 PetriNetUnfolder]: 9/99 cut-off events. [2020-10-09 15:31:27,611 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:31:27,612 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:27,612 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:27,612 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:27,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2073375619, now seen corresponding path program 1 times [2020-10-09 15:31:27,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:27,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441104662] [2020-10-09 15:31:27,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 502 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 502 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:27,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:27,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:31:27,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:27,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:31:27,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441104662] [2020-10-09 15:31:27,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:27,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:27,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238749281] [2020-10-09 15:31:27,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:27,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:27,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:27,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:27,982 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:27,982 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 557 transitions, 1594 flow. Second operand 3 states. [2020-10-09 15:31:27,983 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:27,983 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:27,983 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:28,131 INFO L129 PetriNetUnfolder]: 59/598 cut-off events. [2020-10-09 15:31:28,132 INFO L130 PetriNetUnfolder]: For 1521/1521 co-relation queries the response was YES. [2020-10-09 15:31:28,160 INFO L80 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 598 events. 59/598 cut-off events. For 1521/1521 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2351 event pairs, 0 based on Foata normal form. 88/605 useless extension candidates. Maximal degree in co-relation 816. Up to 21 conditions per place. [2020-10-09 15:31:28,167 INFO L132 encePairwiseOnDemand]: 530/557 looper letters, 10 selfloop transitions, 3 changer transitions 0/533 dead transitions. [2020-10-09 15:31:28,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 533 transitions, 1572 flow [2020-10-09 15:31:28,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1631 transitions. [2020-10-09 15:31:28,169 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9760622381807301 [2020-10-09 15:31:28,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1631 transitions. [2020-10-09 15:31:28,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1631 transitions. [2020-10-09 15:31:28,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:28,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1631 transitions. [2020-10-09 15:31:28,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:28,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:28,171 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:28,171 INFO L185 Difference]: Start difference. First operand has 517 places, 557 transitions, 1594 flow. Second operand 3 states and 1631 transitions. [2020-10-09 15:31:28,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 533 transitions, 1572 flow [2020-10-09 15:31:28,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 533 transitions, 1192 flow, removed 190 selfloop flow, removed 0 redundant places. [2020-10-09 15:31:28,177 INFO L241 Difference]: Finished difference. Result has 516 places, 533 transitions, 1186 flow [2020-10-09 15:31:28,178 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1186, PETRI_PLACES=516, PETRI_TRANSITIONS=533} [2020-10-09 15:31:28,178 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, -1 predicate places. [2020-10-09 15:31:28,178 INFO L481 AbstractCegarLoop]: Abstraction has has 516 places, 533 transitions, 1186 flow [2020-10-09 15:31:28,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:28,178 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:28,178 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:28,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 502 mathsat -unsat_core_generation=3 [2020-10-09 15:31:28,379 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:28,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:28,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2073376642, now seen corresponding path program 1 times [2020-10-09 15:31:28,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:28,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951224102] [2020-10-09 15:31:28,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 503 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 503 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:28,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:28,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:31:28,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:31:28,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951224102] [2020-10-09 15:31:28,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:28,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:28,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938719119] [2020-10-09 15:31:28,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:28,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:28,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:28,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:28,740 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 557 [2020-10-09 15:31:28,741 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 533 transitions, 1186 flow. Second operand 3 states. [2020-10-09 15:31:28,741 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:28,741 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 557 [2020-10-09 15:31:28,741 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:28,921 INFO L129 PetriNetUnfolder]: 57/599 cut-off events. [2020-10-09 15:31:28,921 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:31:28,934 INFO L80 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 599 events. 57/599 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2377 event pairs, 0 based on Foata normal form. 1/524 useless extension candidates. Maximal degree in co-relation 653. Up to 21 conditions per place. [2020-10-09 15:31:28,940 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 4 selfloop transitions, 1 changer transitions 0/532 dead transitions. [2020-10-09 15:31:28,940 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 532 transitions, 1192 flow [2020-10-09 15:31:28,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:28,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:28,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2020-10-09 15:31:28,941 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9551166965888689 [2020-10-09 15:31:28,941 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2020-10-09 15:31:28,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2020-10-09 15:31:28,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:28,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2020-10-09 15:31:28,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:28,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:28,944 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:28,944 INFO L185 Difference]: Start difference. First operand has 516 places, 533 transitions, 1186 flow. Second operand 3 states and 1596 transitions. [2020-10-09 15:31:28,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 532 transitions, 1192 flow [2020-10-09 15:31:28,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 532 transitions, 1187 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:28,948 INFO L241 Difference]: Finished difference. Result has 518 places, 532 transitions, 1182 flow [2020-10-09 15:31:28,949 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1182, PETRI_PLACES=518, PETRI_TRANSITIONS=532} [2020-10-09 15:31:28,949 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 1 predicate places. [2020-10-09 15:31:28,949 INFO L481 AbstractCegarLoop]: Abstraction has has 518 places, 532 transitions, 1182 flow [2020-10-09 15:31:28,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:28,949 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:28,949 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:29,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 503 mathsat -unsat_core_generation=3 [2020-10-09 15:31:29,150 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:29,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:29,150 INFO L82 PathProgramCache]: Analyzing trace with hash -2074328931, now seen corresponding path program 1 times [2020-10-09 15:31:29,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:29,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940963964] [2020-10-09 15:31:29,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 504 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 504 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:29,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:29,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:31:29,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:31:29,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940963964] [2020-10-09 15:31:29,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:29,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:29,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811861910] [2020-10-09 15:31:29,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:29,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:29,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:29,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:29,500 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 557 [2020-10-09 15:31:29,500 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 532 transitions, 1182 flow. Second operand 3 states. [2020-10-09 15:31:29,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:29,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 557 [2020-10-09 15:31:29,501 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:29,635 INFO L129 PetriNetUnfolder]: 57/592 cut-off events. [2020-10-09 15:31:29,635 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:31:29,660 INFO L80 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 592 events. 57/592 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2320 event pairs, 0 based on Foata normal form. 1/517 useless extension candidates. Maximal degree in co-relation 655. Up to 21 conditions per place. [2020-10-09 15:31:29,668 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 5 selfloop transitions, 1 changer transitions 0/530 dead transitions. [2020-10-09 15:31:29,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 530 transitions, 1185 flow [2020-10-09 15:31:29,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:29,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2020-10-09 15:31:29,669 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9539198084979055 [2020-10-09 15:31:29,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2020-10-09 15:31:29,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2020-10-09 15:31:29,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:29,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2020-10-09 15:31:29,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:29,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:29,671 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:29,671 INFO L185 Difference]: Start difference. First operand has 518 places, 532 transitions, 1182 flow. Second operand 3 states and 1594 transitions. [2020-10-09 15:31:29,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 530 transitions, 1185 flow [2020-10-09 15:31:29,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 530 transitions, 1178 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:29,676 INFO L241 Difference]: Finished difference. Result has 518 places, 530 transitions, 1171 flow [2020-10-09 15:31:29,676 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1171, PETRI_PLACES=518, PETRI_TRANSITIONS=530} [2020-10-09 15:31:29,676 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 1 predicate places. [2020-10-09 15:31:29,676 INFO L481 AbstractCegarLoop]: Abstraction has has 518 places, 530 transitions, 1171 flow [2020-10-09 15:31:29,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:29,676 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:29,676 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:29,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 504 mathsat -unsat_core_generation=3 [2020-10-09 15:31:29,877 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:29,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:29,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2074329954, now seen corresponding path program 1 times [2020-10-09 15:31:29,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:29,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776587160] [2020-10-09 15:31:29,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 505 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 505 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:30,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:30,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:31:30,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:31:30,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776587160] [2020-10-09 15:31:30,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:30,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:30,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782628052] [2020-10-09 15:31:30,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:30,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:30,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:30,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:30,247 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:30,247 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 530 transitions, 1171 flow. Second operand 3 states. [2020-10-09 15:31:30,247 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:30,247 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:30,248 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:30,384 INFO L129 PetriNetUnfolder]: 57/590 cut-off events. [2020-10-09 15:31:30,385 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:30,409 INFO L80 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 590 events. 57/590 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2306 event pairs, 0 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 655. Up to 21 conditions per place. [2020-10-09 15:31:30,416 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 8 selfloop transitions, 1 changer transitions 0/528 dead transitions. [2020-10-09 15:31:30,417 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 528 transitions, 1184 flow [2020-10-09 15:31:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1582 transitions. [2020-10-09 15:31:30,418 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9467384799521245 [2020-10-09 15:31:30,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1582 transitions. [2020-10-09 15:31:30,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1582 transitions. [2020-10-09 15:31:30,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:30,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1582 transitions. [2020-10-09 15:31:30,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:30,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:30,420 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:30,420 INFO L185 Difference]: Start difference. First operand has 518 places, 530 transitions, 1171 flow. Second operand 3 states and 1582 transitions. [2020-10-09 15:31:30,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 528 transitions, 1184 flow [2020-10-09 15:31:30,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 528 transitions, 1183 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:30,425 INFO L241 Difference]: Finished difference. Result has 517 places, 528 transitions, 1167 flow [2020-10-09 15:31:30,425 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1167, PETRI_PLACES=517, PETRI_TRANSITIONS=528} [2020-10-09 15:31:30,425 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 0 predicate places. [2020-10-09 15:31:30,425 INFO L481 AbstractCegarLoop]: Abstraction has has 517 places, 528 transitions, 1167 flow [2020-10-09 15:31:30,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:30,425 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:30,425 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:31:30,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 505 mathsat -unsat_core_generation=3 [2020-10-09 15:31:30,626 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:30,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:30,626 INFO L82 PathProgramCache]: Analyzing trace with hash -874544671, now seen corresponding path program 1 times [2020-10-09 15:31:30,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:30,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959095240] [2020-10-09 15:31:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 506 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 506 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:30,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:30,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:31:30,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:31:30,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959095240] [2020-10-09 15:31:30,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:30,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:30,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535823495] [2020-10-09 15:31:30,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:30,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:30,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:30,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:30,991 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:30,992 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 528 transitions, 1167 flow. Second operand 3 states. [2020-10-09 15:31:30,992 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:30,992 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:30,992 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:31,133 INFO L129 PetriNetUnfolder]: 56/598 cut-off events. [2020-10-09 15:31:31,134 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:31,160 INFO L80 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 598 events. 56/598 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2378 event pairs, 0 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 667. Up to 21 conditions per place. [2020-10-09 15:31:31,167 INFO L132 encePairwiseOnDemand]: 552/557 looper letters, 10 selfloop transitions, 3 changer transitions 0/530 dead transitions. [2020-10-09 15:31:31,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 530 transitions, 1197 flow [2020-10-09 15:31:31,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1587 transitions. [2020-10-09 15:31:31,168 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9497307001795332 [2020-10-09 15:31:31,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1587 transitions. [2020-10-09 15:31:31,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1587 transitions. [2020-10-09 15:31:31,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:31,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1587 transitions. [2020-10-09 15:31:31,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:31,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:31,170 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:31,170 INFO L185 Difference]: Start difference. First operand has 517 places, 528 transitions, 1167 flow. Second operand 3 states and 1587 transitions. [2020-10-09 15:31:31,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 530 transitions, 1197 flow [2020-10-09 15:31:31,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 530 transitions, 1196 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:31,175 INFO L241 Difference]: Finished difference. Result has 520 places, 530 transitions, 1190 flow [2020-10-09 15:31:31,175 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1190, PETRI_PLACES=520, PETRI_TRANSITIONS=530} [2020-10-09 15:31:31,176 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 3 predicate places. [2020-10-09 15:31:31,176 INFO L481 AbstractCegarLoop]: Abstraction has has 520 places, 530 transitions, 1190 flow [2020-10-09 15:31:31,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:31,176 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:31,176 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:31:31,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 506 mathsat -unsat_core_generation=3 [2020-10-09 15:31:31,377 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:31,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:31,377 INFO L82 PathProgramCache]: Analyzing trace with hash -874545694, now seen corresponding path program 1 times [2020-10-09 15:31:31,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:31,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527496616] [2020-10-09 15:31:31,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 507 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 507 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:31,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:31,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:31:31,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:31:31,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527496616] [2020-10-09 15:31:31,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:31,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:31,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725752909] [2020-10-09 15:31:31,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:31,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:31,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:31,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:31,738 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 557 [2020-10-09 15:31:31,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 530 transitions, 1190 flow. Second operand 3 states. [2020-10-09 15:31:31,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:31,740 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 557 [2020-10-09 15:31:31,740 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:31,898 INFO L129 PetriNetUnfolder]: 54/599 cut-off events. [2020-10-09 15:31:31,898 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:31:31,923 INFO L80 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 599 events. 54/599 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2400 event pairs, 0 based on Foata normal form. 1/527 useless extension candidates. Maximal degree in co-relation 665. Up to 21 conditions per place. [2020-10-09 15:31:31,930 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 4 selfloop transitions, 1 changer transitions 0/529 dead transitions. [2020-10-09 15:31:31,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 529 transitions, 1196 flow [2020-10-09 15:31:31,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2020-10-09 15:31:31,931 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9551166965888689 [2020-10-09 15:31:31,931 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2020-10-09 15:31:31,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2020-10-09 15:31:31,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:31,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2020-10-09 15:31:31,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:31,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:31,934 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:31,934 INFO L185 Difference]: Start difference. First operand has 520 places, 530 transitions, 1190 flow. Second operand 3 states and 1596 transitions. [2020-10-09 15:31:31,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 529 transitions, 1196 flow [2020-10-09 15:31:31,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 529 transitions, 1191 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:31,939 INFO L241 Difference]: Finished difference. Result has 522 places, 529 transitions, 1186 flow [2020-10-09 15:31:31,939 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1186, PETRI_PLACES=522, PETRI_TRANSITIONS=529} [2020-10-09 15:31:31,939 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 5 predicate places. [2020-10-09 15:31:31,939 INFO L481 AbstractCegarLoop]: Abstraction has has 522 places, 529 transitions, 1186 flow [2020-10-09 15:31:31,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:31,939 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:31,939 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:31:32,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 507 mathsat -unsat_core_generation=3 [2020-10-09 15:31:32,140 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:32,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:32,141 INFO L82 PathProgramCache]: Analyzing trace with hash -875497983, now seen corresponding path program 1 times [2020-10-09 15:31:32,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:32,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727874168] [2020-10-09 15:31:32,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 508 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 508 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:32,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:32,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:31:32,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:31:32,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727874168] [2020-10-09 15:31:32,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:32,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:32,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123732028] [2020-10-09 15:31:32,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:32,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:32,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:32,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:32,501 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 557 [2020-10-09 15:31:32,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 529 transitions, 1186 flow. Second operand 3 states. [2020-10-09 15:31:32,502 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:32,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 557 [2020-10-09 15:31:32,502 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:32,644 INFO L129 PetriNetUnfolder]: 54/592 cut-off events. [2020-10-09 15:31:32,644 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:31:32,669 INFO L80 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 592 events. 54/592 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2342 event pairs, 0 based on Foata normal form. 1/520 useless extension candidates. Maximal degree in co-relation 661. Up to 21 conditions per place. [2020-10-09 15:31:32,676 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 5 selfloop transitions, 1 changer transitions 0/527 dead transitions. [2020-10-09 15:31:32,676 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 527 transitions, 1189 flow [2020-10-09 15:31:32,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2020-10-09 15:31:32,677 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9539198084979055 [2020-10-09 15:31:32,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2020-10-09 15:31:32,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2020-10-09 15:31:32,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:32,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2020-10-09 15:31:32,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:32,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:32,679 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:32,679 INFO L185 Difference]: Start difference. First operand has 522 places, 529 transitions, 1186 flow. Second operand 3 states and 1594 transitions. [2020-10-09 15:31:32,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 527 transitions, 1189 flow [2020-10-09 15:31:32,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 527 transitions, 1182 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:32,684 INFO L241 Difference]: Finished difference. Result has 522 places, 527 transitions, 1175 flow [2020-10-09 15:31:32,684 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1175, PETRI_PLACES=522, PETRI_TRANSITIONS=527} [2020-10-09 15:31:32,684 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 5 predicate places. [2020-10-09 15:31:32,684 INFO L481 AbstractCegarLoop]: Abstraction has has 522 places, 527 transitions, 1175 flow [2020-10-09 15:31:32,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:32,685 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:32,685 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:31:32,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 508 mathsat -unsat_core_generation=3 [2020-10-09 15:31:32,885 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:32,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:32,886 INFO L82 PathProgramCache]: Analyzing trace with hash -875499006, now seen corresponding path program 1 times [2020-10-09 15:31:32,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:32,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183032844] [2020-10-09 15:31:32,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 509 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 509 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:33,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:33,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:31:33,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:33,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:31:33,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183032844] [2020-10-09 15:31:33,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:33,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:33,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242988425] [2020-10-09 15:31:33,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:33,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:33,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:33,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:33,253 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:33,254 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 527 transitions, 1175 flow. Second operand 3 states. [2020-10-09 15:31:33,254 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:33,254 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:33,254 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:33,389 INFO L129 PetriNetUnfolder]: 54/590 cut-off events. [2020-10-09 15:31:33,390 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:31:33,414 INFO L80 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 590 events. 54/590 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2329 event pairs, 0 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 661. Up to 21 conditions per place. [2020-10-09 15:31:33,420 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 8 selfloop transitions, 1 changer transitions 0/525 dead transitions. [2020-10-09 15:31:33,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 525 transitions, 1188 flow [2020-10-09 15:31:33,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:33,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1582 transitions. [2020-10-09 15:31:33,422 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9467384799521245 [2020-10-09 15:31:33,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1582 transitions. [2020-10-09 15:31:33,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1582 transitions. [2020-10-09 15:31:33,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:33,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1582 transitions. [2020-10-09 15:31:33,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:33,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:33,424 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:33,424 INFO L185 Difference]: Start difference. First operand has 522 places, 527 transitions, 1175 flow. Second operand 3 states and 1582 transitions. [2020-10-09 15:31:33,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 525 transitions, 1188 flow [2020-10-09 15:31:33,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 525 transitions, 1187 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:33,429 INFO L241 Difference]: Finished difference. Result has 521 places, 525 transitions, 1171 flow [2020-10-09 15:31:33,429 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1171, PETRI_PLACES=521, PETRI_TRANSITIONS=525} [2020-10-09 15:31:33,429 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 4 predicate places. [2020-10-09 15:31:33,429 INFO L481 AbstractCegarLoop]: Abstraction has has 521 places, 525 transitions, 1171 flow [2020-10-09 15:31:33,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:33,430 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:33,430 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:31:33,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 509 mathsat -unsat_core_generation=3 [2020-10-09 15:31:33,630 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:33,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:33,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1102271130, now seen corresponding path program 1 times [2020-10-09 15:31:33,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:33,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215343510] [2020-10-09 15:31:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 510 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 510 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:33,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:33,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:31:33,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:31:33,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215343510] [2020-10-09 15:31:33,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:33,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:33,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731515113] [2020-10-09 15:31:33,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:33,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:33,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:33,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:33,988 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 557 [2020-10-09 15:31:33,989 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 525 transitions, 1171 flow. Second operand 3 states. [2020-10-09 15:31:33,989 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:33,989 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 557 [2020-10-09 15:31:33,989 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:34,130 INFO L129 PetriNetUnfolder]: 52/595 cut-off events. [2020-10-09 15:31:34,130 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:34,155 INFO L80 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 595 events. 52/595 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2375 event pairs, 0 based on Foata normal form. 0/522 useless extension candidates. Maximal degree in co-relation 664. Up to 21 conditions per place. [2020-10-09 15:31:34,161 INFO L132 encePairwiseOnDemand]: 554/557 looper letters, 5 selfloop transitions, 2 changer transitions 0/526 dead transitions. [2020-10-09 15:31:34,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 526 transitions, 1187 flow [2020-10-09 15:31:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1595 transitions. [2020-10-09 15:31:34,163 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9545182525433872 [2020-10-09 15:31:34,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1595 transitions. [2020-10-09 15:31:34,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1595 transitions. [2020-10-09 15:31:34,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:34,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1595 transitions. [2020-10-09 15:31:34,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:34,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:34,164 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:34,165 INFO L185 Difference]: Start difference. First operand has 521 places, 525 transitions, 1171 flow. Second operand 3 states and 1595 transitions. [2020-10-09 15:31:34,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 526 transitions, 1187 flow [2020-10-09 15:31:34,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 526 transitions, 1186 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:34,169 INFO L241 Difference]: Finished difference. Result has 524 places, 526 transitions, 1184 flow [2020-10-09 15:31:34,170 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=520, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1184, PETRI_PLACES=524, PETRI_TRANSITIONS=526} [2020-10-09 15:31:34,170 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 7 predicate places. [2020-10-09 15:31:34,170 INFO L481 AbstractCegarLoop]: Abstraction has has 524 places, 526 transitions, 1184 flow [2020-10-09 15:31:34,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:34,170 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:34,170 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:31:34,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 510 mathsat -unsat_core_generation=3 [2020-10-09 15:31:34,371 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:34,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:34,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1102272153, now seen corresponding path program 1 times [2020-10-09 15:31:34,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:34,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364622447] [2020-10-09 15:31:34,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 511 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 511 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:34,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:34,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:34,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:31:34,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:34,732 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:31:34,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364622447] [2020-10-09 15:31:34,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:34,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:34,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247991291] [2020-10-09 15:31:34,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:34,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:34,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:34,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:34,752 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:34,752 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 526 transitions, 1184 flow. Second operand 3 states. [2020-10-09 15:31:34,752 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:34,752 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:34,753 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:34,899 INFO L129 PetriNetUnfolder]: 52/596 cut-off events. [2020-10-09 15:31:34,899 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:31:34,926 INFO L80 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 596 events. 52/596 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2382 event pairs, 0 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 672. Up to 21 conditions per place. [2020-10-09 15:31:34,932 INFO L132 encePairwiseOnDemand]: 553/557 looper letters, 9 selfloop transitions, 3 changer transitions 0/527 dead transitions. [2020-10-09 15:31:34,933 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 527 transitions, 1210 flow [2020-10-09 15:31:34,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:34,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1585 transitions. [2020-10-09 15:31:34,934 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9485338120885697 [2020-10-09 15:31:34,934 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1585 transitions. [2020-10-09 15:31:34,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1585 transitions. [2020-10-09 15:31:34,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:34,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1585 transitions. [2020-10-09 15:31:34,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:34,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:34,936 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:34,936 INFO L185 Difference]: Start difference. First operand has 524 places, 526 transitions, 1184 flow. Second operand 3 states and 1585 transitions. [2020-10-09 15:31:34,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 527 transitions, 1210 flow [2020-10-09 15:31:34,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 527 transitions, 1208 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:34,940 INFO L241 Difference]: Finished difference. Result has 527 places, 527 transitions, 1200 flow [2020-10-09 15:31:34,941 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1200, PETRI_PLACES=527, PETRI_TRANSITIONS=527} [2020-10-09 15:31:34,941 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 10 predicate places. [2020-10-09 15:31:34,941 INFO L481 AbstractCegarLoop]: Abstraction has has 527 places, 527 transitions, 1200 flow [2020-10-09 15:31:34,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:34,941 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:34,941 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:31:35,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 511 mathsat -unsat_core_generation=3 [2020-10-09 15:31:35,142 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:35,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:35,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1101318841, now seen corresponding path program 1 times [2020-10-09 15:31:35,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:35,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309297837] [2020-10-09 15:31:35,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 512 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 512 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:35,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:35,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:31:35,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:35,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:31:35,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309297837] [2020-10-09 15:31:35,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:35,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:35,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742976817] [2020-10-09 15:31:35,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:35,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:35,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:35,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:35,498 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 557 [2020-10-09 15:31:35,499 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 527 transitions, 1200 flow. Second operand 3 states. [2020-10-09 15:31:35,499 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:35,499 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 557 [2020-10-09 15:31:35,499 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:35,639 INFO L129 PetriNetUnfolder]: 51/592 cut-off events. [2020-10-09 15:31:35,639 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:31:35,664 INFO L80 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 592 events. 51/592 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2359 event pairs, 0 based on Foata normal form. 1/523 useless extension candidates. Maximal degree in co-relation 664. Up to 21 conditions per place. [2020-10-09 15:31:35,670 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 4 selfloop transitions, 1 changer transitions 0/524 dead transitions. [2020-10-09 15:31:35,670 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 524 transitions, 1195 flow [2020-10-09 15:31:35,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2020-10-09 15:31:35,671 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9551166965888689 [2020-10-09 15:31:35,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2020-10-09 15:31:35,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2020-10-09 15:31:35,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:35,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2020-10-09 15:31:35,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:35,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:35,674 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:35,674 INFO L185 Difference]: Start difference. First operand has 527 places, 527 transitions, 1200 flow. Second operand 3 states and 1596 transitions. [2020-10-09 15:31:35,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 524 transitions, 1195 flow [2020-10-09 15:31:35,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 524 transitions, 1187 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:35,679 INFO L241 Difference]: Finished difference. Result has 526 places, 524 transitions, 1179 flow [2020-10-09 15:31:35,679 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1179, PETRI_PLACES=526, PETRI_TRANSITIONS=524} [2020-10-09 15:31:35,679 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 9 predicate places. [2020-10-09 15:31:35,679 INFO L481 AbstractCegarLoop]: Abstraction has has 526 places, 524 transitions, 1179 flow [2020-10-09 15:31:35,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:35,679 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:35,679 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:31:35,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 512 mathsat -unsat_core_generation=3 [2020-10-09 15:31:35,880 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:35,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:35,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1101317818, now seen corresponding path program 1 times [2020-10-09 15:31:35,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:35,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645185575] [2020-10-09 15:31:35,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 513 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 513 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:36,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:36,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:31:36,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:36,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:31:36,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645185575] [2020-10-09 15:31:36,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:36,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:36,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692465120] [2020-10-09 15:31:36,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:36,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:36,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:36,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:36,257 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:36,257 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 524 transitions, 1179 flow. Second operand 3 states. [2020-10-09 15:31:36,257 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:36,257 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:36,257 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:36,397 INFO L129 PetriNetUnfolder]: 51/590 cut-off events. [2020-10-09 15:31:36,397 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:36,421 INFO L80 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 590 events. 51/590 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2342 event pairs, 0 based on Foata normal form. 0/519 useless extension candidates. Maximal degree in co-relation 668. Up to 21 conditions per place. [2020-10-09 15:31:36,427 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 8 selfloop transitions, 1 changer transitions 0/522 dead transitions. [2020-10-09 15:31:36,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 522 transitions, 1192 flow [2020-10-09 15:31:36,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1582 transitions. [2020-10-09 15:31:36,429 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9467384799521245 [2020-10-09 15:31:36,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1582 transitions. [2020-10-09 15:31:36,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1582 transitions. [2020-10-09 15:31:36,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:36,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1582 transitions. [2020-10-09 15:31:36,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:36,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:36,431 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:36,431 INFO L185 Difference]: Start difference. First operand has 526 places, 524 transitions, 1179 flow. Second operand 3 states and 1582 transitions. [2020-10-09 15:31:36,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 522 transitions, 1192 flow [2020-10-09 15:31:36,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 522 transitions, 1191 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:36,436 INFO L241 Difference]: Finished difference. Result has 525 places, 522 transitions, 1175 flow [2020-10-09 15:31:36,436 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1175, PETRI_PLACES=525, PETRI_TRANSITIONS=522} [2020-10-09 15:31:36,436 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 8 predicate places. [2020-10-09 15:31:36,436 INFO L481 AbstractCegarLoop]: Abstraction has has 525 places, 522 transitions, 1175 flow [2020-10-09 15:31:36,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:36,436 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:36,436 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:31:36,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 513 mathsat -unsat_core_generation=3 [2020-10-09 15:31:36,637 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:36,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:36,638 INFO L82 PathProgramCache]: Analyzing trace with hash -450759091, now seen corresponding path program 1 times [2020-10-09 15:31:36,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:36,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806733230] [2020-10-09 15:31:36,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 514 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 514 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:36,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:36,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:31:36,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:31:36,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806733230] [2020-10-09 15:31:36,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:36,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:36,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423784526] [2020-10-09 15:31:36,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:36,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:36,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:36,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:37,001 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:37,001 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 522 transitions, 1175 flow. Second operand 3 states. [2020-10-09 15:31:37,001 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:37,001 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:37,001 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:37,150 INFO L129 PetriNetUnfolder]: 50/598 cut-off events. [2020-10-09 15:31:37,151 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:37,177 INFO L80 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 598 events. 50/598 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2414 event pairs, 0 based on Foata normal form. 0/527 useless extension candidates. Maximal degree in co-relation 680. Up to 21 conditions per place. [2020-10-09 15:31:37,183 INFO L132 encePairwiseOnDemand]: 552/557 looper letters, 10 selfloop transitions, 3 changer transitions 0/524 dead transitions. [2020-10-09 15:31:37,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 524 transitions, 1205 flow [2020-10-09 15:31:37,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:37,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1587 transitions. [2020-10-09 15:31:37,185 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9497307001795332 [2020-10-09 15:31:37,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1587 transitions. [2020-10-09 15:31:37,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1587 transitions. [2020-10-09 15:31:37,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:37,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1587 transitions. [2020-10-09 15:31:37,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:37,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:37,187 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:37,187 INFO L185 Difference]: Start difference. First operand has 525 places, 522 transitions, 1175 flow. Second operand 3 states and 1587 transitions. [2020-10-09 15:31:37,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 524 transitions, 1205 flow [2020-10-09 15:31:37,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 524 transitions, 1204 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:37,191 INFO L241 Difference]: Finished difference. Result has 528 places, 524 transitions, 1198 flow [2020-10-09 15:31:37,192 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1174, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1198, PETRI_PLACES=528, PETRI_TRANSITIONS=524} [2020-10-09 15:31:37,192 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 11 predicate places. [2020-10-09 15:31:37,192 INFO L481 AbstractCegarLoop]: Abstraction has has 528 places, 524 transitions, 1198 flow [2020-10-09 15:31:37,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:37,192 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:37,192 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:31:37,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 514 mathsat -unsat_core_generation=3 [2020-10-09 15:31:37,393 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:37,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:37,393 INFO L82 PathProgramCache]: Analyzing trace with hash -450758068, now seen corresponding path program 1 times [2020-10-09 15:31:37,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:37,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478639849] [2020-10-09 15:31:37,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 515 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 515 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:37,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:37,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:31:37,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:31:37,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478639849] [2020-10-09 15:31:37,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:37,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:37,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707232569] [2020-10-09 15:31:37,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:37,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:37,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:37,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:37,777 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 557 [2020-10-09 15:31:37,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 524 transitions, 1198 flow. Second operand 3 states. [2020-10-09 15:31:37,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:37,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 557 [2020-10-09 15:31:37,778 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:37,924 INFO L129 PetriNetUnfolder]: 49/596 cut-off events. [2020-10-09 15:31:37,924 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:31:37,950 INFO L80 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 596 events. 49/596 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2404 event pairs, 0 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 677. Up to 21 conditions per place. [2020-10-09 15:31:37,956 INFO L132 encePairwiseOnDemand]: 554/557 looper letters, 5 selfloop transitions, 2 changer transitions 0/524 dead transitions. [2020-10-09 15:31:37,957 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 524 transitions, 1210 flow [2020-10-09 15:31:37,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1595 transitions. [2020-10-09 15:31:37,958 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9545182525433872 [2020-10-09 15:31:37,958 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1595 transitions. [2020-10-09 15:31:37,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1595 transitions. [2020-10-09 15:31:37,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:37,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1595 transitions. [2020-10-09 15:31:37,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:37,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:37,960 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:37,960 INFO L185 Difference]: Start difference. First operand has 528 places, 524 transitions, 1198 flow. Second operand 3 states and 1595 transitions. [2020-10-09 15:31:37,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 524 transitions, 1210 flow [2020-10-09 15:31:37,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 524 transitions, 1205 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:37,965 INFO L241 Difference]: Finished difference. Result has 531 places, 524 transitions, 1203 flow [2020-10-09 15:31:37,965 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1203, PETRI_PLACES=531, PETRI_TRANSITIONS=524} [2020-10-09 15:31:37,965 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 14 predicate places. [2020-10-09 15:31:37,965 INFO L481 AbstractCegarLoop]: Abstraction has has 531 places, 524 transitions, 1203 flow [2020-10-09 15:31:37,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:37,965 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:37,965 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:31:38,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 515 mathsat -unsat_core_generation=3 [2020-10-09 15:31:38,166 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:38,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:38,166 INFO L82 PathProgramCache]: Analyzing trace with hash -449805779, now seen corresponding path program 1 times [2020-10-09 15:31:38,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:38,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866302062] [2020-10-09 15:31:38,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 516 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 516 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:38,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:38,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:31:38,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:31:38,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866302062] [2020-10-09 15:31:38,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:38,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:38,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967316247] [2020-10-09 15:31:38,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:38,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:38,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:38,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:38,532 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 557 [2020-10-09 15:31:38,533 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 524 transitions, 1203 flow. Second operand 3 states. [2020-10-09 15:31:38,533 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:38,533 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 557 [2020-10-09 15:31:38,533 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:38,674 INFO L129 PetriNetUnfolder]: 48/592 cut-off events. [2020-10-09 15:31:38,674 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:31:38,699 INFO L80 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 592 events. 48/592 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2376 event pairs, 0 based on Foata normal form. 1/526 useless extension candidates. Maximal degree in co-relation 673. Up to 21 conditions per place. [2020-10-09 15:31:38,704 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 4 selfloop transitions, 1 changer transitions 0/521 dead transitions. [2020-10-09 15:31:38,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 533 places, 521 transitions, 1198 flow [2020-10-09 15:31:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:38,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2020-10-09 15:31:38,706 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9551166965888689 [2020-10-09 15:31:38,706 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2020-10-09 15:31:38,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2020-10-09 15:31:38,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:38,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2020-10-09 15:31:38,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:38,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:38,708 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:38,708 INFO L185 Difference]: Start difference. First operand has 531 places, 524 transitions, 1203 flow. Second operand 3 states and 1596 transitions. [2020-10-09 15:31:38,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 533 places, 521 transitions, 1198 flow [2020-10-09 15:31:38,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 530 places, 521 transitions, 1191 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:38,713 INFO L241 Difference]: Finished difference. Result has 530 places, 521 transitions, 1183 flow [2020-10-09 15:31:38,713 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1183, PETRI_PLACES=530, PETRI_TRANSITIONS=521} [2020-10-09 15:31:38,713 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 13 predicate places. [2020-10-09 15:31:38,713 INFO L481 AbstractCegarLoop]: Abstraction has has 530 places, 521 transitions, 1183 flow [2020-10-09 15:31:38,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:38,713 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:38,714 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:31:38,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 516 mathsat -unsat_core_generation=3 [2020-10-09 15:31:38,914 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:38,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:38,915 INFO L82 PathProgramCache]: Analyzing trace with hash -449804756, now seen corresponding path program 1 times [2020-10-09 15:31:38,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:38,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553887281] [2020-10-09 15:31:38,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 517 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 517 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:39,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:39,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:39,254 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:31:39,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:31:39,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553887281] [2020-10-09 15:31:39,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:39,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:39,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532303193] [2020-10-09 15:31:39,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:39,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:39,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:39,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:39,290 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:39,290 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 521 transitions, 1183 flow. Second operand 3 states. [2020-10-09 15:31:39,290 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:39,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:39,291 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:39,437 INFO L129 PetriNetUnfolder]: 48/590 cut-off events. [2020-10-09 15:31:39,437 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:39,462 INFO L80 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 590 events. 48/590 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2359 event pairs, 0 based on Foata normal form. 0/522 useless extension candidates. Maximal degree in co-relation 675. Up to 21 conditions per place. [2020-10-09 15:31:39,468 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 8 selfloop transitions, 1 changer transitions 0/519 dead transitions. [2020-10-09 15:31:39,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 519 transitions, 1196 flow [2020-10-09 15:31:39,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:39,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1582 transitions. [2020-10-09 15:31:39,469 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9467384799521245 [2020-10-09 15:31:39,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1582 transitions. [2020-10-09 15:31:39,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1582 transitions. [2020-10-09 15:31:39,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:39,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1582 transitions. [2020-10-09 15:31:39,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:39,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:39,471 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:39,471 INFO L185 Difference]: Start difference. First operand has 530 places, 521 transitions, 1183 flow. Second operand 3 states and 1582 transitions. [2020-10-09 15:31:39,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 519 transitions, 1196 flow [2020-10-09 15:31:39,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 519 transitions, 1195 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:39,477 INFO L241 Difference]: Finished difference. Result has 529 places, 519 transitions, 1179 flow [2020-10-09 15:31:39,477 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1179, PETRI_PLACES=529, PETRI_TRANSITIONS=519} [2020-10-09 15:31:39,477 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 12 predicate places. [2020-10-09 15:31:39,477 INFO L481 AbstractCegarLoop]: Abstraction has has 529 places, 519 transitions, 1179 flow [2020-10-09 15:31:39,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:39,477 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:39,477 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:39,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 517 mathsat -unsat_core_generation=3 [2020-10-09 15:31:39,678 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:39,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:39,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1183154668, now seen corresponding path program 1 times [2020-10-09 15:31:39,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:39,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003541492] [2020-10-09 15:31:39,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 518 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 518 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:40,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:40,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:40,024 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:31:40,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:31:40,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003541492] [2020-10-09 15:31:40,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:40,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:40,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120650195] [2020-10-09 15:31:40,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:40,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:40,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:40,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:40,049 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 557 [2020-10-09 15:31:40,050 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 519 transitions, 1179 flow. Second operand 3 states. [2020-10-09 15:31:40,050 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:40,050 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 557 [2020-10-09 15:31:40,050 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:40,196 INFO L129 PetriNetUnfolder]: 47/597 cut-off events. [2020-10-09 15:31:40,196 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:40,222 INFO L80 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 597 events. 47/597 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2420 event pairs, 0 based on Foata normal form. 1/531 useless extension candidates. Maximal degree in co-relation 678. Up to 21 conditions per place. [2020-10-09 15:31:40,229 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 4 selfloop transitions, 1 changer transitions 0/519 dead transitions. [2020-10-09 15:31:40,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 519 transitions, 1189 flow [2020-10-09 15:31:40,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2020-10-09 15:31:40,230 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9551166965888689 [2020-10-09 15:31:40,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2020-10-09 15:31:40,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2020-10-09 15:31:40,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:40,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2020-10-09 15:31:40,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:40,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:40,232 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:40,232 INFO L185 Difference]: Start difference. First operand has 529 places, 519 transitions, 1179 flow. Second operand 3 states and 1596 transitions. [2020-10-09 15:31:40,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 519 transitions, 1189 flow [2020-10-09 15:31:40,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 530 places, 519 transitions, 1188 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:40,237 INFO L241 Difference]: Finished difference. Result has 531 places, 519 transitions, 1183 flow [2020-10-09 15:31:40,237 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1183, PETRI_PLACES=531, PETRI_TRANSITIONS=519} [2020-10-09 15:31:40,237 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 14 predicate places. [2020-10-09 15:31:40,237 INFO L481 AbstractCegarLoop]: Abstraction has has 531 places, 519 transitions, 1183 flow [2020-10-09 15:31:40,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:40,238 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:40,238 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:40,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 518 mathsat -unsat_core_generation=3 [2020-10-09 15:31:40,438 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:40,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:40,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1183153645, now seen corresponding path program 1 times [2020-10-09 15:31:40,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:40,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013578489] [2020-10-09 15:31:40,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 519 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 519 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:40,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:40,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:40,816 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:31:40,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:40,818 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:31:40,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013578489] [2020-10-09 15:31:40,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:40,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:40,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616007896] [2020-10-09 15:31:40,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:40,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:40,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:40,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:40,854 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:40,854 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 519 transitions, 1183 flow. Second operand 3 states. [2020-10-09 15:31:40,855 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:40,855 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:40,855 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:41,029 INFO L129 PetriNetUnfolder]: 45/599 cut-off events. [2020-10-09 15:31:41,029 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:31:41,060 INFO L80 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 599 events. 45/599 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2449 event pairs, 0 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 691. Up to 21 conditions per place. [2020-10-09 15:31:41,067 INFO L132 encePairwiseOnDemand]: 553/557 looper letters, 9 selfloop transitions, 3 changer transitions 0/520 dead transitions. [2020-10-09 15:31:41,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 533 places, 520 transitions, 1209 flow [2020-10-09 15:31:41,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:41,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1585 transitions. [2020-10-09 15:31:41,068 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9485338120885697 [2020-10-09 15:31:41,068 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1585 transitions. [2020-10-09 15:31:41,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1585 transitions. [2020-10-09 15:31:41,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:41,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1585 transitions. [2020-10-09 15:31:41,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:41,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:41,070 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:41,070 INFO L185 Difference]: Start difference. First operand has 531 places, 519 transitions, 1183 flow. Second operand 3 states and 1585 transitions. [2020-10-09 15:31:41,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 533 places, 520 transitions, 1209 flow [2020-10-09 15:31:41,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 520 transitions, 1208 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:41,076 INFO L241 Difference]: Finished difference. Result has 534 places, 520 transitions, 1200 flow [2020-10-09 15:31:41,076 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1200, PETRI_PLACES=534, PETRI_TRANSITIONS=520} [2020-10-09 15:31:41,076 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 17 predicate places. [2020-10-09 15:31:41,076 INFO L481 AbstractCegarLoop]: Abstraction has has 534 places, 520 transitions, 1200 flow [2020-10-09 15:31:41,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:41,077 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:41,077 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:41,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 519 mathsat -unsat_core_generation=3 [2020-10-09 15:31:41,277 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:41,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:41,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1184106957, now seen corresponding path program 1 times [2020-10-09 15:31:41,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:41,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150987033] [2020-10-09 15:31:41,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 520 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 520 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:41,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:41,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:31:41,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:31:41,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150987033] [2020-10-09 15:31:41,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:41,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:41,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210890256] [2020-10-09 15:31:41,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:41,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:41,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:41,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:41,641 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 557 [2020-10-09 15:31:41,642 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 520 transitions, 1200 flow. Second operand 3 states. [2020-10-09 15:31:41,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:41,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 557 [2020-10-09 15:31:41,642 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:41,798 INFO L129 PetriNetUnfolder]: 45/592 cut-off events. [2020-10-09 15:31:41,798 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:31:41,827 INFO L80 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 592 events. 45/592 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2392 event pairs, 0 based on Foata normal form. 1/529 useless extension candidates. Maximal degree in co-relation 677. Up to 21 conditions per place. [2020-10-09 15:31:41,833 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 5 selfloop transitions, 1 changer transitions 0/518 dead transitions. [2020-10-09 15:31:41,833 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 518 transitions, 1202 flow [2020-10-09 15:31:41,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:41,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2020-10-09 15:31:41,835 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9539198084979055 [2020-10-09 15:31:41,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2020-10-09 15:31:41,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2020-10-09 15:31:41,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:41,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2020-10-09 15:31:41,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:41,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:41,837 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:41,837 INFO L185 Difference]: Start difference. First operand has 534 places, 520 transitions, 1200 flow. Second operand 3 states and 1594 transitions. [2020-10-09 15:31:41,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 536 places, 518 transitions, 1202 flow [2020-10-09 15:31:41,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 518 transitions, 1194 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:41,842 INFO L241 Difference]: Finished difference. Result has 534 places, 518 transitions, 1187 flow [2020-10-09 15:31:41,843 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1187, PETRI_PLACES=534, PETRI_TRANSITIONS=518} [2020-10-09 15:31:41,843 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 17 predicate places. [2020-10-09 15:31:41,843 INFO L481 AbstractCegarLoop]: Abstraction has has 534 places, 518 transitions, 1187 flow [2020-10-09 15:31:41,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:41,843 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:41,843 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:42,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 520 mathsat -unsat_core_generation=3 [2020-10-09 15:31:42,044 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:42,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:42,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1184107980, now seen corresponding path program 1 times [2020-10-09 15:31:42,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:42,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004529671] [2020-10-09 15:31:42,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 521 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 521 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:42,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:42,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:42,386 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:31:42,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:31:42,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004529671] [2020-10-09 15:31:42,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:42,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:42,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809767551] [2020-10-09 15:31:42,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:42,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:42,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:42,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:42,423 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:42,424 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 518 transitions, 1187 flow. Second operand 3 states. [2020-10-09 15:31:42,424 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:42,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:42,424 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:42,568 INFO L129 PetriNetUnfolder]: 45/590 cut-off events. [2020-10-09 15:31:42,569 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:31:42,593 INFO L80 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 590 events. 45/590 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2376 event pairs, 0 based on Foata normal form. 0/525 useless extension candidates. Maximal degree in co-relation 681. Up to 21 conditions per place. [2020-10-09 15:31:42,598 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 8 selfloop transitions, 1 changer transitions 0/516 dead transitions. [2020-10-09 15:31:42,598 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 516 transitions, 1200 flow [2020-10-09 15:31:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:42,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1582 transitions. [2020-10-09 15:31:42,600 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9467384799521245 [2020-10-09 15:31:42,600 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1582 transitions. [2020-10-09 15:31:42,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1582 transitions. [2020-10-09 15:31:42,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:42,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1582 transitions. [2020-10-09 15:31:42,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:42,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:42,601 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:42,602 INFO L185 Difference]: Start difference. First operand has 534 places, 518 transitions, 1187 flow. Second operand 3 states and 1582 transitions. [2020-10-09 15:31:42,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 516 transitions, 1200 flow [2020-10-09 15:31:42,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 516 transitions, 1199 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:42,606 INFO L241 Difference]: Finished difference. Result has 533 places, 516 transitions, 1183 flow [2020-10-09 15:31:42,607 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1183, PETRI_PLACES=533, PETRI_TRANSITIONS=516} [2020-10-09 15:31:42,607 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 16 predicate places. [2020-10-09 15:31:42,607 INFO L481 AbstractCegarLoop]: Abstraction has has 533 places, 516 transitions, 1183 flow [2020-10-09 15:31:42,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:42,607 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:42,607 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:42,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 521 mathsat -unsat_core_generation=3 [2020-10-09 15:31:42,808 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:42,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:42,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1557940860, now seen corresponding path program 1 times [2020-10-09 15:31:42,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:42,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490193767] [2020-10-09 15:31:42,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 522 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 522 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:43,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:43,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:43,151 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:31:43,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:31:43,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490193767] [2020-10-09 15:31:43,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:43,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:43,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536675721] [2020-10-09 15:31:43,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:43,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:43,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:43,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:43,175 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 557 [2020-10-09 15:31:43,176 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 516 transitions, 1183 flow. Second operand 3 states. [2020-10-09 15:31:43,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:43,177 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 557 [2020-10-09 15:31:43,177 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:43,318 INFO L129 PetriNetUnfolder]: 44/597 cut-off events. [2020-10-09 15:31:43,318 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:43,342 INFO L80 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 597 events. 44/597 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2438 event pairs, 0 based on Foata normal form. 1/534 useless extension candidates. Maximal degree in co-relation 684. Up to 21 conditions per place. [2020-10-09 15:31:43,347 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 4 selfloop transitions, 1 changer transitions 0/516 dead transitions. [2020-10-09 15:31:43,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 516 transitions, 1193 flow [2020-10-09 15:31:43,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2020-10-09 15:31:43,349 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9551166965888689 [2020-10-09 15:31:43,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2020-10-09 15:31:43,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2020-10-09 15:31:43,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:43,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2020-10-09 15:31:43,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:43,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:43,350 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:43,350 INFO L185 Difference]: Start difference. First operand has 533 places, 516 transitions, 1183 flow. Second operand 3 states and 1596 transitions. [2020-10-09 15:31:43,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 516 transitions, 1193 flow [2020-10-09 15:31:43,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 516 transitions, 1192 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:43,355 INFO L241 Difference]: Finished difference. Result has 535 places, 516 transitions, 1187 flow [2020-10-09 15:31:43,355 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1187, PETRI_PLACES=535, PETRI_TRANSITIONS=516} [2020-10-09 15:31:43,355 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 18 predicate places. [2020-10-09 15:31:43,355 INFO L481 AbstractCegarLoop]: Abstraction has has 535 places, 516 transitions, 1187 flow [2020-10-09 15:31:43,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:43,356 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:43,356 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:43,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 522 mathsat -unsat_core_generation=3 [2020-10-09 15:31:43,556 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:43,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:43,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1557941883, now seen corresponding path program 1 times [2020-10-09 15:31:43,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:43,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578187114] [2020-10-09 15:31:43,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 523 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 523 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:43,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:43,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:31:43,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:31:43,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578187114] [2020-10-09 15:31:43,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:43,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:43,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456154009] [2020-10-09 15:31:43,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:43,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:43,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:43,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:43,950 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:43,950 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 516 transitions, 1187 flow. Second operand 3 states. [2020-10-09 15:31:43,950 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:43,950 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:43,951 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:44,094 INFO L129 PetriNetUnfolder]: 42/599 cut-off events. [2020-10-09 15:31:44,094 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:31:44,118 INFO L80 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 599 events. 42/599 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2471 event pairs, 0 based on Foata normal form. 0/535 useless extension candidates. Maximal degree in co-relation 697. Up to 21 conditions per place. [2020-10-09 15:31:44,123 INFO L132 encePairwiseOnDemand]: 553/557 looper letters, 9 selfloop transitions, 3 changer transitions 0/517 dead transitions. [2020-10-09 15:31:44,123 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 517 transitions, 1213 flow [2020-10-09 15:31:44,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1585 transitions. [2020-10-09 15:31:44,125 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9485338120885697 [2020-10-09 15:31:44,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1585 transitions. [2020-10-09 15:31:44,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1585 transitions. [2020-10-09 15:31:44,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:44,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1585 transitions. [2020-10-09 15:31:44,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:44,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:44,126 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:44,126 INFO L185 Difference]: Start difference. First operand has 535 places, 516 transitions, 1187 flow. Second operand 3 states and 1585 transitions. [2020-10-09 15:31:44,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 517 transitions, 1213 flow [2020-10-09 15:31:44,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 517 transitions, 1212 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:44,131 INFO L241 Difference]: Finished difference. Result has 538 places, 517 transitions, 1204 flow [2020-10-09 15:31:44,131 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1204, PETRI_PLACES=538, PETRI_TRANSITIONS=517} [2020-10-09 15:31:44,132 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 21 predicate places. [2020-10-09 15:31:44,132 INFO L481 AbstractCegarLoop]: Abstraction has has 538 places, 517 transitions, 1204 flow [2020-10-09 15:31:44,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:44,132 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:44,132 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:44,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 523 mathsat -unsat_core_generation=3 [2020-10-09 15:31:44,333 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:44,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:44,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1556988571, now seen corresponding path program 1 times [2020-10-09 15:31:44,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:44,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436574267] [2020-10-09 15:31:44,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 524 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 524 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:44,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:44,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:31:44,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:31:44,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436574267] [2020-10-09 15:31:44,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:44,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:44,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585953254] [2020-10-09 15:31:44,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:44,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:44,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:44,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:44,694 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 557 [2020-10-09 15:31:44,695 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 517 transitions, 1204 flow. Second operand 3 states. [2020-10-09 15:31:44,695 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:44,695 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 557 [2020-10-09 15:31:44,695 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:44,837 INFO L129 PetriNetUnfolder]: 42/592 cut-off events. [2020-10-09 15:31:44,837 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:31:44,861 INFO L80 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 592 events. 42/592 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2414 event pairs, 0 based on Foata normal form. 1/532 useless extension candidates. Maximal degree in co-relation 683. Up to 21 conditions per place. [2020-10-09 15:31:44,866 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 5 selfloop transitions, 1 changer transitions 0/515 dead transitions. [2020-10-09 15:31:44,866 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 515 transitions, 1206 flow [2020-10-09 15:31:44,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2020-10-09 15:31:44,867 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9539198084979055 [2020-10-09 15:31:44,867 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2020-10-09 15:31:44,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2020-10-09 15:31:44,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:44,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2020-10-09 15:31:44,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:44,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:44,869 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:44,869 INFO L185 Difference]: Start difference. First operand has 538 places, 517 transitions, 1204 flow. Second operand 3 states and 1594 transitions. [2020-10-09 15:31:44,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 515 transitions, 1206 flow [2020-10-09 15:31:44,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 515 transitions, 1198 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:44,874 INFO L241 Difference]: Finished difference. Result has 538 places, 515 transitions, 1191 flow [2020-10-09 15:31:44,874 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=538, PETRI_TRANSITIONS=515} [2020-10-09 15:31:44,874 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 21 predicate places. [2020-10-09 15:31:44,874 INFO L481 AbstractCegarLoop]: Abstraction has has 538 places, 515 transitions, 1191 flow [2020-10-09 15:31:44,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:44,874 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:44,875 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:45,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 524 mathsat -unsat_core_generation=3 [2020-10-09 15:31:45,075 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:45,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:45,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1556987548, now seen corresponding path program 1 times [2020-10-09 15:31:45,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:45,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630056828] [2020-10-09 15:31:45,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 525 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 525 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:45,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:45,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:45,417 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:31:45,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:31:45,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630056828] [2020-10-09 15:31:45,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:45,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:45,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536221113] [2020-10-09 15:31:45,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:45,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:45,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:45,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:45,446 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:45,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 515 transitions, 1191 flow. Second operand 3 states. [2020-10-09 15:31:45,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:45,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:45,447 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:45,590 INFO L129 PetriNetUnfolder]: 42/590 cut-off events. [2020-10-09 15:31:45,591 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:31:45,614 INFO L80 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 590 events. 42/590 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2399 event pairs, 0 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 687. Up to 21 conditions per place. [2020-10-09 15:31:45,618 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 8 selfloop transitions, 1 changer transitions 0/513 dead transitions. [2020-10-09 15:31:45,619 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 513 transitions, 1204 flow [2020-10-09 15:31:45,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1582 transitions. [2020-10-09 15:31:45,620 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9467384799521245 [2020-10-09 15:31:45,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1582 transitions. [2020-10-09 15:31:45,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1582 transitions. [2020-10-09 15:31:45,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:45,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1582 transitions. [2020-10-09 15:31:45,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:45,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:45,622 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:45,622 INFO L185 Difference]: Start difference. First operand has 538 places, 515 transitions, 1191 flow. Second operand 3 states and 1582 transitions. [2020-10-09 15:31:45,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 513 transitions, 1204 flow [2020-10-09 15:31:45,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 513 transitions, 1203 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:45,626 INFO L241 Difference]: Finished difference. Result has 537 places, 513 transitions, 1187 flow [2020-10-09 15:31:45,627 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1187, PETRI_PLACES=537, PETRI_TRANSITIONS=513} [2020-10-09 15:31:45,627 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 20 predicate places. [2020-10-09 15:31:45,627 INFO L481 AbstractCegarLoop]: Abstraction has has 537 places, 513 transitions, 1187 flow [2020-10-09 15:31:45,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:45,627 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:45,627 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:45,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 525 mathsat -unsat_core_generation=3 [2020-10-09 15:31:45,828 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:45,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:45,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2045526757, now seen corresponding path program 1 times [2020-10-09 15:31:45,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:45,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140857324] [2020-10-09 15:31:45,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 526 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 526 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:46,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:46,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:31:46,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:31:46,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140857324] [2020-10-09 15:31:46,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:46,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:46,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282713769] [2020-10-09 15:31:46,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:46,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:46,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:46,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:46,202 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 557 [2020-10-09 15:31:46,203 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 513 transitions, 1187 flow. Second operand 3 states. [2020-10-09 15:31:46,203 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:46,203 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 557 [2020-10-09 15:31:46,203 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:46,351 INFO L129 PetriNetUnfolder]: 41/597 cut-off events. [2020-10-09 15:31:46,351 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:46,377 INFO L80 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 597 events. 41/597 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2454 event pairs, 0 based on Foata normal form. 1/537 useless extension candidates. Maximal degree in co-relation 690. Up to 21 conditions per place. [2020-10-09 15:31:46,382 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 4 selfloop transitions, 1 changer transitions 0/513 dead transitions. [2020-10-09 15:31:46,383 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 513 transitions, 1197 flow [2020-10-09 15:31:46,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2020-10-09 15:31:46,384 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9551166965888689 [2020-10-09 15:31:46,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2020-10-09 15:31:46,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2020-10-09 15:31:46,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:46,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2020-10-09 15:31:46,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:46,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:46,386 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:46,386 INFO L185 Difference]: Start difference. First operand has 537 places, 513 transitions, 1187 flow. Second operand 3 states and 1596 transitions. [2020-10-09 15:31:46,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 513 transitions, 1197 flow [2020-10-09 15:31:46,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 513 transitions, 1196 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:46,391 INFO L241 Difference]: Finished difference. Result has 539 places, 513 transitions, 1191 flow [2020-10-09 15:31:46,391 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=539, PETRI_TRANSITIONS=513} [2020-10-09 15:31:46,391 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 22 predicate places. [2020-10-09 15:31:46,391 INFO L481 AbstractCegarLoop]: Abstraction has has 539 places, 513 transitions, 1191 flow [2020-10-09 15:31:46,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:46,391 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:46,391 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:46,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 526 mathsat -unsat_core_generation=3 [2020-10-09 15:31:46,592 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:46,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:46,592 INFO L82 PathProgramCache]: Analyzing trace with hash 2045527780, now seen corresponding path program 1 times [2020-10-09 15:31:46,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:46,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249254659] [2020-10-09 15:31:46,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 527 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 527 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:46,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:46,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:31:46,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:46,962 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:31:46,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249254659] [2020-10-09 15:31:46,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:46,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:46,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845335813] [2020-10-09 15:31:46,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:46,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:46,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:46,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:46,982 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:46,983 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 513 transitions, 1191 flow. Second operand 3 states. [2020-10-09 15:31:46,983 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:46,983 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:46,983 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:47,139 INFO L129 PetriNetUnfolder]: 39/599 cut-off events. [2020-10-09 15:31:47,140 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:31:47,166 INFO L80 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 599 events. 39/599 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2488 event pairs, 0 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 703. Up to 21 conditions per place. [2020-10-09 15:31:47,171 INFO L132 encePairwiseOnDemand]: 553/557 looper letters, 9 selfloop transitions, 3 changer transitions 0/514 dead transitions. [2020-10-09 15:31:47,171 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 514 transitions, 1217 flow [2020-10-09 15:31:47,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:47,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1585 transitions. [2020-10-09 15:31:47,172 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9485338120885697 [2020-10-09 15:31:47,172 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1585 transitions. [2020-10-09 15:31:47,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1585 transitions. [2020-10-09 15:31:47,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:47,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1585 transitions. [2020-10-09 15:31:47,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:47,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:47,175 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:47,175 INFO L185 Difference]: Start difference. First operand has 539 places, 513 transitions, 1191 flow. Second operand 3 states and 1585 transitions. [2020-10-09 15:31:47,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 514 transitions, 1217 flow [2020-10-09 15:31:47,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 514 transitions, 1216 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:47,183 INFO L241 Difference]: Finished difference. Result has 542 places, 514 transitions, 1208 flow [2020-10-09 15:31:47,183 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1208, PETRI_PLACES=542, PETRI_TRANSITIONS=514} [2020-10-09 15:31:47,183 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 25 predicate places. [2020-10-09 15:31:47,183 INFO L481 AbstractCegarLoop]: Abstraction has has 542 places, 514 transitions, 1208 flow [2020-10-09 15:31:47,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:47,183 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:47,183 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:47,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 527 mathsat -unsat_core_generation=3 [2020-10-09 15:31:47,384 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:47,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:47,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2044574468, now seen corresponding path program 1 times [2020-10-09 15:31:47,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:47,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535778464] [2020-10-09 15:31:47,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 528 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 528 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:47,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:47,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:31:47,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:31:47,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535778464] [2020-10-09 15:31:47,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:47,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:47,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181310973] [2020-10-09 15:31:47,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:47,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:47,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:47,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:47,744 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 557 [2020-10-09 15:31:47,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 514 transitions, 1208 flow. Second operand 3 states. [2020-10-09 15:31:47,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:47,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 557 [2020-10-09 15:31:47,745 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:47,896 INFO L129 PetriNetUnfolder]: 39/592 cut-off events. [2020-10-09 15:31:47,897 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:31:47,922 INFO L80 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 592 events. 39/592 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2429 event pairs, 0 based on Foata normal form. 1/535 useless extension candidates. Maximal degree in co-relation 689. Up to 21 conditions per place. [2020-10-09 15:31:47,927 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 5 selfloop transitions, 1 changer transitions 0/512 dead transitions. [2020-10-09 15:31:47,927 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 512 transitions, 1210 flow [2020-10-09 15:31:47,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2020-10-09 15:31:47,928 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9539198084979055 [2020-10-09 15:31:47,928 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2020-10-09 15:31:47,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2020-10-09 15:31:47,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:47,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2020-10-09 15:31:47,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:47,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:47,930 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:47,930 INFO L185 Difference]: Start difference. First operand has 542 places, 514 transitions, 1208 flow. Second operand 3 states and 1594 transitions. [2020-10-09 15:31:47,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 512 transitions, 1210 flow [2020-10-09 15:31:47,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 512 transitions, 1202 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:47,935 INFO L241 Difference]: Finished difference. Result has 542 places, 512 transitions, 1195 flow [2020-10-09 15:31:47,935 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1195, PETRI_PLACES=542, PETRI_TRANSITIONS=512} [2020-10-09 15:31:47,935 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 25 predicate places. [2020-10-09 15:31:47,936 INFO L481 AbstractCegarLoop]: Abstraction has has 542 places, 512 transitions, 1195 flow [2020-10-09 15:31:47,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:47,936 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:47,936 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:48,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 528 mathsat -unsat_core_generation=3 [2020-10-09 15:31:48,136 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:48,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:48,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2044573445, now seen corresponding path program 1 times [2020-10-09 15:31:48,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:48,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681666642] [2020-10-09 15:31:48,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 529 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 529 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:48,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:48,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:31:48,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:31:48,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681666642] [2020-10-09 15:31:48,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:48,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:48,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757978283] [2020-10-09 15:31:48,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:48,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:48,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:48,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:48,516 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:48,517 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 512 transitions, 1195 flow. Second operand 3 states. [2020-10-09 15:31:48,517 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:48,517 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:48,517 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:48,667 INFO L129 PetriNetUnfolder]: 39/590 cut-off events. [2020-10-09 15:31:48,667 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:31:48,692 INFO L80 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 590 events. 39/590 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2416 event pairs, 0 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 693. Up to 21 conditions per place. [2020-10-09 15:31:48,697 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 8 selfloop transitions, 1 changer transitions 0/510 dead transitions. [2020-10-09 15:31:48,697 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 510 transitions, 1208 flow [2020-10-09 15:31:48,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1582 transitions. [2020-10-09 15:31:48,698 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9467384799521245 [2020-10-09 15:31:48,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1582 transitions. [2020-10-09 15:31:48,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1582 transitions. [2020-10-09 15:31:48,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:48,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1582 transitions. [2020-10-09 15:31:48,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:48,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:48,700 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:48,700 INFO L185 Difference]: Start difference. First operand has 542 places, 512 transitions, 1195 flow. Second operand 3 states and 1582 transitions. [2020-10-09 15:31:48,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 510 transitions, 1208 flow [2020-10-09 15:31:48,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 510 transitions, 1207 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:48,705 INFO L241 Difference]: Finished difference. Result has 541 places, 510 transitions, 1191 flow [2020-10-09 15:31:48,705 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=541, PETRI_TRANSITIONS=510} [2020-10-09 15:31:48,706 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 24 predicate places. [2020-10-09 15:31:48,706 INFO L481 AbstractCegarLoop]: Abstraction has has 541 places, 510 transitions, 1191 flow [2020-10-09 15:31:48,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:48,706 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:48,706 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:48,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 529 mathsat -unsat_core_generation=3 [2020-10-09 15:31:48,907 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:48,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:48,907 INFO L82 PathProgramCache]: Analyzing trace with hash -770733329, now seen corresponding path program 1 times [2020-10-09 15:31:48,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:48,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877811698] [2020-10-09 15:31:48,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 530 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 530 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:49,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:49,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:31:49,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:31:49,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877811698] [2020-10-09 15:31:49,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:49,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:49,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359934509] [2020-10-09 15:31:49,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:49,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:49,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:49,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:49,281 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:49,282 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 510 transitions, 1191 flow. Second operand 3 states. [2020-10-09 15:31:49,282 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:49,282 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:49,282 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:49,448 INFO L129 PetriNetUnfolder]: 38/598 cut-off events. [2020-10-09 15:31:49,448 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:49,475 INFO L80 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 598 events. 38/598 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2486 event pairs, 0 based on Foata normal form. 0/539 useless extension candidates. Maximal degree in co-relation 705. Up to 21 conditions per place. [2020-10-09 15:31:49,480 INFO L132 encePairwiseOnDemand]: 552/557 looper letters, 10 selfloop transitions, 3 changer transitions 0/512 dead transitions. [2020-10-09 15:31:49,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 512 transitions, 1221 flow [2020-10-09 15:31:49,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1587 transitions. [2020-10-09 15:31:49,481 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9497307001795332 [2020-10-09 15:31:49,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1587 transitions. [2020-10-09 15:31:49,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1587 transitions. [2020-10-09 15:31:49,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:49,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1587 transitions. [2020-10-09 15:31:49,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:49,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:49,483 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:49,483 INFO L185 Difference]: Start difference. First operand has 541 places, 510 transitions, 1191 flow. Second operand 3 states and 1587 transitions. [2020-10-09 15:31:49,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 512 transitions, 1221 flow [2020-10-09 15:31:49,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 512 transitions, 1220 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:49,546 INFO L241 Difference]: Finished difference. Result has 544 places, 512 transitions, 1214 flow [2020-10-09 15:31:49,546 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1214, PETRI_PLACES=544, PETRI_TRANSITIONS=512} [2020-10-09 15:31:49,547 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 27 predicate places. [2020-10-09 15:31:49,547 INFO L481 AbstractCegarLoop]: Abstraction has has 544 places, 512 transitions, 1214 flow [2020-10-09 15:31:49,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:49,547 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:49,547 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:49,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 530 mathsat -unsat_core_generation=3 [2020-10-09 15:31:49,748 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:49,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:49,748 INFO L82 PathProgramCache]: Analyzing trace with hash -770732306, now seen corresponding path program 1 times [2020-10-09 15:31:49,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:49,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453099469] [2020-10-09 15:31:49,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 531 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 531 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:50,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:50,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:31:50,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:31:50,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453099469] [2020-10-09 15:31:50,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:50,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:50,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522660336] [2020-10-09 15:31:50,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:50,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:50,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:50,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:50,118 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 557 [2020-10-09 15:31:50,119 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 512 transitions, 1214 flow. Second operand 3 states. [2020-10-09 15:31:50,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:50,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 557 [2020-10-09 15:31:50,120 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:50,279 INFO L129 PetriNetUnfolder]: 37/596 cut-off events. [2020-10-09 15:31:50,279 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:31:50,306 INFO L80 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 596 events. 37/596 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2477 event pairs, 0 based on Foata normal form. 0/540 useless extension candidates. Maximal degree in co-relation 702. Up to 21 conditions per place. [2020-10-09 15:31:50,311 INFO L132 encePairwiseOnDemand]: 554/557 looper letters, 5 selfloop transitions, 2 changer transitions 0/512 dead transitions. [2020-10-09 15:31:50,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 512 transitions, 1226 flow [2020-10-09 15:31:50,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1595 transitions. [2020-10-09 15:31:50,313 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9545182525433872 [2020-10-09 15:31:50,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1595 transitions. [2020-10-09 15:31:50,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1595 transitions. [2020-10-09 15:31:50,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:50,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1595 transitions. [2020-10-09 15:31:50,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:50,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:50,315 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:50,315 INFO L185 Difference]: Start difference. First operand has 544 places, 512 transitions, 1214 flow. Second operand 3 states and 1595 transitions. [2020-10-09 15:31:50,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 512 transitions, 1226 flow [2020-10-09 15:31:50,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 512 transitions, 1221 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:50,320 INFO L241 Difference]: Finished difference. Result has 547 places, 512 transitions, 1219 flow [2020-10-09 15:31:50,321 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1219, PETRI_PLACES=547, PETRI_TRANSITIONS=512} [2020-10-09 15:31:50,321 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 30 predicate places. [2020-10-09 15:31:50,321 INFO L481 AbstractCegarLoop]: Abstraction has has 547 places, 512 transitions, 1219 flow [2020-10-09 15:31:50,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:50,321 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:50,321 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:50,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 531 mathsat -unsat_core_generation=3 [2020-10-09 15:31:50,522 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:50,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:50,522 INFO L82 PathProgramCache]: Analyzing trace with hash -769780017, now seen corresponding path program 1 times [2020-10-09 15:31:50,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:50,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637188326] [2020-10-09 15:31:50,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 532 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 532 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:50,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:50,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:31:50,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:31:50,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637188326] [2020-10-09 15:31:50,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:50,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:50,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540918566] [2020-10-09 15:31:50,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:50,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:50,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:50,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:50,914 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 557 [2020-10-09 15:31:50,915 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 512 transitions, 1219 flow. Second operand 3 states. [2020-10-09 15:31:50,915 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:50,915 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 557 [2020-10-09 15:31:50,915 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:51,071 INFO L129 PetriNetUnfolder]: 36/592 cut-off events. [2020-10-09 15:31:51,072 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:31:51,099 INFO L80 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 592 events. 36/592 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2446 event pairs, 0 based on Foata normal form. 1/538 useless extension candidates. Maximal degree in co-relation 698. Up to 21 conditions per place. [2020-10-09 15:31:51,103 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 4 selfloop transitions, 1 changer transitions 0/509 dead transitions. [2020-10-09 15:31:51,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 509 transitions, 1214 flow [2020-10-09 15:31:51,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:51,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2020-10-09 15:31:51,105 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9551166965888689 [2020-10-09 15:31:51,105 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2020-10-09 15:31:51,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2020-10-09 15:31:51,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:51,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2020-10-09 15:31:51,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:51,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:51,108 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:51,108 INFO L185 Difference]: Start difference. First operand has 547 places, 512 transitions, 1219 flow. Second operand 3 states and 1596 transitions. [2020-10-09 15:31:51,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 509 transitions, 1214 flow [2020-10-09 15:31:51,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 509 transitions, 1207 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:51,113 INFO L241 Difference]: Finished difference. Result has 546 places, 509 transitions, 1199 flow [2020-10-09 15:31:51,114 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1199, PETRI_PLACES=546, PETRI_TRANSITIONS=509} [2020-10-09 15:31:51,114 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 29 predicate places. [2020-10-09 15:31:51,114 INFO L481 AbstractCegarLoop]: Abstraction has has 546 places, 509 transitions, 1199 flow [2020-10-09 15:31:51,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:51,114 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:51,114 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:51,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 532 mathsat -unsat_core_generation=3 [2020-10-09 15:31:51,315 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:51,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:51,315 INFO L82 PathProgramCache]: Analyzing trace with hash -769778994, now seen corresponding path program 1 times [2020-10-09 15:31:51,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:51,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839544667] [2020-10-09 15:31:51,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 533 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 533 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:51,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:51,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:31:51,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:31:51,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839544667] [2020-10-09 15:31:51,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:51,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:51,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507224643] [2020-10-09 15:31:51,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:51,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:51,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:51,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:51,707 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:51,708 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 509 transitions, 1199 flow. Second operand 3 states. [2020-10-09 15:31:51,708 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:51,708 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:51,708 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:51,866 INFO L129 PetriNetUnfolder]: 36/590 cut-off events. [2020-10-09 15:31:51,866 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:51,893 INFO L80 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 590 events. 36/590 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2434 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 700. Up to 21 conditions per place. [2020-10-09 15:31:51,897 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 8 selfloop transitions, 1 changer transitions 0/507 dead transitions. [2020-10-09 15:31:51,897 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 507 transitions, 1212 flow [2020-10-09 15:31:51,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:51,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1582 transitions. [2020-10-09 15:31:51,899 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9467384799521245 [2020-10-09 15:31:51,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1582 transitions. [2020-10-09 15:31:51,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1582 transitions. [2020-10-09 15:31:51,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:51,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1582 transitions. [2020-10-09 15:31:51,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:51,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:51,901 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:51,901 INFO L185 Difference]: Start difference. First operand has 546 places, 509 transitions, 1199 flow. Second operand 3 states and 1582 transitions. [2020-10-09 15:31:51,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 507 transitions, 1212 flow [2020-10-09 15:31:51,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 507 transitions, 1211 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:51,906 INFO L241 Difference]: Finished difference. Result has 545 places, 507 transitions, 1195 flow [2020-10-09 15:31:51,907 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1195, PETRI_PLACES=545, PETRI_TRANSITIONS=507} [2020-10-09 15:31:51,907 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 28 predicate places. [2020-10-09 15:31:51,907 INFO L481 AbstractCegarLoop]: Abstraction has has 545 places, 507 transitions, 1195 flow [2020-10-09 15:31:51,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:51,907 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:51,907 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:52,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 533 mathsat -unsat_core_generation=3 [2020-10-09 15:31:52,108 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:52,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:52,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2295225, now seen corresponding path program 1 times [2020-10-09 15:31:52,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:52,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248978396] [2020-10-09 15:31:52,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 534 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 534 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:52,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:52,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:31:52,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:52,464 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:31:52,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248978396] [2020-10-09 15:31:52,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:52,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:52,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112504156] [2020-10-09 15:31:52,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:52,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:52,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:52,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:52,506 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:52,507 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 507 transitions, 1195 flow. Second operand 3 states. [2020-10-09 15:31:52,507 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:52,507 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:52,507 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:52,726 INFO L129 PetriNetUnfolder]: 35/598 cut-off events. [2020-10-09 15:31:52,727 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:52,743 INFO L80 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 598 events. 35/598 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2500 event pairs, 0 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 712. Up to 21 conditions per place. [2020-10-09 15:31:52,747 INFO L132 encePairwiseOnDemand]: 552/557 looper letters, 10 selfloop transitions, 3 changer transitions 0/509 dead transitions. [2020-10-09 15:31:52,748 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 509 transitions, 1225 flow [2020-10-09 15:31:52,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1587 transitions. [2020-10-09 15:31:52,749 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9497307001795332 [2020-10-09 15:31:52,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1587 transitions. [2020-10-09 15:31:52,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1587 transitions. [2020-10-09 15:31:52,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:52,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1587 transitions. [2020-10-09 15:31:52,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:52,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:52,751 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:52,751 INFO L185 Difference]: Start difference. First operand has 545 places, 507 transitions, 1195 flow. Second operand 3 states and 1587 transitions. [2020-10-09 15:31:52,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 509 transitions, 1225 flow [2020-10-09 15:31:52,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 509 transitions, 1224 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:52,758 INFO L241 Difference]: Finished difference. Result has 548 places, 509 transitions, 1218 flow [2020-10-09 15:31:52,759 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1218, PETRI_PLACES=548, PETRI_TRANSITIONS=509} [2020-10-09 15:31:52,759 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 31 predicate places. [2020-10-09 15:31:52,759 INFO L481 AbstractCegarLoop]: Abstraction has has 548 places, 509 transitions, 1218 flow [2020-10-09 15:31:52,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:52,759 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:52,759 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:52,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 534 mathsat -unsat_core_generation=3 [2020-10-09 15:31:52,960 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:52,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:52,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2294202, now seen corresponding path program 1 times [2020-10-09 15:31:52,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:52,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228910259] [2020-10-09 15:31:52,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 535 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 535 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:53,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:53,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:31:53,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:53,314 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:31:53,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228910259] [2020-10-09 15:31:53,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:53,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:53,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777217024] [2020-10-09 15:31:53,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:53,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:53,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:53,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:53,336 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 557 [2020-10-09 15:31:53,337 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 509 transitions, 1218 flow. Second operand 3 states. [2020-10-09 15:31:53,337 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:53,337 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 557 [2020-10-09 15:31:53,337 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:53,491 INFO L129 PetriNetUnfolder]: 33/599 cut-off events. [2020-10-09 15:31:53,492 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:31:53,518 INFO L80 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 599 events. 33/599 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2521 event pairs, 0 based on Foata normal form. 1/548 useless extension candidates. Maximal degree in co-relation 710. Up to 21 conditions per place. [2020-10-09 15:31:53,522 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 4 selfloop transitions, 1 changer transitions 0/508 dead transitions. [2020-10-09 15:31:53,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 508 transitions, 1224 flow [2020-10-09 15:31:53,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:53,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2020-10-09 15:31:53,524 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9551166965888689 [2020-10-09 15:31:53,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2020-10-09 15:31:53,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2020-10-09 15:31:53,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:53,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2020-10-09 15:31:53,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:53,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:53,526 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:53,526 INFO L185 Difference]: Start difference. First operand has 548 places, 509 transitions, 1218 flow. Second operand 3 states and 1596 transitions. [2020-10-09 15:31:53,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 508 transitions, 1224 flow [2020-10-09 15:31:53,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 508 transitions, 1219 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:53,531 INFO L241 Difference]: Finished difference. Result has 550 places, 508 transitions, 1214 flow [2020-10-09 15:31:53,531 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=508, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1214, PETRI_PLACES=550, PETRI_TRANSITIONS=508} [2020-10-09 15:31:53,531 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 33 predicate places. [2020-10-09 15:31:53,531 INFO L481 AbstractCegarLoop]: Abstraction has has 550 places, 508 transitions, 1214 flow [2020-10-09 15:31:53,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:53,531 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:53,531 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:53,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 535 mathsat -unsat_core_generation=3 [2020-10-09 15:31:53,732 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:53,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:53,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1341913, now seen corresponding path program 1 times [2020-10-09 15:31:53,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:53,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530066645] [2020-10-09 15:31:53,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 536 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 536 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:54,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:54,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:31:54,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:54,085 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:31:54,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530066645] [2020-10-09 15:31:54,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:54,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:54,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792275546] [2020-10-09 15:31:54,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:54,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:54,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:54,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:54,101 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 557 [2020-10-09 15:31:54,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 508 transitions, 1214 flow. Second operand 3 states. [2020-10-09 15:31:54,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:54,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 557 [2020-10-09 15:31:54,102 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:54,258 INFO L129 PetriNetUnfolder]: 33/592 cut-off events. [2020-10-09 15:31:54,258 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:31:54,284 INFO L80 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 592 events. 33/592 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2463 event pairs, 0 based on Foata normal form. 1/541 useless extension candidates. Maximal degree in co-relation 706. Up to 21 conditions per place. [2020-10-09 15:31:54,288 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 5 selfloop transitions, 1 changer transitions 0/506 dead transitions. [2020-10-09 15:31:54,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 506 transitions, 1217 flow [2020-10-09 15:31:54,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2020-10-09 15:31:54,289 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9539198084979055 [2020-10-09 15:31:54,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2020-10-09 15:31:54,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2020-10-09 15:31:54,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:54,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2020-10-09 15:31:54,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:54,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:54,291 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:54,291 INFO L185 Difference]: Start difference. First operand has 550 places, 508 transitions, 1214 flow. Second operand 3 states and 1594 transitions. [2020-10-09 15:31:54,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 506 transitions, 1217 flow [2020-10-09 15:31:54,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 506 transitions, 1210 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:54,296 INFO L241 Difference]: Finished difference. Result has 550 places, 506 transitions, 1203 flow [2020-10-09 15:31:54,296 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1203, PETRI_PLACES=550, PETRI_TRANSITIONS=506} [2020-10-09 15:31:54,296 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 33 predicate places. [2020-10-09 15:31:54,296 INFO L481 AbstractCegarLoop]: Abstraction has has 550 places, 506 transitions, 1203 flow [2020-10-09 15:31:54,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:54,296 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:54,297 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:54,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 536 mathsat -unsat_core_generation=3 [2020-10-09 15:31:54,497 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:54,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:54,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1340890, now seen corresponding path program 1 times [2020-10-09 15:31:54,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:54,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231316566] [2020-10-09 15:31:54,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 537 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 537 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:54,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:54,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:31:54,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:31:54,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231316566] [2020-10-09 15:31:54,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:54,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:54,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856427116] [2020-10-09 15:31:54,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:54,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:54,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:54,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:54,884 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:54,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 506 transitions, 1203 flow. Second operand 3 states. [2020-10-09 15:31:54,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:54,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:54,885 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:55,039 INFO L129 PetriNetUnfolder]: 33/590 cut-off events. [2020-10-09 15:31:55,039 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:31:55,064 INFO L80 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 590 events. 33/590 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2446 event pairs, 0 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 706. Up to 21 conditions per place. [2020-10-09 15:31:55,068 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 8 selfloop transitions, 1 changer transitions 0/504 dead transitions. [2020-10-09 15:31:55,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 504 transitions, 1216 flow [2020-10-09 15:31:55,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:55,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1582 transitions. [2020-10-09 15:31:55,070 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9467384799521245 [2020-10-09 15:31:55,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1582 transitions. [2020-10-09 15:31:55,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1582 transitions. [2020-10-09 15:31:55,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:55,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1582 transitions. [2020-10-09 15:31:55,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:55,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:55,072 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:55,072 INFO L185 Difference]: Start difference. First operand has 550 places, 506 transitions, 1203 flow. Second operand 3 states and 1582 transitions. [2020-10-09 15:31:55,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 504 transitions, 1216 flow [2020-10-09 15:31:55,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 504 transitions, 1215 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:55,077 INFO L241 Difference]: Finished difference. Result has 549 places, 504 transitions, 1199 flow [2020-10-09 15:31:55,077 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1199, PETRI_PLACES=549, PETRI_TRANSITIONS=504} [2020-10-09 15:31:55,077 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 32 predicate places. [2020-10-09 15:31:55,077 INFO L481 AbstractCegarLoop]: Abstraction has has 549 places, 504 transitions, 1199 flow [2020-10-09 15:31:55,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:55,077 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:55,077 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:55,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 537 mathsat -unsat_core_generation=3 [2020-10-09 15:31:55,278 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:55,278 INFO L82 PathProgramCache]: Analyzing trace with hash -851478234, now seen corresponding path program 1 times [2020-10-09 15:31:55,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:55,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940401582] [2020-10-09 15:31:55,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 538 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 538 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:55,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:55,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:31:55,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:55,631 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:31:55,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940401582] [2020-10-09 15:31:55,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:55,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:55,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931484503] [2020-10-09 15:31:55,632 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:55,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:55,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:55,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:55,652 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 557 [2020-10-09 15:31:55,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 504 transitions, 1199 flow. Second operand 3 states. [2020-10-09 15:31:55,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:55,654 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 557 [2020-10-09 15:31:55,654 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:55,876 INFO L129 PetriNetUnfolder]: 32/597 cut-off events. [2020-10-09 15:31:55,876 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:55,890 INFO L80 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 597 events. 32/597 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2510 event pairs, 0 based on Foata normal form. 1/546 useless extension candidates. Maximal degree in co-relation 709. Up to 21 conditions per place. [2020-10-09 15:31:55,894 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 4 selfloop transitions, 1 changer transitions 0/504 dead transitions. [2020-10-09 15:31:55,894 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 504 transitions, 1209 flow [2020-10-09 15:31:55,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:55,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2020-10-09 15:31:55,895 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9551166965888689 [2020-10-09 15:31:55,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2020-10-09 15:31:55,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2020-10-09 15:31:55,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:55,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2020-10-09 15:31:55,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:55,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:55,897 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:55,897 INFO L185 Difference]: Start difference. First operand has 549 places, 504 transitions, 1199 flow. Second operand 3 states and 1596 transitions. [2020-10-09 15:31:55,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 504 transitions, 1209 flow [2020-10-09 15:31:55,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 504 transitions, 1208 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:55,902 INFO L241 Difference]: Finished difference. Result has 551 places, 504 transitions, 1203 flow [2020-10-09 15:31:55,902 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=548, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1203, PETRI_PLACES=551, PETRI_TRANSITIONS=504} [2020-10-09 15:31:55,902 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 34 predicate places. [2020-10-09 15:31:55,902 INFO L481 AbstractCegarLoop]: Abstraction has has 551 places, 504 transitions, 1203 flow [2020-10-09 15:31:55,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:55,902 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:55,902 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:56,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 538 mathsat -unsat_core_generation=3 [2020-10-09 15:31:56,103 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:56,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:56,103 INFO L82 PathProgramCache]: Analyzing trace with hash -851477211, now seen corresponding path program 1 times [2020-10-09 15:31:56,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:56,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116118601] [2020-10-09 15:31:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 539 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 539 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:56,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:56,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:31:56,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:31:56,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116118601] [2020-10-09 15:31:56,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:56,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:56,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734024490] [2020-10-09 15:31:56,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:56,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:56,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:56,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:56,494 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:56,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 504 transitions, 1203 flow. Second operand 3 states. [2020-10-09 15:31:56,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:56,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:56,495 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:56,765 INFO L129 PetriNetUnfolder]: 30/599 cut-off events. [2020-10-09 15:31:56,765 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:31:56,805 INFO L80 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 599 events. 30/599 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2541 event pairs, 0 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 722. Up to 21 conditions per place. [2020-10-09 15:31:56,809 INFO L132 encePairwiseOnDemand]: 553/557 looper letters, 9 selfloop transitions, 3 changer transitions 0/505 dead transitions. [2020-10-09 15:31:56,810 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 505 transitions, 1229 flow [2020-10-09 15:31:56,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1585 transitions. [2020-10-09 15:31:56,811 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9485338120885697 [2020-10-09 15:31:56,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1585 transitions. [2020-10-09 15:31:56,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1585 transitions. [2020-10-09 15:31:56,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:56,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1585 transitions. [2020-10-09 15:31:56,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:56,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:56,813 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:56,813 INFO L185 Difference]: Start difference. First operand has 551 places, 504 transitions, 1203 flow. Second operand 3 states and 1585 transitions. [2020-10-09 15:31:56,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 505 transitions, 1229 flow [2020-10-09 15:31:56,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 505 transitions, 1228 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:56,818 INFO L241 Difference]: Finished difference. Result has 554 places, 505 transitions, 1220 flow [2020-10-09 15:31:56,819 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1220, PETRI_PLACES=554, PETRI_TRANSITIONS=505} [2020-10-09 15:31:56,819 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 37 predicate places. [2020-10-09 15:31:56,819 INFO L481 AbstractCegarLoop]: Abstraction has has 554 places, 505 transitions, 1220 flow [2020-10-09 15:31:56,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:56,819 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:56,819 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:57,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 539 mathsat -unsat_core_generation=3 [2020-10-09 15:31:57,020 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:57,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:57,020 INFO L82 PathProgramCache]: Analyzing trace with hash -852430523, now seen corresponding path program 1 times [2020-10-09 15:31:57,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:57,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705324030] [2020-10-09 15:31:57,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 540 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 540 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:57,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:57,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:57,379 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:31:57,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:31:57,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705324030] [2020-10-09 15:31:57,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:57,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:57,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295663606] [2020-10-09 15:31:57,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:57,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:57,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:57,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:57,400 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 557 [2020-10-09 15:31:57,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 505 transitions, 1220 flow. Second operand 3 states. [2020-10-09 15:31:57,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:57,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 557 [2020-10-09 15:31:57,402 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:57,569 INFO L129 PetriNetUnfolder]: 30/592 cut-off events. [2020-10-09 15:31:57,569 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:31:57,598 INFO L80 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 592 events. 30/592 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2483 event pairs, 0 based on Foata normal form. 1/544 useless extension candidates. Maximal degree in co-relation 708. Up to 21 conditions per place. [2020-10-09 15:31:57,602 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 5 selfloop transitions, 1 changer transitions 0/503 dead transitions. [2020-10-09 15:31:57,602 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 503 transitions, 1222 flow [2020-10-09 15:31:57,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2020-10-09 15:31:57,603 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9539198084979055 [2020-10-09 15:31:57,603 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2020-10-09 15:31:57,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2020-10-09 15:31:57,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:57,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2020-10-09 15:31:57,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:57,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:57,605 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:57,605 INFO L185 Difference]: Start difference. First operand has 554 places, 505 transitions, 1220 flow. Second operand 3 states and 1594 transitions. [2020-10-09 15:31:57,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 503 transitions, 1222 flow [2020-10-09 15:31:57,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 503 transitions, 1214 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:31:57,611 INFO L241 Difference]: Finished difference. Result has 554 places, 503 transitions, 1207 flow [2020-10-09 15:31:57,611 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1207, PETRI_PLACES=554, PETRI_TRANSITIONS=503} [2020-10-09 15:31:57,611 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 37 predicate places. [2020-10-09 15:31:57,611 INFO L481 AbstractCegarLoop]: Abstraction has has 554 places, 503 transitions, 1207 flow [2020-10-09 15:31:57,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:57,611 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:57,612 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:57,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 540 mathsat -unsat_core_generation=3 [2020-10-09 15:31:57,812 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:57,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:57,813 INFO L82 PathProgramCache]: Analyzing trace with hash -852431546, now seen corresponding path program 1 times [2020-10-09 15:31:57,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:57,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406119608] [2020-10-09 15:31:57,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 541 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 541 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:58,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:58,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:31:58,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:58,176 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:31:58,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406119608] [2020-10-09 15:31:58,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:58,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:58,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140487669] [2020-10-09 15:31:58,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:58,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:58,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:58,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:58,206 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:58,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 503 transitions, 1207 flow. Second operand 3 states. [2020-10-09 15:31:58,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:58,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:58,208 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:58,376 INFO L129 PetriNetUnfolder]: 30/590 cut-off events. [2020-10-09 15:31:58,376 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:31:58,404 INFO L80 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 590 events. 30/590 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2465 event pairs, 0 based on Foata normal form. 0/540 useless extension candidates. Maximal degree in co-relation 712. Up to 21 conditions per place. [2020-10-09 15:31:58,408 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 8 selfloop transitions, 1 changer transitions 0/501 dead transitions. [2020-10-09 15:31:58,409 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 501 transitions, 1220 flow [2020-10-09 15:31:58,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1582 transitions. [2020-10-09 15:31:58,410 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9467384799521245 [2020-10-09 15:31:58,410 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1582 transitions. [2020-10-09 15:31:58,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1582 transitions. [2020-10-09 15:31:58,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:58,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1582 transitions. [2020-10-09 15:31:58,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:58,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:58,412 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:58,412 INFO L185 Difference]: Start difference. First operand has 554 places, 503 transitions, 1207 flow. Second operand 3 states and 1582 transitions. [2020-10-09 15:31:58,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 501 transitions, 1220 flow [2020-10-09 15:31:58,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 501 transitions, 1219 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:58,417 INFO L241 Difference]: Finished difference. Result has 553 places, 501 transitions, 1203 flow [2020-10-09 15:31:58,418 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1203, PETRI_PLACES=553, PETRI_TRANSITIONS=501} [2020-10-09 15:31:58,418 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 36 predicate places. [2020-10-09 15:31:58,418 INFO L481 AbstractCegarLoop]: Abstraction has has 553 places, 501 transitions, 1203 flow [2020-10-09 15:31:58,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:58,418 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:58,418 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:58,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 541 mathsat -unsat_core_generation=3 [2020-10-09 15:31:58,619 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:58,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:58,619 INFO L82 PathProgramCache]: Analyzing trace with hash 560622738, now seen corresponding path program 1 times [2020-10-09 15:31:58,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:58,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610624508] [2020-10-09 15:31:58,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 542 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 542 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:58,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:31:58,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:58,978 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:31:58,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:58,980 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:31:58,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610624508] [2020-10-09 15:31:58,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:58,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:58,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959721527] [2020-10-09 15:31:58,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:58,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:58,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:58,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:59,016 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:31:59,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 501 transitions, 1203 flow. Second operand 3 states. [2020-10-09 15:31:59,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:59,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:31:59,017 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:31:59,250 INFO L129 PetriNetUnfolder]: 29/598 cut-off events. [2020-10-09 15:31:59,250 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:31:59,266 INFO L80 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 598 events. 29/598 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2536 event pairs, 0 based on Foata normal form. 0/548 useless extension candidates. Maximal degree in co-relation 724. Up to 21 conditions per place. [2020-10-09 15:31:59,270 INFO L132 encePairwiseOnDemand]: 552/557 looper letters, 10 selfloop transitions, 3 changer transitions 0/503 dead transitions. [2020-10-09 15:31:59,270 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 503 transitions, 1233 flow [2020-10-09 15:31:59,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:31:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:31:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1587 transitions. [2020-10-09 15:31:59,271 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9497307001795332 [2020-10-09 15:31:59,271 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1587 transitions. [2020-10-09 15:31:59,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1587 transitions. [2020-10-09 15:31:59,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:31:59,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1587 transitions. [2020-10-09 15:31:59,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:31:59,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:31:59,273 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:31:59,273 INFO L185 Difference]: Start difference. First operand has 553 places, 501 transitions, 1203 flow. Second operand 3 states and 1587 transitions. [2020-10-09 15:31:59,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 503 transitions, 1233 flow [2020-10-09 15:31:59,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 503 transitions, 1232 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:31:59,278 INFO L241 Difference]: Finished difference. Result has 556 places, 503 transitions, 1226 flow [2020-10-09 15:31:59,278 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1226, PETRI_PLACES=556, PETRI_TRANSITIONS=503} [2020-10-09 15:31:59,278 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 39 predicate places. [2020-10-09 15:31:59,278 INFO L481 AbstractCegarLoop]: Abstraction has has 556 places, 503 transitions, 1226 flow [2020-10-09 15:31:59,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:31:59,278 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:31:59,278 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:31:59,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 542 mathsat -unsat_core_generation=3 [2020-10-09 15:31:59,479 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:31:59,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:31:59,479 INFO L82 PathProgramCache]: Analyzing trace with hash 560621715, now seen corresponding path program 1 times [2020-10-09 15:31:59,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:31:59,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875830894] [2020-10-09 15:31:59,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 543 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 543 with mathsat -unsat_core_generation=3 [2020-10-09 15:31:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:31:59,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:31:59,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:31:59,835 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:31:59,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:31:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:31:59,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875830894] [2020-10-09 15:31:59,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:31:59,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:31:59,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839192969] [2020-10-09 15:31:59,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:31:59,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:31:59,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:31:59,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:31:59,853 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 557 [2020-10-09 15:31:59,853 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 503 transitions, 1226 flow. Second operand 3 states. [2020-10-09 15:31:59,854 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:31:59,854 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 557 [2020-10-09 15:31:59,854 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:00,017 INFO L129 PetriNetUnfolder]: 27/599 cut-off events. [2020-10-09 15:32:00,018 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:32:00,045 INFO L80 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 599 events. 27/599 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2556 event pairs, 0 based on Foata normal form. 1/554 useless extension candidates. Maximal degree in co-relation 722. Up to 21 conditions per place. [2020-10-09 15:32:00,048 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 4 selfloop transitions, 1 changer transitions 0/502 dead transitions. [2020-10-09 15:32:00,048 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 502 transitions, 1232 flow [2020-10-09 15:32:00,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2020-10-09 15:32:00,049 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9551166965888689 [2020-10-09 15:32:00,049 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2020-10-09 15:32:00,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2020-10-09 15:32:00,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:00,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2020-10-09 15:32:00,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:00,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:00,051 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:00,051 INFO L185 Difference]: Start difference. First operand has 556 places, 503 transitions, 1226 flow. Second operand 3 states and 1596 transitions. [2020-10-09 15:32:00,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 502 transitions, 1232 flow [2020-10-09 15:32:00,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 502 transitions, 1227 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:00,056 INFO L241 Difference]: Finished difference. Result has 558 places, 502 transitions, 1222 flow [2020-10-09 15:32:00,057 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1222, PETRI_PLACES=558, PETRI_TRANSITIONS=502} [2020-10-09 15:32:00,057 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 41 predicate places. [2020-10-09 15:32:00,057 INFO L481 AbstractCegarLoop]: Abstraction has has 558 places, 502 transitions, 1222 flow [2020-10-09 15:32:00,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:00,057 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:00,057 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:00,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 543 mathsat -unsat_core_generation=3 [2020-10-09 15:32:00,258 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:00,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:00,258 INFO L82 PathProgramCache]: Analyzing trace with hash 559669426, now seen corresponding path program 1 times [2020-10-09 15:32:00,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:00,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060618567] [2020-10-09 15:32:00,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 544 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 544 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:00,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:00,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:32:00,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:32:00,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060618567] [2020-10-09 15:32:00,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:00,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:00,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186611134] [2020-10-09 15:32:00,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:00,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:00,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:00,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:00,628 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 557 [2020-10-09 15:32:00,628 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 502 transitions, 1222 flow. Second operand 3 states. [2020-10-09 15:32:00,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:00,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 557 [2020-10-09 15:32:00,629 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:00,795 INFO L129 PetriNetUnfolder]: 27/592 cut-off events. [2020-10-09 15:32:00,796 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:32:00,822 INFO L80 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 592 events. 27/592 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2499 event pairs, 0 based on Foata normal form. 1/547 useless extension candidates. Maximal degree in co-relation 718. Up to 21 conditions per place. [2020-10-09 15:32:00,825 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 5 selfloop transitions, 1 changer transitions 0/500 dead transitions. [2020-10-09 15:32:00,825 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 500 transitions, 1225 flow [2020-10-09 15:32:00,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:00,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2020-10-09 15:32:00,826 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9539198084979055 [2020-10-09 15:32:00,827 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2020-10-09 15:32:00,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2020-10-09 15:32:00,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:00,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2020-10-09 15:32:00,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:00,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:00,828 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:00,828 INFO L185 Difference]: Start difference. First operand has 558 places, 502 transitions, 1222 flow. Second operand 3 states and 1594 transitions. [2020-10-09 15:32:00,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 500 transitions, 1225 flow [2020-10-09 15:32:00,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 500 transitions, 1218 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:32:00,834 INFO L241 Difference]: Finished difference. Result has 558 places, 500 transitions, 1211 flow [2020-10-09 15:32:00,834 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1211, PETRI_PLACES=558, PETRI_TRANSITIONS=500} [2020-10-09 15:32:00,834 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 41 predicate places. [2020-10-09 15:32:00,834 INFO L481 AbstractCegarLoop]: Abstraction has has 558 places, 500 transitions, 1211 flow [2020-10-09 15:32:00,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:00,834 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:00,834 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:01,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 544 mathsat -unsat_core_generation=3 [2020-10-09 15:32:01,035 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:01,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:01,035 INFO L82 PathProgramCache]: Analyzing trace with hash 559668403, now seen corresponding path program 1 times [2020-10-09 15:32:01,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:01,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66982803] [2020-10-09 15:32:01,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 545 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 545 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:01,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:01,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:32:01,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:32:01,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66982803] [2020-10-09 15:32:01,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:01,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:01,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309053958] [2020-10-09 15:32:01,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:01,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:01,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:01,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:01,436 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:32:01,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 500 transitions, 1211 flow. Second operand 3 states. [2020-10-09 15:32:01,437 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:01,437 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:32:01,437 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:01,598 INFO L129 PetriNetUnfolder]: 27/590 cut-off events. [2020-10-09 15:32:01,599 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:32:01,624 INFO L80 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 590 events. 27/590 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2483 event pairs, 0 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 718. Up to 21 conditions per place. [2020-10-09 15:32:01,628 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 8 selfloop transitions, 1 changer transitions 0/498 dead transitions. [2020-10-09 15:32:01,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 498 transitions, 1224 flow [2020-10-09 15:32:01,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:01,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1582 transitions. [2020-10-09 15:32:01,629 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9467384799521245 [2020-10-09 15:32:01,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1582 transitions. [2020-10-09 15:32:01,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1582 transitions. [2020-10-09 15:32:01,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:01,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1582 transitions. [2020-10-09 15:32:01,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:01,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:01,631 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:01,631 INFO L185 Difference]: Start difference. First operand has 558 places, 500 transitions, 1211 flow. Second operand 3 states and 1582 transitions. [2020-10-09 15:32:01,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 498 transitions, 1224 flow [2020-10-09 15:32:01,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 498 transitions, 1223 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:01,636 INFO L241 Difference]: Finished difference. Result has 557 places, 498 transitions, 1207 flow [2020-10-09 15:32:01,636 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1207, PETRI_PLACES=557, PETRI_TRANSITIONS=498} [2020-10-09 15:32:01,636 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 40 predicate places. [2020-10-09 15:32:01,636 INFO L481 AbstractCegarLoop]: Abstraction has has 557 places, 498 transitions, 1207 flow [2020-10-09 15:32:01,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:01,637 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:01,637 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:01,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 545 mathsat -unsat_core_generation=3 [2020-10-09 15:32:01,837 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:01,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:01,838 INFO L82 PathProgramCache]: Analyzing trace with hash 967005056, now seen corresponding path program 1 times [2020-10-09 15:32:01,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:01,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483807159] [2020-10-09 15:32:01,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 546 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 546 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:02,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:02,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:32:02,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:02,198 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:32:02,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483807159] [2020-10-09 15:32:02,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:02,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:02,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485981488] [2020-10-09 15:32:02,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:02,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:02,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:02,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:02,219 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:32:02,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 498 transitions, 1207 flow. Second operand 3 states. [2020-10-09 15:32:02,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:02,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:32:02,220 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:02,398 INFO L129 PetriNetUnfolder]: 26/598 cut-off events. [2020-10-09 15:32:02,398 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:32:02,426 INFO L80 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 598 events. 26/598 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2553 event pairs, 0 based on Foata normal form. 0/551 useless extension candidates. Maximal degree in co-relation 730. Up to 21 conditions per place. [2020-10-09 15:32:02,430 INFO L132 encePairwiseOnDemand]: 552/557 looper letters, 10 selfloop transitions, 3 changer transitions 0/500 dead transitions. [2020-10-09 15:32:02,430 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 500 transitions, 1237 flow [2020-10-09 15:32:02,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1587 transitions. [2020-10-09 15:32:02,431 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9497307001795332 [2020-10-09 15:32:02,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1587 transitions. [2020-10-09 15:32:02,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1587 transitions. [2020-10-09 15:32:02,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:02,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1587 transitions. [2020-10-09 15:32:02,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:02,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:02,433 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:02,433 INFO L185 Difference]: Start difference. First operand has 557 places, 498 transitions, 1207 flow. Second operand 3 states and 1587 transitions. [2020-10-09 15:32:02,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 500 transitions, 1237 flow [2020-10-09 15:32:02,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 500 transitions, 1236 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:02,439 INFO L241 Difference]: Finished difference. Result has 560 places, 500 transitions, 1230 flow [2020-10-09 15:32:02,439 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1230, PETRI_PLACES=560, PETRI_TRANSITIONS=500} [2020-10-09 15:32:02,439 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 43 predicate places. [2020-10-09 15:32:02,439 INFO L481 AbstractCegarLoop]: Abstraction has has 560 places, 500 transitions, 1230 flow [2020-10-09 15:32:02,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:02,439 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:02,480 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:02,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 546 mathsat -unsat_core_generation=3 [2020-10-09 15:32:02,681 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:02,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:02,681 INFO L82 PathProgramCache]: Analyzing trace with hash 967004033, now seen corresponding path program 1 times [2020-10-09 15:32:02,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:02,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889545362] [2020-10-09 15:32:02,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 547 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 547 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:03,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:32:03,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:32:03,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:32:03,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889545362] [2020-10-09 15:32:03,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:03,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:03,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294716587] [2020-10-09 15:32:03,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:03,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:03,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:03,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:03,073 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 557 [2020-10-09 15:32:03,074 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 500 transitions, 1230 flow. Second operand 3 states. [2020-10-09 15:32:03,074 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:03,074 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 557 [2020-10-09 15:32:03,075 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:03,243 INFO L129 PetriNetUnfolder]: 24/599 cut-off events. [2020-10-09 15:32:03,243 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:32:03,271 INFO L80 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 599 events. 24/599 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2575 event pairs, 0 based on Foata normal form. 1/557 useless extension candidates. Maximal degree in co-relation 728. Up to 21 conditions per place. [2020-10-09 15:32:03,274 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 4 selfloop transitions, 1 changer transitions 0/499 dead transitions. [2020-10-09 15:32:03,275 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 499 transitions, 1236 flow [2020-10-09 15:32:03,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2020-10-09 15:32:03,276 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9551166965888689 [2020-10-09 15:32:03,276 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2020-10-09 15:32:03,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2020-10-09 15:32:03,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:03,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2020-10-09 15:32:03,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:03,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:03,278 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:03,278 INFO L185 Difference]: Start difference. First operand has 560 places, 500 transitions, 1230 flow. Second operand 3 states and 1596 transitions. [2020-10-09 15:32:03,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 499 transitions, 1236 flow [2020-10-09 15:32:03,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 499 transitions, 1231 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:03,283 INFO L241 Difference]: Finished difference. Result has 562 places, 499 transitions, 1226 flow [2020-10-09 15:32:03,284 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1226, PETRI_PLACES=562, PETRI_TRANSITIONS=499} [2020-10-09 15:32:03,284 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 45 predicate places. [2020-10-09 15:32:03,284 INFO L481 AbstractCegarLoop]: Abstraction has has 562 places, 499 transitions, 1226 flow [2020-10-09 15:32:03,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:03,284 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:03,284 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:03,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 547 mathsat -unsat_core_generation=3 [2020-10-09 15:32:03,485 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:03,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:03,485 INFO L82 PathProgramCache]: Analyzing trace with hash 966051744, now seen corresponding path program 1 times [2020-10-09 15:32:03,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:03,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744584059] [2020-10-09 15:32:03,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 548 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 548 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:03,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:03,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:32:03,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:32:03,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744584059] [2020-10-09 15:32:03,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:03,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:03,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854902267] [2020-10-09 15:32:03,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:03,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:03,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:03,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:03,868 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 557 [2020-10-09 15:32:03,869 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 499 transitions, 1226 flow. Second operand 3 states. [2020-10-09 15:32:03,869 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:03,869 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 557 [2020-10-09 15:32:03,869 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:04,045 INFO L129 PetriNetUnfolder]: 24/592 cut-off events. [2020-10-09 15:32:04,045 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:32:04,075 INFO L80 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 592 events. 24/592 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2520 event pairs, 0 based on Foata normal form. 1/550 useless extension candidates. Maximal degree in co-relation 724. Up to 21 conditions per place. [2020-10-09 15:32:04,078 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 5 selfloop transitions, 1 changer transitions 0/497 dead transitions. [2020-10-09 15:32:04,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 497 transitions, 1229 flow [2020-10-09 15:32:04,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2020-10-09 15:32:04,080 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9539198084979055 [2020-10-09 15:32:04,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2020-10-09 15:32:04,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2020-10-09 15:32:04,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:04,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2020-10-09 15:32:04,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:04,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:04,081 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:04,081 INFO L185 Difference]: Start difference. First operand has 562 places, 499 transitions, 1226 flow. Second operand 3 states and 1594 transitions. [2020-10-09 15:32:04,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 497 transitions, 1229 flow [2020-10-09 15:32:04,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 497 transitions, 1222 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:32:04,087 INFO L241 Difference]: Finished difference. Result has 562 places, 497 transitions, 1215 flow [2020-10-09 15:32:04,087 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1215, PETRI_PLACES=562, PETRI_TRANSITIONS=497} [2020-10-09 15:32:04,087 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 45 predicate places. [2020-10-09 15:32:04,087 INFO L481 AbstractCegarLoop]: Abstraction has has 562 places, 497 transitions, 1215 flow [2020-10-09 15:32:04,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:04,088 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:04,088 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:04,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 548 mathsat -unsat_core_generation=3 [2020-10-09 15:32:04,288 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:04,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:04,289 INFO L82 PathProgramCache]: Analyzing trace with hash 966050721, now seen corresponding path program 1 times [2020-10-09 15:32:04,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:04,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122935903] [2020-10-09 15:32:04,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 549 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 549 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:04,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:04,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:04,649 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:32:04,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:04,652 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:32:04,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122935903] [2020-10-09 15:32:04,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:04,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:04,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837748675] [2020-10-09 15:32:04,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:04,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:04,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:04,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:04,688 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:32:04,689 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 497 transitions, 1215 flow. Second operand 3 states. [2020-10-09 15:32:04,689 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:04,689 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:32:04,689 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:04,856 INFO L129 PetriNetUnfolder]: 24/590 cut-off events. [2020-10-09 15:32:04,856 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:32:04,883 INFO L80 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 590 events. 24/590 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2505 event pairs, 0 based on Foata normal form. 0/546 useless extension candidates. Maximal degree in co-relation 724. Up to 21 conditions per place. [2020-10-09 15:32:04,885 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 8 selfloop transitions, 1 changer transitions 0/495 dead transitions. [2020-10-09 15:32:04,886 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 495 transitions, 1228 flow [2020-10-09 15:32:04,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1582 transitions. [2020-10-09 15:32:04,887 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9467384799521245 [2020-10-09 15:32:04,887 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1582 transitions. [2020-10-09 15:32:04,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1582 transitions. [2020-10-09 15:32:04,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:04,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1582 transitions. [2020-10-09 15:32:04,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:04,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:04,889 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:04,889 INFO L185 Difference]: Start difference. First operand has 562 places, 497 transitions, 1215 flow. Second operand 3 states and 1582 transitions. [2020-10-09 15:32:04,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 495 transitions, 1228 flow [2020-10-09 15:32:04,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 495 transitions, 1227 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:04,894 INFO L241 Difference]: Finished difference. Result has 561 places, 495 transitions, 1211 flow [2020-10-09 15:32:04,894 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1211, PETRI_PLACES=561, PETRI_TRANSITIONS=495} [2020-10-09 15:32:04,894 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 44 predicate places. [2020-10-09 15:32:04,894 INFO L481 AbstractCegarLoop]: Abstraction has has 561 places, 495 transitions, 1211 flow [2020-10-09 15:32:04,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:04,894 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:04,894 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:05,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 549 mathsat -unsat_core_generation=3 [2020-10-09 15:32:05,095 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:05,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:05,096 INFO L82 PathProgramCache]: Analyzing trace with hash 875001199, now seen corresponding path program 1 times [2020-10-09 15:32:05,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:05,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742149591] [2020-10-09 15:32:05,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 550 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 550 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:05,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:05,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:05,454 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:32:05,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:32:05,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742149591] [2020-10-09 15:32:05,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:05,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:05,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127994558] [2020-10-09 15:32:05,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:05,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:05,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:05,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:05,494 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:32:05,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 495 transitions, 1211 flow. Second operand 3 states. [2020-10-09 15:32:05,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:05,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:32:05,495 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:05,665 INFO L129 PetriNetUnfolder]: 23/598 cut-off events. [2020-10-09 15:32:05,665 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:32:05,693 INFO L80 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 598 events. 23/598 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2574 event pairs, 0 based on Foata normal form. 0/554 useless extension candidates. Maximal degree in co-relation 736. Up to 21 conditions per place. [2020-10-09 15:32:05,696 INFO L132 encePairwiseOnDemand]: 552/557 looper letters, 10 selfloop transitions, 3 changer transitions 0/497 dead transitions. [2020-10-09 15:32:05,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 497 transitions, 1241 flow [2020-10-09 15:32:05,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1587 transitions. [2020-10-09 15:32:05,697 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9497307001795332 [2020-10-09 15:32:05,697 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1587 transitions. [2020-10-09 15:32:05,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1587 transitions. [2020-10-09 15:32:05,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:05,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1587 transitions. [2020-10-09 15:32:05,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:05,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:05,699 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:05,699 INFO L185 Difference]: Start difference. First operand has 561 places, 495 transitions, 1211 flow. Second operand 3 states and 1587 transitions. [2020-10-09 15:32:05,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 497 transitions, 1241 flow [2020-10-09 15:32:05,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 497 transitions, 1240 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:05,704 INFO L241 Difference]: Finished difference. Result has 564 places, 497 transitions, 1234 flow [2020-10-09 15:32:05,704 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1234, PETRI_PLACES=564, PETRI_TRANSITIONS=497} [2020-10-09 15:32:05,704 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 47 predicate places. [2020-10-09 15:32:05,704 INFO L481 AbstractCegarLoop]: Abstraction has has 564 places, 497 transitions, 1234 flow [2020-10-09 15:32:05,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:05,704 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:05,705 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:05,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 550 mathsat -unsat_core_generation=3 [2020-10-09 15:32:05,905 INFO L429 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:05,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:05,906 INFO L82 PathProgramCache]: Analyzing trace with hash 875000176, now seen corresponding path program 1 times [2020-10-09 15:32:05,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:05,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39800797] [2020-10-09 15:32:05,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 551 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 551 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:06,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:32:06,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:32:06,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:32:06,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39800797] [2020-10-09 15:32:06,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:06,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:06,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158105858] [2020-10-09 15:32:06,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:06,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:06,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:06,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:06,332 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 557 [2020-10-09 15:32:06,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 497 transitions, 1234 flow. Second operand 3 states. [2020-10-09 15:32:06,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:06,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 557 [2020-10-09 15:32:06,333 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:06,501 INFO L129 PetriNetUnfolder]: 21/599 cut-off events. [2020-10-09 15:32:06,502 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:32:06,529 INFO L80 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 599 events. 21/599 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2595 event pairs, 0 based on Foata normal form. 1/560 useless extension candidates. Maximal degree in co-relation 734. Up to 21 conditions per place. [2020-10-09 15:32:06,532 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 4 selfloop transitions, 1 changer transitions 0/496 dead transitions. [2020-10-09 15:32:06,532 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 496 transitions, 1240 flow [2020-10-09 15:32:06,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2020-10-09 15:32:06,533 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9551166965888689 [2020-10-09 15:32:06,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2020-10-09 15:32:06,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2020-10-09 15:32:06,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:06,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2020-10-09 15:32:06,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:06,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:06,535 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:06,535 INFO L185 Difference]: Start difference. First operand has 564 places, 497 transitions, 1234 flow. Second operand 3 states and 1596 transitions. [2020-10-09 15:32:06,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 496 transitions, 1240 flow [2020-10-09 15:32:06,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 496 transitions, 1235 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:06,540 INFO L241 Difference]: Finished difference. Result has 566 places, 496 transitions, 1230 flow [2020-10-09 15:32:06,540 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1230, PETRI_PLACES=566, PETRI_TRANSITIONS=496} [2020-10-09 15:32:06,541 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 49 predicate places. [2020-10-09 15:32:06,541 INFO L481 AbstractCegarLoop]: Abstraction has has 566 places, 496 transitions, 1230 flow [2020-10-09 15:32:06,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:06,541 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:06,541 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:06,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 551 mathsat -unsat_core_generation=3 [2020-10-09 15:32:06,743 INFO L429 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:06,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:06,744 INFO L82 PathProgramCache]: Analyzing trace with hash 874047887, now seen corresponding path program 1 times [2020-10-09 15:32:06,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:06,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129612033] [2020-10-09 15:32:06,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 552 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 552 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:07,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:07,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:32:07,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:32:07,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129612033] [2020-10-09 15:32:07,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:07,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:07,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356365271] [2020-10-09 15:32:07,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:07,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:07,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:07,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:07,123 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 557 [2020-10-09 15:32:07,123 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 496 transitions, 1230 flow. Second operand 3 states. [2020-10-09 15:32:07,124 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:07,124 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 557 [2020-10-09 15:32:07,124 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:07,290 INFO L129 PetriNetUnfolder]: 21/592 cut-off events. [2020-10-09 15:32:07,290 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:32:07,317 INFO L80 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 592 events. 21/592 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2535 event pairs, 0 based on Foata normal form. 1/553 useless extension candidates. Maximal degree in co-relation 730. Up to 21 conditions per place. [2020-10-09 15:32:07,320 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 5 selfloop transitions, 1 changer transitions 0/494 dead transitions. [2020-10-09 15:32:07,320 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 494 transitions, 1233 flow [2020-10-09 15:32:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2020-10-09 15:32:07,322 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9539198084979055 [2020-10-09 15:32:07,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2020-10-09 15:32:07,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2020-10-09 15:32:07,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:07,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2020-10-09 15:32:07,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:07,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:07,323 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:07,323 INFO L185 Difference]: Start difference. First operand has 566 places, 496 transitions, 1230 flow. Second operand 3 states and 1594 transitions. [2020-10-09 15:32:07,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 494 transitions, 1233 flow [2020-10-09 15:32:07,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 494 transitions, 1226 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:32:07,329 INFO L241 Difference]: Finished difference. Result has 566 places, 494 transitions, 1219 flow [2020-10-09 15:32:07,329 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1219, PETRI_PLACES=566, PETRI_TRANSITIONS=494} [2020-10-09 15:32:07,329 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 49 predicate places. [2020-10-09 15:32:07,329 INFO L481 AbstractCegarLoop]: Abstraction has has 566 places, 494 transitions, 1219 flow [2020-10-09 15:32:07,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:07,329 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:07,329 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:07,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 552 mathsat -unsat_core_generation=3 [2020-10-09 15:32:07,530 INFO L429 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:07,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:07,530 INFO L82 PathProgramCache]: Analyzing trace with hash 874046864, now seen corresponding path program 1 times [2020-10-09 15:32:07,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:07,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733554273] [2020-10-09 15:32:07,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 553 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 553 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:07,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:07,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:07,888 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:32:07,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:32:07,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733554273] [2020-10-09 15:32:07,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:07,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:07,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930424394] [2020-10-09 15:32:07,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:07,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:07,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:07,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:07,926 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:32:07,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 494 transitions, 1219 flow. Second operand 3 states. [2020-10-09 15:32:07,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:07,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:32:07,928 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:08,092 INFO L129 PetriNetUnfolder]: 21/590 cut-off events. [2020-10-09 15:32:08,092 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:32:08,118 INFO L80 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 590 events. 21/590 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2518 event pairs, 0 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 730. Up to 21 conditions per place. [2020-10-09 15:32:08,120 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 8 selfloop transitions, 1 changer transitions 0/492 dead transitions. [2020-10-09 15:32:08,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 492 transitions, 1232 flow [2020-10-09 15:32:08,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:08,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1582 transitions. [2020-10-09 15:32:08,122 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9467384799521245 [2020-10-09 15:32:08,122 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1582 transitions. [2020-10-09 15:32:08,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1582 transitions. [2020-10-09 15:32:08,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:08,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1582 transitions. [2020-10-09 15:32:08,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:08,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:08,124 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:08,124 INFO L185 Difference]: Start difference. First operand has 566 places, 494 transitions, 1219 flow. Second operand 3 states and 1582 transitions. [2020-10-09 15:32:08,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 492 transitions, 1232 flow [2020-10-09 15:32:08,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 492 transitions, 1231 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:08,129 INFO L241 Difference]: Finished difference. Result has 565 places, 492 transitions, 1215 flow [2020-10-09 15:32:08,129 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1213, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1215, PETRI_PLACES=565, PETRI_TRANSITIONS=492} [2020-10-09 15:32:08,129 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 48 predicate places. [2020-10-09 15:32:08,130 INFO L481 AbstractCegarLoop]: Abstraction has has 565 places, 492 transitions, 1215 flow [2020-10-09 15:32:08,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:08,130 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:08,130 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:08,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 553 mathsat -unsat_core_generation=3 [2020-10-09 15:32:08,330 INFO L429 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:08,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:08,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1597857280, now seen corresponding path program 1 times [2020-10-09 15:32:08,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:08,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971072852] [2020-10-09 15:32:08,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 554 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 554 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:08,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:08,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:32:08,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:32:08,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971072852] [2020-10-09 15:32:08,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:08,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:08,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057599413] [2020-10-09 15:32:08,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:08,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:08,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:08,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:08,721 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:32:08,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 492 transitions, 1215 flow. Second operand 3 states. [2020-10-09 15:32:08,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:08,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:32:08,722 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:08,896 INFO L129 PetriNetUnfolder]: 20/598 cut-off events. [2020-10-09 15:32:08,896 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:32:08,923 INFO L80 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 598 events. 20/598 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2590 event pairs, 0 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 742. Up to 21 conditions per place. [2020-10-09 15:32:08,926 INFO L132 encePairwiseOnDemand]: 552/557 looper letters, 10 selfloop transitions, 3 changer transitions 0/494 dead transitions. [2020-10-09 15:32:08,926 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 494 transitions, 1245 flow [2020-10-09 15:32:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1587 transitions. [2020-10-09 15:32:08,927 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9497307001795332 [2020-10-09 15:32:08,927 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1587 transitions. [2020-10-09 15:32:08,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1587 transitions. [2020-10-09 15:32:08,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:08,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1587 transitions. [2020-10-09 15:32:08,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:08,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:08,929 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:08,930 INFO L185 Difference]: Start difference. First operand has 565 places, 492 transitions, 1215 flow. Second operand 3 states and 1587 transitions. [2020-10-09 15:32:08,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 494 transitions, 1245 flow [2020-10-09 15:32:08,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 494 transitions, 1244 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:08,935 INFO L241 Difference]: Finished difference. Result has 568 places, 494 transitions, 1238 flow [2020-10-09 15:32:08,935 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1238, PETRI_PLACES=568, PETRI_TRANSITIONS=494} [2020-10-09 15:32:08,935 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 51 predicate places. [2020-10-09 15:32:08,935 INFO L481 AbstractCegarLoop]: Abstraction has has 568 places, 494 transitions, 1238 flow [2020-10-09 15:32:08,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:08,936 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:08,936 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:09,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 554 mathsat -unsat_core_generation=3 [2020-10-09 15:32:09,136 INFO L429 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:09,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:09,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1597856257, now seen corresponding path program 1 times [2020-10-09 15:32:09,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:09,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902537101] [2020-10-09 15:32:09,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 555 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 555 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:09,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:09,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:09,549 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:32:09,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:32:09,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902537101] [2020-10-09 15:32:09,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:09,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:09,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079323732] [2020-10-09 15:32:09,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:09,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:09,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:09,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:09,571 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 557 [2020-10-09 15:32:09,572 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 494 transitions, 1238 flow. Second operand 3 states. [2020-10-09 15:32:09,572 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:09,572 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 557 [2020-10-09 15:32:09,572 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:09,743 INFO L129 PetriNetUnfolder]: 19/596 cut-off events. [2020-10-09 15:32:09,743 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:32:09,771 INFO L80 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 596 events. 19/596 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2579 event pairs, 0 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 739. Up to 21 conditions per place. [2020-10-09 15:32:09,773 INFO L132 encePairwiseOnDemand]: 554/557 looper letters, 5 selfloop transitions, 2 changer transitions 0/494 dead transitions. [2020-10-09 15:32:09,773 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 494 transitions, 1250 flow [2020-10-09 15:32:09,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1595 transitions. [2020-10-09 15:32:09,775 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9545182525433872 [2020-10-09 15:32:09,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1595 transitions. [2020-10-09 15:32:09,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1595 transitions. [2020-10-09 15:32:09,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:09,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1595 transitions. [2020-10-09 15:32:09,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:09,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:09,777 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:09,777 INFO L185 Difference]: Start difference. First operand has 568 places, 494 transitions, 1238 flow. Second operand 3 states and 1595 transitions. [2020-10-09 15:32:09,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 494 transitions, 1250 flow [2020-10-09 15:32:09,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 494 transitions, 1245 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:09,782 INFO L241 Difference]: Finished difference. Result has 571 places, 494 transitions, 1243 flow [2020-10-09 15:32:09,782 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1243, PETRI_PLACES=571, PETRI_TRANSITIONS=494} [2020-10-09 15:32:09,782 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 54 predicate places. [2020-10-09 15:32:09,782 INFO L481 AbstractCegarLoop]: Abstraction has has 571 places, 494 transitions, 1243 flow [2020-10-09 15:32:09,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:09,782 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:09,783 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:09,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 555 mathsat -unsat_core_generation=3 [2020-10-09 15:32:09,983 INFO L429 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:09,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:09,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1596903968, now seen corresponding path program 1 times [2020-10-09 15:32:09,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:09,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288192242] [2020-10-09 15:32:09,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 556 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 556 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:10,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:32:10,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:32:10,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:32:10,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288192242] [2020-10-09 15:32:10,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:10,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:10,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41525491] [2020-10-09 15:32:10,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:10,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:10,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:10,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:10,372 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 557 [2020-10-09 15:32:10,373 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 494 transitions, 1243 flow. Second operand 3 states. [2020-10-09 15:32:10,373 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:10,373 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 557 [2020-10-09 15:32:10,374 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:10,536 INFO L129 PetriNetUnfolder]: 18/592 cut-off events. [2020-10-09 15:32:10,536 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:32:10,562 INFO L80 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 592 events. 18/592 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2553 event pairs, 0 based on Foata normal form. 1/556 useless extension candidates. Maximal degree in co-relation 735. Up to 21 conditions per place. [2020-10-09 15:32:10,565 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 4 selfloop transitions, 1 changer transitions 0/491 dead transitions. [2020-10-09 15:32:10,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 491 transitions, 1238 flow [2020-10-09 15:32:10,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2020-10-09 15:32:10,566 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9551166965888689 [2020-10-09 15:32:10,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2020-10-09 15:32:10,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2020-10-09 15:32:10,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:10,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2020-10-09 15:32:10,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:10,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:10,568 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:10,568 INFO L185 Difference]: Start difference. First operand has 571 places, 494 transitions, 1243 flow. Second operand 3 states and 1596 transitions. [2020-10-09 15:32:10,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 491 transitions, 1238 flow [2020-10-09 15:32:10,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 491 transitions, 1231 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:32:10,573 INFO L241 Difference]: Finished difference. Result has 570 places, 491 transitions, 1223 flow [2020-10-09 15:32:10,573 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1223, PETRI_PLACES=570, PETRI_TRANSITIONS=491} [2020-10-09 15:32:10,573 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 53 predicate places. [2020-10-09 15:32:10,574 INFO L481 AbstractCegarLoop]: Abstraction has has 570 places, 491 transitions, 1223 flow [2020-10-09 15:32:10,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:10,574 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:10,574 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:10,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 556 mathsat -unsat_core_generation=3 [2020-10-09 15:32:10,774 INFO L429 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:10,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:10,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1596902945, now seen corresponding path program 1 times [2020-10-09 15:32:10,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:10,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35127144] [2020-10-09 15:32:10,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 557 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 557 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:11,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:11,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:11,136 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:32:11,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:32:11,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35127144] [2020-10-09 15:32:11,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:11,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:11,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967227778] [2020-10-09 15:32:11,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:11,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:11,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:11,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:11,167 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:32:11,167 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 491 transitions, 1223 flow. Second operand 3 states. [2020-10-09 15:32:11,168 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:11,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:32:11,168 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:11,335 INFO L129 PetriNetUnfolder]: 18/590 cut-off events. [2020-10-09 15:32:11,335 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:32:11,361 INFO L80 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 590 events. 18/590 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2535 event pairs, 0 based on Foata normal form. 0/552 useless extension candidates. Maximal degree in co-relation 737. Up to 21 conditions per place. [2020-10-09 15:32:11,363 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 8 selfloop transitions, 1 changer transitions 0/489 dead transitions. [2020-10-09 15:32:11,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 489 transitions, 1236 flow [2020-10-09 15:32:11,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:11,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1582 transitions. [2020-10-09 15:32:11,365 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9467384799521245 [2020-10-09 15:32:11,365 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1582 transitions. [2020-10-09 15:32:11,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1582 transitions. [2020-10-09 15:32:11,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:11,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1582 transitions. [2020-10-09 15:32:11,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:11,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:11,366 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:11,367 INFO L185 Difference]: Start difference. First operand has 570 places, 491 transitions, 1223 flow. Second operand 3 states and 1582 transitions. [2020-10-09 15:32:11,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 489 transitions, 1236 flow [2020-10-09 15:32:11,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 489 transitions, 1235 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:11,372 INFO L241 Difference]: Finished difference. Result has 569 places, 489 transitions, 1219 flow [2020-10-09 15:32:11,372 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1219, PETRI_PLACES=569, PETRI_TRANSITIONS=489} [2020-10-09 15:32:11,372 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 52 predicate places. [2020-10-09 15:32:11,372 INFO L481 AbstractCegarLoop]: Abstraction has has 569 places, 489 transitions, 1219 flow [2020-10-09 15:32:11,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:11,372 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:11,372 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:11,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 557 mathsat -unsat_core_generation=3 [2020-10-09 15:32:11,573 INFO L429 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:11,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:11,574 INFO L82 PathProgramCache]: Analyzing trace with hash -512448911, now seen corresponding path program 1 times [2020-10-09 15:32:11,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:11,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113940108] [2020-10-09 15:32:11,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 558 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 558 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:11,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:11,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:32:11,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:32:11,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113940108] [2020-10-09 15:32:11,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:11,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:11,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790477349] [2020-10-09 15:32:11,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:11,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:11,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:11,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:11,978 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:32:11,979 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 489 transitions, 1219 flow. Second operand 3 states. [2020-10-09 15:32:11,979 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:11,979 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:32:11,979 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:12,158 INFO L129 PetriNetUnfolder]: 17/598 cut-off events. [2020-10-09 15:32:12,158 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:32:12,186 INFO L80 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 598 events. 17/598 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2606 event pairs, 0 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 749. Up to 21 conditions per place. [2020-10-09 15:32:12,189 INFO L132 encePairwiseOnDemand]: 552/557 looper letters, 10 selfloop transitions, 3 changer transitions 0/491 dead transitions. [2020-10-09 15:32:12,189 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 491 transitions, 1249 flow [2020-10-09 15:32:12,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:12,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1587 transitions. [2020-10-09 15:32:12,190 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9497307001795332 [2020-10-09 15:32:12,190 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1587 transitions. [2020-10-09 15:32:12,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1587 transitions. [2020-10-09 15:32:12,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:12,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1587 transitions. [2020-10-09 15:32:12,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:12,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:12,192 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:12,192 INFO L185 Difference]: Start difference. First operand has 569 places, 489 transitions, 1219 flow. Second operand 3 states and 1587 transitions. [2020-10-09 15:32:12,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 491 transitions, 1249 flow [2020-10-09 15:32:12,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 491 transitions, 1248 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:12,197 INFO L241 Difference]: Finished difference. Result has 572 places, 491 transitions, 1242 flow [2020-10-09 15:32:12,197 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1242, PETRI_PLACES=572, PETRI_TRANSITIONS=491} [2020-10-09 15:32:12,197 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 55 predicate places. [2020-10-09 15:32:12,197 INFO L481 AbstractCegarLoop]: Abstraction has has 572 places, 491 transitions, 1242 flow [2020-10-09 15:32:12,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:12,198 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:12,198 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:12,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 558 mathsat -unsat_core_generation=3 [2020-10-09 15:32:12,398 INFO L429 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:12,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:12,399 INFO L82 PathProgramCache]: Analyzing trace with hash -512447888, now seen corresponding path program 1 times [2020-10-09 15:32:12,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:12,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104653075] [2020-10-09 15:32:12,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 559 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 559 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:12,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:12,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:32:12,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:32:12,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104653075] [2020-10-09 15:32:12,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:12,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:12,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372001883] [2020-10-09 15:32:12,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:12,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:12,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:12,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:12,825 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 557 [2020-10-09 15:32:12,826 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 491 transitions, 1242 flow. Second operand 3 states. [2020-10-09 15:32:12,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:12,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 557 [2020-10-09 15:32:12,827 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:12,998 INFO L129 PetriNetUnfolder]: 16/596 cut-off events. [2020-10-09 15:32:12,998 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:32:13,026 INFO L80 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 596 events. 16/596 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2595 event pairs, 0 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 746. Up to 21 conditions per place. [2020-10-09 15:32:13,028 INFO L132 encePairwiseOnDemand]: 554/557 looper letters, 5 selfloop transitions, 2 changer transitions 0/491 dead transitions. [2020-10-09 15:32:13,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 491 transitions, 1254 flow [2020-10-09 15:32:13,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1595 transitions. [2020-10-09 15:32:13,030 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9545182525433872 [2020-10-09 15:32:13,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1595 transitions. [2020-10-09 15:32:13,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1595 transitions. [2020-10-09 15:32:13,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:13,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1595 transitions. [2020-10-09 15:32:13,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:13,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:13,031 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:13,032 INFO L185 Difference]: Start difference. First operand has 572 places, 491 transitions, 1242 flow. Second operand 3 states and 1595 transitions. [2020-10-09 15:32:13,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 491 transitions, 1254 flow [2020-10-09 15:32:13,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 491 transitions, 1249 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:13,037 INFO L241 Difference]: Finished difference. Result has 575 places, 491 transitions, 1247 flow [2020-10-09 15:32:13,037 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1233, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1247, PETRI_PLACES=575, PETRI_TRANSITIONS=491} [2020-10-09 15:32:13,037 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 58 predicate places. [2020-10-09 15:32:13,037 INFO L481 AbstractCegarLoop]: Abstraction has has 575 places, 491 transitions, 1247 flow [2020-10-09 15:32:13,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:13,037 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:13,037 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:13,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 559 mathsat -unsat_core_generation=3 [2020-10-09 15:32:13,238 INFO L429 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:13,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:13,238 INFO L82 PathProgramCache]: Analyzing trace with hash -511495599, now seen corresponding path program 1 times [2020-10-09 15:32:13,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:13,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340713177] [2020-10-09 15:32:13,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 560 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 560 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:13,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:32:13,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:32:13,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:32:13,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340713177] [2020-10-09 15:32:13,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:13,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:13,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350399696] [2020-10-09 15:32:13,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:13,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:13,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:13,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:13,623 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 557 [2020-10-09 15:32:13,623 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 491 transitions, 1247 flow. Second operand 3 states. [2020-10-09 15:32:13,623 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:13,623 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 557 [2020-10-09 15:32:13,624 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:13,794 INFO L129 PetriNetUnfolder]: 15/592 cut-off events. [2020-10-09 15:32:13,794 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:32:13,822 INFO L80 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 592 events. 15/592 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2569 event pairs, 0 based on Foata normal form. 1/559 useless extension candidates. Maximal degree in co-relation 742. Up to 21 conditions per place. [2020-10-09 15:32:13,824 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 4 selfloop transitions, 1 changer transitions 0/488 dead transitions. [2020-10-09 15:32:13,824 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 488 transitions, 1242 flow [2020-10-09 15:32:13,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:13,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2020-10-09 15:32:13,825 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9551166965888689 [2020-10-09 15:32:13,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2020-10-09 15:32:13,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2020-10-09 15:32:13,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:13,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2020-10-09 15:32:13,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:13,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:13,827 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:13,827 INFO L185 Difference]: Start difference. First operand has 575 places, 491 transitions, 1247 flow. Second operand 3 states and 1596 transitions. [2020-10-09 15:32:13,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 488 transitions, 1242 flow [2020-10-09 15:32:13,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 488 transitions, 1235 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:32:13,833 INFO L241 Difference]: Finished difference. Result has 574 places, 488 transitions, 1227 flow [2020-10-09 15:32:13,833 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1227, PETRI_PLACES=574, PETRI_TRANSITIONS=488} [2020-10-09 15:32:13,833 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 57 predicate places. [2020-10-09 15:32:13,833 INFO L481 AbstractCegarLoop]: Abstraction has has 574 places, 488 transitions, 1227 flow [2020-10-09 15:32:13,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:13,833 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:13,833 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:14,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 560 mathsat -unsat_core_generation=3 [2020-10-09 15:32:14,034 INFO L429 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:14,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:14,034 INFO L82 PathProgramCache]: Analyzing trace with hash -511494576, now seen corresponding path program 1 times [2020-10-09 15:32:14,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:14,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93467373] [2020-10-09 15:32:14,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 561 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 561 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:14,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:14,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:32:14,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:14,399 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:32:14,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93467373] [2020-10-09 15:32:14,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:14,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:14,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779168000] [2020-10-09 15:32:14,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:14,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:14,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:14,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:14,434 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:32:14,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 488 transitions, 1227 flow. Second operand 3 states. [2020-10-09 15:32:14,435 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:14,435 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:32:14,435 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:14,605 INFO L129 PetriNetUnfolder]: 15/590 cut-off events. [2020-10-09 15:32:14,605 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:32:14,631 INFO L80 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 590 events. 15/590 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2553 event pairs, 0 based on Foata normal form. 0/555 useless extension candidates. Maximal degree in co-relation 744. Up to 21 conditions per place. [2020-10-09 15:32:14,633 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 8 selfloop transitions, 1 changer transitions 0/486 dead transitions. [2020-10-09 15:32:14,633 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 486 transitions, 1240 flow [2020-10-09 15:32:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1582 transitions. [2020-10-09 15:32:14,634 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9467384799521245 [2020-10-09 15:32:14,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1582 transitions. [2020-10-09 15:32:14,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1582 transitions. [2020-10-09 15:32:14,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:14,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1582 transitions. [2020-10-09 15:32:14,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:14,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:14,637 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:14,637 INFO L185 Difference]: Start difference. First operand has 574 places, 488 transitions, 1227 flow. Second operand 3 states and 1582 transitions. [2020-10-09 15:32:14,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 486 transitions, 1240 flow [2020-10-09 15:32:14,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 486 transitions, 1239 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:14,643 INFO L241 Difference]: Finished difference. Result has 573 places, 486 transitions, 1223 flow [2020-10-09 15:32:14,643 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1223, PETRI_PLACES=573, PETRI_TRANSITIONS=486} [2020-10-09 15:32:14,643 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 56 predicate places. [2020-10-09 15:32:14,643 INFO L481 AbstractCegarLoop]: Abstraction has has 573 places, 486 transitions, 1223 flow [2020-10-09 15:32:14,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:14,644 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:14,644 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:14,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 561 mathsat -unsat_core_generation=3 [2020-10-09 15:32:14,844 INFO L429 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:14,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:14,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2016425374, now seen corresponding path program 1 times [2020-10-09 15:32:14,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:14,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552161750] [2020-10-09 15:32:14,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 562 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 562 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:15,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:15,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:15,210 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:32:15,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:32:15,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552161750] [2020-10-09 15:32:15,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:15,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:15,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708828191] [2020-10-09 15:32:15,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:15,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:15,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:15,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:15,224 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 557 [2020-10-09 15:32:15,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 486 transitions, 1223 flow. Second operand 3 states. [2020-10-09 15:32:15,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:15,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 557 [2020-10-09 15:32:15,225 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:15,393 INFO L129 PetriNetUnfolder]: 13/595 cut-off events. [2020-10-09 15:32:15,393 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:32:15,420 INFO L80 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 595 events. 13/595 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2605 event pairs, 0 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 747. Up to 21 conditions per place. [2020-10-09 15:32:15,422 INFO L132 encePairwiseOnDemand]: 554/557 looper letters, 5 selfloop transitions, 2 changer transitions 0/487 dead transitions. [2020-10-09 15:32:15,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 487 transitions, 1239 flow [2020-10-09 15:32:15,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:15,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1595 transitions. [2020-10-09 15:32:15,424 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9545182525433872 [2020-10-09 15:32:15,424 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1595 transitions. [2020-10-09 15:32:15,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1595 transitions. [2020-10-09 15:32:15,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:15,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1595 transitions. [2020-10-09 15:32:15,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:15,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:15,426 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:15,426 INFO L185 Difference]: Start difference. First operand has 573 places, 486 transitions, 1223 flow. Second operand 3 states and 1595 transitions. [2020-10-09 15:32:15,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 487 transitions, 1239 flow [2020-10-09 15:32:15,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 487 transitions, 1238 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:15,431 INFO L241 Difference]: Finished difference. Result has 576 places, 487 transitions, 1236 flow [2020-10-09 15:32:15,431 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1236, PETRI_PLACES=576, PETRI_TRANSITIONS=487} [2020-10-09 15:32:15,431 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 59 predicate places. [2020-10-09 15:32:15,431 INFO L481 AbstractCegarLoop]: Abstraction has has 576 places, 487 transitions, 1236 flow [2020-10-09 15:32:15,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:15,431 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:15,431 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:15,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 562 mathsat -unsat_core_generation=3 [2020-10-09 15:32:15,632 INFO L429 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:15,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:15,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2016426397, now seen corresponding path program 1 times [2020-10-09 15:32:15,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:15,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236730711] [2020-10-09 15:32:15,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 563 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 563 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:15,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:15,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:32:15,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:32:16,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236730711] [2020-10-09 15:32:16,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:16,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:16,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088220910] [2020-10-09 15:32:16,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:16,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:16,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:16,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:16,042 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:32:16,043 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 487 transitions, 1236 flow. Second operand 3 states. [2020-10-09 15:32:16,043 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:16,043 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:32:16,043 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:16,268 INFO L129 PetriNetUnfolder]: 13/596 cut-off events. [2020-10-09 15:32:16,268 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:32:16,293 INFO L80 FinitePrefix]: Finished finitePrefix Result has 818 conditions, 596 events. 13/596 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2612 event pairs, 0 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 755. Up to 21 conditions per place. [2020-10-09 15:32:16,295 INFO L132 encePairwiseOnDemand]: 553/557 looper letters, 9 selfloop transitions, 3 changer transitions 0/488 dead transitions. [2020-10-09 15:32:16,295 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 488 transitions, 1262 flow [2020-10-09 15:32:16,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:16,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1585 transitions. [2020-10-09 15:32:16,296 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9485338120885697 [2020-10-09 15:32:16,296 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1585 transitions. [2020-10-09 15:32:16,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1585 transitions. [2020-10-09 15:32:16,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:16,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1585 transitions. [2020-10-09 15:32:16,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:16,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:16,298 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:16,298 INFO L185 Difference]: Start difference. First operand has 576 places, 487 transitions, 1236 flow. Second operand 3 states and 1585 transitions. [2020-10-09 15:32:16,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 488 transitions, 1262 flow [2020-10-09 15:32:16,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 488 transitions, 1260 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:16,303 INFO L241 Difference]: Finished difference. Result has 579 places, 488 transitions, 1252 flow [2020-10-09 15:32:16,303 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1252, PETRI_PLACES=579, PETRI_TRANSITIONS=488} [2020-10-09 15:32:16,303 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 62 predicate places. [2020-10-09 15:32:16,303 INFO L481 AbstractCegarLoop]: Abstraction has has 579 places, 488 transitions, 1252 flow [2020-10-09 15:32:16,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:16,303 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:16,303 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:16,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 563 mathsat -unsat_core_generation=3 [2020-10-09 15:32:16,504 INFO L429 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:16,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:16,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2015473085, now seen corresponding path program 1 times [2020-10-09 15:32:16,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:16,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129668776] [2020-10-09 15:32:16,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 564 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 564 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:16,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:32:16,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:32:16,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:32:16,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129668776] [2020-10-09 15:32:16,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:16,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:16,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095447180] [2020-10-09 15:32:16,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:16,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:16,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:16,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:16,901 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 557 [2020-10-09 15:32:16,902 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 488 transitions, 1252 flow. Second operand 3 states. [2020-10-09 15:32:16,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:16,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 557 [2020-10-09 15:32:16,902 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:17,074 INFO L129 PetriNetUnfolder]: 12/592 cut-off events. [2020-10-09 15:32:17,074 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:32:17,102 INFO L80 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 592 events. 12/592 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2589 event pairs, 0 based on Foata normal form. 1/562 useless extension candidates. Maximal degree in co-relation 747. Up to 21 conditions per place. [2020-10-09 15:32:17,104 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 4 selfloop transitions, 1 changer transitions 0/485 dead transitions. [2020-10-09 15:32:17,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 485 transitions, 1247 flow [2020-10-09 15:32:17,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:17,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2020-10-09 15:32:17,105 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9551166965888689 [2020-10-09 15:32:17,105 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2020-10-09 15:32:17,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2020-10-09 15:32:17,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:17,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2020-10-09 15:32:17,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:17,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:17,107 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:17,107 INFO L185 Difference]: Start difference. First operand has 579 places, 488 transitions, 1252 flow. Second operand 3 states and 1596 transitions. [2020-10-09 15:32:17,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 485 transitions, 1247 flow [2020-10-09 15:32:17,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 485 transitions, 1239 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:32:17,112 INFO L241 Difference]: Finished difference. Result has 578 places, 485 transitions, 1231 flow [2020-10-09 15:32:17,113 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1231, PETRI_PLACES=578, PETRI_TRANSITIONS=485} [2020-10-09 15:32:17,113 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 61 predicate places. [2020-10-09 15:32:17,113 INFO L481 AbstractCegarLoop]: Abstraction has has 578 places, 485 transitions, 1231 flow [2020-10-09 15:32:17,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:17,113 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:17,113 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:17,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 564 mathsat -unsat_core_generation=3 [2020-10-09 15:32:17,314 INFO L429 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:17,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:17,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2015472062, now seen corresponding path program 1 times [2020-10-09 15:32:17,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:17,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787845102] [2020-10-09 15:32:17,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 565 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 565 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:17,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:17,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:17,682 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:32:17,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:32:17,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787845102] [2020-10-09 15:32:17,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:17,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:17,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487146260] [2020-10-09 15:32:17,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:17,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:17,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:17,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:17,721 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 557 [2020-10-09 15:32:17,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 485 transitions, 1231 flow. Second operand 3 states. [2020-10-09 15:32:17,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:17,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 557 [2020-10-09 15:32:17,722 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:17,895 INFO L129 PetriNetUnfolder]: 12/590 cut-off events. [2020-10-09 15:32:17,895 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:32:17,921 INFO L80 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 590 events. 12/590 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2571 event pairs, 0 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 751. Up to 21 conditions per place. [2020-10-09 15:32:17,922 INFO L132 encePairwiseOnDemand]: 555/557 looper letters, 8 selfloop transitions, 1 changer transitions 0/483 dead transitions. [2020-10-09 15:32:17,923 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 483 transitions, 1244 flow [2020-10-09 15:32:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:17,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:17,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1582 transitions. [2020-10-09 15:32:17,924 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9467384799521245 [2020-10-09 15:32:17,924 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1582 transitions. [2020-10-09 15:32:17,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1582 transitions. [2020-10-09 15:32:17,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:17,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1582 transitions. [2020-10-09 15:32:17,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:17,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:17,925 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:17,926 INFO L185 Difference]: Start difference. First operand has 578 places, 485 transitions, 1231 flow. Second operand 3 states and 1582 transitions. [2020-10-09 15:32:17,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 483 transitions, 1244 flow [2020-10-09 15:32:17,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 483 transitions, 1243 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:17,931 INFO L241 Difference]: Finished difference. Result has 577 places, 483 transitions, 1227 flow [2020-10-09 15:32:17,931 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1227, PETRI_PLACES=577, PETRI_TRANSITIONS=483} [2020-10-09 15:32:17,931 INFO L341 CegarLoopForPetriNet]: 517 programPoint places, 60 predicate places. [2020-10-09 15:32:17,931 INFO L481 AbstractCegarLoop]: Abstraction has has 577 places, 483 transitions, 1227 flow [2020-10-09 15:32:17,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:17,931 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:17,931 INFO L255 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:18,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 565 mathsat -unsat_core_generation=3 [2020-10-09 15:32:18,132 INFO L429 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:18,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:18,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1690032949, now seen corresponding path program 1 times [2020-10-09 15:32:18,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:18,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660482010] [2020-10-09 15:32:18,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 566 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 566 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:32:18,498 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:32:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:32:18,534 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:32:18,588 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:32:18,588 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:32:18,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 566 mathsat -unsat_core_generation=3 [2020-10-09 15:32:18,796 WARN L371 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:32:18,797 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2020-10-09 15:32:18,836 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,836 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,836 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,837 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,837 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,838 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,840 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,840 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,840 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,840 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,840 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,840 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,840 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,842 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,842 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,842 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,842 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,842 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,842 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,842 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,842 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,842 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,842 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,842 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,842 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,842 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,843 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,843 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,843 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,843 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,843 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,843 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,843 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,843 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,843 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,843 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,843 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,843 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,843 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,843 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,844 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,844 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,844 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,844 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,844 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,844 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,844 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,844 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,844 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,844 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,844 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,844 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,844 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,844 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,845 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,845 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,845 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,845 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,845 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,845 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,845 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,848 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,848 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,848 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,848 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,848 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,848 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,848 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,848 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,849 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,851 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,851 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,851 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,851 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,851 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,851 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,851 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,853 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,853 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,853 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,853 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,853 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,853 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,853 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,853 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,853 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,853 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,853 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,853 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,853 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,854 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,854 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,854 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,854 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,854 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,855 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,855 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,856 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,856 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,856 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,856 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,856 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,856 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,856 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,856 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,856 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,856 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,856 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,856 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,856 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,857 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,857 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,858 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,858 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,858 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,858 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,858 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,858 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,858 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,858 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,858 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,858 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,858 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,858 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,858 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,858 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,859 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,859 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,859 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,859 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,859 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,859 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,859 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,859 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,859 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,859 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,859 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,859 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,860 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,860 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,861 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,861 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,861 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,861 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,861 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,861 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,861 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,861 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,861 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,861 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,861 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,861 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,861 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,861 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,862 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,862 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,862 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,862 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,862 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,862 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,862 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,862 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,862 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,862 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,862 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,862 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,862 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,863 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,864 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,864 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,864 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,864 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,864 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,864 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,864 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,866 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,866 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,866 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,868 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,874 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,874 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,874 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,874 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,874 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,874 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,876 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,876 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,876 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,876 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,876 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,876 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,876 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,880 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,880 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,880 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,888 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,888 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,888 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,907 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,907 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,907 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,920 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,920 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,920 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,924 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,925 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,925 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,925 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,925 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,927 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,927 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,927 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,928 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,928 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,928 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,929 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,929 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,929 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,929 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,929 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,929 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,929 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,929 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,930 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,930 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,930 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,930 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,930 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,930 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,930 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,930 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,930 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,931 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,931 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,931 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,931 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,931 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,931 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,932 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,932 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,932 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,932 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,932 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,932 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,932 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,933 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,933 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,933 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,934 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,934 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,934 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,934 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,934 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,934 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,934 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,934 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,935 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,935 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,935 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,935 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,935 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,935 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,935 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,936 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,936 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,937 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,937 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,937 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,937 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,938 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:32:18,939 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2020-10-09 15:32:18,940 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:32:18,940 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:32:18,940 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:32:18,940 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:32:18,940 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:32:18,940 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:32:18,940 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:32:18,940 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:32:18,944 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 542 places, 584 transitions, 1693 flow [2020-10-09 15:32:19,112 INFO L129 PetriNetUnfolder]: 106/772 cut-off events. [2020-10-09 15:32:19,113 INFO L130 PetriNetUnfolder]: For 1750/1750 co-relation queries the response was YES. [2020-10-09 15:32:19,151 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1067 conditions, 772 events. 106/772 cut-off events. For 1750/1750 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3179 event pairs, 0 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 1001. Up to 44 conditions per place. [2020-10-09 15:32:19,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 542 places, 584 transitions, 1693 flow [2020-10-09 15:32:19,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 542 places, 584 transitions, 1693 flow [2020-10-09 15:32:19,174 INFO L129 PetriNetUnfolder]: 10/103 cut-off events. [2020-10-09 15:32:19,174 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:32:19,174 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:19,174 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:19,175 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:19,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:19,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1299626057, now seen corresponding path program 1 times [2020-10-09 15:32:19,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:19,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387612185] [2020-10-09 15:32:19,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 567 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 567 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:19,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:19,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:19,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:32:19,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:32:19,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387612185] [2020-10-09 15:32:19,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:19,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:19,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690605809] [2020-10-09 15:32:19,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:19,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:19,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:19,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:19,561 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 584 [2020-10-09 15:32:19,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 584 transitions, 1693 flow. Second operand 3 states. [2020-10-09 15:32:19,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:19,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 584 [2020-10-09 15:32:19,562 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:19,767 INFO L129 PetriNetUnfolder]: 61/624 cut-off events. [2020-10-09 15:32:19,767 INFO L130 PetriNetUnfolder]: For 1751/1751 co-relation queries the response was YES. [2020-10-09 15:32:19,794 INFO L80 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 624 events. 61/624 cut-off events. For 1751/1751 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2469 event pairs, 0 based on Foata normal form. 86/626 useless extension candidates. Maximal degree in co-relation 864. Up to 22 conditions per place. [2020-10-09 15:32:19,801 INFO L132 encePairwiseOnDemand]: 558/584 looper letters, 5 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2020-10-09 15:32:19,801 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 558 transitions, 1655 flow [2020-10-09 15:32:19,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:19,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:19,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1719 transitions. [2020-10-09 15:32:19,802 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9811643835616438 [2020-10-09 15:32:19,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1719 transitions. [2020-10-09 15:32:19,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1719 transitions. [2020-10-09 15:32:19,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:19,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1719 transitions. [2020-10-09 15:32:19,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:19,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:19,804 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:19,804 INFO L185 Difference]: Start difference. First operand has 542 places, 584 transitions, 1693 flow. Second operand 3 states and 1719 transitions. [2020-10-09 15:32:19,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 558 transitions, 1655 flow [2020-10-09 15:32:19,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 558 transitions, 1235 flow, removed 210 selfloop flow, removed 0 redundant places. [2020-10-09 15:32:19,811 INFO L241 Difference]: Finished difference. Result has 541 places, 558 transitions, 1233 flow [2020-10-09 15:32:19,811 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1219, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1233, PETRI_PLACES=541, PETRI_TRANSITIONS=558} [2020-10-09 15:32:19,811 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, -1 predicate places. [2020-10-09 15:32:19,811 INFO L481 AbstractCegarLoop]: Abstraction has has 541 places, 558 transitions, 1233 flow [2020-10-09 15:32:19,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:19,811 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:19,811 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:20,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 567 mathsat -unsat_core_generation=3 [2020-10-09 15:32:20,012 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:20,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1298673768, now seen corresponding path program 1 times [2020-10-09 15:32:20,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:20,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856822590] [2020-10-09 15:32:20,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 568 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 568 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:20,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:32:20,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:32:20,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:32:20,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856822590] [2020-10-09 15:32:20,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:20,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:20,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326316510] [2020-10-09 15:32:20,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:20,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:20,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:20,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:20,395 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 584 [2020-10-09 15:32:20,395 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 558 transitions, 1233 flow. Second operand 3 states. [2020-10-09 15:32:20,396 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:20,396 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 584 [2020-10-09 15:32:20,396 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:20,539 INFO L129 PetriNetUnfolder]: 60/623 cut-off events. [2020-10-09 15:32:20,540 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:32:20,567 INFO L80 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 623 events. 60/623 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2468 event pairs, 0 based on Foata normal form. 1/541 useless extension candidates. Maximal degree in co-relation 682. Up to 22 conditions per place. [2020-10-09 15:32:20,574 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 4 selfloop transitions, 1 changer transitions 0/557 dead transitions. [2020-10-09 15:32:20,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 557 transitions, 1237 flow [2020-10-09 15:32:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:20,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2020-10-09 15:32:20,576 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9554794520547946 [2020-10-09 15:32:20,576 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2020-10-09 15:32:20,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2020-10-09 15:32:20,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:20,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2020-10-09 15:32:20,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:20,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:20,578 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:20,578 INFO L185 Difference]: Start difference. First operand has 541 places, 558 transitions, 1233 flow. Second operand 3 states and 1674 transitions. [2020-10-09 15:32:20,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 557 transitions, 1237 flow [2020-10-09 15:32:20,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 557 transitions, 1236 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:20,583 INFO L241 Difference]: Finished difference. Result has 542 places, 557 transitions, 1228 flow [2020-10-09 15:32:20,583 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1228, PETRI_PLACES=542, PETRI_TRANSITIONS=557} [2020-10-09 15:32:20,583 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 0 predicate places. [2020-10-09 15:32:20,583 INFO L481 AbstractCegarLoop]: Abstraction has has 542 places, 557 transitions, 1228 flow [2020-10-09 15:32:20,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:20,583 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:20,583 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:20,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 568 mathsat -unsat_core_generation=3 [2020-10-09 15:32:20,784 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:20,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:20,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1298672745, now seen corresponding path program 1 times [2020-10-09 15:32:20,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:20,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561106146] [2020-10-09 15:32:20,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 569 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 569 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:21,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:21,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:32:21,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:32:21,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561106146] [2020-10-09 15:32:21,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:21,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:21,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556935782] [2020-10-09 15:32:21,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:21,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:21,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:21,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:21,184 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:21,185 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 557 transitions, 1228 flow. Second operand 3 states. [2020-10-09 15:32:21,185 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:21,185 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:21,186 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:21,335 INFO L129 PetriNetUnfolder]: 60/621 cut-off events. [2020-10-09 15:32:21,335 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-09 15:32:21,364 INFO L80 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 621 events. 60/621 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2452 event pairs, 0 based on Foata normal form. 0/539 useless extension candidates. Maximal degree in co-relation 690. Up to 22 conditions per place. [2020-10-09 15:32:21,372 INFO L132 encePairwiseOnDemand]: 581/584 looper letters, 8 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2020-10-09 15:32:21,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 556 transitions, 1246 flow [2020-10-09 15:32:21,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1661 transitions. [2020-10-09 15:32:21,373 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9480593607305936 [2020-10-09 15:32:21,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1661 transitions. [2020-10-09 15:32:21,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1661 transitions. [2020-10-09 15:32:21,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:21,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1661 transitions. [2020-10-09 15:32:21,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:21,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:21,375 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:21,375 INFO L185 Difference]: Start difference. First operand has 542 places, 557 transitions, 1228 flow. Second operand 3 states and 1661 transitions. [2020-10-09 15:32:21,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 556 transitions, 1246 flow [2020-10-09 15:32:21,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 556 transitions, 1245 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:21,380 INFO L241 Difference]: Finished difference. Result has 543 places, 556 transitions, 1229 flow [2020-10-09 15:32:21,380 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1229, PETRI_PLACES=543, PETRI_TRANSITIONS=556} [2020-10-09 15:32:21,381 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 1 predicate places. [2020-10-09 15:32:21,381 INFO L481 AbstractCegarLoop]: Abstraction has has 543 places, 556 transitions, 1229 flow [2020-10-09 15:32:21,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:21,381 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:21,381 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:21,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 569 mathsat -unsat_core_generation=3 [2020-10-09 15:32:21,581 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:21,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:21,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1299627080, now seen corresponding path program 1 times [2020-10-09 15:32:21,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:21,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360639897] [2020-10-09 15:32:21,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 570 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 570 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:21,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:21,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:32:21,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:32:21,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360639897] [2020-10-09 15:32:21,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:21,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:21,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368036158] [2020-10-09 15:32:21,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:21,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:21,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:21,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:21,985 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:21,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 556 transitions, 1229 flow. Second operand 3 states. [2020-10-09 15:32:21,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:21,986 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:21,987 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:22,129 INFO L129 PetriNetUnfolder]: 60/619 cut-off events. [2020-10-09 15:32:22,129 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:32:22,156 INFO L80 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 619 events. 60/619 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2441 event pairs, 0 based on Foata normal form. 1/540 useless extension candidates. Maximal degree in co-relation 685. Up to 22 conditions per place. [2020-10-09 15:32:22,163 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 8 selfloop transitions, 1 changer transitions 0/554 dead transitions. [2020-10-09 15:32:22,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 554 transitions, 1241 flow [2020-10-09 15:32:22,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:22,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2020-10-09 15:32:22,165 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2020-10-09 15:32:22,165 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1660 transitions. [2020-10-09 15:32:22,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1660 transitions. [2020-10-09 15:32:22,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:22,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1660 transitions. [2020-10-09 15:32:22,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:22,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:22,166 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:22,166 INFO L185 Difference]: Start difference. First operand has 543 places, 556 transitions, 1229 flow. Second operand 3 states and 1660 transitions. [2020-10-09 15:32:22,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 554 transitions, 1241 flow [2020-10-09 15:32:22,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 554 transitions, 1240 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:22,172 INFO L241 Difference]: Finished difference. Result has 542 places, 554 transitions, 1224 flow [2020-10-09 15:32:22,172 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1224, PETRI_PLACES=542, PETRI_TRANSITIONS=554} [2020-10-09 15:32:22,172 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 0 predicate places. [2020-10-09 15:32:22,172 INFO L481 AbstractCegarLoop]: Abstraction has has 542 places, 554 transitions, 1224 flow [2020-10-09 15:32:22,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:22,172 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:22,172 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:32:22,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 570 mathsat -unsat_core_generation=3 [2020-10-09 15:32:22,373 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:22,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:22,373 INFO L82 PathProgramCache]: Analyzing trace with hash 249888790, now seen corresponding path program 1 times [2020-10-09 15:32:22,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:22,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364631778] [2020-10-09 15:32:22,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 571 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 571 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:22,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:32:22,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:32:22,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:22,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:32:22,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364631778] [2020-10-09 15:32:22,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:22,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:22,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573277153] [2020-10-09 15:32:22,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:22,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:22,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:22,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:22,763 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 584 [2020-10-09 15:32:22,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 554 transitions, 1224 flow. Second operand 3 states. [2020-10-09 15:32:22,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:22,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 584 [2020-10-09 15:32:22,764 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:22,911 INFO L129 PetriNetUnfolder]: 59/626 cut-off events. [2020-10-09 15:32:22,912 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:32:22,940 INFO L80 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 626 events. 59/626 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2497 event pairs, 0 based on Foata normal form. 1/547 useless extension candidates. Maximal degree in co-relation 690. Up to 22 conditions per place. [2020-10-09 15:32:22,947 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 4 selfloop transitions, 1 changer transitions 0/554 dead transitions. [2020-10-09 15:32:22,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 554 transitions, 1234 flow [2020-10-09 15:32:22,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:22,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:22,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2020-10-09 15:32:22,949 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9554794520547946 [2020-10-09 15:32:22,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2020-10-09 15:32:22,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2020-10-09 15:32:22,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:22,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2020-10-09 15:32:22,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:22,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:22,951 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:22,951 INFO L185 Difference]: Start difference. First operand has 542 places, 554 transitions, 1224 flow. Second operand 3 states and 1674 transitions. [2020-10-09 15:32:22,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 554 transitions, 1234 flow [2020-10-09 15:32:22,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 554 transitions, 1233 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:22,956 INFO L241 Difference]: Finished difference. Result has 544 places, 554 transitions, 1228 flow [2020-10-09 15:32:22,956 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1223, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1228, PETRI_PLACES=544, PETRI_TRANSITIONS=554} [2020-10-09 15:32:22,956 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 2 predicate places. [2020-10-09 15:32:22,956 INFO L481 AbstractCegarLoop]: Abstraction has has 544 places, 554 transitions, 1228 flow [2020-10-09 15:32:22,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:22,956 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:22,956 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:32:23,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 571 mathsat -unsat_core_generation=3 [2020-10-09 15:32:23,157 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:23,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:23,157 INFO L82 PathProgramCache]: Analyzing trace with hash 249889813, now seen corresponding path program 1 times [2020-10-09 15:32:23,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:23,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492008577] [2020-10-09 15:32:23,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 572 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 572 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:23,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:23,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:32:23,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:32:23,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492008577] [2020-10-09 15:32:23,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:23,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:23,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105384675] [2020-10-09 15:32:23,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:23,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:23,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:23,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:23,570 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:23,571 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 554 transitions, 1228 flow. Second operand 3 states. [2020-10-09 15:32:23,571 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:23,571 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:23,572 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:23,764 INFO L129 PetriNetUnfolder]: 57/628 cut-off events. [2020-10-09 15:32:23,764 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:32:23,793 INFO L80 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 628 events. 57/628 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2532 event pairs, 0 based on Foata normal form. 0/548 useless extension candidates. Maximal degree in co-relation 704. Up to 22 conditions per place. [2020-10-09 15:32:23,800 INFO L132 encePairwiseOnDemand]: 580/584 looper letters, 9 selfloop transitions, 3 changer transitions 0/555 dead transitions. [2020-10-09 15:32:23,800 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 555 transitions, 1254 flow [2020-10-09 15:32:23,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:23,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2020-10-09 15:32:23,801 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9492009132420092 [2020-10-09 15:32:23,801 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1663 transitions. [2020-10-09 15:32:23,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1663 transitions. [2020-10-09 15:32:23,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:23,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1663 transitions. [2020-10-09 15:32:23,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:23,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:23,804 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:23,804 INFO L185 Difference]: Start difference. First operand has 544 places, 554 transitions, 1228 flow. Second operand 3 states and 1663 transitions. [2020-10-09 15:32:23,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 555 transitions, 1254 flow [2020-10-09 15:32:23,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 555 transitions, 1253 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:23,809 INFO L241 Difference]: Finished difference. Result has 547 places, 555 transitions, 1245 flow [2020-10-09 15:32:23,809 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1245, PETRI_PLACES=547, PETRI_TRANSITIONS=555} [2020-10-09 15:32:23,809 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 5 predicate places. [2020-10-09 15:32:23,809 INFO L481 AbstractCegarLoop]: Abstraction has has 547 places, 555 transitions, 1245 flow [2020-10-09 15:32:23,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:23,809 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:23,810 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:32:24,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 572 mathsat -unsat_core_generation=3 [2020-10-09 15:32:24,010 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:24,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:24,011 INFO L82 PathProgramCache]: Analyzing trace with hash 248936501, now seen corresponding path program 1 times [2020-10-09 15:32:24,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:24,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405832671] [2020-10-09 15:32:24,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 573 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 573 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:24,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:24,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:32:24,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:32:24,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405832671] [2020-10-09 15:32:24,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:24,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:24,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680110502] [2020-10-09 15:32:24,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:24,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:24,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:24,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:24,395 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 584 [2020-10-09 15:32:24,396 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 555 transitions, 1245 flow. Second operand 3 states. [2020-10-09 15:32:24,396 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:24,396 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 584 [2020-10-09 15:32:24,397 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:24,545 INFO L129 PetriNetUnfolder]: 57/621 cut-off events. [2020-10-09 15:32:24,545 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:32:24,572 INFO L80 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 621 events. 57/621 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2471 event pairs, 0 based on Foata normal form. 1/545 useless extension candidates. Maximal degree in co-relation 689. Up to 22 conditions per place. [2020-10-09 15:32:24,579 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 5 selfloop transitions, 1 changer transitions 0/553 dead transitions. [2020-10-09 15:32:24,579 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 553 transitions, 1247 flow [2020-10-09 15:32:24,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:24,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2020-10-09 15:32:24,580 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.954337899543379 [2020-10-09 15:32:24,581 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2020-10-09 15:32:24,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2020-10-09 15:32:24,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:24,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2020-10-09 15:32:24,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:24,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:24,582 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:24,582 INFO L185 Difference]: Start difference. First operand has 547 places, 555 transitions, 1245 flow. Second operand 3 states and 1672 transitions. [2020-10-09 15:32:24,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 553 transitions, 1247 flow [2020-10-09 15:32:24,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 553 transitions, 1239 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:32:24,587 INFO L241 Difference]: Finished difference. Result has 547 places, 553 transitions, 1232 flow [2020-10-09 15:32:24,588 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1232, PETRI_PLACES=547, PETRI_TRANSITIONS=553} [2020-10-09 15:32:24,588 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 5 predicate places. [2020-10-09 15:32:24,588 INFO L481 AbstractCegarLoop]: Abstraction has has 547 places, 553 transitions, 1232 flow [2020-10-09 15:32:24,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:24,588 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:24,588 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:32:24,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 573 mathsat -unsat_core_generation=3 [2020-10-09 15:32:24,789 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:24,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:24,789 INFO L82 PathProgramCache]: Analyzing trace with hash 248935478, now seen corresponding path program 1 times [2020-10-09 15:32:24,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:24,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243390303] [2020-10-09 15:32:24,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 574 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 574 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:25,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:25,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:32:25,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:32:25,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243390303] [2020-10-09 15:32:25,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:25,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:25,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517919009] [2020-10-09 15:32:25,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:25,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:25,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:25,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:25,193 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:25,194 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 553 transitions, 1232 flow. Second operand 3 states. [2020-10-09 15:32:25,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:25,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:25,194 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:25,343 INFO L129 PetriNetUnfolder]: 57/619 cut-off events. [2020-10-09 15:32:25,343 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:32:25,370 INFO L80 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 619 events. 57/619 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2456 event pairs, 0 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 694. Up to 22 conditions per place. [2020-10-09 15:32:25,377 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 8 selfloop transitions, 1 changer transitions 0/551 dead transitions. [2020-10-09 15:32:25,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 551 transitions, 1245 flow [2020-10-09 15:32:25,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2020-10-09 15:32:25,378 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2020-10-09 15:32:25,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1660 transitions. [2020-10-09 15:32:25,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1660 transitions. [2020-10-09 15:32:25,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:25,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1660 transitions. [2020-10-09 15:32:25,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:25,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:25,380 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:25,380 INFO L185 Difference]: Start difference. First operand has 547 places, 553 transitions, 1232 flow. Second operand 3 states and 1660 transitions. [2020-10-09 15:32:25,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 551 transitions, 1245 flow [2020-10-09 15:32:25,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 551 transitions, 1244 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:25,385 INFO L241 Difference]: Finished difference. Result has 546 places, 551 transitions, 1228 flow [2020-10-09 15:32:25,385 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1228, PETRI_PLACES=546, PETRI_TRANSITIONS=551} [2020-10-09 15:32:25,385 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 4 predicate places. [2020-10-09 15:32:25,385 INFO L481 AbstractCegarLoop]: Abstraction has has 546 places, 551 transitions, 1228 flow [2020-10-09 15:32:25,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:25,386 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:25,386 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:32:25,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 574 mathsat -unsat_core_generation=3 [2020-10-09 15:32:25,586 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:25,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:25,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1095369109, now seen corresponding path program 1 times [2020-10-09 15:32:25,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:25,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311314651] [2020-10-09 15:32:25,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 575 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 575 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:25,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:32:25,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:32:25,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:32:25,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311314651] [2020-10-09 15:32:25,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:25,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:25,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534585119] [2020-10-09 15:32:25,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:25,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:25,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:25,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:25,975 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 584 [2020-10-09 15:32:25,976 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 551 transitions, 1228 flow. Second operand 3 states. [2020-10-09 15:32:25,976 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:25,976 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 584 [2020-10-09 15:32:25,977 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:26,127 INFO L129 PetriNetUnfolder]: 56/626 cut-off events. [2020-10-09 15:32:26,127 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:32:26,155 INFO L80 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 626 events. 56/626 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2519 event pairs, 0 based on Foata normal form. 1/550 useless extension candidates. Maximal degree in co-relation 697. Up to 22 conditions per place. [2020-10-09 15:32:26,162 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 4 selfloop transitions, 1 changer transitions 0/551 dead transitions. [2020-10-09 15:32:26,162 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 551 transitions, 1238 flow [2020-10-09 15:32:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2020-10-09 15:32:26,163 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9554794520547946 [2020-10-09 15:32:26,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2020-10-09 15:32:26,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2020-10-09 15:32:26,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:26,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2020-10-09 15:32:26,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:26,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:26,165 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:26,165 INFO L185 Difference]: Start difference. First operand has 546 places, 551 transitions, 1228 flow. Second operand 3 states and 1674 transitions. [2020-10-09 15:32:26,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 551 transitions, 1238 flow [2020-10-09 15:32:26,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 551 transitions, 1237 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:26,170 INFO L241 Difference]: Finished difference. Result has 548 places, 551 transitions, 1232 flow [2020-10-09 15:32:26,170 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1232, PETRI_PLACES=548, PETRI_TRANSITIONS=551} [2020-10-09 15:32:26,170 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 6 predicate places. [2020-10-09 15:32:26,170 INFO L481 AbstractCegarLoop]: Abstraction has has 548 places, 551 transitions, 1232 flow [2020-10-09 15:32:26,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:26,171 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:26,171 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:32:26,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 575 mathsat -unsat_core_generation=3 [2020-10-09 15:32:26,371 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:26,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:26,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1095370132, now seen corresponding path program 1 times [2020-10-09 15:32:26,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:26,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005070500] [2020-10-09 15:32:26,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 576 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 576 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:26,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:26,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:32:26,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:26,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:32:26,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005070500] [2020-10-09 15:32:26,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:26,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:26,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677278060] [2020-10-09 15:32:26,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:26,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:26,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:26,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:26,779 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:26,780 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 551 transitions, 1232 flow. Second operand 3 states. [2020-10-09 15:32:26,780 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:26,780 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:26,780 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:26,939 INFO L129 PetriNetUnfolder]: 54/628 cut-off events. [2020-10-09 15:32:26,939 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:32:26,969 INFO L80 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 628 events. 54/628 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2548 event pairs, 0 based on Foata normal form. 0/551 useless extension candidates. Maximal degree in co-relation 710. Up to 22 conditions per place. [2020-10-09 15:32:26,976 INFO L132 encePairwiseOnDemand]: 580/584 looper letters, 9 selfloop transitions, 3 changer transitions 0/552 dead transitions. [2020-10-09 15:32:26,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 552 transitions, 1258 flow [2020-10-09 15:32:26,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2020-10-09 15:32:26,978 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9492009132420092 [2020-10-09 15:32:26,978 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1663 transitions. [2020-10-09 15:32:26,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1663 transitions. [2020-10-09 15:32:26,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:26,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1663 transitions. [2020-10-09 15:32:26,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:26,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:26,979 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:26,979 INFO L185 Difference]: Start difference. First operand has 548 places, 551 transitions, 1232 flow. Second operand 3 states and 1663 transitions. [2020-10-09 15:32:26,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 552 transitions, 1258 flow [2020-10-09 15:32:26,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 552 transitions, 1257 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:26,984 INFO L241 Difference]: Finished difference. Result has 551 places, 552 transitions, 1249 flow [2020-10-09 15:32:26,985 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1249, PETRI_PLACES=551, PETRI_TRANSITIONS=552} [2020-10-09 15:32:26,985 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 9 predicate places. [2020-10-09 15:32:26,985 INFO L481 AbstractCegarLoop]: Abstraction has has 551 places, 552 transitions, 1249 flow [2020-10-09 15:32:26,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:26,985 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:26,985 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:32:27,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 576 mathsat -unsat_core_generation=3 [2020-10-09 15:32:27,186 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:27,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:27,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1094416820, now seen corresponding path program 1 times [2020-10-09 15:32:27,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:27,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291837685] [2020-10-09 15:32:27,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 577 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 577 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:27,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:27,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:32:27,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:32:27,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291837685] [2020-10-09 15:32:27,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:27,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:27,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795430429] [2020-10-09 15:32:27,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:27,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:27,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:27,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:27,608 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 584 [2020-10-09 15:32:27,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 552 transitions, 1249 flow. Second operand 3 states. [2020-10-09 15:32:27,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:27,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 584 [2020-10-09 15:32:27,609 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:27,761 INFO L129 PetriNetUnfolder]: 54/621 cut-off events. [2020-10-09 15:32:27,761 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:32:27,789 INFO L80 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 621 events. 54/621 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2488 event pairs, 0 based on Foata normal form. 1/548 useless extension candidates. Maximal degree in co-relation 696. Up to 22 conditions per place. [2020-10-09 15:32:27,796 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 5 selfloop transitions, 1 changer transitions 0/550 dead transitions. [2020-10-09 15:32:27,796 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 550 transitions, 1251 flow [2020-10-09 15:32:27,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:27,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:27,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2020-10-09 15:32:27,798 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.954337899543379 [2020-10-09 15:32:27,798 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2020-10-09 15:32:27,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2020-10-09 15:32:27,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:27,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2020-10-09 15:32:27,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:27,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:27,800 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:27,800 INFO L185 Difference]: Start difference. First operand has 551 places, 552 transitions, 1249 flow. Second operand 3 states and 1672 transitions. [2020-10-09 15:32:27,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 550 transitions, 1251 flow [2020-10-09 15:32:27,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 550 transitions, 1243 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:32:27,805 INFO L241 Difference]: Finished difference. Result has 551 places, 550 transitions, 1236 flow [2020-10-09 15:32:27,805 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=548, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1236, PETRI_PLACES=551, PETRI_TRANSITIONS=550} [2020-10-09 15:32:27,805 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 9 predicate places. [2020-10-09 15:32:27,805 INFO L481 AbstractCegarLoop]: Abstraction has has 551 places, 550 transitions, 1236 flow [2020-10-09 15:32:27,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:27,805 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:27,805 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:32:28,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 577 mathsat -unsat_core_generation=3 [2020-10-09 15:32:28,006 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:28,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:28,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1094415797, now seen corresponding path program 1 times [2020-10-09 15:32:28,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:28,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835862099] [2020-10-09 15:32:28,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 578 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 578 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:28,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:28,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:32:28,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:32:28,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835862099] [2020-10-09 15:32:28,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:28,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:28,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561335167] [2020-10-09 15:32:28,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:28,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:28,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:28,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:28,398 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:28,399 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 550 transitions, 1236 flow. Second operand 3 states. [2020-10-09 15:32:28,399 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:28,400 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:28,400 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:28,556 INFO L129 PetriNetUnfolder]: 54/619 cut-off events. [2020-10-09 15:32:28,556 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:32:28,585 INFO L80 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 619 events. 54/619 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2473 event pairs, 0 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 700. Up to 22 conditions per place. [2020-10-09 15:32:28,591 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 8 selfloop transitions, 1 changer transitions 0/548 dead transitions. [2020-10-09 15:32:28,592 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 548 transitions, 1249 flow [2020-10-09 15:32:28,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2020-10-09 15:32:28,593 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2020-10-09 15:32:28,593 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1660 transitions. [2020-10-09 15:32:28,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1660 transitions. [2020-10-09 15:32:28,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:28,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1660 transitions. [2020-10-09 15:32:28,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:28,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:28,595 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:28,595 INFO L185 Difference]: Start difference. First operand has 551 places, 550 transitions, 1236 flow. Second operand 3 states and 1660 transitions. [2020-10-09 15:32:28,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 548 transitions, 1249 flow [2020-10-09 15:32:28,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 548 transitions, 1248 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:28,600 INFO L241 Difference]: Finished difference. Result has 550 places, 548 transitions, 1232 flow [2020-10-09 15:32:28,600 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=548, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1232, PETRI_PLACES=550, PETRI_TRANSITIONS=548} [2020-10-09 15:32:28,600 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 8 predicate places. [2020-10-09 15:32:28,600 INFO L481 AbstractCegarLoop]: Abstraction has has 550 places, 548 transitions, 1232 flow [2020-10-09 15:32:28,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:28,600 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:28,600 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:32:28,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 578 mathsat -unsat_core_generation=3 [2020-10-09 15:32:28,801 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:28,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:28,802 INFO L82 PathProgramCache]: Analyzing trace with hash 2085346228, now seen corresponding path program 1 times [2020-10-09 15:32:28,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:28,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532361921] [2020-10-09 15:32:28,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 579 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 579 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:29,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:29,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:32:29,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:32:29,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532361921] [2020-10-09 15:32:29,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:29,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:29,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010552449] [2020-10-09 15:32:29,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:29,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:29,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:29,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:29,193 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 584 [2020-10-09 15:32:29,194 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 548 transitions, 1232 flow. Second operand 3 states. [2020-10-09 15:32:29,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:29,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 584 [2020-10-09 15:32:29,194 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:29,348 INFO L129 PetriNetUnfolder]: 52/624 cut-off events. [2020-10-09 15:32:29,349 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:32:29,376 INFO L80 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 624 events. 52/624 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2524 event pairs, 0 based on Foata normal form. 0/550 useless extension candidates. Maximal degree in co-relation 703. Up to 22 conditions per place. [2020-10-09 15:32:29,383 INFO L132 encePairwiseOnDemand]: 581/584 looper letters, 5 selfloop transitions, 2 changer transitions 0/549 dead transitions. [2020-10-09 15:32:29,383 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 549 transitions, 1248 flow [2020-10-09 15:32:29,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2020-10-09 15:32:29,384 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9549086757990868 [2020-10-09 15:32:29,385 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1673 transitions. [2020-10-09 15:32:29,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1673 transitions. [2020-10-09 15:32:29,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:29,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1673 transitions. [2020-10-09 15:32:29,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:29,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:29,386 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:29,386 INFO L185 Difference]: Start difference. First operand has 550 places, 548 transitions, 1232 flow. Second operand 3 states and 1673 transitions. [2020-10-09 15:32:29,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 549 transitions, 1248 flow [2020-10-09 15:32:29,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 549 transitions, 1247 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:29,391 INFO L241 Difference]: Finished difference. Result has 553 places, 549 transitions, 1245 flow [2020-10-09 15:32:29,392 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1245, PETRI_PLACES=553, PETRI_TRANSITIONS=549} [2020-10-09 15:32:29,392 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 11 predicate places. [2020-10-09 15:32:29,392 INFO L481 AbstractCegarLoop]: Abstraction has has 553 places, 549 transitions, 1245 flow [2020-10-09 15:32:29,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:29,392 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:29,392 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:32:29,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 579 mathsat -unsat_core_generation=3 [2020-10-09 15:32:29,593 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:29,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:29,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2085345205, now seen corresponding path program 1 times [2020-10-09 15:32:29,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:29,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569953274] [2020-10-09 15:32:29,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 580 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 580 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:29,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:29,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:32:29,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:32:29,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569953274] [2020-10-09 15:32:29,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:29,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:29,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389302501] [2020-10-09 15:32:29,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:29,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:29,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:29,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:30,002 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:30,003 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 549 transitions, 1245 flow. Second operand 3 states. [2020-10-09 15:32:30,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:30,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:30,004 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:30,163 INFO L129 PetriNetUnfolder]: 52/625 cut-off events. [2020-10-09 15:32:30,163 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:32:30,192 INFO L80 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 625 events. 52/625 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2531 event pairs, 0 based on Foata normal form. 0/551 useless extension candidates. Maximal degree in co-relation 711. Up to 22 conditions per place. [2020-10-09 15:32:30,199 INFO L132 encePairwiseOnDemand]: 580/584 looper letters, 9 selfloop transitions, 3 changer transitions 0/550 dead transitions. [2020-10-09 15:32:30,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 550 transitions, 1271 flow [2020-10-09 15:32:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2020-10-09 15:32:30,200 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9492009132420092 [2020-10-09 15:32:30,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1663 transitions. [2020-10-09 15:32:30,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1663 transitions. [2020-10-09 15:32:30,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:30,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1663 transitions. [2020-10-09 15:32:30,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:30,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:30,203 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:30,203 INFO L185 Difference]: Start difference. First operand has 553 places, 549 transitions, 1245 flow. Second operand 3 states and 1663 transitions. [2020-10-09 15:32:30,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 550 transitions, 1271 flow [2020-10-09 15:32:30,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 550 transitions, 1269 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:30,209 INFO L241 Difference]: Finished difference. Result has 556 places, 550 transitions, 1261 flow [2020-10-09 15:32:30,209 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1261, PETRI_PLACES=556, PETRI_TRANSITIONS=550} [2020-10-09 15:32:30,209 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 14 predicate places. [2020-10-09 15:32:30,209 INFO L481 AbstractCegarLoop]: Abstraction has has 556 places, 550 transitions, 1261 flow [2020-10-09 15:32:30,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:30,209 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:30,209 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:32:30,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 580 mathsat -unsat_core_generation=3 [2020-10-09 15:32:30,410 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:30,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:30,411 INFO L82 PathProgramCache]: Analyzing trace with hash 2086299540, now seen corresponding path program 1 times [2020-10-09 15:32:30,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:30,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391960891] [2020-10-09 15:32:30,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 581 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 581 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:30,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:30,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:32:30,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:32:30,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391960891] [2020-10-09 15:32:30,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:30,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:30,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931498097] [2020-10-09 15:32:30,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:30,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:30,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:30,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:30,808 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:30,809 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 550 transitions, 1261 flow. Second operand 3 states. [2020-10-09 15:32:30,809 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:30,809 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:30,809 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:30,976 INFO L129 PetriNetUnfolder]: 51/622 cut-off events. [2020-10-09 15:32:30,976 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2020-10-09 15:32:31,005 INFO L80 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 622 events. 51/622 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2514 event pairs, 0 based on Foata normal form. 2/552 useless extension candidates. Maximal degree in co-relation 710. Up to 22 conditions per place. [2020-10-09 15:32:31,011 INFO L132 encePairwiseOnDemand]: 581/584 looper letters, 9 selfloop transitions, 1 changer transitions 0/548 dead transitions. [2020-10-09 15:32:31,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 548 transitions, 1269 flow [2020-10-09 15:32:31,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:31,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1662 transitions. [2020-10-09 15:32:31,013 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9486301369863014 [2020-10-09 15:32:31,013 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1662 transitions. [2020-10-09 15:32:31,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1662 transitions. [2020-10-09 15:32:31,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:31,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1662 transitions. [2020-10-09 15:32:31,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:31,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:31,015 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:31,015 INFO L185 Difference]: Start difference. First operand has 556 places, 550 transitions, 1261 flow. Second operand 3 states and 1662 transitions. [2020-10-09 15:32:31,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 548 transitions, 1269 flow [2020-10-09 15:32:31,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 548 transitions, 1268 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:31,020 INFO L241 Difference]: Finished difference. Result has 557 places, 548 transitions, 1250 flow [2020-10-09 15:32:31,021 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1250, PETRI_PLACES=557, PETRI_TRANSITIONS=548} [2020-10-09 15:32:31,021 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 15 predicate places. [2020-10-09 15:32:31,021 INFO L481 AbstractCegarLoop]: Abstraction has has 557 places, 548 transitions, 1250 flow [2020-10-09 15:32:31,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:31,021 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:31,021 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:32:31,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 581 mathsat -unsat_core_generation=3 [2020-10-09 15:32:31,222 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:31,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:31,222 INFO L82 PathProgramCache]: Analyzing trace with hash 2086298517, now seen corresponding path program 1 times [2020-10-09 15:32:31,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:31,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590510426] [2020-10-09 15:32:31,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 582 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 582 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:31,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:32:31,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:32:31,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:32:31,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590510426] [2020-10-09 15:32:31,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:31,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:31,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280608583] [2020-10-09 15:32:31,655 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:31,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:31,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:31,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:31,668 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 584 [2020-10-09 15:32:31,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 548 transitions, 1250 flow. Second operand 3 states. [2020-10-09 15:32:31,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:31,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 584 [2020-10-09 15:32:31,669 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:31,825 INFO L129 PetriNetUnfolder]: 51/619 cut-off events. [2020-10-09 15:32:31,826 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:32:31,853 INFO L80 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 619 events. 51/619 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2490 event pairs, 0 based on Foata normal form. 1/549 useless extension candidates. Maximal degree in co-relation 704. Up to 22 conditions per place. [2020-10-09 15:32:31,859 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 4 selfloop transitions, 1 changer transitions 0/545 dead transitions. [2020-10-09 15:32:31,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 545 transitions, 1249 flow [2020-10-09 15:32:31,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:31,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2020-10-09 15:32:31,861 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9554794520547946 [2020-10-09 15:32:31,861 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2020-10-09 15:32:31,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2020-10-09 15:32:31,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:31,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2020-10-09 15:32:31,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:31,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:31,863 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:31,863 INFO L185 Difference]: Start difference. First operand has 557 places, 548 transitions, 1250 flow. Second operand 3 states and 1674 transitions. [2020-10-09 15:32:31,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 545 transitions, 1249 flow [2020-10-09 15:32:31,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 545 transitions, 1244 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:32:31,868 INFO L241 Difference]: Finished difference. Result has 554 places, 545 transitions, 1236 flow [2020-10-09 15:32:31,868 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1236, PETRI_PLACES=554, PETRI_TRANSITIONS=545} [2020-10-09 15:32:31,868 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 12 predicate places. [2020-10-09 15:32:31,868 INFO L481 AbstractCegarLoop]: Abstraction has has 554 places, 545 transitions, 1236 flow [2020-10-09 15:32:31,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:31,868 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:31,868 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:32,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 582 mathsat -unsat_core_generation=3 [2020-10-09 15:32:32,069 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:32,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:32,070 INFO L82 PathProgramCache]: Analyzing trace with hash 502863798, now seen corresponding path program 1 times [2020-10-09 15:32:32,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:32,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468951993] [2020-10-09 15:32:32,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 583 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 583 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:32,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:32,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:32:32,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:32:32,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468951993] [2020-10-09 15:32:32,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:32,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:32,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837888763] [2020-10-09 15:32:32,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:32,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:32,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:32,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:32,477 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:32,478 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 545 transitions, 1236 flow. Second operand 3 states. [2020-10-09 15:32:32,478 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:32,478 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:32,478 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:32,644 INFO L129 PetriNetUnfolder]: 50/627 cut-off events. [2020-10-09 15:32:32,644 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:32:32,674 INFO L80 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 627 events. 50/627 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2560 event pairs, 0 based on Foata normal form. 0/554 useless extension candidates. Maximal degree in co-relation 721. Up to 22 conditions per place. [2020-10-09 15:32:32,681 INFO L132 encePairwiseOnDemand]: 579/584 looper letters, 10 selfloop transitions, 3 changer transitions 0/547 dead transitions. [2020-10-09 15:32:32,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 547 transitions, 1266 flow [2020-10-09 15:32:32,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:32,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:32,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2020-10-09 15:32:32,682 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503424657534246 [2020-10-09 15:32:32,682 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1665 transitions. [2020-10-09 15:32:32,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1665 transitions. [2020-10-09 15:32:32,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:32,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1665 transitions. [2020-10-09 15:32:32,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:32,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:32,684 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:32,684 INFO L185 Difference]: Start difference. First operand has 554 places, 545 transitions, 1236 flow. Second operand 3 states and 1665 transitions. [2020-10-09 15:32:32,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 547 transitions, 1266 flow [2020-10-09 15:32:32,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 547 transitions, 1265 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:32,690 INFO L241 Difference]: Finished difference. Result has 557 places, 547 transitions, 1259 flow [2020-10-09 15:32:32,690 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1259, PETRI_PLACES=557, PETRI_TRANSITIONS=547} [2020-10-09 15:32:32,690 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 15 predicate places. [2020-10-09 15:32:32,690 INFO L481 AbstractCegarLoop]: Abstraction has has 557 places, 547 transitions, 1259 flow [2020-10-09 15:32:32,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:32,690 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:32,690 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:32,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 583 mathsat -unsat_core_generation=3 [2020-10-09 15:32:32,891 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:32,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:32,891 INFO L82 PathProgramCache]: Analyzing trace with hash 502864821, now seen corresponding path program 1 times [2020-10-09 15:32:32,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:32,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379429678] [2020-10-09 15:32:32,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 584 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 584 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:33,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:33,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:33,265 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:32:33,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:33,266 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:32:33,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379429678] [2020-10-09 15:32:33,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:33,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:33,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459465897] [2020-10-09 15:32:33,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:33,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:33,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:33,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:33,276 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 584 [2020-10-09 15:32:33,277 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 547 transitions, 1259 flow. Second operand 3 states. [2020-10-09 15:32:33,277 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:33,277 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 584 [2020-10-09 15:32:33,278 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:33,438 INFO L129 PetriNetUnfolder]: 49/625 cut-off events. [2020-10-09 15:32:33,438 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:32:33,468 INFO L80 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 625 events. 49/625 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2550 event pairs, 0 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 716. Up to 22 conditions per place. [2020-10-09 15:32:33,474 INFO L132 encePairwiseOnDemand]: 581/584 looper letters, 5 selfloop transitions, 2 changer transitions 0/547 dead transitions. [2020-10-09 15:32:33,475 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 547 transitions, 1271 flow [2020-10-09 15:32:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2020-10-09 15:32:33,476 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9549086757990868 [2020-10-09 15:32:33,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1673 transitions. [2020-10-09 15:32:33,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1673 transitions. [2020-10-09 15:32:33,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:33,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1673 transitions. [2020-10-09 15:32:33,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:33,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:33,478 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:33,478 INFO L185 Difference]: Start difference. First operand has 557 places, 547 transitions, 1259 flow. Second operand 3 states and 1673 transitions. [2020-10-09 15:32:33,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 547 transitions, 1271 flow [2020-10-09 15:32:33,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 547 transitions, 1266 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:33,483 INFO L241 Difference]: Finished difference. Result has 560 places, 547 transitions, 1264 flow [2020-10-09 15:32:33,483 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1264, PETRI_PLACES=560, PETRI_TRANSITIONS=547} [2020-10-09 15:32:33,484 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 18 predicate places. [2020-10-09 15:32:33,484 INFO L481 AbstractCegarLoop]: Abstraction has has 560 places, 547 transitions, 1264 flow [2020-10-09 15:32:33,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:33,484 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:33,484 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:33,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 584 mathsat -unsat_core_generation=3 [2020-10-09 15:32:33,685 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:33,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:33,685 INFO L82 PathProgramCache]: Analyzing trace with hash 503817110, now seen corresponding path program 1 times [2020-10-09 15:32:33,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:33,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311268649] [2020-10-09 15:32:33,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 585 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 585 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:34,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:32:34,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:34,062 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:32:34,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:34,064 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:32:34,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311268649] [2020-10-09 15:32:34,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:34,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:34,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835098746] [2020-10-09 15:32:34,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:34,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:34,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:34,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:34,086 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 584 [2020-10-09 15:32:34,087 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 547 transitions, 1264 flow. Second operand 3 states. [2020-10-09 15:32:34,087 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:34,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 584 [2020-10-09 15:32:34,087 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:34,244 INFO L129 PetriNetUnfolder]: 48/621 cut-off events. [2020-10-09 15:32:34,245 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:32:34,274 INFO L80 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 621 events. 48/621 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2523 event pairs, 0 based on Foata normal form. 1/554 useless extension candidates. Maximal degree in co-relation 712. Up to 22 conditions per place. [2020-10-09 15:32:34,280 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 4 selfloop transitions, 1 changer transitions 0/544 dead transitions. [2020-10-09 15:32:34,280 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 544 transitions, 1259 flow [2020-10-09 15:32:34,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2020-10-09 15:32:34,281 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9554794520547946 [2020-10-09 15:32:34,281 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2020-10-09 15:32:34,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2020-10-09 15:32:34,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:34,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2020-10-09 15:32:34,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:34,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:34,283 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:34,283 INFO L185 Difference]: Start difference. First operand has 560 places, 547 transitions, 1264 flow. Second operand 3 states and 1674 transitions. [2020-10-09 15:32:34,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 544 transitions, 1259 flow [2020-10-09 15:32:34,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 544 transitions, 1252 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:32:34,288 INFO L241 Difference]: Finished difference. Result has 559 places, 544 transitions, 1244 flow [2020-10-09 15:32:34,289 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1244, PETRI_PLACES=559, PETRI_TRANSITIONS=544} [2020-10-09 15:32:34,289 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 17 predicate places. [2020-10-09 15:32:34,289 INFO L481 AbstractCegarLoop]: Abstraction has has 559 places, 544 transitions, 1244 flow [2020-10-09 15:32:34,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:34,289 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:34,289 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:34,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 585 mathsat -unsat_core_generation=3 [2020-10-09 15:32:34,490 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:34,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:34,490 INFO L82 PathProgramCache]: Analyzing trace with hash 503818133, now seen corresponding path program 1 times [2020-10-09 15:32:34,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:34,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709501378] [2020-10-09 15:32:34,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 586 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 586 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:34,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:34,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:32:34,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:32:34,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709501378] [2020-10-09 15:32:34,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:34,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:34,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634712084] [2020-10-09 15:32:34,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:34,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:34,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:34,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:34,900 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:34,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 544 transitions, 1244 flow. Second operand 3 states. [2020-10-09 15:32:34,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:34,901 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:34,901 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:35,058 INFO L129 PetriNetUnfolder]: 48/619 cut-off events. [2020-10-09 15:32:35,058 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:32:35,086 INFO L80 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 619 events. 48/619 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2507 event pairs, 0 based on Foata normal form. 0/550 useless extension candidates. Maximal degree in co-relation 714. Up to 22 conditions per place. [2020-10-09 15:32:35,092 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 8 selfloop transitions, 1 changer transitions 0/542 dead transitions. [2020-10-09 15:32:35,093 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 542 transitions, 1257 flow [2020-10-09 15:32:35,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:35,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:35,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2020-10-09 15:32:35,094 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2020-10-09 15:32:35,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1660 transitions. [2020-10-09 15:32:35,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1660 transitions. [2020-10-09 15:32:35,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:35,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1660 transitions. [2020-10-09 15:32:35,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:35,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:35,096 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:35,096 INFO L185 Difference]: Start difference. First operand has 559 places, 544 transitions, 1244 flow. Second operand 3 states and 1660 transitions. [2020-10-09 15:32:35,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 542 transitions, 1257 flow [2020-10-09 15:32:35,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 542 transitions, 1256 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:35,101 INFO L241 Difference]: Finished difference. Result has 558 places, 542 transitions, 1240 flow [2020-10-09 15:32:35,101 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1240, PETRI_PLACES=558, PETRI_TRANSITIONS=542} [2020-10-09 15:32:35,101 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 16 predicate places. [2020-10-09 15:32:35,101 INFO L481 AbstractCegarLoop]: Abstraction has has 558 places, 542 transitions, 1240 flow [2020-10-09 15:32:35,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:35,101 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:35,101 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:35,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 586 mathsat -unsat_core_generation=3 [2020-10-09 15:32:35,302 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:35,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:35,302 INFO L82 PathProgramCache]: Analyzing trace with hash 768303896, now seen corresponding path program 1 times [2020-10-09 15:32:35,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:35,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81127998] [2020-10-09 15:32:35,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 587 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 587 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:35,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:32:35,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:32:35,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:35,717 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:32:35,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81127998] [2020-10-09 15:32:35,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:35,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:35,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926443350] [2020-10-09 15:32:35,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:35,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:35,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:35,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:35,738 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 584 [2020-10-09 15:32:35,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 542 transitions, 1240 flow. Second operand 3 states. [2020-10-09 15:32:35,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:35,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 584 [2020-10-09 15:32:35,739 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:35,896 INFO L129 PetriNetUnfolder]: 47/626 cut-off events. [2020-10-09 15:32:35,896 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:32:35,926 INFO L80 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 626 events. 47/626 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2566 event pairs, 0 based on Foata normal form. 1/559 useless extension candidates. Maximal degree in co-relation 717. Up to 22 conditions per place. [2020-10-09 15:32:35,931 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 4 selfloop transitions, 1 changer transitions 0/542 dead transitions. [2020-10-09 15:32:35,932 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 542 transitions, 1250 flow [2020-10-09 15:32:35,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:35,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2020-10-09 15:32:35,933 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9554794520547946 [2020-10-09 15:32:35,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2020-10-09 15:32:35,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2020-10-09 15:32:35,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:35,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2020-10-09 15:32:35,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:35,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:35,935 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:35,935 INFO L185 Difference]: Start difference. First operand has 558 places, 542 transitions, 1240 flow. Second operand 3 states and 1674 transitions. [2020-10-09 15:32:35,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 542 transitions, 1250 flow [2020-10-09 15:32:35,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 542 transitions, 1249 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:35,940 INFO L241 Difference]: Finished difference. Result has 560 places, 542 transitions, 1244 flow [2020-10-09 15:32:35,940 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1244, PETRI_PLACES=560, PETRI_TRANSITIONS=542} [2020-10-09 15:32:35,940 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 18 predicate places. [2020-10-09 15:32:35,940 INFO L481 AbstractCegarLoop]: Abstraction has has 560 places, 542 transitions, 1244 flow [2020-10-09 15:32:35,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:35,940 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:35,940 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:36,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 587 mathsat -unsat_core_generation=3 [2020-10-09 15:32:36,141 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:36,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:36,141 INFO L82 PathProgramCache]: Analyzing trace with hash 768304919, now seen corresponding path program 1 times [2020-10-09 15:32:36,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:36,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588467115] [2020-10-09 15:32:36,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 588 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 588 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:36,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:36,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:32:36,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:32:36,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588467115] [2020-10-09 15:32:36,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:36,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:36,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635649334] [2020-10-09 15:32:36,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:36,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:36,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:36,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:36,550 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:36,551 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 542 transitions, 1244 flow. Second operand 3 states. [2020-10-09 15:32:36,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:36,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:36,552 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:36,706 INFO L129 PetriNetUnfolder]: 45/628 cut-off events. [2020-10-09 15:32:36,706 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:32:36,733 INFO L80 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 628 events. 45/628 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2599 event pairs, 0 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 730. Up to 22 conditions per place. [2020-10-09 15:32:36,739 INFO L132 encePairwiseOnDemand]: 580/584 looper letters, 9 selfloop transitions, 3 changer transitions 0/543 dead transitions. [2020-10-09 15:32:36,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 543 transitions, 1270 flow [2020-10-09 15:32:36,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2020-10-09 15:32:36,740 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9492009132420092 [2020-10-09 15:32:36,740 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1663 transitions. [2020-10-09 15:32:36,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1663 transitions. [2020-10-09 15:32:36,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:36,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1663 transitions. [2020-10-09 15:32:36,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:36,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:36,742 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:36,742 INFO L185 Difference]: Start difference. First operand has 560 places, 542 transitions, 1244 flow. Second operand 3 states and 1663 transitions. [2020-10-09 15:32:36,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 543 transitions, 1270 flow [2020-10-09 15:32:36,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 543 transitions, 1269 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:36,747 INFO L241 Difference]: Finished difference. Result has 563 places, 543 transitions, 1261 flow [2020-10-09 15:32:36,747 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1261, PETRI_PLACES=563, PETRI_TRANSITIONS=543} [2020-10-09 15:32:36,747 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 21 predicate places. [2020-10-09 15:32:36,747 INFO L481 AbstractCegarLoop]: Abstraction has has 563 places, 543 transitions, 1261 flow [2020-10-09 15:32:36,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:36,747 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:36,747 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:36,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 588 mathsat -unsat_core_generation=3 [2020-10-09 15:32:36,948 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:36,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:36,949 INFO L82 PathProgramCache]: Analyzing trace with hash 767351607, now seen corresponding path program 1 times [2020-10-09 15:32:36,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:36,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530619666] [2020-10-09 15:32:36,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 589 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 589 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:37,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:37,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:32:37,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:32:37,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530619666] [2020-10-09 15:32:37,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:37,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:37,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973303137] [2020-10-09 15:32:37,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:37,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:37,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:37,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:37,346 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 584 [2020-10-09 15:32:37,347 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 543 transitions, 1261 flow. Second operand 3 states. [2020-10-09 15:32:37,347 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:37,347 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 584 [2020-10-09 15:32:37,347 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:37,498 INFO L129 PetriNetUnfolder]: 45/621 cut-off events. [2020-10-09 15:32:37,499 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:32:37,525 INFO L80 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 621 events. 45/621 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2543 event pairs, 0 based on Foata normal form. 1/557 useless extension candidates. Maximal degree in co-relation 716. Up to 22 conditions per place. [2020-10-09 15:32:37,530 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 5 selfloop transitions, 1 changer transitions 0/541 dead transitions. [2020-10-09 15:32:37,531 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 541 transitions, 1263 flow [2020-10-09 15:32:37,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:37,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2020-10-09 15:32:37,532 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.954337899543379 [2020-10-09 15:32:37,532 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2020-10-09 15:32:37,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2020-10-09 15:32:37,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:37,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2020-10-09 15:32:37,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:37,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:37,534 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:37,534 INFO L185 Difference]: Start difference. First operand has 563 places, 543 transitions, 1261 flow. Second operand 3 states and 1672 transitions. [2020-10-09 15:32:37,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 541 transitions, 1263 flow [2020-10-09 15:32:37,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 541 transitions, 1255 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:32:37,539 INFO L241 Difference]: Finished difference. Result has 563 places, 541 transitions, 1248 flow [2020-10-09 15:32:37,539 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1248, PETRI_PLACES=563, PETRI_TRANSITIONS=541} [2020-10-09 15:32:37,539 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 21 predicate places. [2020-10-09 15:32:37,539 INFO L481 AbstractCegarLoop]: Abstraction has has 563 places, 541 transitions, 1248 flow [2020-10-09 15:32:37,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:37,539 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:37,539 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:37,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 589 mathsat -unsat_core_generation=3 [2020-10-09 15:32:37,740 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:37,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:37,740 INFO L82 PathProgramCache]: Analyzing trace with hash 767350584, now seen corresponding path program 1 times [2020-10-09 15:32:37,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:37,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952694399] [2020-10-09 15:32:37,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 590 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 590 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:38,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:38,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:32:38,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:38,117 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:32:38,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952694399] [2020-10-09 15:32:38,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:38,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:38,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102120420] [2020-10-09 15:32:38,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:38,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:38,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:38,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:38,145 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:38,146 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 541 transitions, 1248 flow. Second operand 3 states. [2020-10-09 15:32:38,146 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:38,146 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:38,146 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:38,298 INFO L129 PetriNetUnfolder]: 45/619 cut-off events. [2020-10-09 15:32:38,299 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:32:38,325 INFO L80 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 619 events. 45/619 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2525 event pairs, 0 based on Foata normal form. 0/553 useless extension candidates. Maximal degree in co-relation 720. Up to 22 conditions per place. [2020-10-09 15:32:38,330 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 8 selfloop transitions, 1 changer transitions 0/539 dead transitions. [2020-10-09 15:32:38,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 539 transitions, 1261 flow [2020-10-09 15:32:38,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:38,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2020-10-09 15:32:38,332 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2020-10-09 15:32:38,332 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1660 transitions. [2020-10-09 15:32:38,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1660 transitions. [2020-10-09 15:32:38,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:38,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1660 transitions. [2020-10-09 15:32:38,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:38,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:38,334 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:38,334 INFO L185 Difference]: Start difference. First operand has 563 places, 541 transitions, 1248 flow. Second operand 3 states and 1660 transitions. [2020-10-09 15:32:38,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 539 transitions, 1261 flow [2020-10-09 15:32:38,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 539 transitions, 1260 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:38,339 INFO L241 Difference]: Finished difference. Result has 562 places, 539 transitions, 1244 flow [2020-10-09 15:32:38,339 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1244, PETRI_PLACES=562, PETRI_TRANSITIONS=539} [2020-10-09 15:32:38,339 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 20 predicate places. [2020-10-09 15:32:38,339 INFO L481 AbstractCegarLoop]: Abstraction has has 562 places, 539 transitions, 1244 flow [2020-10-09 15:32:38,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:38,339 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:38,339 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:38,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 590 mathsat -unsat_core_generation=3 [2020-10-09 15:32:38,540 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:38,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:38,540 INFO L82 PathProgramCache]: Analyzing trace with hash -585983589, now seen corresponding path program 1 times [2020-10-09 15:32:38,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:38,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892704040] [2020-10-09 15:32:38,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 591 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 591 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:38,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:32:38,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:32:38,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:32:38,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892704040] [2020-10-09 15:32:38,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:38,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:38,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269189654] [2020-10-09 15:32:38,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:38,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:38,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:38,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:38,938 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 584 [2020-10-09 15:32:38,939 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 539 transitions, 1244 flow. Second operand 3 states. [2020-10-09 15:32:38,940 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:38,940 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 584 [2020-10-09 15:32:38,940 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:39,103 INFO L129 PetriNetUnfolder]: 44/626 cut-off events. [2020-10-09 15:32:39,104 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:32:39,132 INFO L80 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 626 events. 44/626 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2586 event pairs, 0 based on Foata normal form. 1/562 useless extension candidates. Maximal degree in co-relation 723. Up to 22 conditions per place. [2020-10-09 15:32:39,138 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 4 selfloop transitions, 1 changer transitions 0/539 dead transitions. [2020-10-09 15:32:39,138 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 539 transitions, 1254 flow [2020-10-09 15:32:39,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2020-10-09 15:32:39,139 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9554794520547946 [2020-10-09 15:32:39,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2020-10-09 15:32:39,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2020-10-09 15:32:39,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:39,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2020-10-09 15:32:39,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:39,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:39,141 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:39,141 INFO L185 Difference]: Start difference. First operand has 562 places, 539 transitions, 1244 flow. Second operand 3 states and 1674 transitions. [2020-10-09 15:32:39,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 539 transitions, 1254 flow [2020-10-09 15:32:39,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 539 transitions, 1253 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:39,146 INFO L241 Difference]: Finished difference. Result has 564 places, 539 transitions, 1248 flow [2020-10-09 15:32:39,147 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1248, PETRI_PLACES=564, PETRI_TRANSITIONS=539} [2020-10-09 15:32:39,147 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 22 predicate places. [2020-10-09 15:32:39,147 INFO L481 AbstractCegarLoop]: Abstraction has has 564 places, 539 transitions, 1248 flow [2020-10-09 15:32:39,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:39,147 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:39,147 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:39,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 591 mathsat -unsat_core_generation=3 [2020-10-09 15:32:39,348 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:39,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:39,348 INFO L82 PathProgramCache]: Analyzing trace with hash -585982566, now seen corresponding path program 1 times [2020-10-09 15:32:39,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:39,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872180453] [2020-10-09 15:32:39,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 592 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 592 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:39,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:39,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:32:39,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:32:39,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872180453] [2020-10-09 15:32:39,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:39,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:39,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041243532] [2020-10-09 15:32:39,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:39,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:39,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:39,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:39,817 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:39,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 539 transitions, 1248 flow. Second operand 3 states. [2020-10-09 15:32:39,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:39,819 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:39,819 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:39,987 INFO L129 PetriNetUnfolder]: 42/628 cut-off events. [2020-10-09 15:32:39,987 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:32:40,016 INFO L80 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 628 events. 42/628 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2613 event pairs, 0 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 736. Up to 22 conditions per place. [2020-10-09 15:32:40,021 INFO L132 encePairwiseOnDemand]: 580/584 looper letters, 9 selfloop transitions, 3 changer transitions 0/540 dead transitions. [2020-10-09 15:32:40,022 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 540 transitions, 1274 flow [2020-10-09 15:32:40,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:40,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2020-10-09 15:32:40,023 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9492009132420092 [2020-10-09 15:32:40,023 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1663 transitions. [2020-10-09 15:32:40,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1663 transitions. [2020-10-09 15:32:40,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:40,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1663 transitions. [2020-10-09 15:32:40,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:40,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:40,025 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:40,025 INFO L185 Difference]: Start difference. First operand has 564 places, 539 transitions, 1248 flow. Second operand 3 states and 1663 transitions. [2020-10-09 15:32:40,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 540 transitions, 1274 flow [2020-10-09 15:32:40,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 540 transitions, 1273 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:40,030 INFO L241 Difference]: Finished difference. Result has 567 places, 540 transitions, 1265 flow [2020-10-09 15:32:40,030 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1265, PETRI_PLACES=567, PETRI_TRANSITIONS=540} [2020-10-09 15:32:40,030 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 25 predicate places. [2020-10-09 15:32:40,030 INFO L481 AbstractCegarLoop]: Abstraction has has 567 places, 540 transitions, 1265 flow [2020-10-09 15:32:40,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:40,030 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:40,031 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:40,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 592 mathsat -unsat_core_generation=3 [2020-10-09 15:32:40,231 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:40,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:40,232 INFO L82 PathProgramCache]: Analyzing trace with hash -586935878, now seen corresponding path program 1 times [2020-10-09 15:32:40,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:40,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670085520] [2020-10-09 15:32:40,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 593 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 593 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:40,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:40,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:32:40,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:32:40,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670085520] [2020-10-09 15:32:40,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:40,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:40,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481098067] [2020-10-09 15:32:40,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:40,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:40,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:40,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:40,622 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 584 [2020-10-09 15:32:40,623 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 540 transitions, 1265 flow. Second operand 3 states. [2020-10-09 15:32:40,624 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:40,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 584 [2020-10-09 15:32:40,624 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:40,783 INFO L129 PetriNetUnfolder]: 42/621 cut-off events. [2020-10-09 15:32:40,784 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:32:40,812 INFO L80 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 621 events. 42/621 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2558 event pairs, 0 based on Foata normal form. 1/560 useless extension candidates. Maximal degree in co-relation 722. Up to 22 conditions per place. [2020-10-09 15:32:40,817 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 5 selfloop transitions, 1 changer transitions 0/538 dead transitions. [2020-10-09 15:32:40,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 538 transitions, 1267 flow [2020-10-09 15:32:40,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2020-10-09 15:32:40,819 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.954337899543379 [2020-10-09 15:32:40,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2020-10-09 15:32:40,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2020-10-09 15:32:40,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:40,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2020-10-09 15:32:40,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:40,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:40,820 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:40,820 INFO L185 Difference]: Start difference. First operand has 567 places, 540 transitions, 1265 flow. Second operand 3 states and 1672 transitions. [2020-10-09 15:32:40,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 538 transitions, 1267 flow [2020-10-09 15:32:40,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 538 transitions, 1259 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:32:40,826 INFO L241 Difference]: Finished difference. Result has 567 places, 538 transitions, 1252 flow [2020-10-09 15:32:40,826 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1252, PETRI_PLACES=567, PETRI_TRANSITIONS=538} [2020-10-09 15:32:40,826 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 25 predicate places. [2020-10-09 15:32:40,826 INFO L481 AbstractCegarLoop]: Abstraction has has 567 places, 538 transitions, 1252 flow [2020-10-09 15:32:40,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:40,826 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:40,826 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:41,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 593 mathsat -unsat_core_generation=3 [2020-10-09 15:32:41,027 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:41,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:41,027 INFO L82 PathProgramCache]: Analyzing trace with hash -586936901, now seen corresponding path program 1 times [2020-10-09 15:32:41,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:41,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375950071] [2020-10-09 15:32:41,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 594 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 594 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:41,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:41,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:32:41,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:32:41,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375950071] [2020-10-09 15:32:41,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:41,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:41,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865769086] [2020-10-09 15:32:41,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:41,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:41,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:41,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:41,425 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:41,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 538 transitions, 1252 flow. Second operand 3 states. [2020-10-09 15:32:41,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:41,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:41,426 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:41,591 INFO L129 PetriNetUnfolder]: 42/619 cut-off events. [2020-10-09 15:32:41,591 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:32:41,620 INFO L80 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 619 events. 42/619 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2542 event pairs, 0 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 726. Up to 22 conditions per place. [2020-10-09 15:32:41,625 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 8 selfloop transitions, 1 changer transitions 0/536 dead transitions. [2020-10-09 15:32:41,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 536 transitions, 1265 flow [2020-10-09 15:32:41,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2020-10-09 15:32:41,627 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2020-10-09 15:32:41,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1660 transitions. [2020-10-09 15:32:41,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1660 transitions. [2020-10-09 15:32:41,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:41,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1660 transitions. [2020-10-09 15:32:41,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:41,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:41,629 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:41,629 INFO L185 Difference]: Start difference. First operand has 567 places, 538 transitions, 1252 flow. Second operand 3 states and 1660 transitions. [2020-10-09 15:32:41,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 536 transitions, 1265 flow [2020-10-09 15:32:41,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 536 transitions, 1264 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:41,634 INFO L241 Difference]: Finished difference. Result has 566 places, 536 transitions, 1248 flow [2020-10-09 15:32:41,634 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1248, PETRI_PLACES=566, PETRI_TRANSITIONS=536} [2020-10-09 15:32:41,634 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 24 predicate places. [2020-10-09 15:32:41,634 INFO L481 AbstractCegarLoop]: Abstraction has has 566 places, 536 transitions, 1248 flow [2020-10-09 15:32:41,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:41,634 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:41,634 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:41,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 594 mathsat -unsat_core_generation=3 [2020-10-09 15:32:41,835 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:41,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:41,836 INFO L82 PathProgramCache]: Analyzing trace with hash -198754657, now seen corresponding path program 1 times [2020-10-09 15:32:41,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:41,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977506236] [2020-10-09 15:32:41,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 595 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 595 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:42,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:32:42,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:32:42,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:32:42,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977506236] [2020-10-09 15:32:42,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:42,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:42,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069402786] [2020-10-09 15:32:42,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:42,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:42,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:42,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:42,243 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 584 [2020-10-09 15:32:42,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 536 transitions, 1248 flow. Second operand 3 states. [2020-10-09 15:32:42,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:42,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 584 [2020-10-09 15:32:42,245 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:42,414 INFO L129 PetriNetUnfolder]: 41/626 cut-off events. [2020-10-09 15:32:42,415 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:32:42,445 INFO L80 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 626 events. 41/626 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2601 event pairs, 0 based on Foata normal form. 1/565 useless extension candidates. Maximal degree in co-relation 729. Up to 22 conditions per place. [2020-10-09 15:32:42,450 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 4 selfloop transitions, 1 changer transitions 0/536 dead transitions. [2020-10-09 15:32:42,450 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 536 transitions, 1258 flow [2020-10-09 15:32:42,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2020-10-09 15:32:42,452 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9554794520547946 [2020-10-09 15:32:42,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2020-10-09 15:32:42,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2020-10-09 15:32:42,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:42,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2020-10-09 15:32:42,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:42,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:42,454 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:42,454 INFO L185 Difference]: Start difference. First operand has 566 places, 536 transitions, 1248 flow. Second operand 3 states and 1674 transitions. [2020-10-09 15:32:42,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 536 transitions, 1258 flow [2020-10-09 15:32:42,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 536 transitions, 1257 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:42,459 INFO L241 Difference]: Finished difference. Result has 568 places, 536 transitions, 1252 flow [2020-10-09 15:32:42,460 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1252, PETRI_PLACES=568, PETRI_TRANSITIONS=536} [2020-10-09 15:32:42,460 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 26 predicate places. [2020-10-09 15:32:42,460 INFO L481 AbstractCegarLoop]: Abstraction has has 568 places, 536 transitions, 1252 flow [2020-10-09 15:32:42,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:42,460 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:42,460 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:42,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 595 mathsat -unsat_core_generation=3 [2020-10-09 15:32:42,661 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:42,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:42,661 INFO L82 PathProgramCache]: Analyzing trace with hash -198753634, now seen corresponding path program 1 times [2020-10-09 15:32:42,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:42,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432539093] [2020-10-09 15:32:42,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 596 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 596 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:43,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:43,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:43,046 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:32:43,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:32:43,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432539093] [2020-10-09 15:32:43,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:43,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:43,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065115152] [2020-10-09 15:32:43,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:43,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:43,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:43,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:43,085 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:43,086 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 536 transitions, 1252 flow. Second operand 3 states. [2020-10-09 15:32:43,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:43,086 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:43,086 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:43,262 INFO L129 PetriNetUnfolder]: 39/628 cut-off events. [2020-10-09 15:32:43,262 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:32:43,294 INFO L80 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 628 events. 39/628 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2634 event pairs, 0 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 742. Up to 22 conditions per place. [2020-10-09 15:32:43,299 INFO L132 encePairwiseOnDemand]: 580/584 looper letters, 9 selfloop transitions, 3 changer transitions 0/537 dead transitions. [2020-10-09 15:32:43,300 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 537 transitions, 1278 flow [2020-10-09 15:32:43,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2020-10-09 15:32:43,301 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9492009132420092 [2020-10-09 15:32:43,301 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1663 transitions. [2020-10-09 15:32:43,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1663 transitions. [2020-10-09 15:32:43,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:43,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1663 transitions. [2020-10-09 15:32:43,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:43,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:43,303 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:43,303 INFO L185 Difference]: Start difference. First operand has 568 places, 536 transitions, 1252 flow. Second operand 3 states and 1663 transitions. [2020-10-09 15:32:43,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 537 transitions, 1278 flow [2020-10-09 15:32:43,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 537 transitions, 1277 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:43,308 INFO L241 Difference]: Finished difference. Result has 571 places, 537 transitions, 1269 flow [2020-10-09 15:32:43,309 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1251, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1269, PETRI_PLACES=571, PETRI_TRANSITIONS=537} [2020-10-09 15:32:43,309 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 29 predicate places. [2020-10-09 15:32:43,309 INFO L481 AbstractCegarLoop]: Abstraction has has 571 places, 537 transitions, 1269 flow [2020-10-09 15:32:43,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:43,309 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:43,309 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:43,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 596 mathsat -unsat_core_generation=3 [2020-10-09 15:32:43,510 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:43,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:43,510 INFO L82 PathProgramCache]: Analyzing trace with hash -199706946, now seen corresponding path program 1 times [2020-10-09 15:32:43,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:43,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117535297] [2020-10-09 15:32:43,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 597 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 597 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:43,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:43,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:32:43,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:43,932 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:32:43,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117535297] [2020-10-09 15:32:43,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:43,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:43,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700887927] [2020-10-09 15:32:43,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:43,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:43,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:43,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:43,944 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 584 [2020-10-09 15:32:43,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 537 transitions, 1269 flow. Second operand 3 states. [2020-10-09 15:32:43,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:43,945 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 584 [2020-10-09 15:32:43,945 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:44,109 INFO L129 PetriNetUnfolder]: 39/621 cut-off events. [2020-10-09 15:32:44,110 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:32:44,139 INFO L80 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 621 events. 39/621 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2578 event pairs, 0 based on Foata normal form. 1/563 useless extension candidates. Maximal degree in co-relation 728. Up to 22 conditions per place. [2020-10-09 15:32:44,143 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 5 selfloop transitions, 1 changer transitions 0/535 dead transitions. [2020-10-09 15:32:44,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 535 transitions, 1271 flow [2020-10-09 15:32:44,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:44,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2020-10-09 15:32:44,145 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.954337899543379 [2020-10-09 15:32:44,145 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2020-10-09 15:32:44,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2020-10-09 15:32:44,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:44,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2020-10-09 15:32:44,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:44,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:44,147 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:44,147 INFO L185 Difference]: Start difference. First operand has 571 places, 537 transitions, 1269 flow. Second operand 3 states and 1672 transitions. [2020-10-09 15:32:44,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 535 transitions, 1271 flow [2020-10-09 15:32:44,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 535 transitions, 1263 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:32:44,152 INFO L241 Difference]: Finished difference. Result has 571 places, 535 transitions, 1256 flow [2020-10-09 15:32:44,152 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1251, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1256, PETRI_PLACES=571, PETRI_TRANSITIONS=535} [2020-10-09 15:32:44,152 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 29 predicate places. [2020-10-09 15:32:44,152 INFO L481 AbstractCegarLoop]: Abstraction has has 571 places, 535 transitions, 1256 flow [2020-10-09 15:32:44,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:44,152 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:44,152 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:44,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 597 mathsat -unsat_core_generation=3 [2020-10-09 15:32:44,353 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:44,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:44,354 INFO L82 PathProgramCache]: Analyzing trace with hash -199707969, now seen corresponding path program 1 times [2020-10-09 15:32:44,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:44,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683323391] [2020-10-09 15:32:44,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 598 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 598 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:44,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:44,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:32:44,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:32:44,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683323391] [2020-10-09 15:32:44,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:44,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:44,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261824271] [2020-10-09 15:32:44,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:44,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:44,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:44,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:44,754 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:44,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 535 transitions, 1256 flow. Second operand 3 states. [2020-10-09 15:32:44,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:44,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:44,756 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:44,922 INFO L129 PetriNetUnfolder]: 39/619 cut-off events. [2020-10-09 15:32:44,922 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:32:44,951 INFO L80 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 619 events. 39/619 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2560 event pairs, 0 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 732. Up to 22 conditions per place. [2020-10-09 15:32:44,955 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 8 selfloop transitions, 1 changer transitions 0/533 dead transitions. [2020-10-09 15:32:44,956 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 533 transitions, 1269 flow [2020-10-09 15:32:44,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:44,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:44,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2020-10-09 15:32:44,957 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2020-10-09 15:32:44,957 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1660 transitions. [2020-10-09 15:32:44,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1660 transitions. [2020-10-09 15:32:44,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:44,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1660 transitions. [2020-10-09 15:32:44,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:44,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:44,959 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:44,959 INFO L185 Difference]: Start difference. First operand has 571 places, 535 transitions, 1256 flow. Second operand 3 states and 1660 transitions. [2020-10-09 15:32:44,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 533 transitions, 1269 flow [2020-10-09 15:32:44,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 533 transitions, 1268 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:44,964 INFO L241 Difference]: Finished difference. Result has 570 places, 533 transitions, 1252 flow [2020-10-09 15:32:44,964 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1252, PETRI_PLACES=570, PETRI_TRANSITIONS=533} [2020-10-09 15:32:44,965 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 28 predicate places. [2020-10-09 15:32:44,965 INFO L481 AbstractCegarLoop]: Abstraction has has 570 places, 533 transitions, 1252 flow [2020-10-09 15:32:44,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:44,965 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:44,965 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:45,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 598 mathsat -unsat_core_generation=3 [2020-10-09 15:32:45,166 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:45,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:45,166 INFO L82 PathProgramCache]: Analyzing trace with hash -604236380, now seen corresponding path program 1 times [2020-10-09 15:32:45,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:45,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325912326] [2020-10-09 15:32:45,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 599 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 599 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:45,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:32:45,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:32:45,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:32:45,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325912326] [2020-10-09 15:32:45,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:45,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:45,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641932467] [2020-10-09 15:32:45,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:45,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:45,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:45,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:45,565 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 584 [2020-10-09 15:32:45,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 533 transitions, 1252 flow. Second operand 3 states. [2020-10-09 15:32:45,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:45,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 584 [2020-10-09 15:32:45,567 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:45,734 INFO L129 PetriNetUnfolder]: 38/626 cut-off events. [2020-10-09 15:32:45,734 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:32:45,763 INFO L80 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 626 events. 38/626 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2620 event pairs, 0 based on Foata normal form. 1/568 useless extension candidates. Maximal degree in co-relation 735. Up to 22 conditions per place. [2020-10-09 15:32:45,768 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 4 selfloop transitions, 1 changer transitions 0/533 dead transitions. [2020-10-09 15:32:45,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 533 transitions, 1262 flow [2020-10-09 15:32:45,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2020-10-09 15:32:45,769 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9554794520547946 [2020-10-09 15:32:45,769 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2020-10-09 15:32:45,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2020-10-09 15:32:45,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:45,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2020-10-09 15:32:45,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:45,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:45,771 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:45,771 INFO L185 Difference]: Start difference. First operand has 570 places, 533 transitions, 1252 flow. Second operand 3 states and 1674 transitions. [2020-10-09 15:32:45,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 533 transitions, 1262 flow [2020-10-09 15:32:45,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 533 transitions, 1261 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:45,776 INFO L241 Difference]: Finished difference. Result has 572 places, 533 transitions, 1256 flow [2020-10-09 15:32:45,777 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1251, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1256, PETRI_PLACES=572, PETRI_TRANSITIONS=533} [2020-10-09 15:32:45,777 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 30 predicate places. [2020-10-09 15:32:45,777 INFO L481 AbstractCegarLoop]: Abstraction has has 572 places, 533 transitions, 1256 flow [2020-10-09 15:32:45,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:45,777 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:45,777 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:45,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 599 mathsat -unsat_core_generation=3 [2020-10-09 15:32:45,978 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:45,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:45,978 INFO L82 PathProgramCache]: Analyzing trace with hash -604235357, now seen corresponding path program 1 times [2020-10-09 15:32:45,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:45,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932957598] [2020-10-09 15:32:45,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 600 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 600 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:46,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:46,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:32:46,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:32:46,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932957598] [2020-10-09 15:32:46,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:46,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:46,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983465536] [2020-10-09 15:32:46,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:46,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:46,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:46,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:46,397 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:46,397 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 533 transitions, 1256 flow. Second operand 3 states. [2020-10-09 15:32:46,398 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:46,398 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:46,398 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:46,569 INFO L129 PetriNetUnfolder]: 36/628 cut-off events. [2020-10-09 15:32:46,569 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:32:46,598 INFO L80 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 628 events. 36/628 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2648 event pairs, 0 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 748. Up to 22 conditions per place. [2020-10-09 15:32:46,602 INFO L132 encePairwiseOnDemand]: 580/584 looper letters, 9 selfloop transitions, 3 changer transitions 0/534 dead transitions. [2020-10-09 15:32:46,603 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 534 transitions, 1282 flow [2020-10-09 15:32:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2020-10-09 15:32:46,604 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9492009132420092 [2020-10-09 15:32:46,604 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1663 transitions. [2020-10-09 15:32:46,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1663 transitions. [2020-10-09 15:32:46,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:46,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1663 transitions. [2020-10-09 15:32:46,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:46,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:46,606 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:46,606 INFO L185 Difference]: Start difference. First operand has 572 places, 533 transitions, 1256 flow. Second operand 3 states and 1663 transitions. [2020-10-09 15:32:46,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 534 transitions, 1282 flow [2020-10-09 15:32:46,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 534 transitions, 1281 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:46,611 INFO L241 Difference]: Finished difference. Result has 575 places, 534 transitions, 1273 flow [2020-10-09 15:32:46,611 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1273, PETRI_PLACES=575, PETRI_TRANSITIONS=534} [2020-10-09 15:32:46,611 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 33 predicate places. [2020-10-09 15:32:46,611 INFO L481 AbstractCegarLoop]: Abstraction has has 575 places, 534 transitions, 1273 flow [2020-10-09 15:32:46,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:46,611 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:46,612 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:46,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 600 mathsat -unsat_core_generation=3 [2020-10-09 15:32:46,812 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:46,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:46,813 INFO L82 PathProgramCache]: Analyzing trace with hash -605188669, now seen corresponding path program 1 times [2020-10-09 15:32:46,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:46,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34519648] [2020-10-09 15:32:46,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 601 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 601 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:47,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:47,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:32:47,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:32:47,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34519648] [2020-10-09 15:32:47,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:47,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:47,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987278381] [2020-10-09 15:32:47,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:47,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:47,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:47,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:47,215 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 584 [2020-10-09 15:32:47,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 534 transitions, 1273 flow. Second operand 3 states. [2020-10-09 15:32:47,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:47,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 584 [2020-10-09 15:32:47,216 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:47,392 INFO L129 PetriNetUnfolder]: 36/621 cut-off events. [2020-10-09 15:32:47,393 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:32:47,424 INFO L80 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 621 events. 36/621 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2593 event pairs, 0 based on Foata normal form. 1/566 useless extension candidates. Maximal degree in co-relation 734. Up to 22 conditions per place. [2020-10-09 15:32:47,428 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 5 selfloop transitions, 1 changer transitions 0/532 dead transitions. [2020-10-09 15:32:47,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 532 transitions, 1275 flow [2020-10-09 15:32:47,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2020-10-09 15:32:47,430 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.954337899543379 [2020-10-09 15:32:47,430 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2020-10-09 15:32:47,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2020-10-09 15:32:47,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:47,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2020-10-09 15:32:47,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:47,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:47,432 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:47,432 INFO L185 Difference]: Start difference. First operand has 575 places, 534 transitions, 1273 flow. Second operand 3 states and 1672 transitions. [2020-10-09 15:32:47,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 532 transitions, 1275 flow [2020-10-09 15:32:47,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 532 transitions, 1267 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:32:47,438 INFO L241 Difference]: Finished difference. Result has 575 places, 532 transitions, 1260 flow [2020-10-09 15:32:47,438 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1260, PETRI_PLACES=575, PETRI_TRANSITIONS=532} [2020-10-09 15:32:47,438 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 33 predicate places. [2020-10-09 15:32:47,438 INFO L481 AbstractCegarLoop]: Abstraction has has 575 places, 532 transitions, 1260 flow [2020-10-09 15:32:47,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:47,439 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:47,439 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:47,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 601 mathsat -unsat_core_generation=3 [2020-10-09 15:32:47,639 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:47,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:47,640 INFO L82 PathProgramCache]: Analyzing trace with hash -605189692, now seen corresponding path program 1 times [2020-10-09 15:32:47,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:47,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943087259] [2020-10-09 15:32:47,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 602 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 602 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:48,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:48,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:32:48,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:32:48,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943087259] [2020-10-09 15:32:48,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:48,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:48,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328557614] [2020-10-09 15:32:48,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:48,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:48,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:48,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:48,073 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:48,074 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 532 transitions, 1260 flow. Second operand 3 states. [2020-10-09 15:32:48,074 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:48,074 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:48,075 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:48,284 INFO L129 PetriNetUnfolder]: 36/619 cut-off events. [2020-10-09 15:32:48,284 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:32:48,312 INFO L80 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 619 events. 36/619 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2576 event pairs, 0 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 738. Up to 22 conditions per place. [2020-10-09 15:32:48,316 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 8 selfloop transitions, 1 changer transitions 0/530 dead transitions. [2020-10-09 15:32:48,316 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 530 transitions, 1273 flow [2020-10-09 15:32:48,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:48,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2020-10-09 15:32:48,317 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2020-10-09 15:32:48,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1660 transitions. [2020-10-09 15:32:48,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1660 transitions. [2020-10-09 15:32:48,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:48,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1660 transitions. [2020-10-09 15:32:48,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:48,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:48,319 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:48,319 INFO L185 Difference]: Start difference. First operand has 575 places, 532 transitions, 1260 flow. Second operand 3 states and 1660 transitions. [2020-10-09 15:32:48,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 530 transitions, 1273 flow [2020-10-09 15:32:48,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 530 transitions, 1272 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:48,325 INFO L241 Difference]: Finished difference. Result has 574 places, 530 transitions, 1256 flow [2020-10-09 15:32:48,325 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1256, PETRI_PLACES=574, PETRI_TRANSITIONS=530} [2020-10-09 15:32:48,325 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 32 predicate places. [2020-10-09 15:32:48,325 INFO L481 AbstractCegarLoop]: Abstraction has has 574 places, 530 transitions, 1256 flow [2020-10-09 15:32:48,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:48,325 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:48,325 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:48,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 602 mathsat -unsat_core_generation=3 [2020-10-09 15:32:48,526 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:48,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:48,527 INFO L82 PathProgramCache]: Analyzing trace with hash -318975414, now seen corresponding path program 1 times [2020-10-09 15:32:48,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:48,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299758938] [2020-10-09 15:32:48,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 603 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 603 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:48,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:48,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:32:48,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:32:48,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299758938] [2020-10-09 15:32:48,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:48,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:48,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944713010] [2020-10-09 15:32:48,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:48,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:48,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:48,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:48,944 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:48,945 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 530 transitions, 1256 flow. Second operand 3 states. [2020-10-09 15:32:48,946 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:48,946 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:48,946 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:49,122 INFO L129 PetriNetUnfolder]: 35/627 cut-off events. [2020-10-09 15:32:49,122 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:32:49,152 INFO L80 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 627 events. 35/627 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2646 event pairs, 0 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 750. Up to 22 conditions per place. [2020-10-09 15:32:49,156 INFO L132 encePairwiseOnDemand]: 579/584 looper letters, 10 selfloop transitions, 3 changer transitions 0/532 dead transitions. [2020-10-09 15:32:49,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 532 transitions, 1286 flow [2020-10-09 15:32:49,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2020-10-09 15:32:49,158 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503424657534246 [2020-10-09 15:32:49,158 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1665 transitions. [2020-10-09 15:32:49,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1665 transitions. [2020-10-09 15:32:49,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:49,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1665 transitions. [2020-10-09 15:32:49,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:49,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:49,160 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:49,160 INFO L185 Difference]: Start difference. First operand has 574 places, 530 transitions, 1256 flow. Second operand 3 states and 1665 transitions. [2020-10-09 15:32:49,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 532 transitions, 1286 flow [2020-10-09 15:32:49,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 532 transitions, 1285 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:49,165 INFO L241 Difference]: Finished difference. Result has 577 places, 532 transitions, 1279 flow [2020-10-09 15:32:49,165 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1279, PETRI_PLACES=577, PETRI_TRANSITIONS=532} [2020-10-09 15:32:49,165 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 35 predicate places. [2020-10-09 15:32:49,165 INFO L481 AbstractCegarLoop]: Abstraction has has 577 places, 532 transitions, 1279 flow [2020-10-09 15:32:49,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:49,165 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:49,166 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:49,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 603 mathsat -unsat_core_generation=3 [2020-10-09 15:32:49,366 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:49,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:49,367 INFO L82 PathProgramCache]: Analyzing trace with hash -318974391, now seen corresponding path program 1 times [2020-10-09 15:32:49,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:49,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016500490] [2020-10-09 15:32:49,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 604 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 604 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:49,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:49,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:32:49,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:32:49,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016500490] [2020-10-09 15:32:49,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:49,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:49,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954749599] [2020-10-09 15:32:49,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:49,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:49,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:49,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:49,763 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 584 [2020-10-09 15:32:49,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 532 transitions, 1279 flow. Second operand 3 states. [2020-10-09 15:32:49,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:49,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 584 [2020-10-09 15:32:49,764 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:49,937 INFO L129 PetriNetUnfolder]: 34/625 cut-off events. [2020-10-09 15:32:49,937 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:32:49,968 INFO L80 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 625 events. 34/625 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2634 event pairs, 0 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 747. Up to 22 conditions per place. [2020-10-09 15:32:49,973 INFO L132 encePairwiseOnDemand]: 581/584 looper letters, 5 selfloop transitions, 2 changer transitions 0/532 dead transitions. [2020-10-09 15:32:49,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 532 transitions, 1291 flow [2020-10-09 15:32:49,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2020-10-09 15:32:49,974 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9549086757990868 [2020-10-09 15:32:49,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1673 transitions. [2020-10-09 15:32:49,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1673 transitions. [2020-10-09 15:32:49,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:49,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1673 transitions. [2020-10-09 15:32:49,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:49,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:49,976 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:49,976 INFO L185 Difference]: Start difference. First operand has 577 places, 532 transitions, 1279 flow. Second operand 3 states and 1673 transitions. [2020-10-09 15:32:49,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 579 places, 532 transitions, 1291 flow [2020-10-09 15:32:49,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 532 transitions, 1286 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:49,981 INFO L241 Difference]: Finished difference. Result has 580 places, 532 transitions, 1284 flow [2020-10-09 15:32:49,982 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1284, PETRI_PLACES=580, PETRI_TRANSITIONS=532} [2020-10-09 15:32:49,982 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 38 predicate places. [2020-10-09 15:32:49,982 INFO L481 AbstractCegarLoop]: Abstraction has has 580 places, 532 transitions, 1284 flow [2020-10-09 15:32:49,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:49,982 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:49,982 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:50,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 604 mathsat -unsat_core_generation=3 [2020-10-09 15:32:50,183 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:50,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:50,183 INFO L82 PathProgramCache]: Analyzing trace with hash -318022102, now seen corresponding path program 1 times [2020-10-09 15:32:50,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:50,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694087192] [2020-10-09 15:32:50,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 605 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 605 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:50,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:32:50,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:32:50,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:32:50,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694087192] [2020-10-09 15:32:50,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:50,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:50,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118554618] [2020-10-09 15:32:50,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:50,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:50,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:50,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:50,593 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 584 [2020-10-09 15:32:50,594 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 532 transitions, 1284 flow. Second operand 3 states. [2020-10-09 15:32:50,594 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:50,594 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 584 [2020-10-09 15:32:50,594 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:50,760 INFO L129 PetriNetUnfolder]: 33/621 cut-off events. [2020-10-09 15:32:50,760 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:32:50,789 INFO L80 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 621 events. 33/621 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2611 event pairs, 0 based on Foata normal form. 1/569 useless extension candidates. Maximal degree in co-relation 743. Up to 22 conditions per place. [2020-10-09 15:32:50,793 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 4 selfloop transitions, 1 changer transitions 0/529 dead transitions. [2020-10-09 15:32:50,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 529 transitions, 1279 flow [2020-10-09 15:32:50,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:50,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2020-10-09 15:32:50,794 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9554794520547946 [2020-10-09 15:32:50,794 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2020-10-09 15:32:50,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2020-10-09 15:32:50,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:50,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2020-10-09 15:32:50,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:50,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:50,796 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:50,796 INFO L185 Difference]: Start difference. First operand has 580 places, 532 transitions, 1284 flow. Second operand 3 states and 1674 transitions. [2020-10-09 15:32:50,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 529 transitions, 1279 flow [2020-10-09 15:32:50,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 529 transitions, 1272 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:32:50,801 INFO L241 Difference]: Finished difference. Result has 579 places, 529 transitions, 1264 flow [2020-10-09 15:32:50,802 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1262, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1264, PETRI_PLACES=579, PETRI_TRANSITIONS=529} [2020-10-09 15:32:50,802 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 37 predicate places. [2020-10-09 15:32:50,802 INFO L481 AbstractCegarLoop]: Abstraction has has 579 places, 529 transitions, 1264 flow [2020-10-09 15:32:50,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:50,802 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:50,802 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:51,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 605 mathsat -unsat_core_generation=3 [2020-10-09 15:32:51,003 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:51,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:51,003 INFO L82 PathProgramCache]: Analyzing trace with hash -318021079, now seen corresponding path program 1 times [2020-10-09 15:32:51,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:51,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920571221] [2020-10-09 15:32:51,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 606 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 606 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:51,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:51,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:32:51,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:32:51,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920571221] [2020-10-09 15:32:51,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:51,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:51,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699732154] [2020-10-09 15:32:51,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:51,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:51,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:51,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:51,422 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:51,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 529 transitions, 1264 flow. Second operand 3 states. [2020-10-09 15:32:51,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:51,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:51,423 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:51,596 INFO L129 PetriNetUnfolder]: 33/619 cut-off events. [2020-10-09 15:32:51,596 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:32:51,627 INFO L80 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 619 events. 33/619 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2593 event pairs, 0 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 745. Up to 22 conditions per place. [2020-10-09 15:32:51,631 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 8 selfloop transitions, 1 changer transitions 0/527 dead transitions. [2020-10-09 15:32:51,631 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 527 transitions, 1277 flow [2020-10-09 15:32:51,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:51,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2020-10-09 15:32:51,632 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2020-10-09 15:32:51,632 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1660 transitions. [2020-10-09 15:32:51,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1660 transitions. [2020-10-09 15:32:51,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:51,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1660 transitions. [2020-10-09 15:32:51,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:51,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:51,634 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:51,634 INFO L185 Difference]: Start difference. First operand has 579 places, 529 transitions, 1264 flow. Second operand 3 states and 1660 transitions. [2020-10-09 15:32:51,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 579 places, 527 transitions, 1277 flow [2020-10-09 15:32:51,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 527 transitions, 1276 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:51,639 INFO L241 Difference]: Finished difference. Result has 578 places, 527 transitions, 1260 flow [2020-10-09 15:32:51,639 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1260, PETRI_PLACES=578, PETRI_TRANSITIONS=527} [2020-10-09 15:32:51,640 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 36 predicate places. [2020-10-09 15:32:51,640 INFO L481 AbstractCegarLoop]: Abstraction has has 578 places, 527 transitions, 1260 flow [2020-10-09 15:32:51,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:51,640 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:51,640 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:51,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 606 mathsat -unsat_core_generation=3 [2020-10-09 15:32:51,841 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:51,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:51,841 INFO L82 PathProgramCache]: Analyzing trace with hash 768233936, now seen corresponding path program 1 times [2020-10-09 15:32:51,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:51,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047984685] [2020-10-09 15:32:51,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 607 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 607 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:52,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:52,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:52,229 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:32:52,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:52,232 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:32:52,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047984685] [2020-10-09 15:32:52,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:52,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:52,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7349295] [2020-10-09 15:32:52,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:52,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:52,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:52,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:52,246 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 584 [2020-10-09 15:32:52,247 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 527 transitions, 1260 flow. Second operand 3 states. [2020-10-09 15:32:52,247 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:52,247 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 584 [2020-10-09 15:32:52,247 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:52,468 INFO L129 PetriNetUnfolder]: 31/624 cut-off events. [2020-10-09 15:32:52,468 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:32:52,494 INFO L80 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 624 events. 31/624 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2642 event pairs, 0 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 748. Up to 22 conditions per place. [2020-10-09 15:32:52,498 INFO L132 encePairwiseOnDemand]: 581/584 looper letters, 5 selfloop transitions, 2 changer transitions 0/528 dead transitions. [2020-10-09 15:32:52,498 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 528 transitions, 1276 flow [2020-10-09 15:32:52,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:52,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2020-10-09 15:32:52,499 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9549086757990868 [2020-10-09 15:32:52,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1673 transitions. [2020-10-09 15:32:52,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1673 transitions. [2020-10-09 15:32:52,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:52,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1673 transitions. [2020-10-09 15:32:52,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:52,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:52,501 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:52,501 INFO L185 Difference]: Start difference. First operand has 578 places, 527 transitions, 1260 flow. Second operand 3 states and 1673 transitions. [2020-10-09 15:32:52,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 528 transitions, 1276 flow [2020-10-09 15:32:52,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 528 transitions, 1275 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:52,506 INFO L241 Difference]: Finished difference. Result has 581 places, 528 transitions, 1273 flow [2020-10-09 15:32:52,506 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1273, PETRI_PLACES=581, PETRI_TRANSITIONS=528} [2020-10-09 15:32:52,506 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 39 predicate places. [2020-10-09 15:32:52,506 INFO L481 AbstractCegarLoop]: Abstraction has has 581 places, 528 transitions, 1273 flow [2020-10-09 15:32:52,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:52,506 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:52,507 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:52,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 607 mathsat -unsat_core_generation=3 [2020-10-09 15:32:52,707 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:52,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:52,708 INFO L82 PathProgramCache]: Analyzing trace with hash 768232913, now seen corresponding path program 1 times [2020-10-09 15:32:52,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:52,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231862551] [2020-10-09 15:32:52,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 608 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 608 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:53,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:53,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:53,093 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:32:53,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:32:53,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231862551] [2020-10-09 15:32:53,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:53,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:53,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720560158] [2020-10-09 15:32:53,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:53,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:53,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:53,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:53,132 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:53,133 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 528 transitions, 1273 flow. Second operand 3 states. [2020-10-09 15:32:53,133 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:53,133 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:53,133 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:53,309 INFO L129 PetriNetUnfolder]: 31/625 cut-off events. [2020-10-09 15:32:53,309 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:32:53,340 INFO L80 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 625 events. 31/625 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2652 event pairs, 0 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 756. Up to 22 conditions per place. [2020-10-09 15:32:53,344 INFO L132 encePairwiseOnDemand]: 580/584 looper letters, 9 selfloop transitions, 3 changer transitions 0/529 dead transitions. [2020-10-09 15:32:53,344 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 529 transitions, 1299 flow [2020-10-09 15:32:53,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:53,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2020-10-09 15:32:53,345 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9492009132420092 [2020-10-09 15:32:53,345 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1663 transitions. [2020-10-09 15:32:53,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1663 transitions. [2020-10-09 15:32:53,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:53,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1663 transitions. [2020-10-09 15:32:53,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:53,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:53,347 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:53,347 INFO L185 Difference]: Start difference. First operand has 581 places, 528 transitions, 1273 flow. Second operand 3 states and 1663 transitions. [2020-10-09 15:32:53,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 529 transitions, 1299 flow [2020-10-09 15:32:53,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 582 places, 529 transitions, 1297 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:53,352 INFO L241 Difference]: Finished difference. Result has 584 places, 529 transitions, 1289 flow [2020-10-09 15:32:53,353 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1271, PETRI_DIFFERENCE_MINUEND_PLACES=580, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1289, PETRI_PLACES=584, PETRI_TRANSITIONS=529} [2020-10-09 15:32:53,353 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 42 predicate places. [2020-10-09 15:32:53,353 INFO L481 AbstractCegarLoop]: Abstraction has has 584 places, 529 transitions, 1289 flow [2020-10-09 15:32:53,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:53,353 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:53,353 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:53,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 608 mathsat -unsat_core_generation=3 [2020-10-09 15:32:53,554 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:53,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:53,554 INFO L82 PathProgramCache]: Analyzing trace with hash 769187248, now seen corresponding path program 1 times [2020-10-09 15:32:53,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:53,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323755392] [2020-10-09 15:32:53,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 609 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 609 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:53,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:53,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:32:53,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:32:53,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323755392] [2020-10-09 15:32:53,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:53,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:53,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452987423] [2020-10-09 15:32:53,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:53,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:53,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:53,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:53,971 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:53,972 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 529 transitions, 1289 flow. Second operand 3 states. [2020-10-09 15:32:53,972 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:53,973 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:53,973 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:54,150 INFO L129 PetriNetUnfolder]: 30/622 cut-off events. [2020-10-09 15:32:54,150 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2020-10-09 15:32:54,180 INFO L80 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 622 events. 30/622 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2634 event pairs, 0 based on Foata normal form. 2/573 useless extension candidates. Maximal degree in co-relation 755. Up to 22 conditions per place. [2020-10-09 15:32:54,184 INFO L132 encePairwiseOnDemand]: 581/584 looper letters, 9 selfloop transitions, 1 changer transitions 0/527 dead transitions. [2020-10-09 15:32:54,184 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 527 transitions, 1297 flow [2020-10-09 15:32:54,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:54,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1662 transitions. [2020-10-09 15:32:54,185 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9486301369863014 [2020-10-09 15:32:54,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1662 transitions. [2020-10-09 15:32:54,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1662 transitions. [2020-10-09 15:32:54,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:54,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1662 transitions. [2020-10-09 15:32:54,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:54,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:54,187 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:54,187 INFO L185 Difference]: Start difference. First operand has 584 places, 529 transitions, 1289 flow. Second operand 3 states and 1662 transitions. [2020-10-09 15:32:54,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 527 transitions, 1297 flow [2020-10-09 15:32:54,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 527 transitions, 1296 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:54,193 INFO L241 Difference]: Finished difference. Result has 585 places, 527 transitions, 1278 flow [2020-10-09 15:32:54,193 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=583, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1278, PETRI_PLACES=585, PETRI_TRANSITIONS=527} [2020-10-09 15:32:54,193 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 43 predicate places. [2020-10-09 15:32:54,193 INFO L481 AbstractCegarLoop]: Abstraction has has 585 places, 527 transitions, 1278 flow [2020-10-09 15:32:54,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:54,194 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:54,194 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:54,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 609 mathsat -unsat_core_generation=3 [2020-10-09 15:32:54,394 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:54,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:54,395 INFO L82 PathProgramCache]: Analyzing trace with hash 769186225, now seen corresponding path program 1 times [2020-10-09 15:32:54,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:54,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874714637] [2020-10-09 15:32:54,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 610 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 610 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:54,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:32:54,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:32:54,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:54,787 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:32:54,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874714637] [2020-10-09 15:32:54,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:54,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:54,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324294335] [2020-10-09 15:32:54,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:54,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:54,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:54,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:54,800 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 584 [2020-10-09 15:32:54,801 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 527 transitions, 1278 flow. Second operand 3 states. [2020-10-09 15:32:54,801 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:54,801 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 584 [2020-10-09 15:32:54,801 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:54,971 INFO L129 PetriNetUnfolder]: 30/619 cut-off events. [2020-10-09 15:32:54,971 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:32:54,999 INFO L80 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 619 events. 30/619 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2610 event pairs, 0 based on Foata normal form. 1/570 useless extension candidates. Maximal degree in co-relation 749. Up to 22 conditions per place. [2020-10-09 15:32:55,003 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 4 selfloop transitions, 1 changer transitions 0/524 dead transitions. [2020-10-09 15:32:55,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 524 transitions, 1277 flow [2020-10-09 15:32:55,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2020-10-09 15:32:55,004 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9554794520547946 [2020-10-09 15:32:55,004 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2020-10-09 15:32:55,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2020-10-09 15:32:55,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:55,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2020-10-09 15:32:55,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:55,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:55,006 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:55,006 INFO L185 Difference]: Start difference. First operand has 585 places, 527 transitions, 1278 flow. Second operand 3 states and 1674 transitions. [2020-10-09 15:32:55,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 524 transitions, 1277 flow [2020-10-09 15:32:55,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 582 places, 524 transitions, 1272 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:32:55,011 INFO L241 Difference]: Finished difference. Result has 582 places, 524 transitions, 1264 flow [2020-10-09 15:32:55,011 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1262, PETRI_DIFFERENCE_MINUEND_PLACES=580, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1264, PETRI_PLACES=582, PETRI_TRANSITIONS=524} [2020-10-09 15:32:55,012 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 40 predicate places. [2020-10-09 15:32:55,012 INFO L481 AbstractCegarLoop]: Abstraction has has 582 places, 524 transitions, 1264 flow [2020-10-09 15:32:55,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:55,012 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:55,012 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:55,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 610 mathsat -unsat_core_generation=3 [2020-10-09 15:32:55,213 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:55,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:55,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1598085081, now seen corresponding path program 1 times [2020-10-09 15:32:55,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:55,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464553328] [2020-10-09 15:32:55,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 611 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 611 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:55,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:55,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:32:55,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:32:55,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464553328] [2020-10-09 15:32:55,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:55,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:55,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867620566] [2020-10-09 15:32:55,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:55,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:55,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:55,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:55,641 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:55,642 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 524 transitions, 1264 flow. Second operand 3 states. [2020-10-09 15:32:55,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:55,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:55,642 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:55,823 INFO L129 PetriNetUnfolder]: 29/627 cut-off events. [2020-10-09 15:32:55,823 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:32:55,854 INFO L80 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 627 events. 29/627 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2681 event pairs, 0 based on Foata normal form. 0/575 useless extension candidates. Maximal degree in co-relation 766. Up to 22 conditions per place. [2020-10-09 15:32:55,858 INFO L132 encePairwiseOnDemand]: 579/584 looper letters, 10 selfloop transitions, 3 changer transitions 0/526 dead transitions. [2020-10-09 15:32:55,858 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 526 transitions, 1294 flow [2020-10-09 15:32:55,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2020-10-09 15:32:55,859 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503424657534246 [2020-10-09 15:32:55,859 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1665 transitions. [2020-10-09 15:32:55,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1665 transitions. [2020-10-09 15:32:55,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:55,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1665 transitions. [2020-10-09 15:32:55,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:55,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:55,861 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:55,861 INFO L185 Difference]: Start difference. First operand has 582 places, 524 transitions, 1264 flow. Second operand 3 states and 1665 transitions. [2020-10-09 15:32:55,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 526 transitions, 1294 flow [2020-10-09 15:32:55,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 526 transitions, 1293 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:55,866 INFO L241 Difference]: Finished difference. Result has 585 places, 526 transitions, 1287 flow [2020-10-09 15:32:55,866 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1263, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1287, PETRI_PLACES=585, PETRI_TRANSITIONS=526} [2020-10-09 15:32:55,866 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 43 predicate places. [2020-10-09 15:32:55,867 INFO L481 AbstractCegarLoop]: Abstraction has has 585 places, 526 transitions, 1287 flow [2020-10-09 15:32:55,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:55,867 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:55,867 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:56,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 611 mathsat -unsat_core_generation=3 [2020-10-09 15:32:56,067 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:56,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:56,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1598086104, now seen corresponding path program 1 times [2020-10-09 15:32:56,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:56,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654120443] [2020-10-09 15:32:56,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 612 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 612 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:56,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:56,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:56,454 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:32:56,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:32:56,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654120443] [2020-10-09 15:32:56,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:56,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:56,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923796085] [2020-10-09 15:32:56,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:56,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:56,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:56,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:56,468 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 584 [2020-10-09 15:32:56,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 526 transitions, 1287 flow. Second operand 3 states. [2020-10-09 15:32:56,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:56,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 584 [2020-10-09 15:32:56,469 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:56,701 INFO L129 PetriNetUnfolder]: 28/625 cut-off events. [2020-10-09 15:32:56,701 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:32:56,719 INFO L80 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 625 events. 28/625 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2670 event pairs, 0 based on Foata normal form. 0/577 useless extension candidates. Maximal degree in co-relation 761. Up to 22 conditions per place. [2020-10-09 15:32:56,722 INFO L132 encePairwiseOnDemand]: 581/584 looper letters, 5 selfloop transitions, 2 changer transitions 0/526 dead transitions. [2020-10-09 15:32:56,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 526 transitions, 1299 flow [2020-10-09 15:32:56,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2020-10-09 15:32:56,724 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9549086757990868 [2020-10-09 15:32:56,724 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1673 transitions. [2020-10-09 15:32:56,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1673 transitions. [2020-10-09 15:32:56,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:56,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1673 transitions. [2020-10-09 15:32:56,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:56,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:56,726 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:56,726 INFO L185 Difference]: Start difference. First operand has 585 places, 526 transitions, 1287 flow. Second operand 3 states and 1673 transitions. [2020-10-09 15:32:56,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 526 transitions, 1299 flow [2020-10-09 15:32:56,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 526 transitions, 1294 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:56,731 INFO L241 Difference]: Finished difference. Result has 588 places, 526 transitions, 1292 flow [2020-10-09 15:32:56,731 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1292, PETRI_PLACES=588, PETRI_TRANSITIONS=526} [2020-10-09 15:32:56,731 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 46 predicate places. [2020-10-09 15:32:56,731 INFO L481 AbstractCegarLoop]: Abstraction has has 588 places, 526 transitions, 1292 flow [2020-10-09 15:32:56,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:56,731 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:56,731 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:56,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 612 mathsat -unsat_core_generation=3 [2020-10-09 15:32:56,932 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:56,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:56,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1599038393, now seen corresponding path program 1 times [2020-10-09 15:32:56,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:56,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818292436] [2020-10-09 15:32:56,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 613 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 613 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:57,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:32:57,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:32:57,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:57,323 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:32:57,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818292436] [2020-10-09 15:32:57,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:57,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:57,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449795600] [2020-10-09 15:32:57,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:57,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:57,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:57,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:57,336 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 584 [2020-10-09 15:32:57,337 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 526 transitions, 1292 flow. Second operand 3 states. [2020-10-09 15:32:57,337 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:57,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 584 [2020-10-09 15:32:57,338 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:57,514 INFO L129 PetriNetUnfolder]: 27/621 cut-off events. [2020-10-09 15:32:57,514 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:32:57,544 INFO L80 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 621 events. 27/621 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2646 event pairs, 0 based on Foata normal form. 1/575 useless extension candidates. Maximal degree in co-relation 757. Up to 22 conditions per place. [2020-10-09 15:32:57,548 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 4 selfloop transitions, 1 changer transitions 0/523 dead transitions. [2020-10-09 15:32:57,548 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 523 transitions, 1287 flow [2020-10-09 15:32:57,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:57,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2020-10-09 15:32:57,549 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9554794520547946 [2020-10-09 15:32:57,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2020-10-09 15:32:57,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2020-10-09 15:32:57,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:57,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2020-10-09 15:32:57,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:57,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:57,551 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:57,551 INFO L185 Difference]: Start difference. First operand has 588 places, 526 transitions, 1292 flow. Second operand 3 states and 1674 transitions. [2020-10-09 15:32:57,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 523 transitions, 1287 flow [2020-10-09 15:32:57,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 523 transitions, 1280 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:32:57,557 INFO L241 Difference]: Finished difference. Result has 587 places, 523 transitions, 1272 flow [2020-10-09 15:32:57,557 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=587, PETRI_TRANSITIONS=523} [2020-10-09 15:32:57,557 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 45 predicate places. [2020-10-09 15:32:57,557 INFO L481 AbstractCegarLoop]: Abstraction has has 587 places, 523 transitions, 1272 flow [2020-10-09 15:32:57,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:57,557 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:57,557 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:57,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 613 mathsat -unsat_core_generation=3 [2020-10-09 15:32:57,758 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:57,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:57,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1599039416, now seen corresponding path program 1 times [2020-10-09 15:32:57,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:57,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183787022] [2020-10-09 15:32:57,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 614 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 614 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:58,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:58,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:32:58,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:32:58,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183787022] [2020-10-09 15:32:58,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:58,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:58,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230574912] [2020-10-09 15:32:58,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:58,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:58,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:58,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:58,171 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:58,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 523 transitions, 1272 flow. Second operand 3 states. [2020-10-09 15:32:58,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:58,172 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:58,172 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:58,352 INFO L129 PetriNetUnfolder]: 27/619 cut-off events. [2020-10-09 15:32:58,352 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:32:58,382 INFO L80 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 619 events. 27/619 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2628 event pairs, 0 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 759. Up to 22 conditions per place. [2020-10-09 15:32:58,385 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 8 selfloop transitions, 1 changer transitions 0/521 dead transitions. [2020-10-09 15:32:58,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 521 transitions, 1285 flow [2020-10-09 15:32:58,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:58,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:58,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2020-10-09 15:32:58,386 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2020-10-09 15:32:58,386 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1660 transitions. [2020-10-09 15:32:58,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1660 transitions. [2020-10-09 15:32:58,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:58,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1660 transitions. [2020-10-09 15:32:58,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:58,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:58,388 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:58,388 INFO L185 Difference]: Start difference. First operand has 587 places, 523 transitions, 1272 flow. Second operand 3 states and 1660 transitions. [2020-10-09 15:32:58,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 521 transitions, 1285 flow [2020-10-09 15:32:58,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 521 transitions, 1284 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:58,394 INFO L241 Difference]: Finished difference. Result has 586 places, 521 transitions, 1268 flow [2020-10-09 15:32:58,394 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1266, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1268, PETRI_PLACES=586, PETRI_TRANSITIONS=521} [2020-10-09 15:32:58,394 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 44 predicate places. [2020-10-09 15:32:58,394 INFO L481 AbstractCegarLoop]: Abstraction has has 586 places, 521 transitions, 1268 flow [2020-10-09 15:32:58,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:58,394 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:58,394 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:58,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 614 mathsat -unsat_core_generation=3 [2020-10-09 15:32:58,595 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:58,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:58,595 INFO L82 PathProgramCache]: Analyzing trace with hash 341286849, now seen corresponding path program 1 times [2020-10-09 15:32:58,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:58,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521052585] [2020-10-09 15:32:58,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 615 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 615 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:58,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:32:58,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:32:58,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:32:58,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521052585] [2020-10-09 15:32:58,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:58,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:58,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248387531] [2020-10-09 15:32:58,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:58,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:58,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:58,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:59,018 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:32:59,019 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 521 transitions, 1268 flow. Second operand 3 states. [2020-10-09 15:32:59,019 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:59,019 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:32:59,019 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:32:59,200 INFO L129 PetriNetUnfolder]: 26/627 cut-off events. [2020-10-09 15:32:59,200 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:32:59,229 INFO L80 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 627 events. 26/627 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2698 event pairs, 0 based on Foata normal form. 0/579 useless extension candidates. Maximal degree in co-relation 771. Up to 22 conditions per place. [2020-10-09 15:32:59,233 INFO L132 encePairwiseOnDemand]: 579/584 looper letters, 10 selfloop transitions, 3 changer transitions 0/523 dead transitions. [2020-10-09 15:32:59,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 523 transitions, 1298 flow [2020-10-09 15:32:59,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:32:59,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:32:59,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2020-10-09 15:32:59,234 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503424657534246 [2020-10-09 15:32:59,234 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1665 transitions. [2020-10-09 15:32:59,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1665 transitions. [2020-10-09 15:32:59,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:32:59,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1665 transitions. [2020-10-09 15:32:59,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:32:59,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:32:59,236 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:32:59,236 INFO L185 Difference]: Start difference. First operand has 586 places, 521 transitions, 1268 flow. Second operand 3 states and 1665 transitions. [2020-10-09 15:32:59,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 523 transitions, 1298 flow [2020-10-09 15:32:59,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 523 transitions, 1297 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:32:59,241 INFO L241 Difference]: Finished difference. Result has 589 places, 523 transitions, 1291 flow [2020-10-09 15:32:59,242 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1291, PETRI_PLACES=589, PETRI_TRANSITIONS=523} [2020-10-09 15:32:59,242 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 47 predicate places. [2020-10-09 15:32:59,242 INFO L481 AbstractCegarLoop]: Abstraction has has 589 places, 523 transitions, 1291 flow [2020-10-09 15:32:59,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:32:59,242 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:32:59,242 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:32:59,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 615 mathsat -unsat_core_generation=3 [2020-10-09 15:32:59,443 INFO L429 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:32:59,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:32:59,443 INFO L82 PathProgramCache]: Analyzing trace with hash 341285826, now seen corresponding path program 1 times [2020-10-09 15:32:59,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:32:59,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657198212] [2020-10-09 15:32:59,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 616 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 616 with mathsat -unsat_core_generation=3 [2020-10-09 15:32:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:32:59,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:32:59,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:32:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:32:59,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:32:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:32:59,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657198212] [2020-10-09 15:32:59,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:32:59,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:32:59,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846387350] [2020-10-09 15:32:59,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:32:59,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:32:59,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:32:59,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:32:59,857 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 584 [2020-10-09 15:32:59,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 523 transitions, 1291 flow. Second operand 3 states. [2020-10-09 15:32:59,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:32:59,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 584 [2020-10-09 15:32:59,858 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:00,035 INFO L129 PetriNetUnfolder]: 24/628 cut-off events. [2020-10-09 15:33:00,036 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:33:00,065 INFO L80 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 628 events. 24/628 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2718 event pairs, 0 based on Foata normal form. 1/585 useless extension candidates. Maximal degree in co-relation 769. Up to 22 conditions per place. [2020-10-09 15:33:00,068 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 4 selfloop transitions, 1 changer transitions 0/522 dead transitions. [2020-10-09 15:33:00,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 522 transitions, 1297 flow [2020-10-09 15:33:00,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:00,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2020-10-09 15:33:00,070 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9554794520547946 [2020-10-09 15:33:00,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2020-10-09 15:33:00,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2020-10-09 15:33:00,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:00,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2020-10-09 15:33:00,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:00,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:00,071 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:00,071 INFO L185 Difference]: Start difference. First operand has 589 places, 523 transitions, 1291 flow. Second operand 3 states and 1674 transitions. [2020-10-09 15:33:00,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 522 transitions, 1297 flow [2020-10-09 15:33:00,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 522 transitions, 1292 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:00,077 INFO L241 Difference]: Finished difference. Result has 591 places, 522 transitions, 1287 flow [2020-10-09 15:33:00,077 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1287, PETRI_PLACES=591, PETRI_TRANSITIONS=522} [2020-10-09 15:33:00,077 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 49 predicate places. [2020-10-09 15:33:00,077 INFO L481 AbstractCegarLoop]: Abstraction has has 591 places, 522 transitions, 1287 flow [2020-10-09 15:33:00,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:00,077 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:00,077 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:00,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 616 mathsat -unsat_core_generation=3 [2020-10-09 15:33:00,278 INFO L429 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:00,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:00,279 INFO L82 PathProgramCache]: Analyzing trace with hash 340333537, now seen corresponding path program 1 times [2020-10-09 15:33:00,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:00,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480802399] [2020-10-09 15:33:00,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 617 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 617 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:00,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:00,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:00,671 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:33:00,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:33:00,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480802399] [2020-10-09 15:33:00,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:00,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:00,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035956892] [2020-10-09 15:33:00,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:00,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:00,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:00,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:00,692 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 584 [2020-10-09 15:33:00,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 522 transitions, 1287 flow. Second operand 3 states. [2020-10-09 15:33:00,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:00,693 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 584 [2020-10-09 15:33:00,693 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:00,868 INFO L129 PetriNetUnfolder]: 24/621 cut-off events. [2020-10-09 15:33:00,868 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:33:00,896 INFO L80 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 621 events. 24/621 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2661 event pairs, 0 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 765. Up to 22 conditions per place. [2020-10-09 15:33:00,899 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 5 selfloop transitions, 1 changer transitions 0/520 dead transitions. [2020-10-09 15:33:00,899 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 520 transitions, 1290 flow [2020-10-09 15:33:00,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2020-10-09 15:33:00,901 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.954337899543379 [2020-10-09 15:33:00,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2020-10-09 15:33:00,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2020-10-09 15:33:00,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:00,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2020-10-09 15:33:00,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:00,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:00,903 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:00,903 INFO L185 Difference]: Start difference. First operand has 591 places, 522 transitions, 1287 flow. Second operand 3 states and 1672 transitions. [2020-10-09 15:33:00,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 520 transitions, 1290 flow [2020-10-09 15:33:00,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 520 transitions, 1283 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:33:00,927 INFO L241 Difference]: Finished difference. Result has 591 places, 520 transitions, 1276 flow [2020-10-09 15:33:00,927 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1271, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1276, PETRI_PLACES=591, PETRI_TRANSITIONS=520} [2020-10-09 15:33:00,927 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 49 predicate places. [2020-10-09 15:33:00,927 INFO L481 AbstractCegarLoop]: Abstraction has has 591 places, 520 transitions, 1276 flow [2020-10-09 15:33:00,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:00,928 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:00,928 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:01,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 617 mathsat -unsat_core_generation=3 [2020-10-09 15:33:01,128 INFO L429 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:01,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:01,129 INFO L82 PathProgramCache]: Analyzing trace with hash 340332514, now seen corresponding path program 1 times [2020-10-09 15:33:01,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:01,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679306601] [2020-10-09 15:33:01,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 618 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 618 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:01,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:01,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:33:01,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:01,522 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:33:01,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679306601] [2020-10-09 15:33:01,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:01,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:01,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313878645] [2020-10-09 15:33:01,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:01,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:01,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:01,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:01,558 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:33:01,559 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 520 transitions, 1276 flow. Second operand 3 states. [2020-10-09 15:33:01,559 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:01,559 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:33:01,559 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:01,734 INFO L129 PetriNetUnfolder]: 24/619 cut-off events. [2020-10-09 15:33:01,735 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:01,763 INFO L80 FinitePrefix]: Finished finitePrefix Result has 818 conditions, 619 events. 24/619 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2645 event pairs, 0 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 765. Up to 22 conditions per place. [2020-10-09 15:33:01,766 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 8 selfloop transitions, 1 changer transitions 0/518 dead transitions. [2020-10-09 15:33:01,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 518 transitions, 1289 flow [2020-10-09 15:33:01,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2020-10-09 15:33:01,767 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2020-10-09 15:33:01,767 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1660 transitions. [2020-10-09 15:33:01,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1660 transitions. [2020-10-09 15:33:01,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:01,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1660 transitions. [2020-10-09 15:33:01,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:01,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:01,769 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:01,769 INFO L185 Difference]: Start difference. First operand has 591 places, 520 transitions, 1276 flow. Second operand 3 states and 1660 transitions. [2020-10-09 15:33:01,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 518 transitions, 1289 flow [2020-10-09 15:33:01,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 518 transitions, 1288 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:01,775 INFO L241 Difference]: Finished difference. Result has 590 places, 518 transitions, 1272 flow [2020-10-09 15:33:01,775 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=590, PETRI_TRANSITIONS=518} [2020-10-09 15:33:01,775 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 48 predicate places. [2020-10-09 15:33:01,775 INFO L481 AbstractCegarLoop]: Abstraction has has 590 places, 518 transitions, 1272 flow [2020-10-09 15:33:01,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:01,775 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:01,775 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:01,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 618 mathsat -unsat_core_generation=3 [2020-10-09 15:33:01,976 INFO L429 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:01,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:01,977 INFO L82 PathProgramCache]: Analyzing trace with hash -944910517, now seen corresponding path program 1 times [2020-10-09 15:33:01,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:01,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77302514] [2020-10-09 15:33:01,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 619 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 619 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:02,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:02,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:33:02,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:33:02,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77302514] [2020-10-09 15:33:02,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:02,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:02,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707601129] [2020-10-09 15:33:02,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:02,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:02,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:02,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:02,402 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:33:02,403 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 518 transitions, 1272 flow. Second operand 3 states. [2020-10-09 15:33:02,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:02,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:33:02,404 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:02,585 INFO L129 PetriNetUnfolder]: 23/627 cut-off events. [2020-10-09 15:33:02,585 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:33:02,615 INFO L80 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 627 events. 23/627 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2715 event pairs, 0 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 777. Up to 22 conditions per place. [2020-10-09 15:33:02,618 INFO L132 encePairwiseOnDemand]: 579/584 looper letters, 10 selfloop transitions, 3 changer transitions 0/520 dead transitions. [2020-10-09 15:33:02,618 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 520 transitions, 1302 flow [2020-10-09 15:33:02,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:02,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2020-10-09 15:33:02,619 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503424657534246 [2020-10-09 15:33:02,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1665 transitions. [2020-10-09 15:33:02,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1665 transitions. [2020-10-09 15:33:02,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:02,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1665 transitions. [2020-10-09 15:33:02,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:02,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:02,621 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:02,621 INFO L185 Difference]: Start difference. First operand has 590 places, 518 transitions, 1272 flow. Second operand 3 states and 1665 transitions. [2020-10-09 15:33:02,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 520 transitions, 1302 flow [2020-10-09 15:33:02,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 520 transitions, 1301 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:02,626 INFO L241 Difference]: Finished difference. Result has 593 places, 520 transitions, 1295 flow [2020-10-09 15:33:02,627 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1271, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1295, PETRI_PLACES=593, PETRI_TRANSITIONS=520} [2020-10-09 15:33:02,627 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 51 predicate places. [2020-10-09 15:33:02,627 INFO L481 AbstractCegarLoop]: Abstraction has has 593 places, 520 transitions, 1295 flow [2020-10-09 15:33:02,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:02,627 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:02,627 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:02,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 619 mathsat -unsat_core_generation=3 [2020-10-09 15:33:02,834 INFO L429 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:02,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:02,834 INFO L82 PathProgramCache]: Analyzing trace with hash -944911540, now seen corresponding path program 1 times [2020-10-09 15:33:02,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:02,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703453843] [2020-10-09 15:33:02,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 620 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 620 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:03,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:33:03,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:33:03,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:33:03,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703453843] [2020-10-09 15:33:03,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:03,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:03,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529692179] [2020-10-09 15:33:03,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:03,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:03,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:03,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:03,244 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 584 [2020-10-09 15:33:03,245 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 520 transitions, 1295 flow. Second operand 3 states. [2020-10-09 15:33:03,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:03,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 584 [2020-10-09 15:33:03,245 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:03,423 INFO L129 PetriNetUnfolder]: 21/628 cut-off events. [2020-10-09 15:33:03,423 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:33:03,453 INFO L80 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 628 events. 21/628 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2737 event pairs, 0 based on Foata normal form. 1/588 useless extension candidates. Maximal degree in co-relation 775. Up to 22 conditions per place. [2020-10-09 15:33:03,456 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 4 selfloop transitions, 1 changer transitions 0/519 dead transitions. [2020-10-09 15:33:03,456 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 519 transitions, 1301 flow [2020-10-09 15:33:03,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2020-10-09 15:33:03,458 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9554794520547946 [2020-10-09 15:33:03,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2020-10-09 15:33:03,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2020-10-09 15:33:03,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:03,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2020-10-09 15:33:03,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:03,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:03,460 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:03,460 INFO L185 Difference]: Start difference. First operand has 593 places, 520 transitions, 1295 flow. Second operand 3 states and 1674 transitions. [2020-10-09 15:33:03,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 519 transitions, 1301 flow [2020-10-09 15:33:03,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 519 transitions, 1296 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:03,465 INFO L241 Difference]: Finished difference. Result has 595 places, 519 transitions, 1291 flow [2020-10-09 15:33:03,465 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1286, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1291, PETRI_PLACES=595, PETRI_TRANSITIONS=519} [2020-10-09 15:33:03,466 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 53 predicate places. [2020-10-09 15:33:03,466 INFO L481 AbstractCegarLoop]: Abstraction has has 595 places, 519 transitions, 1291 flow [2020-10-09 15:33:03,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:03,466 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:03,466 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:03,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 620 mathsat -unsat_core_generation=3 [2020-10-09 15:33:03,667 INFO L429 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:03,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:03,667 INFO L82 PathProgramCache]: Analyzing trace with hash -945863829, now seen corresponding path program 1 times [2020-10-09 15:33:03,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:03,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001037915] [2020-10-09 15:33:03,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 621 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 621 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:04,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:04,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:33:04,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:33:04,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001037915] [2020-10-09 15:33:04,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:04,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:04,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978962581] [2020-10-09 15:33:04,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:04,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:04,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:04,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:04,080 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 584 [2020-10-09 15:33:04,081 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 519 transitions, 1291 flow. Second operand 3 states. [2020-10-09 15:33:04,082 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:04,082 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 584 [2020-10-09 15:33:04,082 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:04,259 INFO L129 PetriNetUnfolder]: 21/621 cut-off events. [2020-10-09 15:33:04,259 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:33:04,288 INFO L80 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 621 events. 21/621 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2680 event pairs, 0 based on Foata normal form. 1/581 useless extension candidates. Maximal degree in co-relation 771. Up to 22 conditions per place. [2020-10-09 15:33:04,291 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 5 selfloop transitions, 1 changer transitions 0/517 dead transitions. [2020-10-09 15:33:04,291 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 517 transitions, 1294 flow [2020-10-09 15:33:04,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2020-10-09 15:33:04,292 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.954337899543379 [2020-10-09 15:33:04,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2020-10-09 15:33:04,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2020-10-09 15:33:04,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:04,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2020-10-09 15:33:04,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:04,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:04,294 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:04,294 INFO L185 Difference]: Start difference. First operand has 595 places, 519 transitions, 1291 flow. Second operand 3 states and 1672 transitions. [2020-10-09 15:33:04,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 517 transitions, 1294 flow [2020-10-09 15:33:04,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 517 transitions, 1287 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:33:04,299 INFO L241 Difference]: Finished difference. Result has 595 places, 517 transitions, 1280 flow [2020-10-09 15:33:04,300 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1275, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1280, PETRI_PLACES=595, PETRI_TRANSITIONS=517} [2020-10-09 15:33:04,300 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 53 predicate places. [2020-10-09 15:33:04,300 INFO L481 AbstractCegarLoop]: Abstraction has has 595 places, 517 transitions, 1280 flow [2020-10-09 15:33:04,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:04,300 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:04,300 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:04,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 621 mathsat -unsat_core_generation=3 [2020-10-09 15:33:04,510 INFO L429 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:04,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:04,511 INFO L82 PathProgramCache]: Analyzing trace with hash -945864852, now seen corresponding path program 1 times [2020-10-09 15:33:04,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:04,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104474449] [2020-10-09 15:33:04,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 622 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 622 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:04,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:04,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:33:04,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:33:04,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104474449] [2020-10-09 15:33:04,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:04,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:04,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213153911] [2020-10-09 15:33:04,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:04,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:04,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:04,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:04,932 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:33:04,932 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 517 transitions, 1280 flow. Second operand 3 states. [2020-10-09 15:33:04,933 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:04,933 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:33:04,933 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:05,110 INFO L129 PetriNetUnfolder]: 21/619 cut-off events. [2020-10-09 15:33:05,110 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:05,138 INFO L80 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 619 events. 21/619 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2662 event pairs, 0 based on Foata normal form. 0/577 useless extension candidates. Maximal degree in co-relation 771. Up to 22 conditions per place. [2020-10-09 15:33:05,141 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 8 selfloop transitions, 1 changer transitions 0/515 dead transitions. [2020-10-09 15:33:05,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 515 transitions, 1293 flow [2020-10-09 15:33:05,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2020-10-09 15:33:05,142 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2020-10-09 15:33:05,142 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1660 transitions. [2020-10-09 15:33:05,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1660 transitions. [2020-10-09 15:33:05,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:05,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1660 transitions. [2020-10-09 15:33:05,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:05,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:05,144 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:05,144 INFO L185 Difference]: Start difference. First operand has 595 places, 517 transitions, 1280 flow. Second operand 3 states and 1660 transitions. [2020-10-09 15:33:05,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 515 transitions, 1293 flow [2020-10-09 15:33:05,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 515 transitions, 1292 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:05,149 INFO L241 Difference]: Finished difference. Result has 594 places, 515 transitions, 1276 flow [2020-10-09 15:33:05,150 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1274, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1276, PETRI_PLACES=594, PETRI_TRANSITIONS=515} [2020-10-09 15:33:05,150 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 52 predicate places. [2020-10-09 15:33:05,150 INFO L481 AbstractCegarLoop]: Abstraction has has 594 places, 515 transitions, 1276 flow [2020-10-09 15:33:05,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:05,150 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:05,150 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:05,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 622 mathsat -unsat_core_generation=3 [2020-10-09 15:33:05,351 INFO L429 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:05,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:05,351 INFO L82 PathProgramCache]: Analyzing trace with hash 76911062, now seen corresponding path program 1 times [2020-10-09 15:33:05,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:05,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773347075] [2020-10-09 15:33:05,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 623 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 623 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:05,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:05,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:33:05,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:33:05,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773347075] [2020-10-09 15:33:05,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:05,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:05,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275873877] [2020-10-09 15:33:05,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:05,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:05,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:05,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:05,794 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:33:05,795 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 515 transitions, 1276 flow. Second operand 3 states. [2020-10-09 15:33:05,795 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:05,795 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:33:05,795 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:05,981 INFO L129 PetriNetUnfolder]: 20/627 cut-off events. [2020-10-09 15:33:05,982 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:33:06,013 INFO L80 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 627 events. 20/627 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2733 event pairs, 0 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 783. Up to 22 conditions per place. [2020-10-09 15:33:06,015 INFO L132 encePairwiseOnDemand]: 579/584 looper letters, 10 selfloop transitions, 3 changer transitions 0/517 dead transitions. [2020-10-09 15:33:06,015 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 517 transitions, 1306 flow [2020-10-09 15:33:06,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:06,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2020-10-09 15:33:06,017 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503424657534246 [2020-10-09 15:33:06,017 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1665 transitions. [2020-10-09 15:33:06,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1665 transitions. [2020-10-09 15:33:06,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:06,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1665 transitions. [2020-10-09 15:33:06,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:06,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:06,019 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:06,019 INFO L185 Difference]: Start difference. First operand has 594 places, 515 transitions, 1276 flow. Second operand 3 states and 1665 transitions. [2020-10-09 15:33:06,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 517 transitions, 1306 flow [2020-10-09 15:33:06,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 517 transitions, 1305 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:06,024 INFO L241 Difference]: Finished difference. Result has 597 places, 517 transitions, 1299 flow [2020-10-09 15:33:06,024 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1275, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1299, PETRI_PLACES=597, PETRI_TRANSITIONS=517} [2020-10-09 15:33:06,024 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 55 predicate places. [2020-10-09 15:33:06,024 INFO L481 AbstractCegarLoop]: Abstraction has has 597 places, 517 transitions, 1299 flow [2020-10-09 15:33:06,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:06,024 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:06,024 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:06,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 623 mathsat -unsat_core_generation=3 [2020-10-09 15:33:06,225 INFO L429 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:06,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:06,226 INFO L82 PathProgramCache]: Analyzing trace with hash 76910039, now seen corresponding path program 1 times [2020-10-09 15:33:06,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:06,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156521855] [2020-10-09 15:33:06,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 624 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 624 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:06,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:33:06,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:33:06,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:33:06,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156521855] [2020-10-09 15:33:06,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:06,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:06,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570055525] [2020-10-09 15:33:06,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:06,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:06,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:06,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:06,636 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 584 [2020-10-09 15:33:06,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 517 transitions, 1299 flow. Second operand 3 states. [2020-10-09 15:33:06,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:06,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 584 [2020-10-09 15:33:06,637 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:06,819 INFO L129 PetriNetUnfolder]: 18/628 cut-off events. [2020-10-09 15:33:06,819 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:33:06,849 INFO L80 FinitePrefix]: Finished finitePrefix Result has 842 conditions, 628 events. 18/628 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2754 event pairs, 0 based on Foata normal form. 1/591 useless extension candidates. Maximal degree in co-relation 781. Up to 22 conditions per place. [2020-10-09 15:33:06,852 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 4 selfloop transitions, 1 changer transitions 0/516 dead transitions. [2020-10-09 15:33:06,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 516 transitions, 1305 flow [2020-10-09 15:33:06,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:06,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2020-10-09 15:33:06,853 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9554794520547946 [2020-10-09 15:33:06,853 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2020-10-09 15:33:06,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2020-10-09 15:33:06,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:06,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2020-10-09 15:33:06,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:06,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:06,856 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:06,856 INFO L185 Difference]: Start difference. First operand has 597 places, 517 transitions, 1299 flow. Second operand 3 states and 1674 transitions. [2020-10-09 15:33:06,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 516 transitions, 1305 flow [2020-10-09 15:33:06,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 516 transitions, 1300 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:06,861 INFO L241 Difference]: Finished difference. Result has 599 places, 516 transitions, 1295 flow [2020-10-09 15:33:06,861 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1295, PETRI_PLACES=599, PETRI_TRANSITIONS=516} [2020-10-09 15:33:06,861 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 57 predicate places. [2020-10-09 15:33:06,861 INFO L481 AbstractCegarLoop]: Abstraction has has 599 places, 516 transitions, 1295 flow [2020-10-09 15:33:06,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:06,862 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:06,862 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:07,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 624 mathsat -unsat_core_generation=3 [2020-10-09 15:33:07,062 INFO L429 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:07,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:07,063 INFO L82 PathProgramCache]: Analyzing trace with hash 75957750, now seen corresponding path program 1 times [2020-10-09 15:33:07,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:07,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729727029] [2020-10-09 15:33:07,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 625 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 625 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:07,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:07,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:33:07,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:33:07,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729727029] [2020-10-09 15:33:07,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:07,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:07,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966643506] [2020-10-09 15:33:07,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:07,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:07,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:07,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:07,472 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 584 [2020-10-09 15:33:07,473 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 516 transitions, 1295 flow. Second operand 3 states. [2020-10-09 15:33:07,473 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:07,473 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 584 [2020-10-09 15:33:07,473 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:07,649 INFO L129 PetriNetUnfolder]: 18/621 cut-off events. [2020-10-09 15:33:07,649 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:33:07,678 INFO L80 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 621 events. 18/621 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2696 event pairs, 0 based on Foata normal form. 1/584 useless extension candidates. Maximal degree in co-relation 777. Up to 22 conditions per place. [2020-10-09 15:33:07,680 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 5 selfloop transitions, 1 changer transitions 0/514 dead transitions. [2020-10-09 15:33:07,680 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 514 transitions, 1298 flow [2020-10-09 15:33:07,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2020-10-09 15:33:07,682 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.954337899543379 [2020-10-09 15:33:07,682 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2020-10-09 15:33:07,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2020-10-09 15:33:07,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:07,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2020-10-09 15:33:07,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:07,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:07,684 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:07,684 INFO L185 Difference]: Start difference. First operand has 599 places, 516 transitions, 1295 flow. Second operand 3 states and 1672 transitions. [2020-10-09 15:33:07,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 514 transitions, 1298 flow [2020-10-09 15:33:07,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 514 transitions, 1291 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:33:07,689 INFO L241 Difference]: Finished difference. Result has 599 places, 514 transitions, 1284 flow [2020-10-09 15:33:07,689 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1284, PETRI_PLACES=599, PETRI_TRANSITIONS=514} [2020-10-09 15:33:07,689 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 57 predicate places. [2020-10-09 15:33:07,690 INFO L481 AbstractCegarLoop]: Abstraction has has 599 places, 514 transitions, 1284 flow [2020-10-09 15:33:07,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:07,690 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:07,690 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:07,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 625 mathsat -unsat_core_generation=3 [2020-10-09 15:33:07,891 INFO L429 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:07,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:07,891 INFO L82 PathProgramCache]: Analyzing trace with hash 75956727, now seen corresponding path program 1 times [2020-10-09 15:33:07,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:07,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835206011] [2020-10-09 15:33:07,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 626 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 626 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:08,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:08,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:33:08,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:33:08,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835206011] [2020-10-09 15:33:08,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:08,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:08,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77193466] [2020-10-09 15:33:08,287 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:08,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:08,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:08,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:08,307 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:33:08,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 514 transitions, 1284 flow. Second operand 3 states. [2020-10-09 15:33:08,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:08,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:33:08,308 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:08,491 INFO L129 PetriNetUnfolder]: 18/619 cut-off events. [2020-10-09 15:33:08,491 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:08,520 INFO L80 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 619 events. 18/619 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2680 event pairs, 0 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 777. Up to 22 conditions per place. [2020-10-09 15:33:08,522 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 8 selfloop transitions, 1 changer transitions 0/512 dead transitions. [2020-10-09 15:33:08,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 512 transitions, 1297 flow [2020-10-09 15:33:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2020-10-09 15:33:08,524 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2020-10-09 15:33:08,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1660 transitions. [2020-10-09 15:33:08,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1660 transitions. [2020-10-09 15:33:08,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:08,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1660 transitions. [2020-10-09 15:33:08,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:08,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:08,525 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:08,525 INFO L185 Difference]: Start difference. First operand has 599 places, 514 transitions, 1284 flow. Second operand 3 states and 1660 transitions. [2020-10-09 15:33:08,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 512 transitions, 1297 flow [2020-10-09 15:33:08,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 512 transitions, 1296 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:08,531 INFO L241 Difference]: Finished difference. Result has 598 places, 512 transitions, 1280 flow [2020-10-09 15:33:08,531 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1280, PETRI_PLACES=598, PETRI_TRANSITIONS=512} [2020-10-09 15:33:08,531 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 56 predicate places. [2020-10-09 15:33:08,531 INFO L481 AbstractCegarLoop]: Abstraction has has 598 places, 512 transitions, 1280 flow [2020-10-09 15:33:08,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:08,531 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:08,531 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:08,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 626 mathsat -unsat_core_generation=3 [2020-10-09 15:33:08,732 INFO L429 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:08,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:08,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1170748670, now seen corresponding path program 1 times [2020-10-09 15:33:08,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:08,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65458078] [2020-10-09 15:33:08,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 627 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 627 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:09,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:09,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:33:09,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:33:09,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65458078] [2020-10-09 15:33:09,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:09,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:09,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928211500] [2020-10-09 15:33:09,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:09,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:09,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:09,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:09,159 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 584 [2020-10-09 15:33:09,160 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 512 transitions, 1280 flow. Second operand 3 states. [2020-10-09 15:33:09,160 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:09,160 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 584 [2020-10-09 15:33:09,160 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:09,347 INFO L129 PetriNetUnfolder]: 16/624 cut-off events. [2020-10-09 15:33:09,347 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:33:09,378 INFO L80 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 624 events. 16/624 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2733 event pairs, 0 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 780. Up to 22 conditions per place. [2020-10-09 15:33:09,381 INFO L132 encePairwiseOnDemand]: 581/584 looper letters, 5 selfloop transitions, 2 changer transitions 0/513 dead transitions. [2020-10-09 15:33:09,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 513 transitions, 1296 flow [2020-10-09 15:33:09,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:09,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2020-10-09 15:33:09,382 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9549086757990868 [2020-10-09 15:33:09,382 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1673 transitions. [2020-10-09 15:33:09,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1673 transitions. [2020-10-09 15:33:09,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:09,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1673 transitions. [2020-10-09 15:33:09,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:09,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:09,384 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:09,384 INFO L185 Difference]: Start difference. First operand has 598 places, 512 transitions, 1280 flow. Second operand 3 states and 1673 transitions. [2020-10-09 15:33:09,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 513 transitions, 1296 flow [2020-10-09 15:33:09,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 513 transitions, 1295 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:09,390 INFO L241 Difference]: Finished difference. Result has 601 places, 513 transitions, 1293 flow [2020-10-09 15:33:09,390 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1293, PETRI_PLACES=601, PETRI_TRANSITIONS=513} [2020-10-09 15:33:09,390 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 59 predicate places. [2020-10-09 15:33:09,390 INFO L481 AbstractCegarLoop]: Abstraction has has 601 places, 513 transitions, 1293 flow [2020-10-09 15:33:09,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:09,390 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:09,390 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:09,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 627 mathsat -unsat_core_generation=3 [2020-10-09 15:33:09,591 INFO L429 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:09,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:09,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1170749693, now seen corresponding path program 1 times [2020-10-09 15:33:09,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:09,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200711201] [2020-10-09 15:33:09,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 628 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 628 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:09,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:09,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:33:10,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:10,007 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:33:10,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200711201] [2020-10-09 15:33:10,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:10,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:10,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202067083] [2020-10-09 15:33:10,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:10,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:10,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:10,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:10,045 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:33:10,045 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 513 transitions, 1293 flow. Second operand 3 states. [2020-10-09 15:33:10,046 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:10,046 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:33:10,046 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:10,234 INFO L129 PetriNetUnfolder]: 16/625 cut-off events. [2020-10-09 15:33:10,234 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:33:10,266 INFO L80 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 625 events. 16/625 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2738 event pairs, 0 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 788. Up to 22 conditions per place. [2020-10-09 15:33:10,268 INFO L132 encePairwiseOnDemand]: 580/584 looper letters, 9 selfloop transitions, 3 changer transitions 0/514 dead transitions. [2020-10-09 15:33:10,268 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 514 transitions, 1319 flow [2020-10-09 15:33:10,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2020-10-09 15:33:10,269 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9492009132420092 [2020-10-09 15:33:10,270 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1663 transitions. [2020-10-09 15:33:10,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1663 transitions. [2020-10-09 15:33:10,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:10,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1663 transitions. [2020-10-09 15:33:10,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:10,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:10,271 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:10,271 INFO L185 Difference]: Start difference. First operand has 601 places, 513 transitions, 1293 flow. Second operand 3 states and 1663 transitions. [2020-10-09 15:33:10,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 514 transitions, 1319 flow [2020-10-09 15:33:10,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 514 transitions, 1317 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:10,277 INFO L241 Difference]: Finished difference. Result has 604 places, 514 transitions, 1309 flow [2020-10-09 15:33:10,277 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1309, PETRI_PLACES=604, PETRI_TRANSITIONS=514} [2020-10-09 15:33:10,277 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 62 predicate places. [2020-10-09 15:33:10,277 INFO L481 AbstractCegarLoop]: Abstraction has has 604 places, 514 transitions, 1309 flow [2020-10-09 15:33:10,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:10,277 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:10,277 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:10,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 628 mathsat -unsat_core_generation=3 [2020-10-09 15:33:10,478 INFO L429 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:10,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:10,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1169795358, now seen corresponding path program 1 times [2020-10-09 15:33:10,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:10,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258083200] [2020-10-09 15:33:10,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 629 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 629 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:10,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:10,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:33:10,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:10,876 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:33:10,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258083200] [2020-10-09 15:33:10,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:10,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:10,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637831878] [2020-10-09 15:33:10,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:10,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:10,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:10,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:10,897 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:33:10,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 514 transitions, 1309 flow. Second operand 3 states. [2020-10-09 15:33:10,898 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:10,898 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:33:10,898 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:11,083 INFO L129 PetriNetUnfolder]: 15/622 cut-off events. [2020-10-09 15:33:11,083 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2020-10-09 15:33:11,113 INFO L80 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 622 events. 15/622 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2722 event pairs, 0 based on Foata normal form. 2/588 useless extension candidates. Maximal degree in co-relation 787. Up to 22 conditions per place. [2020-10-09 15:33:11,115 INFO L132 encePairwiseOnDemand]: 581/584 looper letters, 9 selfloop transitions, 1 changer transitions 0/512 dead transitions. [2020-10-09 15:33:11,115 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 512 transitions, 1317 flow [2020-10-09 15:33:11,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:11,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1662 transitions. [2020-10-09 15:33:11,116 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9486301369863014 [2020-10-09 15:33:11,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1662 transitions. [2020-10-09 15:33:11,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1662 transitions. [2020-10-09 15:33:11,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:11,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1662 transitions. [2020-10-09 15:33:11,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:11,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:11,118 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:11,118 INFO L185 Difference]: Start difference. First operand has 604 places, 514 transitions, 1309 flow. Second operand 3 states and 1662 transitions. [2020-10-09 15:33:11,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 512 transitions, 1317 flow [2020-10-09 15:33:11,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 512 transitions, 1316 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:11,124 INFO L241 Difference]: Finished difference. Result has 605 places, 512 transitions, 1298 flow [2020-10-09 15:33:11,124 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1298, PETRI_PLACES=605, PETRI_TRANSITIONS=512} [2020-10-09 15:33:11,124 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 63 predicate places. [2020-10-09 15:33:11,124 INFO L481 AbstractCegarLoop]: Abstraction has has 605 places, 512 transitions, 1298 flow [2020-10-09 15:33:11,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:11,125 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:11,125 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:11,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 629 mathsat -unsat_core_generation=3 [2020-10-09 15:33:11,325 INFO L429 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:11,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:11,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1169796381, now seen corresponding path program 1 times [2020-10-09 15:33:11,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:11,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674605787] [2020-10-09 15:33:11,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 630 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 630 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:11,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:33:11,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:33:11,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:33:11,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674605787] [2020-10-09 15:33:11,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:11,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:11,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609580501] [2020-10-09 15:33:11,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:11,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:11,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:11,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:11,744 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 584 [2020-10-09 15:33:11,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 512 transitions, 1298 flow. Second operand 3 states. [2020-10-09 15:33:11,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:11,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 584 [2020-10-09 15:33:11,745 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:11,928 INFO L129 PetriNetUnfolder]: 15/619 cut-off events. [2020-10-09 15:33:11,928 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:11,959 INFO L80 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 619 events. 15/619 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2698 event pairs, 0 based on Foata normal form. 1/585 useless extension candidates. Maximal degree in co-relation 781. Up to 22 conditions per place. [2020-10-09 15:33:11,961 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 4 selfloop transitions, 1 changer transitions 0/509 dead transitions. [2020-10-09 15:33:11,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 509 transitions, 1297 flow [2020-10-09 15:33:11,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2020-10-09 15:33:11,962 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9554794520547946 [2020-10-09 15:33:11,962 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2020-10-09 15:33:11,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2020-10-09 15:33:11,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:11,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2020-10-09 15:33:11,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:11,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:11,964 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:11,964 INFO L185 Difference]: Start difference. First operand has 605 places, 512 transitions, 1298 flow. Second operand 3 states and 1674 transitions. [2020-10-09 15:33:11,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 509 transitions, 1297 flow [2020-10-09 15:33:11,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 509 transitions, 1292 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:33:11,969 INFO L241 Difference]: Finished difference. Result has 602 places, 509 transitions, 1284 flow [2020-10-09 15:33:11,970 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1284, PETRI_PLACES=602, PETRI_TRANSITIONS=509} [2020-10-09 15:33:11,970 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 60 predicate places. [2020-10-09 15:33:11,970 INFO L481 AbstractCegarLoop]: Abstraction has has 602 places, 509 transitions, 1284 flow [2020-10-09 15:33:11,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:11,970 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:11,970 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:12,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 630 mathsat -unsat_core_generation=3 [2020-10-09 15:33:12,171 INFO L429 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:12,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1711622160, now seen corresponding path program 1 times [2020-10-09 15:33:12,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:12,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583612962] [2020-10-09 15:33:12,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 631 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 631 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:12,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:12,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:33:12,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:33:12,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583612962] [2020-10-09 15:33:12,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:12,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:12,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901819718] [2020-10-09 15:33:12,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:12,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:12,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:12,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:12,602 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:33:12,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 509 transitions, 1284 flow. Second operand 3 states. [2020-10-09 15:33:12,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:12,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:33:12,603 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:12,803 INFO L129 PetriNetUnfolder]: 14/627 cut-off events. [2020-10-09 15:33:12,803 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:33:12,833 INFO L80 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 627 events. 14/627 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2768 event pairs, 0 based on Foata normal form. 0/590 useless extension candidates. Maximal degree in co-relation 798. Up to 22 conditions per place. [2020-10-09 15:33:12,836 INFO L132 encePairwiseOnDemand]: 579/584 looper letters, 10 selfloop transitions, 3 changer transitions 0/511 dead transitions. [2020-10-09 15:33:12,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 511 transitions, 1314 flow [2020-10-09 15:33:12,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:12,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2020-10-09 15:33:12,837 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503424657534246 [2020-10-09 15:33:12,837 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1665 transitions. [2020-10-09 15:33:12,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1665 transitions. [2020-10-09 15:33:12,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:12,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1665 transitions. [2020-10-09 15:33:12,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:12,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:12,839 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:12,839 INFO L185 Difference]: Start difference. First operand has 602 places, 509 transitions, 1284 flow. Second operand 3 states and 1665 transitions. [2020-10-09 15:33:12,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 511 transitions, 1314 flow [2020-10-09 15:33:12,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 511 transitions, 1313 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:12,845 INFO L241 Difference]: Finished difference. Result has 605 places, 511 transitions, 1307 flow [2020-10-09 15:33:12,845 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1307, PETRI_PLACES=605, PETRI_TRANSITIONS=511} [2020-10-09 15:33:12,845 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 63 predicate places. [2020-10-09 15:33:12,845 INFO L481 AbstractCegarLoop]: Abstraction has has 605 places, 511 transitions, 1307 flow [2020-10-09 15:33:12,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:12,845 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:12,846 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:13,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 631 mathsat -unsat_core_generation=3 [2020-10-09 15:33:13,046 INFO L429 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:13,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:13,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1711623183, now seen corresponding path program 1 times [2020-10-09 15:33:13,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:13,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045678790] [2020-10-09 15:33:13,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 632 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 632 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:13,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:13,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:13,446 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:33:13,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:33:13,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045678790] [2020-10-09 15:33:13,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:13,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:13,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659657922] [2020-10-09 15:33:13,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:13,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:13,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:13,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:13,461 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 584 [2020-10-09 15:33:13,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 511 transitions, 1307 flow. Second operand 3 states. [2020-10-09 15:33:13,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:13,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 584 [2020-10-09 15:33:13,462 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:13,672 INFO L129 PetriNetUnfolder]: 13/625 cut-off events. [2020-10-09 15:33:13,672 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:33:13,698 INFO L80 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 625 events. 13/625 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2758 event pairs, 0 based on Foata normal form. 0/592 useless extension candidates. Maximal degree in co-relation 793. Up to 22 conditions per place. [2020-10-09 15:33:13,700 INFO L132 encePairwiseOnDemand]: 581/584 looper letters, 5 selfloop transitions, 2 changer transitions 0/511 dead transitions. [2020-10-09 15:33:13,700 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 511 transitions, 1319 flow [2020-10-09 15:33:13,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:13,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2020-10-09 15:33:13,701 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9549086757990868 [2020-10-09 15:33:13,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1673 transitions. [2020-10-09 15:33:13,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1673 transitions. [2020-10-09 15:33:13,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:13,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1673 transitions. [2020-10-09 15:33:13,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:13,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:13,703 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:13,703 INFO L185 Difference]: Start difference. First operand has 605 places, 511 transitions, 1307 flow. Second operand 3 states and 1673 transitions. [2020-10-09 15:33:13,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 511 transitions, 1319 flow [2020-10-09 15:33:13,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 511 transitions, 1314 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:13,709 INFO L241 Difference]: Finished difference. Result has 608 places, 511 transitions, 1312 flow [2020-10-09 15:33:13,709 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1312, PETRI_PLACES=608, PETRI_TRANSITIONS=511} [2020-10-09 15:33:13,709 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 66 predicate places. [2020-10-09 15:33:13,709 INFO L481 AbstractCegarLoop]: Abstraction has has 608 places, 511 transitions, 1312 flow [2020-10-09 15:33:13,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:13,709 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:13,709 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:13,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 632 mathsat -unsat_core_generation=3 [2020-10-09 15:33:13,910 INFO L429 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:13,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:13,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1712575472, now seen corresponding path program 1 times [2020-10-09 15:33:13,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:13,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72816420] [2020-10-09 15:33:13,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 633 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 633 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:14,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:33:14,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:33:14,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:33:14,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72816420] [2020-10-09 15:33:14,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:14,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:14,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128348953] [2020-10-09 15:33:14,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:14,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:14,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:14,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:14,337 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 584 [2020-10-09 15:33:14,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 511 transitions, 1312 flow. Second operand 3 states. [2020-10-09 15:33:14,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:14,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 584 [2020-10-09 15:33:14,339 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:14,520 INFO L129 PetriNetUnfolder]: 12/621 cut-off events. [2020-10-09 15:33:14,521 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:14,550 INFO L80 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 621 events. 12/621 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2732 event pairs, 0 based on Foata normal form. 1/590 useless extension candidates. Maximal degree in co-relation 789. Up to 22 conditions per place. [2020-10-09 15:33:14,552 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 4 selfloop transitions, 1 changer transitions 0/508 dead transitions. [2020-10-09 15:33:14,552 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 508 transitions, 1307 flow [2020-10-09 15:33:14,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:14,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2020-10-09 15:33:14,554 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9554794520547946 [2020-10-09 15:33:14,554 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2020-10-09 15:33:14,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2020-10-09 15:33:14,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:14,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2020-10-09 15:33:14,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:14,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:14,556 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:14,556 INFO L185 Difference]: Start difference. First operand has 608 places, 511 transitions, 1312 flow. Second operand 3 states and 1674 transitions. [2020-10-09 15:33:14,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 508 transitions, 1307 flow [2020-10-09 15:33:14,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 508 transitions, 1300 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:33:14,561 INFO L241 Difference]: Finished difference. Result has 607 places, 508 transitions, 1292 flow [2020-10-09 15:33:14,561 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=508, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1292, PETRI_PLACES=607, PETRI_TRANSITIONS=508} [2020-10-09 15:33:14,562 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 65 predicate places. [2020-10-09 15:33:14,562 INFO L481 AbstractCegarLoop]: Abstraction has has 607 places, 508 transitions, 1292 flow [2020-10-09 15:33:14,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:14,562 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:14,562 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:14,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 633 mathsat -unsat_core_generation=3 [2020-10-09 15:33:14,763 INFO L429 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:14,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:14,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1712576495, now seen corresponding path program 1 times [2020-10-09 15:33:14,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:14,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959248976] [2020-10-09 15:33:14,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 634 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 634 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:15,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:15,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:33:15,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:33:15,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959248976] [2020-10-09 15:33:15,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:15,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:15,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294995876] [2020-10-09 15:33:15,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:15,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:15,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:15,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:15,203 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 584 [2020-10-09 15:33:15,204 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 508 transitions, 1292 flow. Second operand 3 states. [2020-10-09 15:33:15,204 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:15,204 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 584 [2020-10-09 15:33:15,204 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:15,394 INFO L129 PetriNetUnfolder]: 12/619 cut-off events. [2020-10-09 15:33:15,394 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:33:15,426 INFO L80 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 619 events. 12/619 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2715 event pairs, 0 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 791. Up to 22 conditions per place. [2020-10-09 15:33:15,428 INFO L132 encePairwiseOnDemand]: 582/584 looper letters, 8 selfloop transitions, 1 changer transitions 0/506 dead transitions. [2020-10-09 15:33:15,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 506 transitions, 1305 flow [2020-10-09 15:33:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2020-10-09 15:33:15,430 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2020-10-09 15:33:15,430 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1660 transitions. [2020-10-09 15:33:15,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1660 transitions. [2020-10-09 15:33:15,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:15,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1660 transitions. [2020-10-09 15:33:15,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:15,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:15,431 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:15,431 INFO L185 Difference]: Start difference. First operand has 607 places, 508 transitions, 1292 flow. Second operand 3 states and 1660 transitions. [2020-10-09 15:33:15,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 506 transitions, 1305 flow [2020-10-09 15:33:15,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 506 transitions, 1304 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:15,437 INFO L241 Difference]: Finished difference. Result has 606 places, 506 transitions, 1288 flow [2020-10-09 15:33:15,437 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1286, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1288, PETRI_PLACES=606, PETRI_TRANSITIONS=506} [2020-10-09 15:33:15,437 INFO L341 CegarLoopForPetriNet]: 542 programPoint places, 64 predicate places. [2020-10-09 15:33:15,437 INFO L481 AbstractCegarLoop]: Abstraction has has 606 places, 506 transitions, 1288 flow [2020-10-09 15:33:15,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:15,438 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:15,438 INFO L255 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:15,638 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 634 mathsat -unsat_core_generation=3 [2020-10-09 15:33:15,638 INFO L429 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:15,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:15,639 INFO L82 PathProgramCache]: Analyzing trace with hash -884689026, now seen corresponding path program 1 times [2020-10-09 15:33:15,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:15,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765159214] [2020-10-09 15:33:15,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 635 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 635 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:33:16,039 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:33:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:33:16,078 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:33:16,135 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:33:16,136 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:33:16,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 635 mathsat -unsat_core_generation=3 [2020-10-09 15:33:16,336 WARN L371 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:33:16,337 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2020-10-09 15:33:16,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,399 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,399 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,399 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,399 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,399 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,399 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,399 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,399 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,400 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,400 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,400 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,402 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,402 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,402 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,402 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,402 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,402 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,402 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,405 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,405 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,405 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,405 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,405 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,415 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,420 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,421 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,421 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,421 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,421 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,421 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,421 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,421 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,421 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,423 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,424 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,424 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,424 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,424 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,424 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,424 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,424 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,425 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,425 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,425 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,425 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,426 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,426 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,426 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,428 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,432 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,432 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,432 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,432 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,432 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,432 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,432 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,433 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,433 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,433 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,433 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,433 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,434 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,434 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,434 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,435 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,435 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,435 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,435 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,435 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,435 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,435 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,435 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,435 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,435 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,435 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,435 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,435 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,435 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,436 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,437 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,437 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,437 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,437 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,437 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,438 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,438 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,438 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,438 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,438 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,438 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,438 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,438 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,438 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,438 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,438 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,438 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,438 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,438 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,441 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,441 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,441 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,441 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,441 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,441 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,441 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,441 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,441 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,441 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,441 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,441 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,441 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,441 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,441 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,442 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,442 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,442 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,443 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,443 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,443 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,443 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,443 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,443 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,444 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,444 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,445 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,445 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,445 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,445 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,445 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,445 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,445 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,445 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,445 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,446 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,446 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,446 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,446 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,446 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,446 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,446 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,446 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,447 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,447 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,447 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,447 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,447 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,447 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,448 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,448 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,448 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,448 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,448 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,448 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,448 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,448 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,449 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,450 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,450 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,450 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,450 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,450 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,450 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,450 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,450 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,450 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,450 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,451 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,451 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,451 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,451 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,451 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,452 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,452 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,452 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,452 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,452 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,452 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,453 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,453 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,453 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,453 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,453 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,453 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,453 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,453 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,453 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,453 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,453 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,456 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,456 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,456 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,456 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,456 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,456 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,457 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,459 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,459 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,459 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,467 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,467 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,468 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,468 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,470 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,470 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,470 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,470 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,470 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,476 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,478 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,478 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,478 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,481 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,481 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,481 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,481 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,483 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,483 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,483 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,483 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,483 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:33:16,484 INFO L253 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2020-10-09 15:33:16,484 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:33:16,484 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:33:16,484 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:33:16,484 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:33:16,485 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:33:16,485 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:33:16,485 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:33:16,485 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:33:16,489 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 567 places, 611 transitions, 1794 flow [2020-10-09 15:33:16,678 INFO L129 PetriNetUnfolder]: 111/808 cut-off events. [2020-10-09 15:33:16,678 INFO L130 PetriNetUnfolder]: For 2002/2002 co-relation queries the response was YES. [2020-10-09 15:33:16,722 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 808 events. 111/808 cut-off events. For 2002/2002 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3336 event pairs, 0 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 1061. Up to 46 conditions per place. [2020-10-09 15:33:16,722 INFO L82 GeneralOperation]: Start removeDead. Operand has 567 places, 611 transitions, 1794 flow [2020-10-09 15:33:16,738 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 567 places, 611 transitions, 1794 flow [2020-10-09 15:33:16,747 INFO L129 PetriNetUnfolder]: 10/102 cut-off events. [2020-10-09 15:33:16,747 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:33:16,747 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:16,747 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:16,747 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:16,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:16,748 INFO L82 PathProgramCache]: Analyzing trace with hash -370163534, now seen corresponding path program 1 times [2020-10-09 15:33:16,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:16,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024908240] [2020-10-09 15:33:16,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 636 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 636 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:17,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:17,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:33:17,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:33:17,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024908240] [2020-10-09 15:33:17,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:17,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:17,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533229557] [2020-10-09 15:33:17,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:17,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:17,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:17,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:17,184 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:17,184 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 611 transitions, 1794 flow. Second operand 3 states. [2020-10-09 15:33:17,185 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:17,185 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:17,185 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:17,413 INFO L129 PetriNetUnfolder]: 65/656 cut-off events. [2020-10-09 15:33:17,414 INFO L130 PetriNetUnfolder]: For 2003/2003 co-relation queries the response was YES. [2020-10-09 15:33:17,435 INFO L80 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 656 events. 65/656 cut-off events. For 2003/2003 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2593 event pairs, 0 based on Foata normal form. 96/663 useless extension candidates. Maximal degree in co-relation 921. Up to 23 conditions per place. [2020-10-09 15:33:17,443 INFO L132 encePairwiseOnDemand]: 582/611 looper letters, 10 selfloop transitions, 3 changer transitions 0/585 dead transitions. [2020-10-09 15:33:17,443 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 585 transitions, 1768 flow [2020-10-09 15:33:17,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:17,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1791 transitions. [2020-10-09 15:33:17,444 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9770867430441899 [2020-10-09 15:33:17,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1791 transitions. [2020-10-09 15:33:17,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1791 transitions. [2020-10-09 15:33:17,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:17,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1791 transitions. [2020-10-09 15:33:17,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:17,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:17,446 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:17,447 INFO L185 Difference]: Start difference. First operand has 567 places, 611 transitions, 1794 flow. Second operand 3 states and 1791 transitions. [2020-10-09 15:33:17,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 585 transitions, 1768 flow [2020-10-09 15:33:17,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 585 transitions, 1306 flow, removed 231 selfloop flow, removed 0 redundant places. [2020-10-09 15:33:17,454 INFO L241 Difference]: Finished difference. Result has 566 places, 585 transitions, 1300 flow [2020-10-09 15:33:17,454 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1300, PETRI_PLACES=566, PETRI_TRANSITIONS=585} [2020-10-09 15:33:17,454 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, -1 predicate places. [2020-10-09 15:33:17,454 INFO L481 AbstractCegarLoop]: Abstraction has has 566 places, 585 transitions, 1300 flow [2020-10-09 15:33:17,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:17,455 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:17,455 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:17,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 636 mathsat -unsat_core_generation=3 [2020-10-09 15:33:17,655 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:17,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:17,656 INFO L82 PathProgramCache]: Analyzing trace with hash -370162511, now seen corresponding path program 1 times [2020-10-09 15:33:17,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:17,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091884016] [2020-10-09 15:33:17,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 637 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 637 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:18,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:18,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:33:18,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:33:18,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091884016] [2020-10-09 15:33:18,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:18,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:18,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132532477] [2020-10-09 15:33:18,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:18,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:18,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:18,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:18,072 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 611 [2020-10-09 15:33:18,073 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 585 transitions, 1300 flow. Second operand 3 states. [2020-10-09 15:33:18,073 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:18,073 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 611 [2020-10-09 15:33:18,073 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:18,240 INFO L129 PetriNetUnfolder]: 64/654 cut-off events. [2020-10-09 15:33:18,240 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:33:18,272 INFO L80 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 654 events. 64/654 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2583 event pairs, 0 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 717. Up to 23 conditions per place. [2020-10-09 15:33:18,281 INFO L132 encePairwiseOnDemand]: 608/611 looper letters, 5 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2020-10-09 15:33:18,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 585 transitions, 1312 flow [2020-10-09 15:33:18,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1751 transitions. [2020-10-09 15:33:18,283 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955264593562466 [2020-10-09 15:33:18,283 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1751 transitions. [2020-10-09 15:33:18,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1751 transitions. [2020-10-09 15:33:18,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:18,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1751 transitions. [2020-10-09 15:33:18,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:18,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:18,285 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:18,285 INFO L185 Difference]: Start difference. First operand has 566 places, 585 transitions, 1300 flow. Second operand 3 states and 1751 transitions. [2020-10-09 15:33:18,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 585 transitions, 1312 flow [2020-10-09 15:33:18,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 585 transitions, 1307 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:18,290 INFO L241 Difference]: Finished difference. Result has 569 places, 585 transitions, 1305 flow [2020-10-09 15:33:18,290 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=569, PETRI_TRANSITIONS=585} [2020-10-09 15:33:18,290 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 2 predicate places. [2020-10-09 15:33:18,290 INFO L481 AbstractCegarLoop]: Abstraction has has 569 places, 585 transitions, 1305 flow [2020-10-09 15:33:18,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:18,291 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:18,291 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:18,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 637 mathsat -unsat_core_generation=3 [2020-10-09 15:33:18,491 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:18,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:18,492 INFO L82 PathProgramCache]: Analyzing trace with hash -369210222, now seen corresponding path program 1 times [2020-10-09 15:33:18,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:18,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176317977] [2020-10-09 15:33:18,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 638 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 638 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:18,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:33:18,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:33:18,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:18,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:33:18,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176317977] [2020-10-09 15:33:18,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:18,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:18,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153006935] [2020-10-09 15:33:18,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:18,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:18,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:18,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:18,909 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 582 out of 611 [2020-10-09 15:33:18,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 585 transitions, 1305 flow. Second operand 3 states. [2020-10-09 15:33:18,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:18,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 582 of 611 [2020-10-09 15:33:18,911 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:19,079 INFO L129 PetriNetUnfolder]: 63/650 cut-off events. [2020-10-09 15:33:19,079 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:19,111 INFO L80 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 650 events. 63/650 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2561 event pairs, 0 based on Foata normal form. 1/567 useless extension candidates. Maximal degree in co-relation 718. Up to 23 conditions per place. [2020-10-09 15:33:19,120 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 4 selfloop transitions, 1 changer transitions 0/582 dead transitions. [2020-10-09 15:33:19,120 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 582 transitions, 1300 flow [2020-10-09 15:33:19,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2020-10-09 15:33:19,121 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955810147299509 [2020-10-09 15:33:19,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2020-10-09 15:33:19,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2020-10-09 15:33:19,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:19,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2020-10-09 15:33:19,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:19,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:19,123 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:19,123 INFO L185 Difference]: Start difference. First operand has 569 places, 585 transitions, 1305 flow. Second operand 3 states and 1752 transitions. [2020-10-09 15:33:19,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 582 transitions, 1300 flow [2020-10-09 15:33:19,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 582 transitions, 1293 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:33:19,128 INFO L241 Difference]: Finished difference. Result has 568 places, 582 transitions, 1285 flow [2020-10-09 15:33:19,129 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1285, PETRI_PLACES=568, PETRI_TRANSITIONS=582} [2020-10-09 15:33:19,129 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 1 predicate places. [2020-10-09 15:33:19,129 INFO L481 AbstractCegarLoop]: Abstraction has has 568 places, 582 transitions, 1285 flow [2020-10-09 15:33:19,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:19,129 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:19,129 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:19,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 638 mathsat -unsat_core_generation=3 [2020-10-09 15:33:19,330 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:19,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:19,330 INFO L82 PathProgramCache]: Analyzing trace with hash -369209199, now seen corresponding path program 1 times [2020-10-09 15:33:19,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:19,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532240935] [2020-10-09 15:33:19,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 639 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 639 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:19,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:19,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:33:19,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:33:19,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532240935] [2020-10-09 15:33:19,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:19,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:19,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933550523] [2020-10-09 15:33:19,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:19,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:19,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:19,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:19,749 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:19,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 582 transitions, 1285 flow. Second operand 3 states. [2020-10-09 15:33:19,750 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:19,750 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:19,750 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:19,909 INFO L129 PetriNetUnfolder]: 63/648 cut-off events. [2020-10-09 15:33:19,909 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-09 15:33:19,939 INFO L80 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 648 events. 63/648 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2545 event pairs, 0 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 720. Up to 23 conditions per place. [2020-10-09 15:33:19,947 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 8 selfloop transitions, 1 changer transitions 0/580 dead transitions. [2020-10-09 15:33:19,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 580 transitions, 1298 flow [2020-10-09 15:33:19,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1738 transitions. [2020-10-09 15:33:19,948 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481723949809057 [2020-10-09 15:33:19,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1738 transitions. [2020-10-09 15:33:19,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1738 transitions. [2020-10-09 15:33:19,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:19,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1738 transitions. [2020-10-09 15:33:19,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:19,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:19,950 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:19,950 INFO L185 Difference]: Start difference. First operand has 568 places, 582 transitions, 1285 flow. Second operand 3 states and 1738 transitions. [2020-10-09 15:33:19,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 580 transitions, 1298 flow [2020-10-09 15:33:19,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 580 transitions, 1297 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:19,956 INFO L241 Difference]: Finished difference. Result has 567 places, 580 transitions, 1281 flow [2020-10-09 15:33:19,956 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1281, PETRI_PLACES=567, PETRI_TRANSITIONS=580} [2020-10-09 15:33:19,956 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 0 predicate places. [2020-10-09 15:33:19,956 INFO L481 AbstractCegarLoop]: Abstraction has has 567 places, 580 transitions, 1281 flow [2020-10-09 15:33:19,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:19,956 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:19,956 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:33:20,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 639 mathsat -unsat_core_generation=3 [2020-10-09 15:33:20,157 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:20,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:20,157 INFO L82 PathProgramCache]: Analyzing trace with hash -919926551, now seen corresponding path program 1 times [2020-10-09 15:33:20,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:20,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034006255] [2020-10-09 15:33:20,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 640 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 640 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:20,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:20,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:33:20,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:33:20,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034006255] [2020-10-09 15:33:20,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:20,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:20,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427184212] [2020-10-09 15:33:20,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:20,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:20,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:20,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:20,585 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:20,586 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 580 transitions, 1281 flow. Second operand 3 states. [2020-10-09 15:33:20,586 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:20,586 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:20,586 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:20,745 INFO L129 PetriNetUnfolder]: 62/656 cut-off events. [2020-10-09 15:33:20,745 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:20,775 INFO L80 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 656 events. 62/656 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2619 event pairs, 0 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 732. Up to 23 conditions per place. [2020-10-09 15:33:20,783 INFO L132 encePairwiseOnDemand]: 606/611 looper letters, 10 selfloop transitions, 3 changer transitions 0/582 dead transitions. [2020-10-09 15:33:20,783 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 582 transitions, 1311 flow [2020-10-09 15:33:20,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1743 transitions. [2020-10-09 15:33:20,784 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9509001636661211 [2020-10-09 15:33:20,785 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1743 transitions. [2020-10-09 15:33:20,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1743 transitions. [2020-10-09 15:33:20,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:20,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1743 transitions. [2020-10-09 15:33:20,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:20,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:20,786 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:20,786 INFO L185 Difference]: Start difference. First operand has 567 places, 580 transitions, 1281 flow. Second operand 3 states and 1743 transitions. [2020-10-09 15:33:20,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 582 transitions, 1311 flow [2020-10-09 15:33:20,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 582 transitions, 1310 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:20,792 INFO L241 Difference]: Finished difference. Result has 570 places, 582 transitions, 1304 flow [2020-10-09 15:33:20,792 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1304, PETRI_PLACES=570, PETRI_TRANSITIONS=582} [2020-10-09 15:33:20,792 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 3 predicate places. [2020-10-09 15:33:20,792 INFO L481 AbstractCegarLoop]: Abstraction has has 570 places, 582 transitions, 1304 flow [2020-10-09 15:33:20,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:20,792 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:20,792 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:33:20,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 640 mathsat -unsat_core_generation=3 [2020-10-09 15:33:20,993 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:20,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:20,994 INFO L82 PathProgramCache]: Analyzing trace with hash -919927574, now seen corresponding path program 1 times [2020-10-09 15:33:20,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:20,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289687762] [2020-10-09 15:33:20,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 641 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 641 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:21,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:33:21,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:33:21,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:33:21,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289687762] [2020-10-09 15:33:21,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:21,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:21,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707087101] [2020-10-09 15:33:21,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:21,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:21,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:21,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:21,413 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 582 out of 611 [2020-10-09 15:33:21,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 582 transitions, 1304 flow. Second operand 3 states. [2020-10-09 15:33:21,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:21,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 582 of 611 [2020-10-09 15:33:21,414 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:21,614 INFO L129 PetriNetUnfolder]: 60/657 cut-off events. [2020-10-09 15:33:21,615 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:21,632 INFO L80 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 657 events. 60/657 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2641 event pairs, 0 based on Foata normal form. 1/577 useless extension candidates. Maximal degree in co-relation 729. Up to 23 conditions per place. [2020-10-09 15:33:21,639 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 4 selfloop transitions, 1 changer transitions 0/581 dead transitions. [2020-10-09 15:33:21,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 581 transitions, 1310 flow [2020-10-09 15:33:21,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:21,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:21,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2020-10-09 15:33:21,640 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955810147299509 [2020-10-09 15:33:21,640 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2020-10-09 15:33:21,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2020-10-09 15:33:21,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:21,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2020-10-09 15:33:21,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:21,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:21,643 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:21,643 INFO L185 Difference]: Start difference. First operand has 570 places, 582 transitions, 1304 flow. Second operand 3 states and 1752 transitions. [2020-10-09 15:33:21,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 581 transitions, 1310 flow [2020-10-09 15:33:21,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 581 transitions, 1305 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:21,648 INFO L241 Difference]: Finished difference. Result has 572 places, 581 transitions, 1300 flow [2020-10-09 15:33:21,648 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1300, PETRI_PLACES=572, PETRI_TRANSITIONS=581} [2020-10-09 15:33:21,648 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 5 predicate places. [2020-10-09 15:33:21,648 INFO L481 AbstractCegarLoop]: Abstraction has has 572 places, 581 transitions, 1300 flow [2020-10-09 15:33:21,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:21,648 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:21,649 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:33:21,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 641 mathsat -unsat_core_generation=3 [2020-10-09 15:33:21,849 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:21,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:21,850 INFO L82 PathProgramCache]: Analyzing trace with hash -920879863, now seen corresponding path program 1 times [2020-10-09 15:33:21,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:21,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88346212] [2020-10-09 15:33:21,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 642 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 642 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:22,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:22,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:33:22,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:33:22,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88346212] [2020-10-09 15:33:22,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:22,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:22,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798848160] [2020-10-09 15:33:22,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:22,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:22,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:22,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:22,265 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 611 [2020-10-09 15:33:22,266 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 581 transitions, 1300 flow. Second operand 3 states. [2020-10-09 15:33:22,266 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:22,266 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 611 [2020-10-09 15:33:22,266 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:22,432 INFO L129 PetriNetUnfolder]: 60/650 cut-off events. [2020-10-09 15:33:22,433 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:22,464 INFO L80 FinitePrefix]: Finished finitePrefix Result has 764 conditions, 650 events. 60/650 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2579 event pairs, 0 based on Foata normal form. 1/570 useless extension candidates. Maximal degree in co-relation 726. Up to 23 conditions per place. [2020-10-09 15:33:22,472 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 5 selfloop transitions, 1 changer transitions 0/579 dead transitions. [2020-10-09 15:33:22,472 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 579 transitions, 1303 flow [2020-10-09 15:33:22,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2020-10-09 15:33:22,474 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547190398254228 [2020-10-09 15:33:22,474 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2020-10-09 15:33:22,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2020-10-09 15:33:22,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:22,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2020-10-09 15:33:22,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:22,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:22,475 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:22,476 INFO L185 Difference]: Start difference. First operand has 572 places, 581 transitions, 1300 flow. Second operand 3 states and 1750 transitions. [2020-10-09 15:33:22,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 579 transitions, 1303 flow [2020-10-09 15:33:22,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 579 transitions, 1296 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:33:22,481 INFO L241 Difference]: Finished difference. Result has 572 places, 579 transitions, 1289 flow [2020-10-09 15:33:22,481 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1284, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1289, PETRI_PLACES=572, PETRI_TRANSITIONS=579} [2020-10-09 15:33:22,481 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 5 predicate places. [2020-10-09 15:33:22,481 INFO L481 AbstractCegarLoop]: Abstraction has has 572 places, 579 transitions, 1289 flow [2020-10-09 15:33:22,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:22,481 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:22,482 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:33:22,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 642 mathsat -unsat_core_generation=3 [2020-10-09 15:33:22,682 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:22,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:22,683 INFO L82 PathProgramCache]: Analyzing trace with hash -920880886, now seen corresponding path program 1 times [2020-10-09 15:33:22,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:22,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44921202] [2020-10-09 15:33:22,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 643 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 643 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:23,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:23,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:33:23,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:33:23,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44921202] [2020-10-09 15:33:23,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:23,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:23,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877480776] [2020-10-09 15:33:23,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:23,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:23,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:23,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:23,112 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:23,112 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 579 transitions, 1289 flow. Second operand 3 states. [2020-10-09 15:33:23,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:23,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:23,113 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:23,280 INFO L129 PetriNetUnfolder]: 60/648 cut-off events. [2020-10-09 15:33:23,280 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:33:23,312 INFO L80 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 648 events. 60/648 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2566 event pairs, 0 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 726. Up to 23 conditions per place. [2020-10-09 15:33:23,320 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 8 selfloop transitions, 1 changer transitions 0/577 dead transitions. [2020-10-09 15:33:23,320 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 577 transitions, 1302 flow [2020-10-09 15:33:23,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:23,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1738 transitions. [2020-10-09 15:33:23,321 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481723949809057 [2020-10-09 15:33:23,321 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1738 transitions. [2020-10-09 15:33:23,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1738 transitions. [2020-10-09 15:33:23,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:23,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1738 transitions. [2020-10-09 15:33:23,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:23,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:23,323 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:23,323 INFO L185 Difference]: Start difference. First operand has 572 places, 579 transitions, 1289 flow. Second operand 3 states and 1738 transitions. [2020-10-09 15:33:23,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 577 transitions, 1302 flow [2020-10-09 15:33:23,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 577 transitions, 1301 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:23,328 INFO L241 Difference]: Finished difference. Result has 571 places, 577 transitions, 1285 flow [2020-10-09 15:33:23,329 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1285, PETRI_PLACES=571, PETRI_TRANSITIONS=577} [2020-10-09 15:33:23,329 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 4 predicate places. [2020-10-09 15:33:23,329 INFO L481 AbstractCegarLoop]: Abstraction has has 571 places, 577 transitions, 1285 flow [2020-10-09 15:33:23,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:23,329 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:23,329 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:33:23,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 643 mathsat -unsat_core_generation=3 [2020-10-09 15:33:23,530 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:23,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:23,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2059947198, now seen corresponding path program 1 times [2020-10-09 15:33:23,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:23,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234148055] [2020-10-09 15:33:23,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 644 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 644 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:23,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:23,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:33:23,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:33:23,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234148055] [2020-10-09 15:33:23,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:23,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:23,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229039014] [2020-10-09 15:33:23,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:23,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:23,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:23,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:23,967 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:23,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 577 transitions, 1285 flow. Second operand 3 states. [2020-10-09 15:33:23,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:23,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:23,968 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:24,145 INFO L129 PetriNetUnfolder]: 59/656 cut-off events. [2020-10-09 15:33:24,145 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:24,177 INFO L80 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 656 events. 59/656 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2637 event pairs, 0 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 738. Up to 23 conditions per place. [2020-10-09 15:33:24,186 INFO L132 encePairwiseOnDemand]: 606/611 looper letters, 10 selfloop transitions, 3 changer transitions 0/579 dead transitions. [2020-10-09 15:33:24,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 579 transitions, 1315 flow [2020-10-09 15:33:24,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:24,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1743 transitions. [2020-10-09 15:33:24,187 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9509001636661211 [2020-10-09 15:33:24,187 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1743 transitions. [2020-10-09 15:33:24,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1743 transitions. [2020-10-09 15:33:24,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:24,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1743 transitions. [2020-10-09 15:33:24,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:24,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:24,189 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:24,189 INFO L185 Difference]: Start difference. First operand has 571 places, 577 transitions, 1285 flow. Second operand 3 states and 1743 transitions. [2020-10-09 15:33:24,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 579 transitions, 1315 flow [2020-10-09 15:33:24,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 579 transitions, 1314 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:24,195 INFO L241 Difference]: Finished difference. Result has 574 places, 579 transitions, 1308 flow [2020-10-09 15:33:24,195 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1284, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1308, PETRI_PLACES=574, PETRI_TRANSITIONS=579} [2020-10-09 15:33:24,195 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 7 predicate places. [2020-10-09 15:33:24,195 INFO L481 AbstractCegarLoop]: Abstraction has has 574 places, 579 transitions, 1308 flow [2020-10-09 15:33:24,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:24,195 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:24,195 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:33:24,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 644 mathsat -unsat_core_generation=3 [2020-10-09 15:33:24,396 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:24,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:24,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2059948221, now seen corresponding path program 1 times [2020-10-09 15:33:24,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:24,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398875563] [2020-10-09 15:33:24,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 645 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 645 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:24,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:33:24,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:33:24,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:24,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:33:24,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398875563] [2020-10-09 15:33:24,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:24,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:24,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219311616] [2020-10-09 15:33:24,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:24,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:24,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:24,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:24,815 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 582 out of 611 [2020-10-09 15:33:24,816 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 579 transitions, 1308 flow. Second operand 3 states. [2020-10-09 15:33:24,816 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:24,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 582 of 611 [2020-10-09 15:33:24,816 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:24,991 INFO L129 PetriNetUnfolder]: 57/657 cut-off events. [2020-10-09 15:33:24,991 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:25,025 INFO L80 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 657 events. 57/657 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2660 event pairs, 0 based on Foata normal form. 1/580 useless extension candidates. Maximal degree in co-relation 736. Up to 23 conditions per place. [2020-10-09 15:33:25,032 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 4 selfloop transitions, 1 changer transitions 0/578 dead transitions. [2020-10-09 15:33:25,032 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 578 transitions, 1314 flow [2020-10-09 15:33:25,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2020-10-09 15:33:25,034 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955810147299509 [2020-10-09 15:33:25,034 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2020-10-09 15:33:25,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2020-10-09 15:33:25,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:25,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2020-10-09 15:33:25,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:25,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:25,036 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:25,036 INFO L185 Difference]: Start difference. First operand has 574 places, 579 transitions, 1308 flow. Second operand 3 states and 1752 transitions. [2020-10-09 15:33:25,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 578 transitions, 1314 flow [2020-10-09 15:33:25,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 578 transitions, 1309 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:25,041 INFO L241 Difference]: Finished difference. Result has 576 places, 578 transitions, 1304 flow [2020-10-09 15:33:25,042 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1304, PETRI_PLACES=576, PETRI_TRANSITIONS=578} [2020-10-09 15:33:25,042 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 9 predicate places. [2020-10-09 15:33:25,042 INFO L481 AbstractCegarLoop]: Abstraction has has 576 places, 578 transitions, 1304 flow [2020-10-09 15:33:25,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:25,042 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:25,042 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:33:25,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 645 mathsat -unsat_core_generation=3 [2020-10-09 15:33:25,243 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:25,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:25,243 INFO L82 PathProgramCache]: Analyzing trace with hash -2060900510, now seen corresponding path program 1 times [2020-10-09 15:33:25,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:25,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631905557] [2020-10-09 15:33:25,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 646 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 646 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:25,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:25,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:33:25,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:33:25,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631905557] [2020-10-09 15:33:25,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:25,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:25,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740554430] [2020-10-09 15:33:25,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:25,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:25,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:25,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:25,655 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 611 [2020-10-09 15:33:25,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 578 transitions, 1304 flow. Second operand 3 states. [2020-10-09 15:33:25,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:25,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 611 [2020-10-09 15:33:25,656 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:25,821 INFO L129 PetriNetUnfolder]: 57/650 cut-off events. [2020-10-09 15:33:25,821 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:25,852 INFO L80 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 650 events. 57/650 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2600 event pairs, 0 based on Foata normal form. 1/573 useless extension candidates. Maximal degree in co-relation 732. Up to 23 conditions per place. [2020-10-09 15:33:25,859 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 5 selfloop transitions, 1 changer transitions 0/576 dead transitions. [2020-10-09 15:33:25,859 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 576 transitions, 1307 flow [2020-10-09 15:33:25,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2020-10-09 15:33:25,860 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547190398254228 [2020-10-09 15:33:25,861 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2020-10-09 15:33:25,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2020-10-09 15:33:25,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:25,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2020-10-09 15:33:25,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:25,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:25,862 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:25,862 INFO L185 Difference]: Start difference. First operand has 576 places, 578 transitions, 1304 flow. Second operand 3 states and 1750 transitions. [2020-10-09 15:33:25,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 576 transitions, 1307 flow [2020-10-09 15:33:25,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 576 transitions, 1300 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:33:25,868 INFO L241 Difference]: Finished difference. Result has 576 places, 576 transitions, 1293 flow [2020-10-09 15:33:25,868 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1293, PETRI_PLACES=576, PETRI_TRANSITIONS=576} [2020-10-09 15:33:25,868 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 9 predicate places. [2020-10-09 15:33:25,868 INFO L481 AbstractCegarLoop]: Abstraction has has 576 places, 576 transitions, 1293 flow [2020-10-09 15:33:25,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:25,868 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:25,868 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:33:26,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 646 mathsat -unsat_core_generation=3 [2020-10-09 15:33:26,069 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:26,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:26,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2060901533, now seen corresponding path program 1 times [2020-10-09 15:33:26,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:26,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895047608] [2020-10-09 15:33:26,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 647 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 647 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:26,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:26,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:33:26,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:33:26,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895047608] [2020-10-09 15:33:26,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:26,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:26,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516252403] [2020-10-09 15:33:26,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:26,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:26,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:26,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:26,506 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:26,506 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 576 transitions, 1293 flow. Second operand 3 states. [2020-10-09 15:33:26,506 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:26,506 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:26,506 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:26,671 INFO L129 PetriNetUnfolder]: 57/648 cut-off events. [2020-10-09 15:33:26,671 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:33:26,701 INFO L80 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 648 events. 57/648 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2587 event pairs, 0 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 732. Up to 23 conditions per place. [2020-10-09 15:33:26,709 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 8 selfloop transitions, 1 changer transitions 0/574 dead transitions. [2020-10-09 15:33:26,709 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 574 transitions, 1306 flow [2020-10-09 15:33:26,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1738 transitions. [2020-10-09 15:33:26,710 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481723949809057 [2020-10-09 15:33:26,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1738 transitions. [2020-10-09 15:33:26,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1738 transitions. [2020-10-09 15:33:26,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:26,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1738 transitions. [2020-10-09 15:33:26,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:26,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:26,712 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:26,712 INFO L185 Difference]: Start difference. First operand has 576 places, 576 transitions, 1293 flow. Second operand 3 states and 1738 transitions. [2020-10-09 15:33:26,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 574 transitions, 1306 flow [2020-10-09 15:33:26,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 574 transitions, 1305 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:26,718 INFO L241 Difference]: Finished difference. Result has 575 places, 574 transitions, 1289 flow [2020-10-09 15:33:26,718 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1289, PETRI_PLACES=575, PETRI_TRANSITIONS=574} [2020-10-09 15:33:26,718 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 8 predicate places. [2020-10-09 15:33:26,718 INFO L481 AbstractCegarLoop]: Abstraction has has 575 places, 574 transitions, 1289 flow [2020-10-09 15:33:26,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:26,718 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:26,718 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:33:26,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 647 mathsat -unsat_core_generation=3 [2020-10-09 15:33:26,919 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:26,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:26,919 INFO L82 PathProgramCache]: Analyzing trace with hash -74435268, now seen corresponding path program 1 times [2020-10-09 15:33:26,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:26,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387184947] [2020-10-09 15:33:26,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 648 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 648 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:27,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:27,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:27,319 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:33:27,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:33:27,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387184947] [2020-10-09 15:33:27,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:27,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:27,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794646239] [2020-10-09 15:33:27,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:27,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:27,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:27,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:27,331 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 611 [2020-10-09 15:33:27,332 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 574 transitions, 1289 flow. Second operand 3 states. [2020-10-09 15:33:27,332 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:27,332 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 611 [2020-10-09 15:33:27,332 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:27,502 INFO L129 PetriNetUnfolder]: 55/653 cut-off events. [2020-10-09 15:33:27,502 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:27,534 INFO L80 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 653 events. 55/653 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2635 event pairs, 0 based on Foata normal form. 0/575 useless extension candidates. Maximal degree in co-relation 735. Up to 23 conditions per place. [2020-10-09 15:33:27,542 INFO L132 encePairwiseOnDemand]: 608/611 looper letters, 5 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2020-10-09 15:33:27,542 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 575 transitions, 1305 flow [2020-10-09 15:33:27,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1751 transitions. [2020-10-09 15:33:27,543 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955264593562466 [2020-10-09 15:33:27,544 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1751 transitions. [2020-10-09 15:33:27,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1751 transitions. [2020-10-09 15:33:27,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:27,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1751 transitions. [2020-10-09 15:33:27,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:27,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:27,545 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:27,545 INFO L185 Difference]: Start difference. First operand has 575 places, 574 transitions, 1289 flow. Second operand 3 states and 1751 transitions. [2020-10-09 15:33:27,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 575 transitions, 1305 flow [2020-10-09 15:33:27,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 575 transitions, 1304 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:27,551 INFO L241 Difference]: Finished difference. Result has 578 places, 575 transitions, 1302 flow [2020-10-09 15:33:27,551 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1302, PETRI_PLACES=578, PETRI_TRANSITIONS=575} [2020-10-09 15:33:27,551 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 11 predicate places. [2020-10-09 15:33:27,551 INFO L481 AbstractCegarLoop]: Abstraction has has 578 places, 575 transitions, 1302 flow [2020-10-09 15:33:27,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:27,551 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:27,551 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:33:27,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 648 mathsat -unsat_core_generation=3 [2020-10-09 15:33:27,752 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:27,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:27,753 INFO L82 PathProgramCache]: Analyzing trace with hash -74436291, now seen corresponding path program 1 times [2020-10-09 15:33:27,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:27,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837573256] [2020-10-09 15:33:27,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 649 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 649 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:28,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:28,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:28,154 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:33:28,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:28,156 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:33:28,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837573256] [2020-10-09 15:33:28,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:28,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:28,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413829868] [2020-10-09 15:33:28,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:28,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:28,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:28,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:28,191 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:28,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 575 transitions, 1302 flow. Second operand 3 states. [2020-10-09 15:33:28,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:28,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:28,193 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:28,368 INFO L129 PetriNetUnfolder]: 55/654 cut-off events. [2020-10-09 15:33:28,368 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:33:28,402 INFO L80 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 654 events. 55/654 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2641 event pairs, 0 based on Foata normal form. 0/576 useless extension candidates. Maximal degree in co-relation 743. Up to 23 conditions per place. [2020-10-09 15:33:28,409 INFO L132 encePairwiseOnDemand]: 607/611 looper letters, 9 selfloop transitions, 3 changer transitions 0/576 dead transitions. [2020-10-09 15:33:28,409 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 576 transitions, 1328 flow [2020-10-09 15:33:28,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:28,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1741 transitions. [2020-10-09 15:33:28,410 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9498090561920349 [2020-10-09 15:33:28,410 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1741 transitions. [2020-10-09 15:33:28,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1741 transitions. [2020-10-09 15:33:28,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:28,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1741 transitions. [2020-10-09 15:33:28,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:28,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:28,412 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:28,412 INFO L185 Difference]: Start difference. First operand has 578 places, 575 transitions, 1302 flow. Second operand 3 states and 1741 transitions. [2020-10-09 15:33:28,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 576 transitions, 1328 flow [2020-10-09 15:33:28,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 576 transitions, 1326 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:28,418 INFO L241 Difference]: Finished difference. Result has 581 places, 576 transitions, 1318 flow [2020-10-09 15:33:28,418 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1318, PETRI_PLACES=581, PETRI_TRANSITIONS=576} [2020-10-09 15:33:28,418 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 14 predicate places. [2020-10-09 15:33:28,418 INFO L481 AbstractCegarLoop]: Abstraction has has 581 places, 576 transitions, 1318 flow [2020-10-09 15:33:28,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:28,419 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:28,419 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:33:28,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 649 mathsat -unsat_core_generation=3 [2020-10-09 15:33:28,620 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:28,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:28,620 INFO L82 PathProgramCache]: Analyzing trace with hash -73482979, now seen corresponding path program 1 times [2020-10-09 15:33:28,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:28,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898354017] [2020-10-09 15:33:28,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 650 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 650 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:29,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:33:29,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:33:29,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:33:29,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898354017] [2020-10-09 15:33:29,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:29,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:29,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040546279] [2020-10-09 15:33:29,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:29,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:29,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:29,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:29,043 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 582 out of 611 [2020-10-09 15:33:29,044 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 576 transitions, 1318 flow. Second operand 3 states. [2020-10-09 15:33:29,044 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:29,044 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 582 of 611 [2020-10-09 15:33:29,044 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:29,210 INFO L129 PetriNetUnfolder]: 54/650 cut-off events. [2020-10-09 15:33:29,211 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:29,241 INFO L80 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 650 events. 54/650 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2614 event pairs, 0 based on Foata normal form. 1/576 useless extension candidates. Maximal degree in co-relation 735. Up to 23 conditions per place. [2020-10-09 15:33:29,248 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 4 selfloop transitions, 1 changer transitions 0/573 dead transitions. [2020-10-09 15:33:29,249 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 573 transitions, 1313 flow [2020-10-09 15:33:29,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2020-10-09 15:33:29,250 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955810147299509 [2020-10-09 15:33:29,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2020-10-09 15:33:29,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2020-10-09 15:33:29,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:29,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2020-10-09 15:33:29,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:29,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:29,252 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:29,252 INFO L185 Difference]: Start difference. First operand has 581 places, 576 transitions, 1318 flow. Second operand 3 states and 1752 transitions. [2020-10-09 15:33:29,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 573 transitions, 1313 flow [2020-10-09 15:33:29,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 573 transitions, 1305 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:33:29,258 INFO L241 Difference]: Finished difference. Result has 580 places, 573 transitions, 1297 flow [2020-10-09 15:33:29,258 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1297, PETRI_PLACES=580, PETRI_TRANSITIONS=573} [2020-10-09 15:33:29,258 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 13 predicate places. [2020-10-09 15:33:29,258 INFO L481 AbstractCegarLoop]: Abstraction has has 580 places, 573 transitions, 1297 flow [2020-10-09 15:33:29,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:29,258 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:29,258 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:33:29,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 650 mathsat -unsat_core_generation=3 [2020-10-09 15:33:29,459 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:29,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:29,459 INFO L82 PathProgramCache]: Analyzing trace with hash -73481956, now seen corresponding path program 1 times [2020-10-09 15:33:29,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:29,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91366358] [2020-10-09 15:33:29,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 651 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 651 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:29,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:29,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:33:29,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:29,862 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:33:29,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91366358] [2020-10-09 15:33:29,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:29,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:29,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504849312] [2020-10-09 15:33:29,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:29,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:29,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:29,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:29,882 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:29,883 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 573 transitions, 1297 flow. Second operand 3 states. [2020-10-09 15:33:29,884 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:29,884 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:29,884 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:30,088 INFO L129 PetriNetUnfolder]: 54/648 cut-off events. [2020-10-09 15:33:30,088 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:30,106 INFO L80 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 648 events. 54/648 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2601 event pairs, 0 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 739. Up to 23 conditions per place. [2020-10-09 15:33:30,112 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 8 selfloop transitions, 1 changer transitions 0/571 dead transitions. [2020-10-09 15:33:30,112 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 571 transitions, 1310 flow [2020-10-09 15:33:30,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1738 transitions. [2020-10-09 15:33:30,113 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481723949809057 [2020-10-09 15:33:30,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1738 transitions. [2020-10-09 15:33:30,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1738 transitions. [2020-10-09 15:33:30,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:30,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1738 transitions. [2020-10-09 15:33:30,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:30,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:30,116 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:30,116 INFO L185 Difference]: Start difference. First operand has 580 places, 573 transitions, 1297 flow. Second operand 3 states and 1738 transitions. [2020-10-09 15:33:30,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 571 transitions, 1310 flow [2020-10-09 15:33:30,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 571 transitions, 1309 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:30,121 INFO L241 Difference]: Finished difference. Result has 579 places, 571 transitions, 1293 flow [2020-10-09 15:33:30,121 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1293, PETRI_PLACES=579, PETRI_TRANSITIONS=571} [2020-10-09 15:33:30,121 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 12 predicate places. [2020-10-09 15:33:30,121 INFO L481 AbstractCegarLoop]: Abstraction has has 579 places, 571 transitions, 1293 flow [2020-10-09 15:33:30,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:30,121 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:30,121 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:30,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 651 mathsat -unsat_core_generation=3 [2020-10-09 15:33:30,322 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:30,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:30,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2099884567, now seen corresponding path program 1 times [2020-10-09 15:33:30,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:30,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158184381] [2020-10-09 15:33:30,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 652 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 652 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:30,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:30,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:33:30,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:33:30,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158184381] [2020-10-09 15:33:30,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:30,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:30,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337075932] [2020-10-09 15:33:30,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:30,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:30,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:30,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:30,741 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 611 [2020-10-09 15:33:30,742 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 571 transitions, 1293 flow. Second operand 3 states. [2020-10-09 15:33:30,742 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:30,742 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 611 [2020-10-09 15:33:30,742 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:30,914 INFO L129 PetriNetUnfolder]: 52/653 cut-off events. [2020-10-09 15:33:30,914 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:30,945 INFO L80 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 653 events. 52/653 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2649 event pairs, 0 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 742. Up to 23 conditions per place. [2020-10-09 15:33:30,952 INFO L132 encePairwiseOnDemand]: 608/611 looper letters, 5 selfloop transitions, 2 changer transitions 0/572 dead transitions. [2020-10-09 15:33:30,952 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 572 transitions, 1309 flow [2020-10-09 15:33:30,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1751 transitions. [2020-10-09 15:33:30,954 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955264593562466 [2020-10-09 15:33:30,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1751 transitions. [2020-10-09 15:33:30,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1751 transitions. [2020-10-09 15:33:30,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:30,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1751 transitions. [2020-10-09 15:33:30,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:30,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:30,956 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:30,956 INFO L185 Difference]: Start difference. First operand has 579 places, 571 transitions, 1293 flow. Second operand 3 states and 1751 transitions. [2020-10-09 15:33:30,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 572 transitions, 1309 flow [2020-10-09 15:33:30,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 572 transitions, 1308 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:30,961 INFO L241 Difference]: Finished difference. Result has 582 places, 572 transitions, 1306 flow [2020-10-09 15:33:30,962 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1306, PETRI_PLACES=582, PETRI_TRANSITIONS=572} [2020-10-09 15:33:30,962 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 15 predicate places. [2020-10-09 15:33:30,962 INFO L481 AbstractCegarLoop]: Abstraction has has 582 places, 572 transitions, 1306 flow [2020-10-09 15:33:30,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:30,962 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:30,962 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:31,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 652 mathsat -unsat_core_generation=3 [2020-10-09 15:33:31,163 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:31,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:31,163 INFO L82 PathProgramCache]: Analyzing trace with hash 2099883544, now seen corresponding path program 1 times [2020-10-09 15:33:31,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:31,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602453154] [2020-10-09 15:33:31,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 653 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 653 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:31,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:31,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:33:31,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:33:31,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602453154] [2020-10-09 15:33:31,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:31,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:31,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559190163] [2020-10-09 15:33:31,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:31,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:31,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:31,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:31,608 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:31,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 572 transitions, 1306 flow. Second operand 3 states. [2020-10-09 15:33:31,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:31,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:31,609 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:31,783 INFO L129 PetriNetUnfolder]: 52/654 cut-off events. [2020-10-09 15:33:31,784 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:33:31,815 INFO L80 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 654 events. 52/654 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2660 event pairs, 0 based on Foata normal form. 0/579 useless extension candidates. Maximal degree in co-relation 750. Up to 23 conditions per place. [2020-10-09 15:33:31,822 INFO L132 encePairwiseOnDemand]: 607/611 looper letters, 9 selfloop transitions, 3 changer transitions 0/573 dead transitions. [2020-10-09 15:33:31,822 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 573 transitions, 1332 flow [2020-10-09 15:33:31,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1741 transitions. [2020-10-09 15:33:31,823 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9498090561920349 [2020-10-09 15:33:31,824 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1741 transitions. [2020-10-09 15:33:31,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1741 transitions. [2020-10-09 15:33:31,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:31,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1741 transitions. [2020-10-09 15:33:31,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:31,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:31,825 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:31,825 INFO L185 Difference]: Start difference. First operand has 582 places, 572 transitions, 1306 flow. Second operand 3 states and 1741 transitions. [2020-10-09 15:33:31,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 573 transitions, 1332 flow [2020-10-09 15:33:31,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 573 transitions, 1330 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:31,831 INFO L241 Difference]: Finished difference. Result has 585 places, 573 transitions, 1322 flow [2020-10-09 15:33:31,831 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1322, PETRI_PLACES=585, PETRI_TRANSITIONS=573} [2020-10-09 15:33:31,831 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 18 predicate places. [2020-10-09 15:33:31,831 INFO L481 AbstractCegarLoop]: Abstraction has has 585 places, 573 transitions, 1322 flow [2020-10-09 15:33:31,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:31,831 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:31,831 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:32,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 653 mathsat -unsat_core_generation=3 [2020-10-09 15:33:32,032 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:32,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:32,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2100836856, now seen corresponding path program 1 times [2020-10-09 15:33:32,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:32,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007978122] [2020-10-09 15:33:32,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 654 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 654 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:32,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:33:32,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:33:32,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:33:32,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007978122] [2020-10-09 15:33:32,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:32,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:32,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623191723] [2020-10-09 15:33:32,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:32,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:32,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:32,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:32,462 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 582 out of 611 [2020-10-09 15:33:32,463 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 573 transitions, 1322 flow. Second operand 3 states. [2020-10-09 15:33:32,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:32,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 582 of 611 [2020-10-09 15:33:32,463 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:32,633 INFO L129 PetriNetUnfolder]: 51/650 cut-off events. [2020-10-09 15:33:32,634 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:32,665 INFO L80 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 650 events. 51/650 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2631 event pairs, 0 based on Foata normal form. 1/579 useless extension candidates. Maximal degree in co-relation 742. Up to 23 conditions per place. [2020-10-09 15:33:32,672 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 4 selfloop transitions, 1 changer transitions 0/570 dead transitions. [2020-10-09 15:33:32,672 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 570 transitions, 1317 flow [2020-10-09 15:33:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:32,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2020-10-09 15:33:32,673 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955810147299509 [2020-10-09 15:33:32,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2020-10-09 15:33:32,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2020-10-09 15:33:32,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:32,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2020-10-09 15:33:32,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:32,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:32,675 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:32,675 INFO L185 Difference]: Start difference. First operand has 585 places, 573 transitions, 1322 flow. Second operand 3 states and 1752 transitions. [2020-10-09 15:33:32,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 570 transitions, 1317 flow [2020-10-09 15:33:32,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 570 transitions, 1309 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:33:32,681 INFO L241 Difference]: Finished difference. Result has 584 places, 570 transitions, 1301 flow [2020-10-09 15:33:32,681 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1301, PETRI_PLACES=584, PETRI_TRANSITIONS=570} [2020-10-09 15:33:32,681 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 17 predicate places. [2020-10-09 15:33:32,681 INFO L481 AbstractCegarLoop]: Abstraction has has 584 places, 570 transitions, 1301 flow [2020-10-09 15:33:32,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:32,681 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:32,681 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:32,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 654 mathsat -unsat_core_generation=3 [2020-10-09 15:33:32,882 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:32,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:32,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2100837879, now seen corresponding path program 1 times [2020-10-09 15:33:32,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:32,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134041162] [2020-10-09 15:33:32,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 655 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 655 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:33,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:33,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:33:33,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:33:33,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134041162] [2020-10-09 15:33:33,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:33,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:33,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307413285] [2020-10-09 15:33:33,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:33,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:33,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:33,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:33,309 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:33,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 570 transitions, 1301 flow. Second operand 3 states. [2020-10-09 15:33:33,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:33,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:33,311 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:33,481 INFO L129 PetriNetUnfolder]: 51/648 cut-off events. [2020-10-09 15:33:33,481 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:33,512 INFO L80 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 648 events. 51/648 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2614 event pairs, 0 based on Foata normal form. 0/575 useless extension candidates. Maximal degree in co-relation 746. Up to 23 conditions per place. [2020-10-09 15:33:33,518 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 8 selfloop transitions, 1 changer transitions 0/568 dead transitions. [2020-10-09 15:33:33,518 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 568 transitions, 1314 flow [2020-10-09 15:33:33,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:33,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1738 transitions. [2020-10-09 15:33:33,520 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481723949809057 [2020-10-09 15:33:33,520 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1738 transitions. [2020-10-09 15:33:33,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1738 transitions. [2020-10-09 15:33:33,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:33,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1738 transitions. [2020-10-09 15:33:33,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:33,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:33,522 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:33,522 INFO L185 Difference]: Start difference. First operand has 584 places, 570 transitions, 1301 flow. Second operand 3 states and 1738 transitions. [2020-10-09 15:33:33,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 568 transitions, 1314 flow [2020-10-09 15:33:33,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 568 transitions, 1313 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:33,527 INFO L241 Difference]: Finished difference. Result has 583 places, 568 transitions, 1297 flow [2020-10-09 15:33:33,527 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1297, PETRI_PLACES=583, PETRI_TRANSITIONS=568} [2020-10-09 15:33:33,527 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 16 predicate places. [2020-10-09 15:33:33,527 INFO L481 AbstractCegarLoop]: Abstraction has has 583 places, 568 transitions, 1297 flow [2020-10-09 15:33:33,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:33,527 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:33,528 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:33,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 655 mathsat -unsat_core_generation=3 [2020-10-09 15:33:33,728 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:33,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:33,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1171332269, now seen corresponding path program 1 times [2020-10-09 15:33:33,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:33,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578361082] [2020-10-09 15:33:33,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 656 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 656 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:34,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:34,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:33:34,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:33:34,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578361082] [2020-10-09 15:33:34,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:34,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:34,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486959959] [2020-10-09 15:33:34,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:34,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:34,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:34,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:34,183 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:34,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 583 places, 568 transitions, 1297 flow. Second operand 3 states. [2020-10-09 15:33:34,184 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:34,184 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:34,184 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:34,364 INFO L129 PetriNetUnfolder]: 50/656 cut-off events. [2020-10-09 15:33:34,364 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:34,397 INFO L80 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 656 events. 50/656 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2688 event pairs, 0 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 758. Up to 23 conditions per place. [2020-10-09 15:33:34,404 INFO L132 encePairwiseOnDemand]: 606/611 looper letters, 10 selfloop transitions, 3 changer transitions 0/570 dead transitions. [2020-10-09 15:33:34,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 570 transitions, 1327 flow [2020-10-09 15:33:34,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1743 transitions. [2020-10-09 15:33:34,405 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9509001636661211 [2020-10-09 15:33:34,405 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1743 transitions. [2020-10-09 15:33:34,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1743 transitions. [2020-10-09 15:33:34,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:34,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1743 transitions. [2020-10-09 15:33:34,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:34,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:34,408 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:34,408 INFO L185 Difference]: Start difference. First operand has 583 places, 568 transitions, 1297 flow. Second operand 3 states and 1743 transitions. [2020-10-09 15:33:34,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 570 transitions, 1327 flow [2020-10-09 15:33:34,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 570 transitions, 1326 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:34,413 INFO L241 Difference]: Finished difference. Result has 586 places, 570 transitions, 1320 flow [2020-10-09 15:33:34,414 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1320, PETRI_PLACES=586, PETRI_TRANSITIONS=570} [2020-10-09 15:33:34,414 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 19 predicate places. [2020-10-09 15:33:34,414 INFO L481 AbstractCegarLoop]: Abstraction has has 586 places, 570 transitions, 1320 flow [2020-10-09 15:33:34,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:34,414 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:34,414 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:34,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 656 mathsat -unsat_core_generation=3 [2020-10-09 15:33:34,615 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:34,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:34,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1171333292, now seen corresponding path program 1 times [2020-10-09 15:33:34,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:34,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053687746] [2020-10-09 15:33:34,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 657 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 657 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:35,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:33:35,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:33:35,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:35,027 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:33:35,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053687746] [2020-10-09 15:33:35,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:35,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:35,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601937475] [2020-10-09 15:33:35,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:35,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:35,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:35,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:35,048 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 582 out of 611 [2020-10-09 15:33:35,049 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 570 transitions, 1320 flow. Second operand 3 states. [2020-10-09 15:33:35,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:35,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 582 of 611 [2020-10-09 15:33:35,049 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:35,221 INFO L129 PetriNetUnfolder]: 48/657 cut-off events. [2020-10-09 15:33:35,221 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:35,253 INFO L80 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 657 events. 48/657 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2711 event pairs, 0 based on Foata normal form. 1/589 useless extension candidates. Maximal degree in co-relation 756. Up to 23 conditions per place. [2020-10-09 15:33:35,259 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 4 selfloop transitions, 1 changer transitions 0/569 dead transitions. [2020-10-09 15:33:35,260 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 569 transitions, 1326 flow [2020-10-09 15:33:35,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2020-10-09 15:33:35,261 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955810147299509 [2020-10-09 15:33:35,261 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2020-10-09 15:33:35,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2020-10-09 15:33:35,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:35,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2020-10-09 15:33:35,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:35,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:35,263 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:35,263 INFO L185 Difference]: Start difference. First operand has 586 places, 570 transitions, 1320 flow. Second operand 3 states and 1752 transitions. [2020-10-09 15:33:35,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 569 transitions, 1326 flow [2020-10-09 15:33:35,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 569 transitions, 1321 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:35,268 INFO L241 Difference]: Finished difference. Result has 588 places, 569 transitions, 1316 flow [2020-10-09 15:33:35,268 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1316, PETRI_PLACES=588, PETRI_TRANSITIONS=569} [2020-10-09 15:33:35,268 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 21 predicate places. [2020-10-09 15:33:35,269 INFO L481 AbstractCegarLoop]: Abstraction has has 588 places, 569 transitions, 1316 flow [2020-10-09 15:33:35,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:35,269 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:35,269 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:35,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 657 mathsat -unsat_core_generation=3 [2020-10-09 15:33:35,469 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:35,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:35,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1172285581, now seen corresponding path program 1 times [2020-10-09 15:33:35,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:35,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894881978] [2020-10-09 15:33:35,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 658 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 658 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:35,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:35,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:35,876 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:33:35,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:33:35,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894881978] [2020-10-09 15:33:35,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:35,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:35,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77142023] [2020-10-09 15:33:35,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:35,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:35,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:35,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:35,890 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 611 [2020-10-09 15:33:35,891 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 569 transitions, 1316 flow. Second operand 3 states. [2020-10-09 15:33:35,891 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:35,891 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 611 [2020-10-09 15:33:35,891 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:36,063 INFO L129 PetriNetUnfolder]: 48/650 cut-off events. [2020-10-09 15:33:36,063 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:36,094 INFO L80 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 650 events. 48/650 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2649 event pairs, 0 based on Foata normal form. 1/582 useless extension candidates. Maximal degree in co-relation 752. Up to 23 conditions per place. [2020-10-09 15:33:36,100 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 5 selfloop transitions, 1 changer transitions 0/567 dead transitions. [2020-10-09 15:33:36,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 567 transitions, 1319 flow [2020-10-09 15:33:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2020-10-09 15:33:36,101 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547190398254228 [2020-10-09 15:33:36,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2020-10-09 15:33:36,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2020-10-09 15:33:36,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:36,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2020-10-09 15:33:36,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:36,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:36,103 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:36,103 INFO L185 Difference]: Start difference. First operand has 588 places, 569 transitions, 1316 flow. Second operand 3 states and 1750 transitions. [2020-10-09 15:33:36,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 567 transitions, 1319 flow [2020-10-09 15:33:36,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 567 transitions, 1312 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:33:36,108 INFO L241 Difference]: Finished difference. Result has 588 places, 567 transitions, 1305 flow [2020-10-09 15:33:36,109 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=588, PETRI_TRANSITIONS=567} [2020-10-09 15:33:36,109 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 21 predicate places. [2020-10-09 15:33:36,109 INFO L481 AbstractCegarLoop]: Abstraction has has 588 places, 567 transitions, 1305 flow [2020-10-09 15:33:36,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:36,109 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:36,109 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:36,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 658 mathsat -unsat_core_generation=3 [2020-10-09 15:33:36,310 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:36,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:36,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1172286604, now seen corresponding path program 1 times [2020-10-09 15:33:36,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:36,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792481209] [2020-10-09 15:33:36,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 659 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 659 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:36,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:36,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:33:36,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:36,718 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:33:36,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792481209] [2020-10-09 15:33:36,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:36,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:36,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044257441] [2020-10-09 15:33:36,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:36,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:36,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:36,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:36,748 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:36,749 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 567 transitions, 1305 flow. Second operand 3 states. [2020-10-09 15:33:36,749 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:36,750 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:36,750 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:36,920 INFO L129 PetriNetUnfolder]: 48/648 cut-off events. [2020-10-09 15:33:36,921 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:33:36,952 INFO L80 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 648 events. 48/648 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2635 event pairs, 0 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 752. Up to 23 conditions per place. [2020-10-09 15:33:36,958 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 8 selfloop transitions, 1 changer transitions 0/565 dead transitions. [2020-10-09 15:33:36,958 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 565 transitions, 1318 flow [2020-10-09 15:33:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1738 transitions. [2020-10-09 15:33:36,959 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481723949809057 [2020-10-09 15:33:36,959 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1738 transitions. [2020-10-09 15:33:36,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1738 transitions. [2020-10-09 15:33:36,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:36,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1738 transitions. [2020-10-09 15:33:36,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:36,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:36,961 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:36,961 INFO L185 Difference]: Start difference. First operand has 588 places, 567 transitions, 1305 flow. Second operand 3 states and 1738 transitions. [2020-10-09 15:33:36,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 565 transitions, 1318 flow [2020-10-09 15:33:36,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 565 transitions, 1317 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:36,967 INFO L241 Difference]: Finished difference. Result has 587 places, 565 transitions, 1301 flow [2020-10-09 15:33:36,967 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1301, PETRI_PLACES=587, PETRI_TRANSITIONS=565} [2020-10-09 15:33:36,967 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 20 predicate places. [2020-10-09 15:33:36,967 INFO L481 AbstractCegarLoop]: Abstraction has has 587 places, 565 transitions, 1301 flow [2020-10-09 15:33:36,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:36,967 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:36,967 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:37,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 659 mathsat -unsat_core_generation=3 [2020-10-09 15:33:37,168 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:37,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:37,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1386010321, now seen corresponding path program 1 times [2020-10-09 15:33:37,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:37,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130084696] [2020-10-09 15:33:37,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 660 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 660 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:37,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:37,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:37,577 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:33:37,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:37,579 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:33:37,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130084696] [2020-10-09 15:33:37,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:37,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:37,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395933995] [2020-10-09 15:33:37,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:37,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:37,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:37,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:37,615 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:37,616 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 565 transitions, 1301 flow. Second operand 3 states. [2020-10-09 15:33:37,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:37,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:37,616 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:37,818 INFO L129 PetriNetUnfolder]: 47/656 cut-off events. [2020-10-09 15:33:37,819 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:37,844 INFO L80 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 656 events. 47/656 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2704 event pairs, 0 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 764. Up to 23 conditions per place. [2020-10-09 15:33:37,849 INFO L132 encePairwiseOnDemand]: 606/611 looper letters, 10 selfloop transitions, 3 changer transitions 0/567 dead transitions. [2020-10-09 15:33:37,849 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 567 transitions, 1331 flow [2020-10-09 15:33:37,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1743 transitions. [2020-10-09 15:33:37,851 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9509001636661211 [2020-10-09 15:33:37,851 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1743 transitions. [2020-10-09 15:33:37,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1743 transitions. [2020-10-09 15:33:37,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:37,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1743 transitions. [2020-10-09 15:33:37,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:37,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:37,853 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:37,853 INFO L185 Difference]: Start difference. First operand has 587 places, 565 transitions, 1301 flow. Second operand 3 states and 1743 transitions. [2020-10-09 15:33:37,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 567 transitions, 1331 flow [2020-10-09 15:33:37,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 567 transitions, 1330 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:37,858 INFO L241 Difference]: Finished difference. Result has 590 places, 567 transitions, 1324 flow [2020-10-09 15:33:37,858 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=586, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1324, PETRI_PLACES=590, PETRI_TRANSITIONS=567} [2020-10-09 15:33:37,858 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 23 predicate places. [2020-10-09 15:33:37,858 INFO L481 AbstractCegarLoop]: Abstraction has has 590 places, 567 transitions, 1324 flow [2020-10-09 15:33:37,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:37,858 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:37,858 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:38,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 660 mathsat -unsat_core_generation=3 [2020-10-09 15:33:38,059 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:38,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:38,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1386011344, now seen corresponding path program 1 times [2020-10-09 15:33:38,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:38,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9845464] [2020-10-09 15:33:38,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 661 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 661 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:38,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:38,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:33:38,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:38,471 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:33:38,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9845464] [2020-10-09 15:33:38,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:38,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:38,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774308727] [2020-10-09 15:33:38,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:38,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:38,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:38,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:38,481 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 611 [2020-10-09 15:33:38,482 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 567 transitions, 1324 flow. Second operand 3 states. [2020-10-09 15:33:38,482 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:38,482 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 611 [2020-10-09 15:33:38,483 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:38,663 INFO L129 PetriNetUnfolder]: 46/654 cut-off events. [2020-10-09 15:33:38,663 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:38,695 INFO L80 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 654 events. 46/654 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2693 event pairs, 0 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 761. Up to 23 conditions per place. [2020-10-09 15:33:38,701 INFO L132 encePairwiseOnDemand]: 608/611 looper letters, 5 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2020-10-09 15:33:38,701 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 567 transitions, 1336 flow [2020-10-09 15:33:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1751 transitions. [2020-10-09 15:33:38,702 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955264593562466 [2020-10-09 15:33:38,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1751 transitions. [2020-10-09 15:33:38,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1751 transitions. [2020-10-09 15:33:38,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:38,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1751 transitions. [2020-10-09 15:33:38,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:38,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:38,704 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:38,704 INFO L185 Difference]: Start difference. First operand has 590 places, 567 transitions, 1324 flow. Second operand 3 states and 1751 transitions. [2020-10-09 15:33:38,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 567 transitions, 1336 flow [2020-10-09 15:33:38,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 567 transitions, 1331 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:38,710 INFO L241 Difference]: Finished difference. Result has 593 places, 567 transitions, 1329 flow [2020-10-09 15:33:38,710 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1329, PETRI_PLACES=593, PETRI_TRANSITIONS=567} [2020-10-09 15:33:38,710 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 26 predicate places. [2020-10-09 15:33:38,710 INFO L481 AbstractCegarLoop]: Abstraction has has 593 places, 567 transitions, 1329 flow [2020-10-09 15:33:38,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:38,710 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:38,710 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:38,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 661 mathsat -unsat_core_generation=3 [2020-10-09 15:33:38,911 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:38,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:38,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1386963633, now seen corresponding path program 1 times [2020-10-09 15:33:38,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:38,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395731510] [2020-10-09 15:33:38,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 662 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 662 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:39,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:33:39,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:33:39,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:33:39,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395731510] [2020-10-09 15:33:39,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:39,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:39,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268556331] [2020-10-09 15:33:39,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:39,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:39,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:39,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:39,341 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 582 out of 611 [2020-10-09 15:33:39,342 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 567 transitions, 1329 flow. Second operand 3 states. [2020-10-09 15:33:39,342 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:39,342 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 582 of 611 [2020-10-09 15:33:39,342 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:39,519 INFO L129 PetriNetUnfolder]: 45/650 cut-off events. [2020-10-09 15:33:39,519 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:33:39,552 INFO L80 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 650 events. 45/650 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2668 event pairs, 0 based on Foata normal form. 1/585 useless extension candidates. Maximal degree in co-relation 757. Up to 23 conditions per place. [2020-10-09 15:33:39,558 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 4 selfloop transitions, 1 changer transitions 0/564 dead transitions. [2020-10-09 15:33:39,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 564 transitions, 1324 flow [2020-10-09 15:33:39,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:39,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2020-10-09 15:33:39,560 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955810147299509 [2020-10-09 15:33:39,560 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2020-10-09 15:33:39,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2020-10-09 15:33:39,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:39,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2020-10-09 15:33:39,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:39,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:39,561 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:39,561 INFO L185 Difference]: Start difference. First operand has 593 places, 567 transitions, 1329 flow. Second operand 3 states and 1752 transitions. [2020-10-09 15:33:39,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 564 transitions, 1324 flow [2020-10-09 15:33:39,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 564 transitions, 1317 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:33:39,567 INFO L241 Difference]: Finished difference. Result has 592 places, 564 transitions, 1309 flow [2020-10-09 15:33:39,567 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1309, PETRI_PLACES=592, PETRI_TRANSITIONS=564} [2020-10-09 15:33:39,567 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 25 predicate places. [2020-10-09 15:33:39,567 INFO L481 AbstractCegarLoop]: Abstraction has has 592 places, 564 transitions, 1309 flow [2020-10-09 15:33:39,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:39,567 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:39,568 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:39,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 662 mathsat -unsat_core_generation=3 [2020-10-09 15:33:39,768 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:39,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:39,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1386964656, now seen corresponding path program 1 times [2020-10-09 15:33:39,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:39,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776403184] [2020-10-09 15:33:39,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 663 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 663 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:40,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:40,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:40,178 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:33:40,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:33:40,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776403184] [2020-10-09 15:33:40,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:40,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:40,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021465387] [2020-10-09 15:33:40,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:40,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:40,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:40,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:40,200 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:40,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 564 transitions, 1309 flow. Second operand 3 states. [2020-10-09 15:33:40,201 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:40,201 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:40,201 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:40,377 INFO L129 PetriNetUnfolder]: 45/648 cut-off events. [2020-10-09 15:33:40,377 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:40,408 INFO L80 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 648 events. 45/648 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2654 event pairs, 0 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 759. Up to 23 conditions per place. [2020-10-09 15:33:40,413 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 8 selfloop transitions, 1 changer transitions 0/562 dead transitions. [2020-10-09 15:33:40,413 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 562 transitions, 1322 flow [2020-10-09 15:33:40,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1738 transitions. [2020-10-09 15:33:40,414 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481723949809057 [2020-10-09 15:33:40,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1738 transitions. [2020-10-09 15:33:40,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1738 transitions. [2020-10-09 15:33:40,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:40,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1738 transitions. [2020-10-09 15:33:40,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:40,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:40,416 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:40,416 INFO L185 Difference]: Start difference. First operand has 592 places, 564 transitions, 1309 flow. Second operand 3 states and 1738 transitions. [2020-10-09 15:33:40,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 562 transitions, 1322 flow [2020-10-09 15:33:40,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 562 transitions, 1321 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:40,422 INFO L241 Difference]: Finished difference. Result has 591 places, 562 transitions, 1305 flow [2020-10-09 15:33:40,422 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=591, PETRI_TRANSITIONS=562} [2020-10-09 15:33:40,422 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 24 predicate places. [2020-10-09 15:33:40,422 INFO L481 AbstractCegarLoop]: Abstraction has has 591 places, 562 transitions, 1305 flow [2020-10-09 15:33:40,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:40,422 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:40,422 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:40,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 663 mathsat -unsat_core_generation=3 [2020-10-09 15:33:40,623 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:40,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:40,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1531014258, now seen corresponding path program 1 times [2020-10-09 15:33:40,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:40,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072558816] [2020-10-09 15:33:40,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 664 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 664 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:41,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:41,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:33:41,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:41,038 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:33:41,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072558816] [2020-10-09 15:33:41,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:41,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:41,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777834010] [2020-10-09 15:33:41,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:41,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:41,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:41,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:41,058 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:41,059 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 562 transitions, 1305 flow. Second operand 3 states. [2020-10-09 15:33:41,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:41,060 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:41,060 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:41,276 INFO L129 PetriNetUnfolder]: 44/656 cut-off events. [2020-10-09 15:33:41,276 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:41,296 INFO L80 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 656 events. 44/656 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2723 event pairs, 0 based on Foata normal form. 0/589 useless extension candidates. Maximal degree in co-relation 771. Up to 23 conditions per place. [2020-10-09 15:33:41,300 INFO L132 encePairwiseOnDemand]: 606/611 looper letters, 10 selfloop transitions, 3 changer transitions 0/564 dead transitions. [2020-10-09 15:33:41,301 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 564 transitions, 1335 flow [2020-10-09 15:33:41,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:41,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1743 transitions. [2020-10-09 15:33:41,302 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9509001636661211 [2020-10-09 15:33:41,302 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1743 transitions. [2020-10-09 15:33:41,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1743 transitions. [2020-10-09 15:33:41,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:41,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1743 transitions. [2020-10-09 15:33:41,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:41,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:41,304 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:41,304 INFO L185 Difference]: Start difference. First operand has 591 places, 562 transitions, 1305 flow. Second operand 3 states and 1743 transitions. [2020-10-09 15:33:41,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 564 transitions, 1335 flow [2020-10-09 15:33:41,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 564 transitions, 1334 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:41,309 INFO L241 Difference]: Finished difference. Result has 594 places, 564 transitions, 1328 flow [2020-10-09 15:33:41,309 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1328, PETRI_PLACES=594, PETRI_TRANSITIONS=564} [2020-10-09 15:33:41,309 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 27 predicate places. [2020-10-09 15:33:41,309 INFO L481 AbstractCegarLoop]: Abstraction has has 594 places, 564 transitions, 1328 flow [2020-10-09 15:33:41,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:41,309 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:41,309 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:41,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 664 mathsat -unsat_core_generation=3 [2020-10-09 15:33:41,510 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:41,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:41,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1531015281, now seen corresponding path program 1 times [2020-10-09 15:33:41,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:41,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087124359] [2020-10-09 15:33:41,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 665 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 665 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:41,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:33:41,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:41,922 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:33:41,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:41,925 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:33:41,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087124359] [2020-10-09 15:33:41,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:41,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:41,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320150548] [2020-10-09 15:33:41,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:41,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:41,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:41,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:41,946 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 582 out of 611 [2020-10-09 15:33:41,947 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 564 transitions, 1328 flow. Second operand 3 states. [2020-10-09 15:33:41,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:41,948 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 582 of 611 [2020-10-09 15:33:41,948 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:42,125 INFO L129 PetriNetUnfolder]: 42/657 cut-off events. [2020-10-09 15:33:42,125 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:42,157 INFO L80 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 657 events. 42/657 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2745 event pairs, 0 based on Foata normal form. 1/595 useless extension candidates. Maximal degree in co-relation 769. Up to 23 conditions per place. [2020-10-09 15:33:42,163 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 4 selfloop transitions, 1 changer transitions 0/563 dead transitions. [2020-10-09 15:33:42,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 563 transitions, 1334 flow [2020-10-09 15:33:42,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:42,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2020-10-09 15:33:42,164 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955810147299509 [2020-10-09 15:33:42,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2020-10-09 15:33:42,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2020-10-09 15:33:42,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:42,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2020-10-09 15:33:42,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:42,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:42,166 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:42,166 INFO L185 Difference]: Start difference. First operand has 594 places, 564 transitions, 1328 flow. Second operand 3 states and 1752 transitions. [2020-10-09 15:33:42,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 563 transitions, 1334 flow [2020-10-09 15:33:42,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 563 transitions, 1329 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:42,172 INFO L241 Difference]: Finished difference. Result has 596 places, 563 transitions, 1324 flow [2020-10-09 15:33:42,172 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1324, PETRI_PLACES=596, PETRI_TRANSITIONS=563} [2020-10-09 15:33:42,172 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 29 predicate places. [2020-10-09 15:33:42,172 INFO L481 AbstractCegarLoop]: Abstraction has has 596 places, 563 transitions, 1324 flow [2020-10-09 15:33:42,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:42,172 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:42,172 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:42,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 665 mathsat -unsat_core_generation=3 [2020-10-09 15:33:42,373 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:42,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:42,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1531967570, now seen corresponding path program 1 times [2020-10-09 15:33:42,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:42,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961127161] [2020-10-09 15:33:42,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 666 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 666 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:42,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:42,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:33:42,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:33:42,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961127161] [2020-10-09 15:33:42,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:42,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:42,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14398854] [2020-10-09 15:33:42,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:42,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:42,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:42,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:42,799 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 611 [2020-10-09 15:33:42,800 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 563 transitions, 1324 flow. Second operand 3 states. [2020-10-09 15:33:42,800 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:42,800 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 611 [2020-10-09 15:33:42,801 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:42,978 INFO L129 PetriNetUnfolder]: 42/650 cut-off events. [2020-10-09 15:33:42,978 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:43,009 INFO L80 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 650 events. 42/650 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2686 event pairs, 0 based on Foata normal form. 1/588 useless extension candidates. Maximal degree in co-relation 765. Up to 23 conditions per place. [2020-10-09 15:33:43,015 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 5 selfloop transitions, 1 changer transitions 0/561 dead transitions. [2020-10-09 15:33:43,015 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 561 transitions, 1327 flow [2020-10-09 15:33:43,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2020-10-09 15:33:43,016 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547190398254228 [2020-10-09 15:33:43,016 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2020-10-09 15:33:43,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2020-10-09 15:33:43,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:43,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2020-10-09 15:33:43,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:43,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:43,018 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:43,018 INFO L185 Difference]: Start difference. First operand has 596 places, 563 transitions, 1324 flow. Second operand 3 states and 1750 transitions. [2020-10-09 15:33:43,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 561 transitions, 1327 flow [2020-10-09 15:33:43,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 561 transitions, 1320 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:33:43,024 INFO L241 Difference]: Finished difference. Result has 596 places, 561 transitions, 1313 flow [2020-10-09 15:33:43,024 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1313, PETRI_PLACES=596, PETRI_TRANSITIONS=561} [2020-10-09 15:33:43,024 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 29 predicate places. [2020-10-09 15:33:43,025 INFO L481 AbstractCegarLoop]: Abstraction has has 596 places, 561 transitions, 1313 flow [2020-10-09 15:33:43,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:43,025 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:43,025 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:43,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 666 mathsat -unsat_core_generation=3 [2020-10-09 15:33:43,226 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:43,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:43,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1531968593, now seen corresponding path program 1 times [2020-10-09 15:33:43,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:43,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939870271] [2020-10-09 15:33:43,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 667 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 667 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:43,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:43,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:33:43,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:33:43,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939870271] [2020-10-09 15:33:43,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:43,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:43,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383241568] [2020-10-09 15:33:43,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:43,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:43,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:43,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:43,660 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:43,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 561 transitions, 1313 flow. Second operand 3 states. [2020-10-09 15:33:43,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:43,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:43,661 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:43,840 INFO L129 PetriNetUnfolder]: 42/648 cut-off events. [2020-10-09 15:33:43,840 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:33:43,871 INFO L80 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 648 events. 42/648 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2671 event pairs, 0 based on Foata normal form. 0/584 useless extension candidates. Maximal degree in co-relation 765. Up to 23 conditions per place. [2020-10-09 15:33:43,876 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 8 selfloop transitions, 1 changer transitions 0/559 dead transitions. [2020-10-09 15:33:43,877 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 559 transitions, 1326 flow [2020-10-09 15:33:43,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1738 transitions. [2020-10-09 15:33:43,878 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481723949809057 [2020-10-09 15:33:43,878 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1738 transitions. [2020-10-09 15:33:43,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1738 transitions. [2020-10-09 15:33:43,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:43,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1738 transitions. [2020-10-09 15:33:43,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:43,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:43,880 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:43,880 INFO L185 Difference]: Start difference. First operand has 596 places, 561 transitions, 1313 flow. Second operand 3 states and 1738 transitions. [2020-10-09 15:33:43,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 559 transitions, 1326 flow [2020-10-09 15:33:43,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 559 transitions, 1325 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:43,885 INFO L241 Difference]: Finished difference. Result has 595 places, 559 transitions, 1309 flow [2020-10-09 15:33:43,885 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1309, PETRI_PLACES=595, PETRI_TRANSITIONS=559} [2020-10-09 15:33:43,885 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 28 predicate places. [2020-10-09 15:33:43,886 INFO L481 AbstractCegarLoop]: Abstraction has has 595 places, 559 transitions, 1309 flow [2020-10-09 15:33:43,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:43,886 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:43,886 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:44,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 667 mathsat -unsat_core_generation=3 [2020-10-09 15:33:44,086 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:44,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:44,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1485303693, now seen corresponding path program 1 times [2020-10-09 15:33:44,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:44,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910667887] [2020-10-09 15:33:44,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 668 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 668 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:44,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:44,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:33:44,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:33:44,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910667887] [2020-10-09 15:33:44,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:44,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:44,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605263] [2020-10-09 15:33:44,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:44,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:44,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:44,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:44,511 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 611 [2020-10-09 15:33:44,512 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 559 transitions, 1309 flow. Second operand 3 states. [2020-10-09 15:33:44,512 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:44,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 611 [2020-10-09 15:33:44,513 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:44,716 INFO L129 PetriNetUnfolder]: 40/653 cut-off events. [2020-10-09 15:33:44,716 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:44,740 INFO L80 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 653 events. 40/653 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2719 event pairs, 0 based on Foata normal form. 0/590 useless extension candidates. Maximal degree in co-relation 768. Up to 23 conditions per place. [2020-10-09 15:33:44,745 INFO L132 encePairwiseOnDemand]: 608/611 looper letters, 5 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2020-10-09 15:33:44,745 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 560 transitions, 1325 flow [2020-10-09 15:33:44,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1751 transitions. [2020-10-09 15:33:44,747 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955264593562466 [2020-10-09 15:33:44,747 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1751 transitions. [2020-10-09 15:33:44,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1751 transitions. [2020-10-09 15:33:44,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:44,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1751 transitions. [2020-10-09 15:33:44,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:44,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:44,749 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:44,749 INFO L185 Difference]: Start difference. First operand has 595 places, 559 transitions, 1309 flow. Second operand 3 states and 1751 transitions. [2020-10-09 15:33:44,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 560 transitions, 1325 flow [2020-10-09 15:33:44,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 560 transitions, 1324 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:44,754 INFO L241 Difference]: Finished difference. Result has 598 places, 560 transitions, 1322 flow [2020-10-09 15:33:44,754 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1322, PETRI_PLACES=598, PETRI_TRANSITIONS=560} [2020-10-09 15:33:44,755 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 31 predicate places. [2020-10-09 15:33:44,755 INFO L481 AbstractCegarLoop]: Abstraction has has 598 places, 560 transitions, 1322 flow [2020-10-09 15:33:44,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:44,755 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:44,755 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:44,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 668 mathsat -unsat_core_generation=3 [2020-10-09 15:33:44,956 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:44,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:44,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1485302670, now seen corresponding path program 1 times [2020-10-09 15:33:44,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:44,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011662037] [2020-10-09 15:33:44,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 669 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 669 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:45,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:45,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:45,369 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:33:45,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:33:45,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011662037] [2020-10-09 15:33:45,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:45,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:45,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863832763] [2020-10-09 15:33:45,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:45,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:45,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:45,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:45,405 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:45,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 560 transitions, 1322 flow. Second operand 3 states. [2020-10-09 15:33:45,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:45,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:45,407 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:45,588 INFO L129 PetriNetUnfolder]: 40/654 cut-off events. [2020-10-09 15:33:45,588 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:33:45,620 INFO L80 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 654 events. 40/654 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2729 event pairs, 0 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 776. Up to 23 conditions per place. [2020-10-09 15:33:45,625 INFO L132 encePairwiseOnDemand]: 607/611 looper letters, 9 selfloop transitions, 3 changer transitions 0/561 dead transitions. [2020-10-09 15:33:45,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 561 transitions, 1348 flow [2020-10-09 15:33:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1741 transitions. [2020-10-09 15:33:45,626 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9498090561920349 [2020-10-09 15:33:45,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1741 transitions. [2020-10-09 15:33:45,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1741 transitions. [2020-10-09 15:33:45,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:45,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1741 transitions. [2020-10-09 15:33:45,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:45,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:45,628 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:45,628 INFO L185 Difference]: Start difference. First operand has 598 places, 560 transitions, 1322 flow. Second operand 3 states and 1741 transitions. [2020-10-09 15:33:45,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 561 transitions, 1348 flow [2020-10-09 15:33:45,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 561 transitions, 1346 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:45,634 INFO L241 Difference]: Finished difference. Result has 601 places, 561 transitions, 1338 flow [2020-10-09 15:33:45,634 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1338, PETRI_PLACES=601, PETRI_TRANSITIONS=561} [2020-10-09 15:33:45,634 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 34 predicate places. [2020-10-09 15:33:45,634 INFO L481 AbstractCegarLoop]: Abstraction has has 601 places, 561 transitions, 1338 flow [2020-10-09 15:33:45,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:45,634 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:45,634 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:45,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 669 mathsat -unsat_core_generation=3 [2020-10-09 15:33:45,835 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:45,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:45,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1486255982, now seen corresponding path program 1 times [2020-10-09 15:33:45,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:45,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730391824] [2020-10-09 15:33:45,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 670 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 670 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:46,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:33:46,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:33:46,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:33:46,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730391824] [2020-10-09 15:33:46,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:46,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:46,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857733616] [2020-10-09 15:33:46,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:46,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:46,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:46,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:46,275 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 582 out of 611 [2020-10-09 15:33:46,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 561 transitions, 1338 flow. Second operand 3 states. [2020-10-09 15:33:46,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:46,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 582 of 611 [2020-10-09 15:33:46,276 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:46,443 INFO L129 PetriNetUnfolder]: 39/650 cut-off events. [2020-10-09 15:33:46,443 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:46,474 INFO L80 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 650 events. 39/650 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2701 event pairs, 0 based on Foata normal form. 1/591 useless extension candidates. Maximal degree in co-relation 768. Up to 23 conditions per place. [2020-10-09 15:33:46,478 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 4 selfloop transitions, 1 changer transitions 0/558 dead transitions. [2020-10-09 15:33:46,478 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 558 transitions, 1333 flow [2020-10-09 15:33:46,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:46,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2020-10-09 15:33:46,480 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955810147299509 [2020-10-09 15:33:46,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2020-10-09 15:33:46,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2020-10-09 15:33:46,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:46,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2020-10-09 15:33:46,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:46,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:46,482 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:46,482 INFO L185 Difference]: Start difference. First operand has 601 places, 561 transitions, 1338 flow. Second operand 3 states and 1752 transitions. [2020-10-09 15:33:46,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 558 transitions, 1333 flow [2020-10-09 15:33:46,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 558 transitions, 1325 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:33:46,487 INFO L241 Difference]: Finished difference. Result has 600 places, 558 transitions, 1317 flow [2020-10-09 15:33:46,487 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=600, PETRI_TRANSITIONS=558} [2020-10-09 15:33:46,487 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 33 predicate places. [2020-10-09 15:33:46,487 INFO L481 AbstractCegarLoop]: Abstraction has has 600 places, 558 transitions, 1317 flow [2020-10-09 15:33:46,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:46,487 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:46,487 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:46,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 670 mathsat -unsat_core_generation=3 [2020-10-09 15:33:46,688 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:46,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:46,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1486257005, now seen corresponding path program 1 times [2020-10-09 15:33:46,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:46,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649814462] [2020-10-09 15:33:46,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 671 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 671 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:47,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:47,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:47,070 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:33:47,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:33:47,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649814462] [2020-10-09 15:33:47,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:47,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:47,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561628710] [2020-10-09 15:33:47,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:47,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:47,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:47,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:47,091 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:47,092 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 558 transitions, 1317 flow. Second operand 3 states. [2020-10-09 15:33:47,092 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:47,092 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:47,092 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:47,264 INFO L129 PetriNetUnfolder]: 39/648 cut-off events. [2020-10-09 15:33:47,264 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:47,293 INFO L80 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 648 events. 39/648 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2684 event pairs, 0 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 772. Up to 23 conditions per place. [2020-10-09 15:33:47,297 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 8 selfloop transitions, 1 changer transitions 0/556 dead transitions. [2020-10-09 15:33:47,297 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 556 transitions, 1330 flow [2020-10-09 15:33:47,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:47,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1738 transitions. [2020-10-09 15:33:47,299 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481723949809057 [2020-10-09 15:33:47,299 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1738 transitions. [2020-10-09 15:33:47,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1738 transitions. [2020-10-09 15:33:47,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:47,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1738 transitions. [2020-10-09 15:33:47,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:47,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:47,301 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:47,301 INFO L185 Difference]: Start difference. First operand has 600 places, 558 transitions, 1317 flow. Second operand 3 states and 1738 transitions. [2020-10-09 15:33:47,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 556 transitions, 1330 flow [2020-10-09 15:33:47,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 556 transitions, 1329 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:47,306 INFO L241 Difference]: Finished difference. Result has 599 places, 556 transitions, 1313 flow [2020-10-09 15:33:47,306 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1313, PETRI_PLACES=599, PETRI_TRANSITIONS=556} [2020-10-09 15:33:47,306 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 32 predicate places. [2020-10-09 15:33:47,306 INFO L481 AbstractCegarLoop]: Abstraction has has 599 places, 556 transitions, 1313 flow [2020-10-09 15:33:47,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:47,306 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:47,306 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:47,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 671 mathsat -unsat_core_generation=3 [2020-10-09 15:33:47,507 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:47,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:47,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1184135117, now seen corresponding path program 1 times [2020-10-09 15:33:47,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:47,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768010653] [2020-10-09 15:33:47,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 672 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 672 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:47,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:47,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:33:47,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:47,908 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:33:47,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768010653] [2020-10-09 15:33:47,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:47,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:47,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601236917] [2020-10-09 15:33:47,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:47,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:47,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:47,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:47,936 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:47,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 556 transitions, 1313 flow. Second operand 3 states. [2020-10-09 15:33:47,937 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:47,937 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:47,937 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:48,111 INFO L129 PetriNetUnfolder]: 38/656 cut-off events. [2020-10-09 15:33:48,112 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:48,142 INFO L80 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 656 events. 38/656 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2760 event pairs, 0 based on Foata normal form. 0/595 useless extension candidates. Maximal degree in co-relation 784. Up to 23 conditions per place. [2020-10-09 15:33:48,147 INFO L132 encePairwiseOnDemand]: 606/611 looper letters, 10 selfloop transitions, 3 changer transitions 0/558 dead transitions. [2020-10-09 15:33:48,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 558 transitions, 1343 flow [2020-10-09 15:33:48,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:48,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:48,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1743 transitions. [2020-10-09 15:33:48,148 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9509001636661211 [2020-10-09 15:33:48,148 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1743 transitions. [2020-10-09 15:33:48,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1743 transitions. [2020-10-09 15:33:48,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:48,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1743 transitions. [2020-10-09 15:33:48,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:48,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:48,150 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:48,150 INFO L185 Difference]: Start difference. First operand has 599 places, 556 transitions, 1313 flow. Second operand 3 states and 1743 transitions. [2020-10-09 15:33:48,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 558 transitions, 1343 flow [2020-10-09 15:33:48,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 558 transitions, 1342 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:48,155 INFO L241 Difference]: Finished difference. Result has 602 places, 558 transitions, 1336 flow [2020-10-09 15:33:48,155 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1336, PETRI_PLACES=602, PETRI_TRANSITIONS=558} [2020-10-09 15:33:48,155 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 35 predicate places. [2020-10-09 15:33:48,155 INFO L481 AbstractCegarLoop]: Abstraction has has 602 places, 558 transitions, 1336 flow [2020-10-09 15:33:48,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:48,156 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:48,156 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:48,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 672 mathsat -unsat_core_generation=3 [2020-10-09 15:33:48,356 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:48,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:48,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1184134094, now seen corresponding path program 1 times [2020-10-09 15:33:48,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:48,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111795374] [2020-10-09 15:33:48,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 673 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 673 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:48,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:33:48,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:48,746 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:33:48,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:33:48,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111795374] [2020-10-09 15:33:48,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:48,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:48,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423506269] [2020-10-09 15:33:48,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:48,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:48,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:48,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:48,769 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 582 out of 611 [2020-10-09 15:33:48,770 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 558 transitions, 1336 flow. Second operand 3 states. [2020-10-09 15:33:48,770 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:48,770 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 582 of 611 [2020-10-09 15:33:48,771 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:48,943 INFO L129 PetriNetUnfolder]: 36/657 cut-off events. [2020-10-09 15:33:48,943 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:48,974 INFO L80 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 657 events. 36/657 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2784 event pairs, 0 based on Foata normal form. 1/601 useless extension candidates. Maximal degree in co-relation 782. Up to 23 conditions per place. [2020-10-09 15:33:48,978 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 4 selfloop transitions, 1 changer transitions 0/557 dead transitions. [2020-10-09 15:33:48,979 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 557 transitions, 1342 flow [2020-10-09 15:33:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2020-10-09 15:33:48,980 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955810147299509 [2020-10-09 15:33:48,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2020-10-09 15:33:48,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2020-10-09 15:33:48,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:48,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2020-10-09 15:33:48,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:48,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:48,982 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:48,982 INFO L185 Difference]: Start difference. First operand has 602 places, 558 transitions, 1336 flow. Second operand 3 states and 1752 transitions. [2020-10-09 15:33:48,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 557 transitions, 1342 flow [2020-10-09 15:33:48,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 557 transitions, 1337 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:48,987 INFO L241 Difference]: Finished difference. Result has 604 places, 557 transitions, 1332 flow [2020-10-09 15:33:48,987 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1332, PETRI_PLACES=604, PETRI_TRANSITIONS=557} [2020-10-09 15:33:48,987 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 37 predicate places. [2020-10-09 15:33:48,987 INFO L481 AbstractCegarLoop]: Abstraction has has 604 places, 557 transitions, 1332 flow [2020-10-09 15:33:48,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:48,987 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:48,988 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:49,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 673 mathsat -unsat_core_generation=3 [2020-10-09 15:33:49,188 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:49,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:49,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1183181805, now seen corresponding path program 1 times [2020-10-09 15:33:49,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:49,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385704199] [2020-10-09 15:33:49,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 674 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 674 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:49,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:49,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:49,575 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:33:49,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:33:49,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385704199] [2020-10-09 15:33:49,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:49,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:49,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990339146] [2020-10-09 15:33:49,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:49,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:49,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:49,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:49,588 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 611 [2020-10-09 15:33:49,589 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 557 transitions, 1332 flow. Second operand 3 states. [2020-10-09 15:33:49,589 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:49,589 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 611 [2020-10-09 15:33:49,589 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:49,761 INFO L129 PetriNetUnfolder]: 36/650 cut-off events. [2020-10-09 15:33:49,761 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:49,791 INFO L80 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 650 events. 36/650 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2721 event pairs, 0 based on Foata normal form. 1/594 useless extension candidates. Maximal degree in co-relation 778. Up to 23 conditions per place. [2020-10-09 15:33:49,795 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 5 selfloop transitions, 1 changer transitions 0/555 dead transitions. [2020-10-09 15:33:49,795 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 555 transitions, 1335 flow [2020-10-09 15:33:49,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:49,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2020-10-09 15:33:49,796 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547190398254228 [2020-10-09 15:33:49,796 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2020-10-09 15:33:49,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2020-10-09 15:33:49,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:49,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2020-10-09 15:33:49,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:49,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:49,798 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:49,798 INFO L185 Difference]: Start difference. First operand has 604 places, 557 transitions, 1332 flow. Second operand 3 states and 1750 transitions. [2020-10-09 15:33:49,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 555 transitions, 1335 flow [2020-10-09 15:33:49,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 555 transitions, 1328 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:33:49,803 INFO L241 Difference]: Finished difference. Result has 604 places, 555 transitions, 1321 flow [2020-10-09 15:33:49,803 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1321, PETRI_PLACES=604, PETRI_TRANSITIONS=555} [2020-10-09 15:33:49,804 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 37 predicate places. [2020-10-09 15:33:49,804 INFO L481 AbstractCegarLoop]: Abstraction has has 604 places, 555 transitions, 1321 flow [2020-10-09 15:33:49,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:49,804 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:49,804 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:50,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 674 mathsat -unsat_core_generation=3 [2020-10-09 15:33:50,004 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:50,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:50,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1183180782, now seen corresponding path program 1 times [2020-10-09 15:33:50,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:50,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131104887] [2020-10-09 15:33:50,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 675 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 675 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:50,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:50,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:33:50,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:33:50,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131104887] [2020-10-09 15:33:50,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:50,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:50,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877047337] [2020-10-09 15:33:50,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:50,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:50,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:50,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:50,417 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:50,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 555 transitions, 1321 flow. Second operand 3 states. [2020-10-09 15:33:50,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:50,418 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:50,418 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:50,625 INFO L129 PetriNetUnfolder]: 36/648 cut-off events. [2020-10-09 15:33:50,626 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:33:50,643 INFO L80 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 648 events. 36/648 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2707 event pairs, 0 based on Foata normal form. 0/590 useless extension candidates. Maximal degree in co-relation 778. Up to 23 conditions per place. [2020-10-09 15:33:50,647 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 8 selfloop transitions, 1 changer transitions 0/553 dead transitions. [2020-10-09 15:33:50,647 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 553 transitions, 1334 flow [2020-10-09 15:33:50,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1738 transitions. [2020-10-09 15:33:50,648 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481723949809057 [2020-10-09 15:33:50,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1738 transitions. [2020-10-09 15:33:50,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1738 transitions. [2020-10-09 15:33:50,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:50,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1738 transitions. [2020-10-09 15:33:50,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:50,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:50,650 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:50,650 INFO L185 Difference]: Start difference. First operand has 604 places, 555 transitions, 1321 flow. Second operand 3 states and 1738 transitions. [2020-10-09 15:33:50,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 553 transitions, 1334 flow [2020-10-09 15:33:50,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 553 transitions, 1333 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:50,655 INFO L241 Difference]: Finished difference. Result has 603 places, 553 transitions, 1317 flow [2020-10-09 15:33:50,655 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=603, PETRI_TRANSITIONS=553} [2020-10-09 15:33:50,655 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 36 predicate places. [2020-10-09 15:33:50,655 INFO L481 AbstractCegarLoop]: Abstraction has has 603 places, 553 transitions, 1317 flow [2020-10-09 15:33:50,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:50,656 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:50,656 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:50,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 675 mathsat -unsat_core_generation=3 [2020-10-09 15:33:50,856 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:50,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:50,857 INFO L82 PathProgramCache]: Analyzing trace with hash 908665935, now seen corresponding path program 1 times [2020-10-09 15:33:50,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:50,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370003701] [2020-10-09 15:33:50,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 676 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 676 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:51,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:51,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:33:51,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:33:51,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370003701] [2020-10-09 15:33:51,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:51,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:51,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653331651] [2020-10-09 15:33:51,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:51,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:51,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:51,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:51,286 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:51,287 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 553 transitions, 1317 flow. Second operand 3 states. [2020-10-09 15:33:51,287 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:51,287 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:51,287 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:51,467 INFO L129 PetriNetUnfolder]: 35/656 cut-off events. [2020-10-09 15:33:51,467 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:51,497 INFO L80 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 656 events. 35/656 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2775 event pairs, 0 based on Foata normal form. 0/598 useless extension candidates. Maximal degree in co-relation 790. Up to 23 conditions per place. [2020-10-09 15:33:51,501 INFO L132 encePairwiseOnDemand]: 606/611 looper letters, 10 selfloop transitions, 3 changer transitions 0/555 dead transitions. [2020-10-09 15:33:51,502 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 555 transitions, 1347 flow [2020-10-09 15:33:51,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:51,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1743 transitions. [2020-10-09 15:33:51,503 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9509001636661211 [2020-10-09 15:33:51,503 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1743 transitions. [2020-10-09 15:33:51,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1743 transitions. [2020-10-09 15:33:51,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:51,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1743 transitions. [2020-10-09 15:33:51,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:51,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:51,505 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:51,505 INFO L185 Difference]: Start difference. First operand has 603 places, 553 transitions, 1317 flow. Second operand 3 states and 1743 transitions. [2020-10-09 15:33:51,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 555 transitions, 1347 flow [2020-10-09 15:33:51,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 555 transitions, 1346 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:51,510 INFO L241 Difference]: Finished difference. Result has 606 places, 555 transitions, 1340 flow [2020-10-09 15:33:51,510 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1340, PETRI_PLACES=606, PETRI_TRANSITIONS=555} [2020-10-09 15:33:51,510 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 39 predicate places. [2020-10-09 15:33:51,510 INFO L481 AbstractCegarLoop]: Abstraction has has 606 places, 555 transitions, 1340 flow [2020-10-09 15:33:51,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:51,510 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:51,511 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:51,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 676 mathsat -unsat_core_generation=3 [2020-10-09 15:33:51,711 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:51,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:51,712 INFO L82 PathProgramCache]: Analyzing trace with hash 908666958, now seen corresponding path program 1 times [2020-10-09 15:33:51,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:51,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094456650] [2020-10-09 15:33:51,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 677 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 677 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:52,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:52,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:33:52,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:33:52,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094456650] [2020-10-09 15:33:52,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:52,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:52,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351453835] [2020-10-09 15:33:52,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:52,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:52,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:52,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:52,112 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 611 [2020-10-09 15:33:52,113 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 555 transitions, 1340 flow. Second operand 3 states. [2020-10-09 15:33:52,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:52,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 611 [2020-10-09 15:33:52,113 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:52,289 INFO L129 PetriNetUnfolder]: 34/654 cut-off events. [2020-10-09 15:33:52,289 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:52,320 INFO L80 FinitePrefix]: Finished finitePrefix Result has 842 conditions, 654 events. 34/654 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2763 event pairs, 0 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 787. Up to 23 conditions per place. [2020-10-09 15:33:52,324 INFO L132 encePairwiseOnDemand]: 608/611 looper letters, 5 selfloop transitions, 2 changer transitions 0/555 dead transitions. [2020-10-09 15:33:52,324 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 555 transitions, 1352 flow [2020-10-09 15:33:52,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1751 transitions. [2020-10-09 15:33:52,325 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955264593562466 [2020-10-09 15:33:52,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1751 transitions. [2020-10-09 15:33:52,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1751 transitions. [2020-10-09 15:33:52,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:52,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1751 transitions. [2020-10-09 15:33:52,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:52,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:52,327 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:52,327 INFO L185 Difference]: Start difference. First operand has 606 places, 555 transitions, 1340 flow. Second operand 3 states and 1751 transitions. [2020-10-09 15:33:52,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 555 transitions, 1352 flow [2020-10-09 15:33:52,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 555 transitions, 1347 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:52,332 INFO L241 Difference]: Finished difference. Result has 609 places, 555 transitions, 1345 flow [2020-10-09 15:33:52,333 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1331, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1345, PETRI_PLACES=609, PETRI_TRANSITIONS=555} [2020-10-09 15:33:52,333 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 42 predicate places. [2020-10-09 15:33:52,333 INFO L481 AbstractCegarLoop]: Abstraction has has 609 places, 555 transitions, 1345 flow [2020-10-09 15:33:52,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:52,333 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:52,333 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:52,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 677 mathsat -unsat_core_generation=3 [2020-10-09 15:33:52,534 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:52,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:52,534 INFO L82 PathProgramCache]: Analyzing trace with hash 909619247, now seen corresponding path program 1 times [2020-10-09 15:33:52,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:52,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261785447] [2020-10-09 15:33:52,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 678 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 678 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:52,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:33:52,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:52,921 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:33:52,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:33:52,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261785447] [2020-10-09 15:33:52,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:52,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:52,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021227283] [2020-10-09 15:33:52,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:52,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:52,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:52,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:52,937 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 582 out of 611 [2020-10-09 15:33:52,938 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 555 transitions, 1345 flow. Second operand 3 states. [2020-10-09 15:33:52,938 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:52,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 582 of 611 [2020-10-09 15:33:52,938 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:53,113 INFO L129 PetriNetUnfolder]: 33/650 cut-off events. [2020-10-09 15:33:53,113 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:33:53,142 INFO L80 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 650 events. 33/650 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2739 event pairs, 0 based on Foata normal form. 1/597 useless extension candidates. Maximal degree in co-relation 783. Up to 23 conditions per place. [2020-10-09 15:33:53,146 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 4 selfloop transitions, 1 changer transitions 0/552 dead transitions. [2020-10-09 15:33:53,146 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 552 transitions, 1340 flow [2020-10-09 15:33:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2020-10-09 15:33:53,148 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955810147299509 [2020-10-09 15:33:53,148 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2020-10-09 15:33:53,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2020-10-09 15:33:53,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:53,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2020-10-09 15:33:53,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:53,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:53,150 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:53,150 INFO L185 Difference]: Start difference. First operand has 609 places, 555 transitions, 1345 flow. Second operand 3 states and 1752 transitions. [2020-10-09 15:33:53,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 611 places, 552 transitions, 1340 flow [2020-10-09 15:33:53,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 552 transitions, 1333 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:33:53,155 INFO L241 Difference]: Finished difference. Result has 608 places, 552 transitions, 1325 flow [2020-10-09 15:33:53,155 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1325, PETRI_PLACES=608, PETRI_TRANSITIONS=552} [2020-10-09 15:33:53,155 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 41 predicate places. [2020-10-09 15:33:53,155 INFO L481 AbstractCegarLoop]: Abstraction has has 608 places, 552 transitions, 1325 flow [2020-10-09 15:33:53,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:53,155 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:53,156 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:53,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 678 mathsat -unsat_core_generation=3 [2020-10-09 15:33:53,356 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:53,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:53,356 INFO L82 PathProgramCache]: Analyzing trace with hash 909620270, now seen corresponding path program 1 times [2020-10-09 15:33:53,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:53,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746131508] [2020-10-09 15:33:53,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 679 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 679 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:53,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:53,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:53,759 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:33:53,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:33:53,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746131508] [2020-10-09 15:33:53,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:53,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:53,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615832752] [2020-10-09 15:33:53,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:53,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:53,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:53,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:53,780 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:53,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 552 transitions, 1325 flow. Second operand 3 states. [2020-10-09 15:33:53,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:53,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:53,781 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:53,959 INFO L129 PetriNetUnfolder]: 33/648 cut-off events. [2020-10-09 15:33:53,959 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:53,988 INFO L80 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 648 events. 33/648 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2725 event pairs, 0 based on Foata normal form. 0/593 useless extension candidates. Maximal degree in co-relation 785. Up to 23 conditions per place. [2020-10-09 15:33:53,992 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 8 selfloop transitions, 1 changer transitions 0/550 dead transitions. [2020-10-09 15:33:53,992 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 550 transitions, 1338 flow [2020-10-09 15:33:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:53,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1738 transitions. [2020-10-09 15:33:53,994 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481723949809057 [2020-10-09 15:33:53,994 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1738 transitions. [2020-10-09 15:33:53,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1738 transitions. [2020-10-09 15:33:53,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:53,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1738 transitions. [2020-10-09 15:33:53,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:53,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:53,996 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:53,996 INFO L185 Difference]: Start difference. First operand has 608 places, 552 transitions, 1325 flow. Second operand 3 states and 1738 transitions. [2020-10-09 15:33:53,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 550 transitions, 1338 flow [2020-10-09 15:33:53,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 550 transitions, 1337 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:54,001 INFO L241 Difference]: Finished difference. Result has 607 places, 550 transitions, 1321 flow [2020-10-09 15:33:54,001 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1321, PETRI_PLACES=607, PETRI_TRANSITIONS=550} [2020-10-09 15:33:54,001 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 40 predicate places. [2020-10-09 15:33:54,001 INFO L481 AbstractCegarLoop]: Abstraction has has 607 places, 550 transitions, 1321 flow [2020-10-09 15:33:54,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:54,002 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:54,002 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:54,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 679 mathsat -unsat_core_generation=3 [2020-10-09 15:33:54,202 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:54,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:54,203 INFO L82 PathProgramCache]: Analyzing trace with hash -534584272, now seen corresponding path program 1 times [2020-10-09 15:33:54,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:54,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427955112] [2020-10-09 15:33:54,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 680 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 680 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:54,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:54,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:33:54,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:33:54,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427955112] [2020-10-09 15:33:54,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:54,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:54,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507983337] [2020-10-09 15:33:54,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:54,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:54,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:54,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:54,606 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 611 [2020-10-09 15:33:54,606 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 550 transitions, 1321 flow. Second operand 3 states. [2020-10-09 15:33:54,606 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:54,606 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 611 [2020-10-09 15:33:54,607 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:54,781 INFO L129 PetriNetUnfolder]: 31/653 cut-off events. [2020-10-09 15:33:54,781 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:54,811 INFO L80 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 653 events. 31/653 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2774 event pairs, 0 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 788. Up to 23 conditions per place. [2020-10-09 15:33:54,815 INFO L132 encePairwiseOnDemand]: 608/611 looper letters, 5 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2020-10-09 15:33:54,815 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 551 transitions, 1337 flow [2020-10-09 15:33:54,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:54,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:54,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1751 transitions. [2020-10-09 15:33:54,816 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955264593562466 [2020-10-09 15:33:54,816 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1751 transitions. [2020-10-09 15:33:54,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1751 transitions. [2020-10-09 15:33:54,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:54,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1751 transitions. [2020-10-09 15:33:54,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:54,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:54,818 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:54,818 INFO L185 Difference]: Start difference. First operand has 607 places, 550 transitions, 1321 flow. Second operand 3 states and 1751 transitions. [2020-10-09 15:33:54,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 551 transitions, 1337 flow [2020-10-09 15:33:54,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 551 transitions, 1336 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:54,824 INFO L241 Difference]: Finished difference. Result has 610 places, 551 transitions, 1334 flow [2020-10-09 15:33:54,824 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1334, PETRI_PLACES=610, PETRI_TRANSITIONS=551} [2020-10-09 15:33:54,824 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 43 predicate places. [2020-10-09 15:33:54,824 INFO L481 AbstractCegarLoop]: Abstraction has has 610 places, 551 transitions, 1334 flow [2020-10-09 15:33:54,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:54,824 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:54,824 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:55,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 680 mathsat -unsat_core_generation=3 [2020-10-09 15:33:55,025 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:55,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:55,025 INFO L82 PathProgramCache]: Analyzing trace with hash -534585295, now seen corresponding path program 1 times [2020-10-09 15:33:55,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:55,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859965629] [2020-10-09 15:33:55,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 681 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 681 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:55,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:55,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:55,416 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:33:55,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:55,420 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:33:55,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859965629] [2020-10-09 15:33:55,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:55,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:55,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849728309] [2020-10-09 15:33:55,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:55,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:55,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:55,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:55,452 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:55,452 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 551 transitions, 1334 flow. Second operand 3 states. [2020-10-09 15:33:55,452 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:55,453 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:55,453 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:55,633 INFO L129 PetriNetUnfolder]: 31/654 cut-off events. [2020-10-09 15:33:55,634 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:33:55,664 INFO L80 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 654 events. 31/654 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2782 event pairs, 0 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 796. Up to 23 conditions per place. [2020-10-09 15:33:55,668 INFO L132 encePairwiseOnDemand]: 607/611 looper letters, 9 selfloop transitions, 3 changer transitions 0/552 dead transitions. [2020-10-09 15:33:55,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 552 transitions, 1360 flow [2020-10-09 15:33:55,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:55,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:55,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1741 transitions. [2020-10-09 15:33:55,669 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9498090561920349 [2020-10-09 15:33:55,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1741 transitions. [2020-10-09 15:33:55,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1741 transitions. [2020-10-09 15:33:55,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:55,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1741 transitions. [2020-10-09 15:33:55,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:55,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:55,671 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:55,671 INFO L185 Difference]: Start difference. First operand has 610 places, 551 transitions, 1334 flow. Second operand 3 states and 1741 transitions. [2020-10-09 15:33:55,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 552 transitions, 1360 flow [2020-10-09 15:33:55,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 552 transitions, 1358 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:55,677 INFO L241 Difference]: Finished difference. Result has 613 places, 552 transitions, 1350 flow [2020-10-09 15:33:55,677 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1350, PETRI_PLACES=613, PETRI_TRANSITIONS=552} [2020-10-09 15:33:55,677 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 46 predicate places. [2020-10-09 15:33:55,677 INFO L481 AbstractCegarLoop]: Abstraction has has 613 places, 552 transitions, 1350 flow [2020-10-09 15:33:55,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:55,677 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:55,677 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:55,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 681 mathsat -unsat_core_generation=3 [2020-10-09 15:33:55,878 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:55,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:55,878 INFO L82 PathProgramCache]: Analyzing trace with hash -533631983, now seen corresponding path program 1 times [2020-10-09 15:33:55,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:55,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977837319] [2020-10-09 15:33:55,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 682 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 682 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:56,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:33:56,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:33:56,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:33:56,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977837319] [2020-10-09 15:33:56,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:56,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:56,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921079487] [2020-10-09 15:33:56,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:56,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:56,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:56,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:56,286 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 582 out of 611 [2020-10-09 15:33:56,287 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 552 transitions, 1350 flow. Second operand 3 states. [2020-10-09 15:33:56,287 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:56,287 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 582 of 611 [2020-10-09 15:33:56,287 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:56,493 INFO L129 PetriNetUnfolder]: 30/650 cut-off events. [2020-10-09 15:33:56,493 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:56,514 INFO L80 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 650 events. 30/650 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2752 event pairs, 0 based on Foata normal form. 1/600 useless extension candidates. Maximal degree in co-relation 788. Up to 23 conditions per place. [2020-10-09 15:33:56,517 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 4 selfloop transitions, 1 changer transitions 0/549 dead transitions. [2020-10-09 15:33:56,517 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 549 transitions, 1345 flow [2020-10-09 15:33:56,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2020-10-09 15:33:56,518 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955810147299509 [2020-10-09 15:33:56,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2020-10-09 15:33:56,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2020-10-09 15:33:56,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:56,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2020-10-09 15:33:56,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:56,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:56,520 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:56,520 INFO L185 Difference]: Start difference. First operand has 613 places, 552 transitions, 1350 flow. Second operand 3 states and 1752 transitions. [2020-10-09 15:33:56,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 549 transitions, 1345 flow [2020-10-09 15:33:56,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 549 transitions, 1337 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:33:56,525 INFO L241 Difference]: Finished difference. Result has 612 places, 549 transitions, 1329 flow [2020-10-09 15:33:56,525 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1329, PETRI_PLACES=612, PETRI_TRANSITIONS=549} [2020-10-09 15:33:56,526 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 45 predicate places. [2020-10-09 15:33:56,526 INFO L481 AbstractCegarLoop]: Abstraction has has 612 places, 549 transitions, 1329 flow [2020-10-09 15:33:56,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:56,526 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:56,526 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:56,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 682 mathsat -unsat_core_generation=3 [2020-10-09 15:33:56,727 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:56,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:56,727 INFO L82 PathProgramCache]: Analyzing trace with hash -533630960, now seen corresponding path program 1 times [2020-10-09 15:33:56,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:56,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738144626] [2020-10-09 15:33:56,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 683 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 683 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:57,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:57,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:33:57,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:33:57,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738144626] [2020-10-09 15:33:57,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:57,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:57,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127086864] [2020-10-09 15:33:57,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:57,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:57,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:57,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:57,150 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:57,151 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 549 transitions, 1329 flow. Second operand 3 states. [2020-10-09 15:33:57,151 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:57,151 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:57,151 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:57,394 INFO L129 PetriNetUnfolder]: 30/648 cut-off events. [2020-10-09 15:33:57,395 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:57,425 INFO L80 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 648 events. 30/648 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2738 event pairs, 0 based on Foata normal form. 0/596 useless extension candidates. Maximal degree in co-relation 792. Up to 23 conditions per place. [2020-10-09 15:33:57,428 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 8 selfloop transitions, 1 changer transitions 0/547 dead transitions. [2020-10-09 15:33:57,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 547 transitions, 1342 flow [2020-10-09 15:33:57,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1738 transitions. [2020-10-09 15:33:57,429 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481723949809057 [2020-10-09 15:33:57,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1738 transitions. [2020-10-09 15:33:57,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1738 transitions. [2020-10-09 15:33:57,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:57,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1738 transitions. [2020-10-09 15:33:57,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:57,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:57,431 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:57,431 INFO L185 Difference]: Start difference. First operand has 612 places, 549 transitions, 1329 flow. Second operand 3 states and 1738 transitions. [2020-10-09 15:33:57,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 547 transitions, 1342 flow [2020-10-09 15:33:57,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 547 transitions, 1341 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:57,437 INFO L241 Difference]: Finished difference. Result has 611 places, 547 transitions, 1325 flow [2020-10-09 15:33:57,437 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1325, PETRI_PLACES=611, PETRI_TRANSITIONS=547} [2020-10-09 15:33:57,437 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 44 predicate places. [2020-10-09 15:33:57,437 INFO L481 AbstractCegarLoop]: Abstraction has has 611 places, 547 transitions, 1325 flow [2020-10-09 15:33:57,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:57,437 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:57,437 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:57,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 683 mathsat -unsat_core_generation=3 [2020-10-09 15:33:57,638 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:57,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:57,638 INFO L82 PathProgramCache]: Analyzing trace with hash -57124588, now seen corresponding path program 1 times [2020-10-09 15:33:57,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:57,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029250527] [2020-10-09 15:33:57,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 684 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 684 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:58,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:58,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:33:58,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:33:58,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029250527] [2020-10-09 15:33:58,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:58,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:58,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762585559] [2020-10-09 15:33:58,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:58,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:58,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:58,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:58,061 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:33:58,062 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 547 transitions, 1325 flow. Second operand 3 states. [2020-10-09 15:33:58,062 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:58,062 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:33:58,062 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:58,246 INFO L129 PetriNetUnfolder]: 29/656 cut-off events. [2020-10-09 15:33:58,247 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:33:58,277 INFO L80 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 656 events. 29/656 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2811 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 804. Up to 23 conditions per place. [2020-10-09 15:33:58,281 INFO L132 encePairwiseOnDemand]: 606/611 looper letters, 10 selfloop transitions, 3 changer transitions 0/549 dead transitions. [2020-10-09 15:33:58,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 549 transitions, 1355 flow [2020-10-09 15:33:58,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:58,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1743 transitions. [2020-10-09 15:33:58,282 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9509001636661211 [2020-10-09 15:33:58,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1743 transitions. [2020-10-09 15:33:58,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1743 transitions. [2020-10-09 15:33:58,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:58,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1743 transitions. [2020-10-09 15:33:58,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:58,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:58,284 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:58,284 INFO L185 Difference]: Start difference. First operand has 611 places, 547 transitions, 1325 flow. Second operand 3 states and 1743 transitions. [2020-10-09 15:33:58,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 549 transitions, 1355 flow [2020-10-09 15:33:58,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 549 transitions, 1354 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:58,290 INFO L241 Difference]: Finished difference. Result has 614 places, 549 transitions, 1348 flow [2020-10-09 15:33:58,290 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1348, PETRI_PLACES=614, PETRI_TRANSITIONS=549} [2020-10-09 15:33:58,290 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 47 predicate places. [2020-10-09 15:33:58,290 INFO L481 AbstractCegarLoop]: Abstraction has has 614 places, 549 transitions, 1348 flow [2020-10-09 15:33:58,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:58,290 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:58,290 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:58,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 684 mathsat -unsat_core_generation=3 [2020-10-09 15:33:58,491 INFO L429 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:58,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:58,492 INFO L82 PathProgramCache]: Analyzing trace with hash -57123565, now seen corresponding path program 1 times [2020-10-09 15:33:58,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:58,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963808757] [2020-10-09 15:33:58,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 685 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 685 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:58,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:33:58,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:33:58,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:33:58,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963808757] [2020-10-09 15:33:58,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:58,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:58,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359843033] [2020-10-09 15:33:58,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:58,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:58,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:58,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:58,916 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 611 [2020-10-09 15:33:58,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 549 transitions, 1348 flow. Second operand 3 states. [2020-10-09 15:33:58,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:58,917 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 611 [2020-10-09 15:33:58,917 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:33:59,115 INFO L129 PetriNetUnfolder]: 28/654 cut-off events. [2020-10-09 15:33:59,115 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:33:59,149 INFO L80 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 654 events. 28/654 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2799 event pairs, 0 based on Foata normal form. 0/605 useless extension candidates. Maximal degree in co-relation 801. Up to 23 conditions per place. [2020-10-09 15:33:59,152 INFO L132 encePairwiseOnDemand]: 608/611 looper letters, 5 selfloop transitions, 2 changer transitions 0/549 dead transitions. [2020-10-09 15:33:59,152 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 549 transitions, 1360 flow [2020-10-09 15:33:59,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:33:59,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:33:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1751 transitions. [2020-10-09 15:33:59,154 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955264593562466 [2020-10-09 15:33:59,154 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1751 transitions. [2020-10-09 15:33:59,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1751 transitions. [2020-10-09 15:33:59,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:33:59,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1751 transitions. [2020-10-09 15:33:59,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:33:59,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:33:59,156 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:33:59,156 INFO L185 Difference]: Start difference. First operand has 614 places, 549 transitions, 1348 flow. Second operand 3 states and 1751 transitions. [2020-10-09 15:33:59,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 549 transitions, 1360 flow [2020-10-09 15:33:59,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 549 transitions, 1355 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:33:59,161 INFO L241 Difference]: Finished difference. Result has 617 places, 549 transitions, 1353 flow [2020-10-09 15:33:59,162 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1339, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1353, PETRI_PLACES=617, PETRI_TRANSITIONS=549} [2020-10-09 15:33:59,162 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 50 predicate places. [2020-10-09 15:33:59,162 INFO L481 AbstractCegarLoop]: Abstraction has has 617 places, 549 transitions, 1353 flow [2020-10-09 15:33:59,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:33:59,162 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:33:59,162 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:33:59,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 685 mathsat -unsat_core_generation=3 [2020-10-09 15:33:59,363 INFO L429 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:33:59,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:33:59,363 INFO L82 PathProgramCache]: Analyzing trace with hash -56171276, now seen corresponding path program 1 times [2020-10-09 15:33:59,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:33:59,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090102085] [2020-10-09 15:33:59,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 686 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 686 with mathsat -unsat_core_generation=3 [2020-10-09 15:33:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:33:59,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:33:59,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:33:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:33:59,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:33:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:33:59,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090102085] [2020-10-09 15:33:59,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:33:59,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:33:59,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147263206] [2020-10-09 15:33:59,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:33:59,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:33:59,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:33:59,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:33:59,824 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 582 out of 611 [2020-10-09 15:33:59,824 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 549 transitions, 1353 flow. Second operand 3 states. [2020-10-09 15:33:59,825 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:33:59,825 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 582 of 611 [2020-10-09 15:33:59,825 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:00,014 INFO L129 PetriNetUnfolder]: 27/650 cut-off events. [2020-10-09 15:34:00,015 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:34:00,047 INFO L80 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 650 events. 27/650 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2774 event pairs, 0 based on Foata normal form. 1/603 useless extension candidates. Maximal degree in co-relation 797. Up to 23 conditions per place. [2020-10-09 15:34:00,050 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 4 selfloop transitions, 1 changer transitions 0/546 dead transitions. [2020-10-09 15:34:00,050 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 546 transitions, 1348 flow [2020-10-09 15:34:00,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:00,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2020-10-09 15:34:00,052 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955810147299509 [2020-10-09 15:34:00,052 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2020-10-09 15:34:00,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2020-10-09 15:34:00,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:00,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2020-10-09 15:34:00,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:00,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:00,054 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:00,054 INFO L185 Difference]: Start difference. First operand has 617 places, 549 transitions, 1353 flow. Second operand 3 states and 1752 transitions. [2020-10-09 15:34:00,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 546 transitions, 1348 flow [2020-10-09 15:34:00,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 546 transitions, 1341 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:34:00,060 INFO L241 Difference]: Finished difference. Result has 616 places, 546 transitions, 1333 flow [2020-10-09 15:34:00,060 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1331, PETRI_DIFFERENCE_MINUEND_PLACES=614, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1333, PETRI_PLACES=616, PETRI_TRANSITIONS=546} [2020-10-09 15:34:00,060 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 49 predicate places. [2020-10-09 15:34:00,060 INFO L481 AbstractCegarLoop]: Abstraction has has 616 places, 546 transitions, 1333 flow [2020-10-09 15:34:00,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:00,060 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:00,060 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:00,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 686 mathsat -unsat_core_generation=3 [2020-10-09 15:34:00,261 INFO L429 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:00,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:00,262 INFO L82 PathProgramCache]: Analyzing trace with hash -56170253, now seen corresponding path program 1 times [2020-10-09 15:34:00,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:00,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098922094] [2020-10-09 15:34:00,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 687 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 687 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:00,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:00,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:34:00,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:34:00,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098922094] [2020-10-09 15:34:00,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:00,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:00,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699285857] [2020-10-09 15:34:00,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:00,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:00,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:00,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:00,712 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:34:00,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 546 transitions, 1333 flow. Second operand 3 states. [2020-10-09 15:34:00,713 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:00,713 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:34:00,713 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:00,913 INFO L129 PetriNetUnfolder]: 27/648 cut-off events. [2020-10-09 15:34:00,913 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:34:00,947 INFO L80 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 648 events. 27/648 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2759 event pairs, 0 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 799. Up to 23 conditions per place. [2020-10-09 15:34:00,950 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 8 selfloop transitions, 1 changer transitions 0/544 dead transitions. [2020-10-09 15:34:00,950 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 544 transitions, 1346 flow [2020-10-09 15:34:00,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1738 transitions. [2020-10-09 15:34:00,952 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481723949809057 [2020-10-09 15:34:00,952 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1738 transitions. [2020-10-09 15:34:00,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1738 transitions. [2020-10-09 15:34:00,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:00,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1738 transitions. [2020-10-09 15:34:00,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:00,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:00,954 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:00,954 INFO L185 Difference]: Start difference. First operand has 616 places, 546 transitions, 1333 flow. Second operand 3 states and 1738 transitions. [2020-10-09 15:34:00,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 544 transitions, 1346 flow [2020-10-09 15:34:00,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 544 transitions, 1345 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:00,960 INFO L241 Difference]: Finished difference. Result has 615 places, 544 transitions, 1329 flow [2020-10-09 15:34:00,960 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1329, PETRI_PLACES=615, PETRI_TRANSITIONS=544} [2020-10-09 15:34:00,960 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 48 predicate places. [2020-10-09 15:34:00,960 INFO L481 AbstractCegarLoop]: Abstraction has has 615 places, 544 transitions, 1329 flow [2020-10-09 15:34:00,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:00,960 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:00,960 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:01,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 687 mathsat -unsat_core_generation=3 [2020-10-09 15:34:01,161 INFO L429 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:01,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:01,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1638252457, now seen corresponding path program 1 times [2020-10-09 15:34:01,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:01,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507527855] [2020-10-09 15:34:01,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 688 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 688 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:01,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:01,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:34:01,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:34:01,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507527855] [2020-10-09 15:34:01,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:01,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:01,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388233420] [2020-10-09 15:34:01,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:01,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:01,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:01,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:01,602 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:34:01,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 544 transitions, 1329 flow. Second operand 3 states. [2020-10-09 15:34:01,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:01,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:34:01,603 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:01,809 INFO L129 PetriNetUnfolder]: 26/656 cut-off events. [2020-10-09 15:34:01,809 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:34:01,843 INFO L80 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 656 events. 26/656 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2827 event pairs, 0 based on Foata normal form. 0/607 useless extension candidates. Maximal degree in co-relation 811. Up to 23 conditions per place. [2020-10-09 15:34:01,846 INFO L132 encePairwiseOnDemand]: 606/611 looper letters, 10 selfloop transitions, 3 changer transitions 0/546 dead transitions. [2020-10-09 15:34:01,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 546 transitions, 1359 flow [2020-10-09 15:34:01,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1743 transitions. [2020-10-09 15:34:01,848 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9509001636661211 [2020-10-09 15:34:01,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1743 transitions. [2020-10-09 15:34:01,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1743 transitions. [2020-10-09 15:34:01,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:01,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1743 transitions. [2020-10-09 15:34:01,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:01,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:01,850 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:01,850 INFO L185 Difference]: Start difference. First operand has 615 places, 544 transitions, 1329 flow. Second operand 3 states and 1743 transitions. [2020-10-09 15:34:01,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 546 transitions, 1359 flow [2020-10-09 15:34:01,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 546 transitions, 1358 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:01,856 INFO L241 Difference]: Finished difference. Result has 618 places, 546 transitions, 1352 flow [2020-10-09 15:34:01,856 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=614, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1352, PETRI_PLACES=618, PETRI_TRANSITIONS=546} [2020-10-09 15:34:01,856 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 51 predicate places. [2020-10-09 15:34:01,856 INFO L481 AbstractCegarLoop]: Abstraction has has 618 places, 546 transitions, 1352 flow [2020-10-09 15:34:01,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:01,857 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:01,857 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:02,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 688 mathsat -unsat_core_generation=3 [2020-10-09 15:34:02,057 INFO L429 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:02,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:02,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1638253480, now seen corresponding path program 1 times [2020-10-09 15:34:02,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:02,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210661591] [2020-10-09 15:34:02,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 689 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 689 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:02,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:34:02,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:34:02,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:34:02,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210661591] [2020-10-09 15:34:02,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:02,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:02,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691809298] [2020-10-09 15:34:02,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:02,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:02,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:02,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:02,507 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 582 out of 611 [2020-10-09 15:34:02,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 546 transitions, 1352 flow. Second operand 3 states. [2020-10-09 15:34:02,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:02,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 582 of 611 [2020-10-09 15:34:02,508 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:02,721 INFO L129 PetriNetUnfolder]: 24/657 cut-off events. [2020-10-09 15:34:02,721 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:34:02,754 INFO L80 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 657 events. 24/657 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2852 event pairs, 0 based on Foata normal form. 1/613 useless extension candidates. Maximal degree in co-relation 809. Up to 23 conditions per place. [2020-10-09 15:34:02,757 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 4 selfloop transitions, 1 changer transitions 0/545 dead transitions. [2020-10-09 15:34:02,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 545 transitions, 1358 flow [2020-10-09 15:34:02,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:02,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2020-10-09 15:34:02,759 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955810147299509 [2020-10-09 15:34:02,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2020-10-09 15:34:02,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2020-10-09 15:34:02,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:02,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2020-10-09 15:34:02,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:02,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:02,761 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:02,761 INFO L185 Difference]: Start difference. First operand has 618 places, 546 transitions, 1352 flow. Second operand 3 states and 1752 transitions. [2020-10-09 15:34:02,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 545 transitions, 1358 flow [2020-10-09 15:34:02,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 545 transitions, 1353 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:02,767 INFO L241 Difference]: Finished difference. Result has 620 places, 545 transitions, 1348 flow [2020-10-09 15:34:02,767 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1343, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1348, PETRI_PLACES=620, PETRI_TRANSITIONS=545} [2020-10-09 15:34:02,767 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 53 predicate places. [2020-10-09 15:34:02,767 INFO L481 AbstractCegarLoop]: Abstraction has has 620 places, 545 transitions, 1348 flow [2020-10-09 15:34:02,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:02,767 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:02,767 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:02,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 689 mathsat -unsat_core_generation=3 [2020-10-09 15:34:02,968 INFO L429 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:02,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:02,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1639205769, now seen corresponding path program 1 times [2020-10-09 15:34:02,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:02,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911905894] [2020-10-09 15:34:02,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 690 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 690 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:03,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:03,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:34:03,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:34:03,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911905894] [2020-10-09 15:34:03,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:03,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:03,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962200469] [2020-10-09 15:34:03,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:03,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:03,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:03,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:03,411 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 611 [2020-10-09 15:34:03,412 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 545 transitions, 1348 flow. Second operand 3 states. [2020-10-09 15:34:03,412 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:03,412 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 611 [2020-10-09 15:34:03,412 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:03,622 INFO L129 PetriNetUnfolder]: 24/650 cut-off events. [2020-10-09 15:34:03,622 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:34:03,659 INFO L80 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 650 events. 24/650 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2790 event pairs, 0 based on Foata normal form. 1/606 useless extension candidates. Maximal degree in co-relation 805. Up to 23 conditions per place. [2020-10-09 15:34:03,662 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 5 selfloop transitions, 1 changer transitions 0/543 dead transitions. [2020-10-09 15:34:03,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 543 transitions, 1351 flow [2020-10-09 15:34:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2020-10-09 15:34:03,664 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547190398254228 [2020-10-09 15:34:03,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2020-10-09 15:34:03,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2020-10-09 15:34:03,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:03,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2020-10-09 15:34:03,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:03,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:03,666 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:03,666 INFO L185 Difference]: Start difference. First operand has 620 places, 545 transitions, 1348 flow. Second operand 3 states and 1750 transitions. [2020-10-09 15:34:03,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 543 transitions, 1351 flow [2020-10-09 15:34:03,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 543 transitions, 1344 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:34:03,672 INFO L241 Difference]: Finished difference. Result has 620 places, 543 transitions, 1337 flow [2020-10-09 15:34:03,672 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1337, PETRI_PLACES=620, PETRI_TRANSITIONS=543} [2020-10-09 15:34:03,672 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 53 predicate places. [2020-10-09 15:34:03,672 INFO L481 AbstractCegarLoop]: Abstraction has has 620 places, 543 transitions, 1337 flow [2020-10-09 15:34:03,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:03,673 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:03,673 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:03,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 690 mathsat -unsat_core_generation=3 [2020-10-09 15:34:03,873 INFO L429 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:03,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:03,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1639206792, now seen corresponding path program 1 times [2020-10-09 15:34:03,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:03,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050786061] [2020-10-09 15:34:03,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 691 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 691 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:04,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:04,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:34:04,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:34:04,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050786061] [2020-10-09 15:34:04,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:04,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:04,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606719345] [2020-10-09 15:34:04,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:04,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:04,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:04,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:04,336 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:34:04,337 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 543 transitions, 1337 flow. Second operand 3 states. [2020-10-09 15:34:04,337 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:04,337 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:34:04,337 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:04,539 INFO L129 PetriNetUnfolder]: 24/648 cut-off events. [2020-10-09 15:34:04,540 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:34:04,574 INFO L80 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 648 events. 24/648 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2777 event pairs, 0 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 805. Up to 23 conditions per place. [2020-10-09 15:34:04,577 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 8 selfloop transitions, 1 changer transitions 0/541 dead transitions. [2020-10-09 15:34:04,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 541 transitions, 1350 flow [2020-10-09 15:34:04,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:04,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:04,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1738 transitions. [2020-10-09 15:34:04,578 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481723949809057 [2020-10-09 15:34:04,578 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1738 transitions. [2020-10-09 15:34:04,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1738 transitions. [2020-10-09 15:34:04,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:04,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1738 transitions. [2020-10-09 15:34:04,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:04,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:04,580 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:04,580 INFO L185 Difference]: Start difference. First operand has 620 places, 543 transitions, 1337 flow. Second operand 3 states and 1738 transitions. [2020-10-09 15:34:04,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 541 transitions, 1350 flow [2020-10-09 15:34:04,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 541 transitions, 1349 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:04,586 INFO L241 Difference]: Finished difference. Result has 619 places, 541 transitions, 1333 flow [2020-10-09 15:34:04,586 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1331, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1333, PETRI_PLACES=619, PETRI_TRANSITIONS=541} [2020-10-09 15:34:04,586 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 52 predicate places. [2020-10-09 15:34:04,587 INFO L481 AbstractCegarLoop]: Abstraction has has 619 places, 541 transitions, 1333 flow [2020-10-09 15:34:04,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:04,587 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:04,587 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:04,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 691 mathsat -unsat_core_generation=3 [2020-10-09 15:34:04,787 INFO L429 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:04,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:04,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1971085276, now seen corresponding path program 1 times [2020-10-09 15:34:04,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:04,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529303949] [2020-10-09 15:34:04,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 692 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 692 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:05,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:05,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:34:05,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:34:05,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529303949] [2020-10-09 15:34:05,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:05,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:05,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925533787] [2020-10-09 15:34:05,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:05,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:05,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:05,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:05,223 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 611 [2020-10-09 15:34:05,224 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 541 transitions, 1333 flow. Second operand 3 states. [2020-10-09 15:34:05,224 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:05,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 611 [2020-10-09 15:34:05,225 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:05,438 INFO L129 PetriNetUnfolder]: 22/653 cut-off events. [2020-10-09 15:34:05,438 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:34:05,467 INFO L80 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 653 events. 22/653 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2825 event pairs, 0 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 808. Up to 23 conditions per place. [2020-10-09 15:34:05,470 INFO L132 encePairwiseOnDemand]: 608/611 looper letters, 5 selfloop transitions, 2 changer transitions 0/542 dead transitions. [2020-10-09 15:34:05,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 542 transitions, 1349 flow [2020-10-09 15:34:05,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:05,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1751 transitions. [2020-10-09 15:34:05,471 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955264593562466 [2020-10-09 15:34:05,471 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1751 transitions. [2020-10-09 15:34:05,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1751 transitions. [2020-10-09 15:34:05,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:05,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1751 transitions. [2020-10-09 15:34:05,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:05,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:05,473 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:05,473 INFO L185 Difference]: Start difference. First operand has 619 places, 541 transitions, 1333 flow. Second operand 3 states and 1751 transitions. [2020-10-09 15:34:05,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 542 transitions, 1349 flow [2020-10-09 15:34:05,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 542 transitions, 1348 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:05,479 INFO L241 Difference]: Finished difference. Result has 622 places, 542 transitions, 1346 flow [2020-10-09 15:34:05,479 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1346, PETRI_PLACES=622, PETRI_TRANSITIONS=542} [2020-10-09 15:34:05,479 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 55 predicate places. [2020-10-09 15:34:05,479 INFO L481 AbstractCegarLoop]: Abstraction has has 622 places, 542 transitions, 1346 flow [2020-10-09 15:34:05,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:05,479 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:05,480 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:05,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 692 mathsat -unsat_core_generation=3 [2020-10-09 15:34:05,680 INFO L429 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:05,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:05,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1971084253, now seen corresponding path program 1 times [2020-10-09 15:34:05,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:05,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027627359] [2020-10-09 15:34:05,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 693 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 693 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:06,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:06,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:34:06,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:34:06,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027627359] [2020-10-09 15:34:06,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:06,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:06,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54729012] [2020-10-09 15:34:06,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:06,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:06,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:06,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:06,126 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:34:06,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 542 transitions, 1346 flow. Second operand 3 states. [2020-10-09 15:34:06,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:06,128 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:34:06,128 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:06,337 INFO L129 PetriNetUnfolder]: 22/654 cut-off events. [2020-10-09 15:34:06,337 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:34:06,371 INFO L80 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 654 events. 22/654 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2837 event pairs, 0 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 816. Up to 23 conditions per place. [2020-10-09 15:34:06,374 INFO L132 encePairwiseOnDemand]: 607/611 looper letters, 9 selfloop transitions, 3 changer transitions 0/543 dead transitions. [2020-10-09 15:34:06,374 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 543 transitions, 1372 flow [2020-10-09 15:34:06,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:06,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:06,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1741 transitions. [2020-10-09 15:34:06,375 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9498090561920349 [2020-10-09 15:34:06,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1741 transitions. [2020-10-09 15:34:06,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1741 transitions. [2020-10-09 15:34:06,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:06,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1741 transitions. [2020-10-09 15:34:06,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:06,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:06,378 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:06,378 INFO L185 Difference]: Start difference. First operand has 622 places, 542 transitions, 1346 flow. Second operand 3 states and 1741 transitions. [2020-10-09 15:34:06,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 543 transitions, 1372 flow [2020-10-09 15:34:06,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 543 transitions, 1370 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:06,384 INFO L241 Difference]: Finished difference. Result has 625 places, 543 transitions, 1362 flow [2020-10-09 15:34:06,384 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1362, PETRI_PLACES=625, PETRI_TRANSITIONS=543} [2020-10-09 15:34:06,385 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 58 predicate places. [2020-10-09 15:34:06,385 INFO L481 AbstractCegarLoop]: Abstraction has has 625 places, 543 transitions, 1362 flow [2020-10-09 15:34:06,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:06,385 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:06,385 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:06,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 693 mathsat -unsat_core_generation=3 [2020-10-09 15:34:06,586 INFO L429 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:06,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:06,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1972037565, now seen corresponding path program 1 times [2020-10-09 15:34:06,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:06,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19603878] [2020-10-09 15:34:06,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 694 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 694 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:06,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:34:06,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:34:07,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:34:07,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19603878] [2020-10-09 15:34:07,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:07,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:07,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110760019] [2020-10-09 15:34:07,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:07,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:07,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:07,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:07,020 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 582 out of 611 [2020-10-09 15:34:07,021 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 543 transitions, 1362 flow. Second operand 3 states. [2020-10-09 15:34:07,021 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:07,021 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 582 of 611 [2020-10-09 15:34:07,021 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:07,221 INFO L129 PetriNetUnfolder]: 21/650 cut-off events. [2020-10-09 15:34:07,221 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:34:07,255 INFO L80 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 650 events. 21/650 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2806 event pairs, 0 based on Foata normal form. 1/609 useless extension candidates. Maximal degree in co-relation 808. Up to 23 conditions per place. [2020-10-09 15:34:07,258 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 4 selfloop transitions, 1 changer transitions 0/540 dead transitions. [2020-10-09 15:34:07,258 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 540 transitions, 1357 flow [2020-10-09 15:34:07,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2020-10-09 15:34:07,260 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955810147299509 [2020-10-09 15:34:07,260 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2020-10-09 15:34:07,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2020-10-09 15:34:07,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:07,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2020-10-09 15:34:07,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:07,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:07,262 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:07,262 INFO L185 Difference]: Start difference. First operand has 625 places, 543 transitions, 1362 flow. Second operand 3 states and 1752 transitions. [2020-10-09 15:34:07,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 540 transitions, 1357 flow [2020-10-09 15:34:07,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 540 transitions, 1349 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:34:07,268 INFO L241 Difference]: Finished difference. Result has 624 places, 540 transitions, 1341 flow [2020-10-09 15:34:07,268 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1339, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1341, PETRI_PLACES=624, PETRI_TRANSITIONS=540} [2020-10-09 15:34:07,268 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 57 predicate places. [2020-10-09 15:34:07,269 INFO L481 AbstractCegarLoop]: Abstraction has has 624 places, 540 transitions, 1341 flow [2020-10-09 15:34:07,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:07,269 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:07,269 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:07,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 694 mathsat -unsat_core_generation=3 [2020-10-09 15:34:07,469 INFO L429 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:07,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:07,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1972038588, now seen corresponding path program 1 times [2020-10-09 15:34:07,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:07,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332564113] [2020-10-09 15:34:07,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 695 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 695 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:07,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:07,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:34:07,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:34:07,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332564113] [2020-10-09 15:34:07,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:07,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:07,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361053079] [2020-10-09 15:34:07,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:07,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:07,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:07,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:07,921 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:34:07,922 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 540 transitions, 1341 flow. Second operand 3 states. [2020-10-09 15:34:07,922 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:07,922 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:34:07,922 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:08,139 INFO L129 PetriNetUnfolder]: 21/648 cut-off events. [2020-10-09 15:34:08,139 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:34:08,166 INFO L80 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 648 events. 21/648 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2794 event pairs, 0 based on Foata normal form. 0/605 useless extension candidates. Maximal degree in co-relation 812. Up to 23 conditions per place. [2020-10-09 15:34:08,169 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 8 selfloop transitions, 1 changer transitions 0/538 dead transitions. [2020-10-09 15:34:08,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 538 transitions, 1354 flow [2020-10-09 15:34:08,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1738 transitions. [2020-10-09 15:34:08,170 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481723949809057 [2020-10-09 15:34:08,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1738 transitions. [2020-10-09 15:34:08,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1738 transitions. [2020-10-09 15:34:08,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:08,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1738 transitions. [2020-10-09 15:34:08,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:08,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:08,172 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:08,172 INFO L185 Difference]: Start difference. First operand has 624 places, 540 transitions, 1341 flow. Second operand 3 states and 1738 transitions. [2020-10-09 15:34:08,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 538 transitions, 1354 flow [2020-10-09 15:34:08,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 538 transitions, 1353 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:08,177 INFO L241 Difference]: Finished difference. Result has 623 places, 538 transitions, 1337 flow [2020-10-09 15:34:08,177 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1337, PETRI_PLACES=623, PETRI_TRANSITIONS=538} [2020-10-09 15:34:08,177 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 56 predicate places. [2020-10-09 15:34:08,178 INFO L481 AbstractCegarLoop]: Abstraction has has 623 places, 538 transitions, 1337 flow [2020-10-09 15:34:08,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:08,178 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:08,178 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:08,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 695 mathsat -unsat_core_generation=3 [2020-10-09 15:34:08,378 INFO L429 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:08,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:08,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1939240099, now seen corresponding path program 1 times [2020-10-09 15:34:08,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:08,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900804490] [2020-10-09 15:34:08,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 696 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 696 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:08,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:34:08,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:34:08,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:08,821 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:34:08,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900804490] [2020-10-09 15:34:08,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:08,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:08,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712658562] [2020-10-09 15:34:08,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:08,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:08,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:08,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:08,834 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 582 out of 611 [2020-10-09 15:34:08,835 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 538 transitions, 1337 flow. Second operand 3 states. [2020-10-09 15:34:08,835 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:08,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 582 of 611 [2020-10-09 15:34:08,835 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:09,041 INFO L129 PetriNetUnfolder]: 20/655 cut-off events. [2020-10-09 15:34:09,041 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:34:09,075 INFO L80 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 655 events. 20/655 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2852 event pairs, 0 based on Foata normal form. 1/614 useless extension candidates. Maximal degree in co-relation 815. Up to 23 conditions per place. [2020-10-09 15:34:09,078 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 4 selfloop transitions, 1 changer transitions 0/538 dead transitions. [2020-10-09 15:34:09,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 538 transitions, 1347 flow [2020-10-09 15:34:09,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:09,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2020-10-09 15:34:09,079 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955810147299509 [2020-10-09 15:34:09,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2020-10-09 15:34:09,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2020-10-09 15:34:09,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:09,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2020-10-09 15:34:09,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:09,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:09,081 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:09,081 INFO L185 Difference]: Start difference. First operand has 623 places, 538 transitions, 1337 flow. Second operand 3 states and 1752 transitions. [2020-10-09 15:34:09,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 538 transitions, 1347 flow [2020-10-09 15:34:09,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 538 transitions, 1346 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:09,087 INFO L241 Difference]: Finished difference. Result has 625 places, 538 transitions, 1341 flow [2020-10-09 15:34:09,088 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1341, PETRI_PLACES=625, PETRI_TRANSITIONS=538} [2020-10-09 15:34:09,088 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 58 predicate places. [2020-10-09 15:34:09,088 INFO L481 AbstractCegarLoop]: Abstraction has has 625 places, 538 transitions, 1341 flow [2020-10-09 15:34:09,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:09,088 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:09,088 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:09,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 696 mathsat -unsat_core_generation=3 [2020-10-09 15:34:09,289 INFO L429 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:09,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:09,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1939241122, now seen corresponding path program 1 times [2020-10-09 15:34:09,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:09,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620179361] [2020-10-09 15:34:09,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 697 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 697 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:09,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:09,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:34:09,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:34:09,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620179361] [2020-10-09 15:34:09,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:09,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:09,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160775496] [2020-10-09 15:34:09,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:09,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:09,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:09,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:09,760 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:34:09,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 538 transitions, 1341 flow. Second operand 3 states. [2020-10-09 15:34:09,762 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:09,762 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:34:09,762 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:09,953 INFO L129 PetriNetUnfolder]: 18/657 cut-off events. [2020-10-09 15:34:09,953 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:34:09,985 INFO L80 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 657 events. 18/657 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2885 event pairs, 0 based on Foata normal form. 0/615 useless extension candidates. Maximal degree in co-relation 828. Up to 23 conditions per place. [2020-10-09 15:34:09,987 INFO L132 encePairwiseOnDemand]: 607/611 looper letters, 9 selfloop transitions, 3 changer transitions 0/539 dead transitions. [2020-10-09 15:34:09,987 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 539 transitions, 1367 flow [2020-10-09 15:34:09,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1741 transitions. [2020-10-09 15:34:09,989 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9498090561920349 [2020-10-09 15:34:09,989 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1741 transitions. [2020-10-09 15:34:09,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1741 transitions. [2020-10-09 15:34:09,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:09,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1741 transitions. [2020-10-09 15:34:09,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:09,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:09,990 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:09,991 INFO L185 Difference]: Start difference. First operand has 625 places, 538 transitions, 1341 flow. Second operand 3 states and 1741 transitions. [2020-10-09 15:34:09,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 539 transitions, 1367 flow [2020-10-09 15:34:09,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 539 transitions, 1366 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:09,996 INFO L241 Difference]: Finished difference. Result has 628 places, 539 transitions, 1358 flow [2020-10-09 15:34:09,996 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1358, PETRI_PLACES=628, PETRI_TRANSITIONS=539} [2020-10-09 15:34:09,996 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 61 predicate places. [2020-10-09 15:34:09,996 INFO L481 AbstractCegarLoop]: Abstraction has has 628 places, 539 transitions, 1358 flow [2020-10-09 15:34:09,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:09,997 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:09,997 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:10,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 697 mathsat -unsat_core_generation=3 [2020-10-09 15:34:10,198 INFO L429 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:10,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:10,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1938287810, now seen corresponding path program 1 times [2020-10-09 15:34:10,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:10,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311670157] [2020-10-09 15:34:10,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 698 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 698 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:10,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:10,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:34:10,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:34:10,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311670157] [2020-10-09 15:34:10,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:10,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:10,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602147450] [2020-10-09 15:34:10,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:10,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:10,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:10,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:10,648 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 611 [2020-10-09 15:34:10,649 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 539 transitions, 1358 flow. Second operand 3 states. [2020-10-09 15:34:10,649 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:10,649 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 611 [2020-10-09 15:34:10,649 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:10,852 INFO L129 PetriNetUnfolder]: 18/650 cut-off events. [2020-10-09 15:34:10,852 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:34:10,886 INFO L80 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 650 events. 18/650 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2821 event pairs, 0 based on Foata normal form. 1/612 useless extension candidates. Maximal degree in co-relation 814. Up to 23 conditions per place. [2020-10-09 15:34:10,888 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 5 selfloop transitions, 1 changer transitions 0/537 dead transitions. [2020-10-09 15:34:10,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 537 transitions, 1360 flow [2020-10-09 15:34:10,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:10,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2020-10-09 15:34:10,890 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547190398254228 [2020-10-09 15:34:10,890 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2020-10-09 15:34:10,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2020-10-09 15:34:10,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:10,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2020-10-09 15:34:10,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:10,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:10,892 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:10,892 INFO L185 Difference]: Start difference. First operand has 628 places, 539 transitions, 1358 flow. Second operand 3 states and 1750 transitions. [2020-10-09 15:34:10,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 537 transitions, 1360 flow [2020-10-09 15:34:10,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 537 transitions, 1352 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:34:10,898 INFO L241 Difference]: Finished difference. Result has 628 places, 537 transitions, 1345 flow [2020-10-09 15:34:10,898 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1345, PETRI_PLACES=628, PETRI_TRANSITIONS=537} [2020-10-09 15:34:10,898 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 61 predicate places. [2020-10-09 15:34:10,898 INFO L481 AbstractCegarLoop]: Abstraction has has 628 places, 537 transitions, 1345 flow [2020-10-09 15:34:10,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:10,898 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:10,898 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:11,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 698 mathsat -unsat_core_generation=3 [2020-10-09 15:34:11,099 INFO L429 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:11,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:11,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1938286787, now seen corresponding path program 1 times [2020-10-09 15:34:11,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:11,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748527404] [2020-10-09 15:34:11,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 699 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 699 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:11,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:11,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:34:11,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:34:11,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748527404] [2020-10-09 15:34:11,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:11,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:11,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879760664] [2020-10-09 15:34:11,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:11,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:11,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:11,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:11,550 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:34:11,551 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 537 transitions, 1345 flow. Second operand 3 states. [2020-10-09 15:34:11,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:11,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:34:11,552 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:11,759 INFO L129 PetriNetUnfolder]: 18/648 cut-off events. [2020-10-09 15:34:11,759 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:34:11,793 INFO L80 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 648 events. 18/648 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2810 event pairs, 0 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 818. Up to 23 conditions per place. [2020-10-09 15:34:11,795 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 8 selfloop transitions, 1 changer transitions 0/535 dead transitions. [2020-10-09 15:34:11,795 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 535 transitions, 1358 flow [2020-10-09 15:34:11,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1738 transitions. [2020-10-09 15:34:11,797 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481723949809057 [2020-10-09 15:34:11,797 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1738 transitions. [2020-10-09 15:34:11,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1738 transitions. [2020-10-09 15:34:11,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:11,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1738 transitions. [2020-10-09 15:34:11,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:11,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:11,798 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:11,799 INFO L185 Difference]: Start difference. First operand has 628 places, 537 transitions, 1345 flow. Second operand 3 states and 1738 transitions. [2020-10-09 15:34:11,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 535 transitions, 1358 flow [2020-10-09 15:34:11,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 535 transitions, 1357 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:11,804 INFO L241 Difference]: Finished difference. Result has 627 places, 535 transitions, 1341 flow [2020-10-09 15:34:11,804 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1339, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1341, PETRI_PLACES=627, PETRI_TRANSITIONS=535} [2020-10-09 15:34:11,805 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 60 predicate places. [2020-10-09 15:34:11,805 INFO L481 AbstractCegarLoop]: Abstraction has has 627 places, 535 transitions, 1341 flow [2020-10-09 15:34:11,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:11,805 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:11,805 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:12,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 699 mathsat -unsat_core_generation=3 [2020-10-09 15:34:12,006 INFO L429 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:12,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:12,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1627567241, now seen corresponding path program 1 times [2020-10-09 15:34:12,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:12,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114748467] [2020-10-09 15:34:12,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 700 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 700 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:12,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:12,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:34:12,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:34:12,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114748467] [2020-10-09 15:34:12,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:12,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:12,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123829769] [2020-10-09 15:34:12,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:12,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:12,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:12,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:12,477 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:34:12,478 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 535 transitions, 1341 flow. Second operand 3 states. [2020-10-09 15:34:12,478 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:12,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:34:12,479 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:12,690 INFO L129 PetriNetUnfolder]: 17/656 cut-off events. [2020-10-09 15:34:12,691 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:34:12,727 INFO L80 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 656 events. 17/656 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2879 event pairs, 0 based on Foata normal form. 0/616 useless extension candidates. Maximal degree in co-relation 830. Up to 23 conditions per place. [2020-10-09 15:34:12,729 INFO L132 encePairwiseOnDemand]: 606/611 looper letters, 10 selfloop transitions, 3 changer transitions 0/537 dead transitions. [2020-10-09 15:34:12,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 537 transitions, 1371 flow [2020-10-09 15:34:12,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:12,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1743 transitions. [2020-10-09 15:34:12,731 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9509001636661211 [2020-10-09 15:34:12,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1743 transitions. [2020-10-09 15:34:12,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1743 transitions. [2020-10-09 15:34:12,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:12,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1743 transitions. [2020-10-09 15:34:12,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:12,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:12,733 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:12,733 INFO L185 Difference]: Start difference. First operand has 627 places, 535 transitions, 1341 flow. Second operand 3 states and 1743 transitions. [2020-10-09 15:34:12,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 537 transitions, 1371 flow [2020-10-09 15:34:12,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 537 transitions, 1370 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:12,739 INFO L241 Difference]: Finished difference. Result has 630 places, 537 transitions, 1364 flow [2020-10-09 15:34:12,739 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1364, PETRI_PLACES=630, PETRI_TRANSITIONS=537} [2020-10-09 15:34:12,739 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 63 predicate places. [2020-10-09 15:34:12,739 INFO L481 AbstractCegarLoop]: Abstraction has has 630 places, 537 transitions, 1364 flow [2020-10-09 15:34:12,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:12,740 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:12,740 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:12,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 700 mathsat -unsat_core_generation=3 [2020-10-09 15:34:12,940 INFO L429 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:12,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:12,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1627566218, now seen corresponding path program 1 times [2020-10-09 15:34:12,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:12,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146373666] [2020-10-09 15:34:12,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 701 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 701 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:13,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:34:13,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:34:13,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:34:13,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146373666] [2020-10-09 15:34:13,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:13,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:13,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869226794] [2020-10-09 15:34:13,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:13,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:13,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:13,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:13,408 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 582 out of 611 [2020-10-09 15:34:13,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 537 transitions, 1364 flow. Second operand 3 states. [2020-10-09 15:34:13,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:13,409 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 582 of 611 [2020-10-09 15:34:13,409 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:13,614 INFO L129 PetriNetUnfolder]: 15/657 cut-off events. [2020-10-09 15:34:13,615 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:34:13,650 INFO L80 FinitePrefix]: Finished finitePrefix Result has 891 conditions, 657 events. 15/657 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2906 event pairs, 0 based on Foata normal form. 1/622 useless extension candidates. Maximal degree in co-relation 828. Up to 23 conditions per place. [2020-10-09 15:34:13,652 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 4 selfloop transitions, 1 changer transitions 0/536 dead transitions. [2020-10-09 15:34:13,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 536 transitions, 1370 flow [2020-10-09 15:34:13,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2020-10-09 15:34:13,654 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955810147299509 [2020-10-09 15:34:13,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2020-10-09 15:34:13,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2020-10-09 15:34:13,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:13,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2020-10-09 15:34:13,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:13,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:13,656 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:13,656 INFO L185 Difference]: Start difference. First operand has 630 places, 537 transitions, 1364 flow. Second operand 3 states and 1752 transitions. [2020-10-09 15:34:13,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 536 transitions, 1370 flow [2020-10-09 15:34:13,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 536 transitions, 1365 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:13,662 INFO L241 Difference]: Finished difference. Result has 632 places, 536 transitions, 1360 flow [2020-10-09 15:34:13,662 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1360, PETRI_PLACES=632, PETRI_TRANSITIONS=536} [2020-10-09 15:34:13,662 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 65 predicate places. [2020-10-09 15:34:13,662 INFO L481 AbstractCegarLoop]: Abstraction has has 632 places, 536 transitions, 1360 flow [2020-10-09 15:34:13,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:13,662 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:13,663 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:13,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 701 mathsat -unsat_core_generation=3 [2020-10-09 15:34:13,863 INFO L429 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:13,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:13,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1626613929, now seen corresponding path program 1 times [2020-10-09 15:34:13,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:13,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630800390] [2020-10-09 15:34:13,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 702 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 702 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:14,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:14,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:34:14,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:34:14,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630800390] [2020-10-09 15:34:14,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:14,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:14,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414135825] [2020-10-09 15:34:14,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:14,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:14,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:14,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:14,314 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 611 [2020-10-09 15:34:14,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 536 transitions, 1360 flow. Second operand 3 states. [2020-10-09 15:34:14,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:14,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 611 [2020-10-09 15:34:14,315 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:14,506 INFO L129 PetriNetUnfolder]: 15/650 cut-off events. [2020-10-09 15:34:14,506 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:34:14,537 INFO L80 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 650 events. 15/650 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2842 event pairs, 0 based on Foata normal form. 1/615 useless extension candidates. Maximal degree in co-relation 824. Up to 23 conditions per place. [2020-10-09 15:34:14,540 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 5 selfloop transitions, 1 changer transitions 0/534 dead transitions. [2020-10-09 15:34:14,540 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 534 transitions, 1363 flow [2020-10-09 15:34:14,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:14,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2020-10-09 15:34:14,541 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9547190398254228 [2020-10-09 15:34:14,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2020-10-09 15:34:14,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2020-10-09 15:34:14,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:14,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2020-10-09 15:34:14,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:14,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:14,543 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:14,543 INFO L185 Difference]: Start difference. First operand has 632 places, 536 transitions, 1360 flow. Second operand 3 states and 1750 transitions. [2020-10-09 15:34:14,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 534 transitions, 1363 flow [2020-10-09 15:34:14,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 534 transitions, 1356 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:34:14,549 INFO L241 Difference]: Finished difference. Result has 632 places, 534 transitions, 1349 flow [2020-10-09 15:34:14,549 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1349, PETRI_PLACES=632, PETRI_TRANSITIONS=534} [2020-10-09 15:34:14,549 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 65 predicate places. [2020-10-09 15:34:14,549 INFO L481 AbstractCegarLoop]: Abstraction has has 632 places, 534 transitions, 1349 flow [2020-10-09 15:34:14,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:14,549 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:14,550 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:14,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 702 mathsat -unsat_core_generation=3 [2020-10-09 15:34:14,750 INFO L429 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:14,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:14,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1626612906, now seen corresponding path program 1 times [2020-10-09 15:34:14,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:14,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231925537] [2020-10-09 15:34:14,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 703 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 703 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:15,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:15,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:34:15,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:34:15,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231925537] [2020-10-09 15:34:15,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:15,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:15,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754165786] [2020-10-09 15:34:15,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:15,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:15,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:15,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:15,206 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:34:15,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 534 transitions, 1349 flow. Second operand 3 states. [2020-10-09 15:34:15,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:15,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:34:15,207 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:15,424 INFO L129 PetriNetUnfolder]: 15/648 cut-off events. [2020-10-09 15:34:15,424 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:34:15,455 INFO L80 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 648 events. 15/648 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2825 event pairs, 0 based on Foata normal form. 0/611 useless extension candidates. Maximal degree in co-relation 824. Up to 23 conditions per place. [2020-10-09 15:34:15,457 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 8 selfloop transitions, 1 changer transitions 0/532 dead transitions. [2020-10-09 15:34:15,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 532 transitions, 1362 flow [2020-10-09 15:34:15,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:15,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1738 transitions. [2020-10-09 15:34:15,459 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481723949809057 [2020-10-09 15:34:15,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1738 transitions. [2020-10-09 15:34:15,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1738 transitions. [2020-10-09 15:34:15,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:15,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1738 transitions. [2020-10-09 15:34:15,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:15,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:15,461 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:15,461 INFO L185 Difference]: Start difference. First operand has 632 places, 534 transitions, 1349 flow. Second operand 3 states and 1738 transitions. [2020-10-09 15:34:15,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 532 transitions, 1362 flow [2020-10-09 15:34:15,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 532 transitions, 1361 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:15,467 INFO L241 Difference]: Finished difference. Result has 631 places, 532 transitions, 1345 flow [2020-10-09 15:34:15,467 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1343, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1345, PETRI_PLACES=631, PETRI_TRANSITIONS=532} [2020-10-09 15:34:15,467 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 64 predicate places. [2020-10-09 15:34:15,467 INFO L481 AbstractCegarLoop]: Abstraction has has 631 places, 532 transitions, 1345 flow [2020-10-09 15:34:15,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:15,467 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:15,467 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:15,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 703 mathsat -unsat_core_generation=3 [2020-10-09 15:34:15,668 INFO L429 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:15,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:15,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1363420945, now seen corresponding path program 1 times [2020-10-09 15:34:15,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:15,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13669429] [2020-10-09 15:34:15,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 704 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 704 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:16,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:16,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:34:16,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:34:16,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13669429] [2020-10-09 15:34:16,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:16,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:16,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694966405] [2020-10-09 15:34:16,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:16,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:16,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:16,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:16,117 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 611 [2020-10-09 15:34:16,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 532 transitions, 1345 flow. Second operand 3 states. [2020-10-09 15:34:16,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:16,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 611 [2020-10-09 15:34:16,118 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:16,325 INFO L129 PetriNetUnfolder]: 13/653 cut-off events. [2020-10-09 15:34:16,325 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:34:16,359 INFO L80 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 653 events. 13/653 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2877 event pairs, 0 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 827. Up to 23 conditions per place. [2020-10-09 15:34:16,361 INFO L132 encePairwiseOnDemand]: 608/611 looper letters, 5 selfloop transitions, 2 changer transitions 0/533 dead transitions. [2020-10-09 15:34:16,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 533 transitions, 1361 flow [2020-10-09 15:34:16,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1751 transitions. [2020-10-09 15:34:16,363 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955264593562466 [2020-10-09 15:34:16,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1751 transitions. [2020-10-09 15:34:16,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1751 transitions. [2020-10-09 15:34:16,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:16,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1751 transitions. [2020-10-09 15:34:16,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:16,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:16,365 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:16,365 INFO L185 Difference]: Start difference. First operand has 631 places, 532 transitions, 1345 flow. Second operand 3 states and 1751 transitions. [2020-10-09 15:34:16,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 533 transitions, 1361 flow [2020-10-09 15:34:16,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 533 transitions, 1360 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:16,371 INFO L241 Difference]: Finished difference. Result has 634 places, 533 transitions, 1358 flow [2020-10-09 15:34:16,371 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1358, PETRI_PLACES=634, PETRI_TRANSITIONS=533} [2020-10-09 15:34:16,371 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 67 predicate places. [2020-10-09 15:34:16,371 INFO L481 AbstractCegarLoop]: Abstraction has has 634 places, 533 transitions, 1358 flow [2020-10-09 15:34:16,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:16,372 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:16,372 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:16,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 704 mathsat -unsat_core_generation=3 [2020-10-09 15:34:16,573 INFO L429 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:16,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:16,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1363419922, now seen corresponding path program 1 times [2020-10-09 15:34:16,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:16,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83856490] [2020-10-09 15:34:16,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 705 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 705 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:16,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:16,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:34:17,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:34:17,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83856490] [2020-10-09 15:34:17,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:17,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:17,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445740555] [2020-10-09 15:34:17,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:17,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:17,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:17,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:17,036 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:34:17,037 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 533 transitions, 1358 flow. Second operand 3 states. [2020-10-09 15:34:17,037 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:17,037 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:34:17,037 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:17,243 INFO L129 PetriNetUnfolder]: 13/654 cut-off events. [2020-10-09 15:34:17,243 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:34:17,278 INFO L80 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 654 events. 13/654 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2883 event pairs, 0 based on Foata normal form. 0/618 useless extension candidates. Maximal degree in co-relation 835. Up to 23 conditions per place. [2020-10-09 15:34:17,280 INFO L132 encePairwiseOnDemand]: 607/611 looper letters, 9 selfloop transitions, 3 changer transitions 0/534 dead transitions. [2020-10-09 15:34:17,280 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 534 transitions, 1384 flow [2020-10-09 15:34:17,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1741 transitions. [2020-10-09 15:34:17,328 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9498090561920349 [2020-10-09 15:34:17,328 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1741 transitions. [2020-10-09 15:34:17,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1741 transitions. [2020-10-09 15:34:17,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:17,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1741 transitions. [2020-10-09 15:34:17,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:17,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:17,330 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:17,330 INFO L185 Difference]: Start difference. First operand has 634 places, 533 transitions, 1358 flow. Second operand 3 states and 1741 transitions. [2020-10-09 15:34:17,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 534 transitions, 1384 flow [2020-10-09 15:34:17,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 534 transitions, 1382 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:17,335 INFO L241 Difference]: Finished difference. Result has 637 places, 534 transitions, 1374 flow [2020-10-09 15:34:17,336 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1374, PETRI_PLACES=637, PETRI_TRANSITIONS=534} [2020-10-09 15:34:17,336 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 70 predicate places. [2020-10-09 15:34:17,336 INFO L481 AbstractCegarLoop]: Abstraction has has 637 places, 534 transitions, 1374 flow [2020-10-09 15:34:17,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:17,336 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:17,336 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:17,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 705 mathsat -unsat_core_generation=3 [2020-10-09 15:34:17,537 INFO L429 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:17,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:17,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1364373234, now seen corresponding path program 1 times [2020-10-09 15:34:17,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:17,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083274113] [2020-10-09 15:34:17,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 706 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 706 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:17,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:34:17,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:34:17,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:34:17,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083274113] [2020-10-09 15:34:17,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:17,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:17,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731346068] [2020-10-09 15:34:17,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:17,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:17,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:17,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:17,996 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 582 out of 611 [2020-10-09 15:34:17,997 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 534 transitions, 1374 flow. Second operand 3 states. [2020-10-09 15:34:17,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:17,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 582 of 611 [2020-10-09 15:34:17,997 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:18,204 INFO L129 PetriNetUnfolder]: 12/650 cut-off events. [2020-10-09 15:34:18,205 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:34:18,240 INFO L80 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 650 events. 12/650 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2858 event pairs, 0 based on Foata normal form. 1/618 useless extension candidates. Maximal degree in co-relation 827. Up to 23 conditions per place. [2020-10-09 15:34:18,242 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 4 selfloop transitions, 1 changer transitions 0/531 dead transitions. [2020-10-09 15:34:18,242 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 531 transitions, 1369 flow [2020-10-09 15:34:18,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2020-10-09 15:34:18,243 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955810147299509 [2020-10-09 15:34:18,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2020-10-09 15:34:18,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2020-10-09 15:34:18,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:18,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2020-10-09 15:34:18,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:18,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:18,245 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:18,245 INFO L185 Difference]: Start difference. First operand has 637 places, 534 transitions, 1374 flow. Second operand 3 states and 1752 transitions. [2020-10-09 15:34:18,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 531 transitions, 1369 flow [2020-10-09 15:34:18,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 531 transitions, 1361 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:34:18,251 INFO L241 Difference]: Finished difference. Result has 636 places, 531 transitions, 1353 flow [2020-10-09 15:34:18,251 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1351, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1353, PETRI_PLACES=636, PETRI_TRANSITIONS=531} [2020-10-09 15:34:18,252 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 69 predicate places. [2020-10-09 15:34:18,252 INFO L481 AbstractCegarLoop]: Abstraction has has 636 places, 531 transitions, 1353 flow [2020-10-09 15:34:18,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:18,252 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:18,252 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:18,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 706 mathsat -unsat_core_generation=3 [2020-10-09 15:34:18,453 INFO L429 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:18,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:18,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1364374257, now seen corresponding path program 1 times [2020-10-09 15:34:18,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:18,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997030941] [2020-10-09 15:34:18,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 707 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 707 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:18,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:18,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:34:18,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:18,890 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:34:18,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997030941] [2020-10-09 15:34:18,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:18,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:18,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475294206] [2020-10-09 15:34:18,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:18,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:18,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:18,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:18,919 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 611 [2020-10-09 15:34:18,919 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 531 transitions, 1353 flow. Second operand 3 states. [2020-10-09 15:34:18,920 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:18,920 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 611 [2020-10-09 15:34:18,920 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:19,127 INFO L129 PetriNetUnfolder]: 12/648 cut-off events. [2020-10-09 15:34:19,128 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-09 15:34:19,160 INFO L80 FinitePrefix]: Finished finitePrefix Result has 891 conditions, 648 events. 12/648 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2845 event pairs, 0 based on Foata normal form. 0/614 useless extension candidates. Maximal degree in co-relation 831. Up to 23 conditions per place. [2020-10-09 15:34:19,162 INFO L132 encePairwiseOnDemand]: 609/611 looper letters, 8 selfloop transitions, 1 changer transitions 0/529 dead transitions. [2020-10-09 15:34:19,162 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 529 transitions, 1366 flow [2020-10-09 15:34:19,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:19,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1738 transitions. [2020-10-09 15:34:19,163 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9481723949809057 [2020-10-09 15:34:19,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1738 transitions. [2020-10-09 15:34:19,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1738 transitions. [2020-10-09 15:34:19,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:19,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1738 transitions. [2020-10-09 15:34:19,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:19,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:19,166 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:19,166 INFO L185 Difference]: Start difference. First operand has 636 places, 531 transitions, 1353 flow. Second operand 3 states and 1738 transitions. [2020-10-09 15:34:19,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 529 transitions, 1366 flow [2020-10-09 15:34:19,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 529 transitions, 1365 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:19,172 INFO L241 Difference]: Finished difference. Result has 635 places, 529 transitions, 1349 flow [2020-10-09 15:34:19,172 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=611, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1349, PETRI_PLACES=635, PETRI_TRANSITIONS=529} [2020-10-09 15:34:19,172 INFO L341 CegarLoopForPetriNet]: 567 programPoint places, 68 predicate places. [2020-10-09 15:34:19,172 INFO L481 AbstractCegarLoop]: Abstraction has has 635 places, 529 transitions, 1349 flow [2020-10-09 15:34:19,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:19,172 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:19,172 INFO L255 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:19,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 707 mathsat -unsat_core_generation=3 [2020-10-09 15:34:19,373 INFO L429 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:19,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:19,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1762417606, now seen corresponding path program 1 times [2020-10-09 15:34:19,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:19,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885861013] [2020-10-09 15:34:19,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 708 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 708 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:34:19,812 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:34:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:34:19,885 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:34:19,965 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:34:19,965 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:34:20,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 708 mathsat -unsat_core_generation=3 [2020-10-09 15:34:20,166 WARN L371 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:34:20,166 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2020-10-09 15:34:20,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,239 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,239 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,239 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,239 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,260 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,260 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,260 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,260 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,260 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,280 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,280 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,285 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,285 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,285 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,285 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,354 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,354 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,359 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,365 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,366 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,366 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,366 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,400 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,403 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,403 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,405 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,420 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,420 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,420 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,421 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,423 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,423 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,426 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,432 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,432 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,433 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,433 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,433 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,434 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,435 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,435 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,435 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,436 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,437 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,437 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,437 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,438 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,438 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:34:20,441 INFO L253 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2020-10-09 15:34:20,442 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:34:20,442 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:34:20,442 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:34:20,442 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:34:20,442 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:34:20,442 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:34:20,442 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:34:20,442 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:34:20,447 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 592 places, 638 transitions, 1897 flow [2020-10-09 15:34:20,725 INFO L129 PetriNetUnfolder]: 116/844 cut-off events. [2020-10-09 15:34:20,726 INFO L130 PetriNetUnfolder]: For 2277/2277 co-relation queries the response was YES. [2020-10-09 15:34:20,773 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1190 conditions, 844 events. 116/844 cut-off events. For 2277/2277 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3572 event pairs, 0 based on Foata normal form. 0/681 useless extension candidates. Maximal degree in co-relation 1122. Up to 48 conditions per place. [2020-10-09 15:34:20,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 592 places, 638 transitions, 1897 flow [2020-10-09 15:34:20,791 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 592 places, 638 transitions, 1897 flow [2020-10-09 15:34:20,799 INFO L129 PetriNetUnfolder]: 9/98 cut-off events. [2020-10-09 15:34:20,799 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:34:20,799 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:20,799 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:20,799 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:20,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:20,799 INFO L82 PathProgramCache]: Analyzing trace with hash -458185333, now seen corresponding path program 1 times [2020-10-09 15:34:20,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:20,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460818859] [2020-10-09 15:34:20,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 709 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 709 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:21,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:21,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:34:21,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:34:21,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460818859] [2020-10-09 15:34:21,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:21,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:21,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83220252] [2020-10-09 15:34:21,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:21,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:21,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:21,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:21,248 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:34:21,249 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 638 transitions, 1897 flow. Second operand 3 states. [2020-10-09 15:34:21,249 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:21,249 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:34:21,250 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:21,436 INFO L129 PetriNetUnfolder]: 67/682 cut-off events. [2020-10-09 15:34:21,437 INFO L130 PetriNetUnfolder]: For 2278/2278 co-relation queries the response was YES. [2020-10-09 15:34:21,477 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 682 events. 67/682 cut-off events. For 2278/2278 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2695 event pairs, 0 based on Foata normal form. 94/684 useless extension candidates. Maximal degree in co-relation 971. Up to 24 conditions per place. [2020-10-09 15:34:21,486 INFO L132 encePairwiseOnDemand]: 610/638 looper letters, 5 selfloop transitions, 2 changer transitions 0/610 dead transitions. [2020-10-09 15:34:21,486 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 610 transitions, 1855 flow [2020-10-09 15:34:21,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:21,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1879 transitions. [2020-10-09 15:34:21,488 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9817136886102403 [2020-10-09 15:34:21,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1879 transitions. [2020-10-09 15:34:21,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1879 transitions. [2020-10-09 15:34:21,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:21,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1879 transitions. [2020-10-09 15:34:21,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:21,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:21,490 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:21,490 INFO L185 Difference]: Start difference. First operand has 592 places, 638 transitions, 1897 flow. Second operand 3 states and 1879 transitions. [2020-10-09 15:34:21,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 610 transitions, 1855 flow [2020-10-09 15:34:21,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 610 transitions, 1349 flow, removed 253 selfloop flow, removed 0 redundant places. [2020-10-09 15:34:21,498 INFO L241 Difference]: Finished difference. Result has 591 places, 610 transitions, 1347 flow [2020-10-09 15:34:21,499 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1333, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1347, PETRI_PLACES=591, PETRI_TRANSITIONS=610} [2020-10-09 15:34:21,499 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, -1 predicate places. [2020-10-09 15:34:21,499 INFO L481 AbstractCegarLoop]: Abstraction has has 591 places, 610 transitions, 1347 flow [2020-10-09 15:34:21,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:21,499 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:21,499 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:21,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 709 mathsat -unsat_core_generation=3 [2020-10-09 15:34:21,700 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:21,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:21,700 INFO L82 PathProgramCache]: Analyzing trace with hash -458186356, now seen corresponding path program 1 times [2020-10-09 15:34:21,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:21,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588021529] [2020-10-09 15:34:21,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 710 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 710 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:22,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:22,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:34:22,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:34:22,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588021529] [2020-10-09 15:34:22,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:22,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:22,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392462349] [2020-10-09 15:34:22,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:22,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:22,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:22,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:22,158 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:22,159 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 610 transitions, 1347 flow. Second operand 3 states. [2020-10-09 15:34:22,159 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:22,159 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:22,159 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:22,355 INFO L129 PetriNetUnfolder]: 67/683 cut-off events. [2020-10-09 15:34:22,355 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:34:22,391 INFO L80 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 683 events. 67/683 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2704 event pairs, 0 based on Foata normal form. 0/592 useless extension candidates. Maximal degree in co-relation 752. Up to 24 conditions per place. [2020-10-09 15:34:22,400 INFO L132 encePairwiseOnDemand]: 634/638 looper letters, 9 selfloop transitions, 3 changer transitions 0/611 dead transitions. [2020-10-09 15:34:22,400 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 611 transitions, 1373 flow [2020-10-09 15:34:22,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:22,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1819 transitions. [2020-10-09 15:34:22,402 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503657262277951 [2020-10-09 15:34:22,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1819 transitions. [2020-10-09 15:34:22,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1819 transitions. [2020-10-09 15:34:22,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:22,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1819 transitions. [2020-10-09 15:34:22,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:22,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:22,404 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:22,404 INFO L185 Difference]: Start difference. First operand has 591 places, 610 transitions, 1347 flow. Second operand 3 states and 1819 transitions. [2020-10-09 15:34:22,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 611 transitions, 1373 flow [2020-10-09 15:34:22,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 611 transitions, 1371 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:22,410 INFO L241 Difference]: Finished difference. Result has 594 places, 611 transitions, 1363 flow [2020-10-09 15:34:22,410 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1363, PETRI_PLACES=594, PETRI_TRANSITIONS=611} [2020-10-09 15:34:22,410 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 2 predicate places. [2020-10-09 15:34:22,410 INFO L481 AbstractCegarLoop]: Abstraction has has 594 places, 611 transitions, 1363 flow [2020-10-09 15:34:22,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:22,410 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:22,410 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:22,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 710 mathsat -unsat_core_generation=3 [2020-10-09 15:34:22,611 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:22,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:22,611 INFO L82 PathProgramCache]: Analyzing trace with hash -457232021, now seen corresponding path program 1 times [2020-10-09 15:34:22,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:22,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835402000] [2020-10-09 15:34:22,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 711 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 711 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:23,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:23,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:34:23,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:34:23,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835402000] [2020-10-09 15:34:23,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:23,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:23,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628963672] [2020-10-09 15:34:23,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:23,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:23,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:23,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:23,100 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:23,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 611 transitions, 1363 flow. Second operand 3 states. [2020-10-09 15:34:23,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:23,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:23,102 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:23,287 INFO L129 PetriNetUnfolder]: 66/680 cut-off events. [2020-10-09 15:34:23,287 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2020-10-09 15:34:23,322 INFO L80 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 680 events. 66/680 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2683 event pairs, 0 based on Foata normal form. 2/593 useless extension candidates. Maximal degree in co-relation 754. Up to 24 conditions per place. [2020-10-09 15:34:23,332 INFO L132 encePairwiseOnDemand]: 635/638 looper letters, 9 selfloop transitions, 1 changer transitions 0/609 dead transitions. [2020-10-09 15:34:23,332 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 609 transitions, 1371 flow [2020-10-09 15:34:23,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2020-10-09 15:34:23,334 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9498432601880877 [2020-10-09 15:34:23,334 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1818 transitions. [2020-10-09 15:34:23,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1818 transitions. [2020-10-09 15:34:23,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:23,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1818 transitions. [2020-10-09 15:34:23,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:23,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:23,336 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:23,336 INFO L185 Difference]: Start difference. First operand has 594 places, 611 transitions, 1363 flow. Second operand 3 states and 1818 transitions. [2020-10-09 15:34:23,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 609 transitions, 1371 flow [2020-10-09 15:34:23,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 609 transitions, 1370 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:23,341 INFO L241 Difference]: Finished difference. Result has 595 places, 609 transitions, 1352 flow [2020-10-09 15:34:23,342 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1352, PETRI_PLACES=595, PETRI_TRANSITIONS=609} [2020-10-09 15:34:23,342 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 3 predicate places. [2020-10-09 15:34:23,342 INFO L481 AbstractCegarLoop]: Abstraction has has 595 places, 609 transitions, 1352 flow [2020-10-09 15:34:23,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:23,342 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:23,342 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:23,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 711 mathsat -unsat_core_generation=3 [2020-10-09 15:34:23,543 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:23,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:23,543 INFO L82 PathProgramCache]: Analyzing trace with hash -457233044, now seen corresponding path program 1 times [2020-10-09 15:34:23,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:23,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649398295] [2020-10-09 15:34:23,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 712 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 712 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:23,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:34:23,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:34:23,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:34:23,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649398295] [2020-10-09 15:34:23,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:23,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:23,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220894466] [2020-10-09 15:34:23,984 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:23,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:23,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:23,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:24,007 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:34:24,008 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 609 transitions, 1352 flow. Second operand 3 states. [2020-10-09 15:34:24,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:24,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:34:24,008 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:24,192 INFO L129 PetriNetUnfolder]: 66/677 cut-off events. [2020-10-09 15:34:24,192 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:34:24,227 INFO L80 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 677 events. 66/677 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2666 event pairs, 0 based on Foata normal form. 1/590 useless extension candidates. Maximal degree in co-relation 749. Up to 24 conditions per place. [2020-10-09 15:34:24,237 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/606 dead transitions. [2020-10-09 15:34:24,237 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 606 transitions, 1351 flow [2020-10-09 15:34:24,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:34:24,238 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:34:24,238 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:34:24,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:34:24,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:24,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:34:24,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:24,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:24,240 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:24,240 INFO L185 Difference]: Start difference. First operand has 595 places, 609 transitions, 1352 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:34:24,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 606 transitions, 1351 flow [2020-10-09 15:34:24,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 606 transitions, 1346 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:34:24,246 INFO L241 Difference]: Finished difference. Result has 592 places, 606 transitions, 1338 flow [2020-10-09 15:34:24,246 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1338, PETRI_PLACES=592, PETRI_TRANSITIONS=606} [2020-10-09 15:34:24,246 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 0 predicate places. [2020-10-09 15:34:24,246 INFO L481 AbstractCegarLoop]: Abstraction has has 592 places, 606 transitions, 1338 flow [2020-10-09 15:34:24,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:24,246 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:24,247 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:34:24,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 712 mathsat -unsat_core_generation=3 [2020-10-09 15:34:24,447 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:24,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:24,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1030652322, now seen corresponding path program 1 times [2020-10-09 15:34:24,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:24,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644370731] [2020-10-09 15:34:24,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 713 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 713 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:24,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:34:24,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:34:24,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:24,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:34:24,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644370731] [2020-10-09 15:34:24,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:24,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:24,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123064530] [2020-10-09 15:34:24,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:24,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:24,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:24,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:24,902 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:34:24,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 606 transitions, 1338 flow. Second operand 3 states. [2020-10-09 15:34:24,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:24,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:34:24,903 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:25,086 INFO L129 PetriNetUnfolder]: 65/684 cut-off events. [2020-10-09 15:34:25,086 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:34:25,120 INFO L80 FinitePrefix]: Finished finitePrefix Result has 792 conditions, 684 events. 65/684 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2724 event pairs, 0 based on Foata normal form. 1/596 useless extension candidates. Maximal degree in co-relation 757. Up to 24 conditions per place. [2020-10-09 15:34:25,129 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/606 dead transitions. [2020-10-09 15:34:25,129 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 606 transitions, 1348 flow [2020-10-09 15:34:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:34:25,130 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:34:25,130 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:34:25,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:34:25,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:25,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:34:25,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:25,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:25,133 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:25,133 INFO L185 Difference]: Start difference. First operand has 592 places, 606 transitions, 1338 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:34:25,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 606 transitions, 1348 flow [2020-10-09 15:34:25,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 593 places, 606 transitions, 1347 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:25,190 INFO L241 Difference]: Finished difference. Result has 594 places, 606 transitions, 1342 flow [2020-10-09 15:34:25,191 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1337, PETRI_DIFFERENCE_MINUEND_PLACES=591, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1342, PETRI_PLACES=594, PETRI_TRANSITIONS=606} [2020-10-09 15:34:25,191 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 2 predicate places. [2020-10-09 15:34:25,191 INFO L481 AbstractCegarLoop]: Abstraction has has 594 places, 606 transitions, 1342 flow [2020-10-09 15:34:25,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:25,191 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:25,191 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:34:25,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 713 mathsat -unsat_core_generation=3 [2020-10-09 15:34:25,392 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:25,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:25,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1030651299, now seen corresponding path program 1 times [2020-10-09 15:34:25,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:25,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119347820] [2020-10-09 15:34:25,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 714 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 714 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:25,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:25,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:34:25,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:25,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:34:25,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119347820] [2020-10-09 15:34:25,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:25,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:25,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088714291] [2020-10-09 15:34:25,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:25,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:25,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:25,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:25,855 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:25,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 606 transitions, 1342 flow. Second operand 3 states. [2020-10-09 15:34:25,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:25,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:25,857 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:26,050 INFO L129 PetriNetUnfolder]: 63/686 cut-off events. [2020-10-09 15:34:26,050 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:34:26,085 INFO L80 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 686 events. 63/686 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2761 event pairs, 0 based on Foata normal form. 0/598 useless extension candidates. Maximal degree in co-relation 768. Up to 24 conditions per place. [2020-10-09 15:34:26,094 INFO L132 encePairwiseOnDemand]: 634/638 looper letters, 9 selfloop transitions, 3 changer transitions 0/607 dead transitions. [2020-10-09 15:34:26,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 607 transitions, 1368 flow [2020-10-09 15:34:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1819 transitions. [2020-10-09 15:34:26,095 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503657262277951 [2020-10-09 15:34:26,095 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1819 transitions. [2020-10-09 15:34:26,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1819 transitions. [2020-10-09 15:34:26,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:26,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1819 transitions. [2020-10-09 15:34:26,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:26,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:26,097 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:26,097 INFO L185 Difference]: Start difference. First operand has 594 places, 606 transitions, 1342 flow. Second operand 3 states and 1819 transitions. [2020-10-09 15:34:26,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 607 transitions, 1368 flow [2020-10-09 15:34:26,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 607 transitions, 1367 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:26,103 INFO L241 Difference]: Finished difference. Result has 597 places, 607 transitions, 1359 flow [2020-10-09 15:34:26,103 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1341, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1359, PETRI_PLACES=597, PETRI_TRANSITIONS=607} [2020-10-09 15:34:26,103 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 5 predicate places. [2020-10-09 15:34:26,104 INFO L481 AbstractCegarLoop]: Abstraction has has 597 places, 607 transitions, 1359 flow [2020-10-09 15:34:26,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:26,104 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:26,104 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:34:26,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 714 mathsat -unsat_core_generation=3 [2020-10-09 15:34:26,304 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:26,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:26,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1031604611, now seen corresponding path program 1 times [2020-10-09 15:34:26,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:26,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212071243] [2020-10-09 15:34:26,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 715 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 715 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:26,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:26,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:34:26,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:26,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:34:26,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212071243] [2020-10-09 15:34:26,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:26,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:26,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130598447] [2020-10-09 15:34:26,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:26,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:26,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:26,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:26,740 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:34:26,740 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 607 transitions, 1359 flow. Second operand 3 states. [2020-10-09 15:34:26,740 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:26,741 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:34:26,741 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:26,931 INFO L129 PetriNetUnfolder]: 63/679 cut-off events. [2020-10-09 15:34:26,931 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:34:26,967 INFO L80 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 679 events. 63/679 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2693 event pairs, 0 based on Foata normal form. 1/595 useless extension candidates. Maximal degree in co-relation 753. Up to 24 conditions per place. [2020-10-09 15:34:26,975 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 5 selfloop transitions, 1 changer transitions 0/605 dead transitions. [2020-10-09 15:34:26,975 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 605 transitions, 1361 flow [2020-10-09 15:34:26,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2020-10-09 15:34:26,977 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955067920585162 [2020-10-09 15:34:26,977 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2020-10-09 15:34:26,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2020-10-09 15:34:26,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:26,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2020-10-09 15:34:26,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:26,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:26,979 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:26,979 INFO L185 Difference]: Start difference. First operand has 597 places, 607 transitions, 1359 flow. Second operand 3 states and 1828 transitions. [2020-10-09 15:34:26,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 605 transitions, 1361 flow [2020-10-09 15:34:26,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 605 transitions, 1353 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:34:26,984 INFO L241 Difference]: Finished difference. Result has 597 places, 605 transitions, 1346 flow [2020-10-09 15:34:26,985 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1341, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1346, PETRI_PLACES=597, PETRI_TRANSITIONS=605} [2020-10-09 15:34:26,985 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 5 predicate places. [2020-10-09 15:34:26,985 INFO L481 AbstractCegarLoop]: Abstraction has has 597 places, 605 transitions, 1346 flow [2020-10-09 15:34:26,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:26,985 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:26,985 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:34:27,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 715 mathsat -unsat_core_generation=3 [2020-10-09 15:34:27,186 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:27,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:27,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1031605634, now seen corresponding path program 1 times [2020-10-09 15:34:27,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:27,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064473318] [2020-10-09 15:34:27,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 716 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 716 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:27,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:27,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:34:27,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:34:27,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064473318] [2020-10-09 15:34:27,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:27,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:27,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729632767] [2020-10-09 15:34:27,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:27,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:27,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:27,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:27,647 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:27,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 605 transitions, 1346 flow. Second operand 3 states. [2020-10-09 15:34:27,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:27,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:27,647 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:27,827 INFO L129 PetriNetUnfolder]: 63/677 cut-off events. [2020-10-09 15:34:27,827 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:34:27,861 INFO L80 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 677 events. 63/677 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2679 event pairs, 0 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 758. Up to 24 conditions per place. [2020-10-09 15:34:27,869 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 8 selfloop transitions, 1 changer transitions 0/603 dead transitions. [2020-10-09 15:34:27,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 603 transitions, 1359 flow [2020-10-09 15:34:27,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1816 transitions. [2020-10-09 15:34:27,871 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9487983281086729 [2020-10-09 15:34:27,871 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1816 transitions. [2020-10-09 15:34:27,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1816 transitions. [2020-10-09 15:34:27,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:27,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1816 transitions. [2020-10-09 15:34:27,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:27,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:27,873 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:27,873 INFO L185 Difference]: Start difference. First operand has 597 places, 605 transitions, 1346 flow. Second operand 3 states and 1816 transitions. [2020-10-09 15:34:27,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 603 transitions, 1359 flow [2020-10-09 15:34:27,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 603 transitions, 1358 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:27,879 INFO L241 Difference]: Finished difference. Result has 596 places, 603 transitions, 1342 flow [2020-10-09 15:34:27,879 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1342, PETRI_PLACES=596, PETRI_TRANSITIONS=603} [2020-10-09 15:34:27,879 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 4 predicate places. [2020-10-09 15:34:27,879 INFO L481 AbstractCegarLoop]: Abstraction has has 596 places, 603 transitions, 1342 flow [2020-10-09 15:34:27,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:27,879 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:27,879 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:34:28,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 716 mathsat -unsat_core_generation=3 [2020-10-09 15:34:28,080 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:28,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:28,080 INFO L82 PathProgramCache]: Analyzing trace with hash 747304048, now seen corresponding path program 1 times [2020-10-09 15:34:28,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:28,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443740955] [2020-10-09 15:34:28,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 717 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 717 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:28,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:28,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:34:28,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:28,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:34:28,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443740955] [2020-10-09 15:34:28,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:28,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:28,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791873205] [2020-10-09 15:34:28,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:28,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:28,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:28,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:28,550 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:34:28,551 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 603 transitions, 1342 flow. Second operand 3 states. [2020-10-09 15:34:28,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:28,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:34:28,551 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:28,733 INFO L129 PetriNetUnfolder]: 61/682 cut-off events. [2020-10-09 15:34:28,733 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:34:28,767 INFO L80 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 682 events. 61/682 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2734 event pairs, 0 based on Foata normal form. 0/597 useless extension candidates. Maximal degree in co-relation 761. Up to 24 conditions per place. [2020-10-09 15:34:28,776 INFO L132 encePairwiseOnDemand]: 635/638 looper letters, 5 selfloop transitions, 2 changer transitions 0/604 dead transitions. [2020-10-09 15:34:28,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 604 transitions, 1358 flow [2020-10-09 15:34:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1829 transitions. [2020-10-09 15:34:28,777 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9555903866248694 [2020-10-09 15:34:28,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1829 transitions. [2020-10-09 15:34:28,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1829 transitions. [2020-10-09 15:34:28,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:28,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1829 transitions. [2020-10-09 15:34:28,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:28,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:28,779 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:28,779 INFO L185 Difference]: Start difference. First operand has 596 places, 603 transitions, 1342 flow. Second operand 3 states and 1829 transitions. [2020-10-09 15:34:28,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 604 transitions, 1358 flow [2020-10-09 15:34:28,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 604 transitions, 1357 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:28,785 INFO L241 Difference]: Finished difference. Result has 599 places, 604 transitions, 1355 flow [2020-10-09 15:34:28,785 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1341, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1355, PETRI_PLACES=599, PETRI_TRANSITIONS=604} [2020-10-09 15:34:28,785 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 7 predicate places. [2020-10-09 15:34:28,785 INFO L481 AbstractCegarLoop]: Abstraction has has 599 places, 604 transitions, 1355 flow [2020-10-09 15:34:28,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:28,785 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:28,785 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:34:28,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 717 mathsat -unsat_core_generation=3 [2020-10-09 15:34:28,986 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:28,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:28,987 INFO L82 PathProgramCache]: Analyzing trace with hash 747303025, now seen corresponding path program 1 times [2020-10-09 15:34:28,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:28,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864360894] [2020-10-09 15:34:28,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 718 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 718 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:29,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:29,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:34:29,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:29,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:34:29,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864360894] [2020-10-09 15:34:29,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:29,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:29,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657929661] [2020-10-09 15:34:29,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:29,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:29,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:29,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:29,443 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:29,444 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 604 transitions, 1355 flow. Second operand 3 states. [2020-10-09 15:34:29,444 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:29,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:29,444 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:29,627 INFO L129 PetriNetUnfolder]: 61/683 cut-off events. [2020-10-09 15:34:29,627 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:34:29,659 INFO L80 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 683 events. 61/683 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2741 event pairs, 0 based on Foata normal form. 0/598 useless extension candidates. Maximal degree in co-relation 769. Up to 24 conditions per place. [2020-10-09 15:34:29,668 INFO L132 encePairwiseOnDemand]: 634/638 looper letters, 9 selfloop transitions, 3 changer transitions 0/605 dead transitions. [2020-10-09 15:34:29,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 605 transitions, 1381 flow [2020-10-09 15:34:29,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:29,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1819 transitions. [2020-10-09 15:34:29,669 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503657262277951 [2020-10-09 15:34:29,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1819 transitions. [2020-10-09 15:34:29,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1819 transitions. [2020-10-09 15:34:29,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:29,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1819 transitions. [2020-10-09 15:34:29,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:29,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:29,671 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:29,671 INFO L185 Difference]: Start difference. First operand has 599 places, 604 transitions, 1355 flow. Second operand 3 states and 1819 transitions. [2020-10-09 15:34:29,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 605 transitions, 1381 flow [2020-10-09 15:34:29,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 605 transitions, 1379 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:29,676 INFO L241 Difference]: Finished difference. Result has 602 places, 605 transitions, 1371 flow [2020-10-09 15:34:29,677 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1353, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1371, PETRI_PLACES=602, PETRI_TRANSITIONS=605} [2020-10-09 15:34:29,677 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 10 predicate places. [2020-10-09 15:34:29,677 INFO L481 AbstractCegarLoop]: Abstraction has has 602 places, 605 transitions, 1371 flow [2020-10-09 15:34:29,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:29,677 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:29,677 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:34:29,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 718 mathsat -unsat_core_generation=3 [2020-10-09 15:34:29,878 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:29,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:29,878 INFO L82 PathProgramCache]: Analyzing trace with hash 748256337, now seen corresponding path program 1 times [2020-10-09 15:34:29,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:29,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709611172] [2020-10-09 15:34:29,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 719 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 719 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:30,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:34:30,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:34:30,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:30,324 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:34:30,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709611172] [2020-10-09 15:34:30,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:30,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:30,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528199526] [2020-10-09 15:34:30,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:30,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:30,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:30,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:30,340 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:34:30,341 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 605 transitions, 1371 flow. Second operand 3 states. [2020-10-09 15:34:30,341 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:30,342 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:34:30,342 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:30,576 INFO L129 PetriNetUnfolder]: 60/679 cut-off events. [2020-10-09 15:34:30,576 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:34:30,610 INFO L80 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 679 events. 60/679 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2714 event pairs, 0 based on Foata normal form. 1/598 useless extension candidates. Maximal degree in co-relation 761. Up to 24 conditions per place. [2020-10-09 15:34:30,618 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/602 dead transitions. [2020-10-09 15:34:30,618 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 602 transitions, 1366 flow [2020-10-09 15:34:30,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:34:30,620 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:34:30,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:34:30,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:34:30,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:30,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:34:30,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:30,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:30,621 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:30,621 INFO L185 Difference]: Start difference. First operand has 602 places, 605 transitions, 1371 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:34:30,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 602 transitions, 1366 flow [2020-10-09 15:34:30,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 602 transitions, 1358 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:34:30,627 INFO L241 Difference]: Finished difference. Result has 601 places, 602 transitions, 1350 flow [2020-10-09 15:34:30,627 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1350, PETRI_PLACES=601, PETRI_TRANSITIONS=602} [2020-10-09 15:34:30,627 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 9 predicate places. [2020-10-09 15:34:30,627 INFO L481 AbstractCegarLoop]: Abstraction has has 601 places, 602 transitions, 1350 flow [2020-10-09 15:34:30,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:30,628 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:30,628 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:34:30,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 719 mathsat -unsat_core_generation=3 [2020-10-09 15:34:30,828 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:30,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:30,829 INFO L82 PathProgramCache]: Analyzing trace with hash 748257360, now seen corresponding path program 1 times [2020-10-09 15:34:30,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:30,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71773237] [2020-10-09 15:34:30,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 720 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 720 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:31,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:31,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:34:31,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:31,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:34:31,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71773237] [2020-10-09 15:34:31,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:31,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:31,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721109340] [2020-10-09 15:34:31,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:31,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:31,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:31,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:31,303 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:31,305 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 602 transitions, 1350 flow. Second operand 3 states. [2020-10-09 15:34:31,305 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:31,305 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:31,305 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:31,496 INFO L129 PetriNetUnfolder]: 60/677 cut-off events. [2020-10-09 15:34:31,496 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:34:31,530 INFO L80 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 677 events. 60/677 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2701 event pairs, 0 based on Foata normal form. 0/594 useless extension candidates. Maximal degree in co-relation 765. Up to 24 conditions per place. [2020-10-09 15:34:31,538 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 8 selfloop transitions, 1 changer transitions 0/600 dead transitions. [2020-10-09 15:34:31,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 600 transitions, 1363 flow [2020-10-09 15:34:31,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1816 transitions. [2020-10-09 15:34:31,539 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9487983281086729 [2020-10-09 15:34:31,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1816 transitions. [2020-10-09 15:34:31,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1816 transitions. [2020-10-09 15:34:31,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:31,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1816 transitions. [2020-10-09 15:34:31,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:31,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:31,541 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:31,541 INFO L185 Difference]: Start difference. First operand has 601 places, 602 transitions, 1350 flow. Second operand 3 states and 1816 transitions. [2020-10-09 15:34:31,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 600 transitions, 1363 flow [2020-10-09 15:34:31,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 600 transitions, 1362 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:31,547 INFO L241 Difference]: Finished difference. Result has 600 places, 600 transitions, 1346 flow [2020-10-09 15:34:31,547 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1346, PETRI_PLACES=600, PETRI_TRANSITIONS=600} [2020-10-09 15:34:31,547 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 8 predicate places. [2020-10-09 15:34:31,547 INFO L481 AbstractCegarLoop]: Abstraction has has 600 places, 600 transitions, 1346 flow [2020-10-09 15:34:31,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:31,547 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:31,547 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:34:31,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 720 mathsat -unsat_core_generation=3 [2020-10-09 15:34:31,748 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:31,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:31,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1378683195, now seen corresponding path program 1 times [2020-10-09 15:34:31,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:31,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915414478] [2020-10-09 15:34:31,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 721 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 721 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:32,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:34:32,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:34:32,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:32,195 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:34:32,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915414478] [2020-10-09 15:34:32,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:32,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:32,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113059827] [2020-10-09 15:34:32,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:32,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:32,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:32,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:32,206 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:34:32,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 600 transitions, 1346 flow. Second operand 3 states. [2020-10-09 15:34:32,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:32,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:34:32,207 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:32,404 INFO L129 PetriNetUnfolder]: 59/684 cut-off events. [2020-10-09 15:34:32,404 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:34:32,439 INFO L80 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 684 events. 59/684 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2759 event pairs, 0 based on Foata normal form. 1/603 useless extension candidates. Maximal degree in co-relation 768. Up to 24 conditions per place. [2020-10-09 15:34:32,448 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/600 dead transitions. [2020-10-09 15:34:32,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 600 transitions, 1356 flow [2020-10-09 15:34:32,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:32,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:34:32,449 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:34:32,449 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:34:32,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:34:32,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:32,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:34:32,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:32,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:32,451 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:32,451 INFO L185 Difference]: Start difference. First operand has 600 places, 600 transitions, 1346 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:34:32,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 600 transitions, 1356 flow [2020-10-09 15:34:32,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 600 transitions, 1355 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:32,457 INFO L241 Difference]: Finished difference. Result has 602 places, 600 transitions, 1350 flow [2020-10-09 15:34:32,457 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1350, PETRI_PLACES=602, PETRI_TRANSITIONS=600} [2020-10-09 15:34:32,458 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 10 predicate places. [2020-10-09 15:34:32,458 INFO L481 AbstractCegarLoop]: Abstraction has has 602 places, 600 transitions, 1350 flow [2020-10-09 15:34:32,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:32,458 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:32,458 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:34:32,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 721 mathsat -unsat_core_generation=3 [2020-10-09 15:34:32,659 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:32,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:32,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1378682172, now seen corresponding path program 1 times [2020-10-09 15:34:32,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:32,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081761602] [2020-10-09 15:34:32,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 722 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 722 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:33,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:33,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:33,095 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:34:33,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:34:33,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081761602] [2020-10-09 15:34:33,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:33,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:33,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812092350] [2020-10-09 15:34:33,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:33,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:33,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:33,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:33,117 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:33,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 600 transitions, 1350 flow. Second operand 3 states. [2020-10-09 15:34:33,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:33,119 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:33,119 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:33,312 INFO L129 PetriNetUnfolder]: 57/686 cut-off events. [2020-10-09 15:34:33,312 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:34:33,347 INFO L80 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 686 events. 57/686 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2793 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 781. Up to 24 conditions per place. [2020-10-09 15:34:33,354 INFO L132 encePairwiseOnDemand]: 634/638 looper letters, 9 selfloop transitions, 3 changer transitions 0/601 dead transitions. [2020-10-09 15:34:33,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 601 transitions, 1376 flow [2020-10-09 15:34:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1819 transitions. [2020-10-09 15:34:33,356 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503657262277951 [2020-10-09 15:34:33,356 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1819 transitions. [2020-10-09 15:34:33,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1819 transitions. [2020-10-09 15:34:33,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:33,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1819 transitions. [2020-10-09 15:34:33,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:33,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:33,358 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:33,358 INFO L185 Difference]: Start difference. First operand has 602 places, 600 transitions, 1350 flow. Second operand 3 states and 1819 transitions. [2020-10-09 15:34:33,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 601 transitions, 1376 flow [2020-10-09 15:34:33,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 601 transitions, 1375 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:33,363 INFO L241 Difference]: Finished difference. Result has 605 places, 601 transitions, 1367 flow [2020-10-09 15:34:33,364 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1349, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1367, PETRI_PLACES=605, PETRI_TRANSITIONS=601} [2020-10-09 15:34:33,364 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 13 predicate places. [2020-10-09 15:34:33,364 INFO L481 AbstractCegarLoop]: Abstraction has has 605 places, 601 transitions, 1367 flow [2020-10-09 15:34:33,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:33,364 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:33,364 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:34:33,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 722 mathsat -unsat_core_generation=3 [2020-10-09 15:34:33,565 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:33,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:33,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1379635484, now seen corresponding path program 1 times [2020-10-09 15:34:33,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:33,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785965300] [2020-10-09 15:34:33,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 723 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 723 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:34,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:34,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:34:34,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:34:34,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785965300] [2020-10-09 15:34:34,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:34,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:34,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512300096] [2020-10-09 15:34:34,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:34,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:34,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:34,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:34,036 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:34:34,037 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 601 transitions, 1367 flow. Second operand 3 states. [2020-10-09 15:34:34,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:34,038 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:34:34,038 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:34,226 INFO L129 PetriNetUnfolder]: 57/679 cut-off events. [2020-10-09 15:34:34,226 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:34:34,260 INFO L80 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 679 events. 57/679 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2731 event pairs, 0 based on Foata normal form. 1/601 useless extension candidates. Maximal degree in co-relation 767. Up to 24 conditions per place. [2020-10-09 15:34:34,267 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 5 selfloop transitions, 1 changer transitions 0/599 dead transitions. [2020-10-09 15:34:34,268 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 599 transitions, 1369 flow [2020-10-09 15:34:34,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2020-10-09 15:34:34,269 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955067920585162 [2020-10-09 15:34:34,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2020-10-09 15:34:34,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2020-10-09 15:34:34,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:34,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2020-10-09 15:34:34,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:34,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:34,271 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:34,271 INFO L185 Difference]: Start difference. First operand has 605 places, 601 transitions, 1367 flow. Second operand 3 states and 1828 transitions. [2020-10-09 15:34:34,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 599 transitions, 1369 flow [2020-10-09 15:34:34,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 599 transitions, 1361 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:34:34,276 INFO L241 Difference]: Finished difference. Result has 605 places, 599 transitions, 1354 flow [2020-10-09 15:34:34,277 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1349, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1354, PETRI_PLACES=605, PETRI_TRANSITIONS=599} [2020-10-09 15:34:34,277 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 13 predicate places. [2020-10-09 15:34:34,277 INFO L481 AbstractCegarLoop]: Abstraction has has 605 places, 599 transitions, 1354 flow [2020-10-09 15:34:34,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:34,277 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:34,277 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:34:34,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 723 mathsat -unsat_core_generation=3 [2020-10-09 15:34:34,478 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:34,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:34,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1379636507, now seen corresponding path program 1 times [2020-10-09 15:34:34,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:34,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828016578] [2020-10-09 15:34:34,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 724 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 724 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:34,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:34,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:34:34,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:34:34,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828016578] [2020-10-09 15:34:34,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:34,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:34,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725668698] [2020-10-09 15:34:34,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:34,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:34,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:34,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:34,950 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:34,951 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 599 transitions, 1354 flow. Second operand 3 states. [2020-10-09 15:34:34,952 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:34,952 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:34,952 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:35,140 INFO L129 PetriNetUnfolder]: 57/677 cut-off events. [2020-10-09 15:34:35,141 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:34:35,175 INFO L80 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 677 events. 57/677 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2714 event pairs, 0 based on Foata normal form. 0/597 useless extension candidates. Maximal degree in co-relation 771. Up to 24 conditions per place. [2020-10-09 15:34:35,182 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 8 selfloop transitions, 1 changer transitions 0/597 dead transitions. [2020-10-09 15:34:35,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 597 transitions, 1367 flow [2020-10-09 15:34:35,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1816 transitions. [2020-10-09 15:34:35,184 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9487983281086729 [2020-10-09 15:34:35,184 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1816 transitions. [2020-10-09 15:34:35,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1816 transitions. [2020-10-09 15:34:35,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:35,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1816 transitions. [2020-10-09 15:34:35,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:35,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:35,186 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:35,186 INFO L185 Difference]: Start difference. First operand has 605 places, 599 transitions, 1354 flow. Second operand 3 states and 1816 transitions. [2020-10-09 15:34:35,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 597 transitions, 1367 flow [2020-10-09 15:34:35,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 597 transitions, 1366 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:35,191 INFO L241 Difference]: Finished difference. Result has 604 places, 597 transitions, 1350 flow [2020-10-09 15:34:35,191 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1350, PETRI_PLACES=604, PETRI_TRANSITIONS=597} [2020-10-09 15:34:35,191 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 12 predicate places. [2020-10-09 15:34:35,192 INFO L481 AbstractCegarLoop]: Abstraction has has 604 places, 597 transitions, 1350 flow [2020-10-09 15:34:35,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:35,192 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:35,192 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:35,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 724 mathsat -unsat_core_generation=3 [2020-10-09 15:34:35,393 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:35,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:35,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1095952729, now seen corresponding path program 1 times [2020-10-09 15:34:35,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:35,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256920662] [2020-10-09 15:34:35,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 725 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 725 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:35,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:35,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:34:35,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:35,835 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:34:35,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256920662] [2020-10-09 15:34:35,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:35,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:35,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005925649] [2020-10-09 15:34:35,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:35,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:35,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:35,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:35,854 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:34:35,854 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 597 transitions, 1350 flow. Second operand 3 states. [2020-10-09 15:34:35,855 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:35,855 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:34:35,855 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:36,055 INFO L129 PetriNetUnfolder]: 55/682 cut-off events. [2020-10-09 15:34:36,055 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:34:36,092 INFO L80 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 682 events. 55/682 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2768 event pairs, 0 based on Foata normal form. 0/603 useless extension candidates. Maximal degree in co-relation 774. Up to 24 conditions per place. [2020-10-09 15:34:36,100 INFO L132 encePairwiseOnDemand]: 635/638 looper letters, 5 selfloop transitions, 2 changer transitions 0/598 dead transitions. [2020-10-09 15:34:36,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 598 transitions, 1366 flow [2020-10-09 15:34:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1829 transitions. [2020-10-09 15:34:36,101 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9555903866248694 [2020-10-09 15:34:36,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1829 transitions. [2020-10-09 15:34:36,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1829 transitions. [2020-10-09 15:34:36,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:36,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1829 transitions. [2020-10-09 15:34:36,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:36,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:36,103 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:36,103 INFO L185 Difference]: Start difference. First operand has 604 places, 597 transitions, 1350 flow. Second operand 3 states and 1829 transitions. [2020-10-09 15:34:36,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 598 transitions, 1366 flow [2020-10-09 15:34:36,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 598 transitions, 1365 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:36,109 INFO L241 Difference]: Finished difference. Result has 607 places, 598 transitions, 1363 flow [2020-10-09 15:34:36,109 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1349, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1363, PETRI_PLACES=607, PETRI_TRANSITIONS=598} [2020-10-09 15:34:36,109 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 15 predicate places. [2020-10-09 15:34:36,109 INFO L481 AbstractCegarLoop]: Abstraction has has 607 places, 598 transitions, 1363 flow [2020-10-09 15:34:36,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:36,109 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:36,110 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:36,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 725 mathsat -unsat_core_generation=3 [2020-10-09 15:34:36,310 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:36,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:36,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1095951706, now seen corresponding path program 1 times [2020-10-09 15:34:36,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:36,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780704234] [2020-10-09 15:34:36,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 726 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 726 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:36,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:36,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:36,750 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:34:36,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:34:36,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780704234] [2020-10-09 15:34:36,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:36,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:36,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665234792] [2020-10-09 15:34:36,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:36,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:36,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:36,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:36,778 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:36,779 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 598 transitions, 1363 flow. Second operand 3 states. [2020-10-09 15:34:36,779 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:36,779 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:36,779 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:37,029 INFO L129 PetriNetUnfolder]: 55/683 cut-off events. [2020-10-09 15:34:37,029 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:34:37,048 INFO L80 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 683 events. 55/683 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2776 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 782. Up to 24 conditions per place. [2020-10-09 15:34:37,054 INFO L132 encePairwiseOnDemand]: 634/638 looper letters, 9 selfloop transitions, 3 changer transitions 0/599 dead transitions. [2020-10-09 15:34:37,054 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 599 transitions, 1389 flow [2020-10-09 15:34:37,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1819 transitions. [2020-10-09 15:34:37,055 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503657262277951 [2020-10-09 15:34:37,055 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1819 transitions. [2020-10-09 15:34:37,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1819 transitions. [2020-10-09 15:34:37,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:37,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1819 transitions. [2020-10-09 15:34:37,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:37,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:37,057 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:37,057 INFO L185 Difference]: Start difference. First operand has 607 places, 598 transitions, 1363 flow. Second operand 3 states and 1819 transitions. [2020-10-09 15:34:37,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 599 transitions, 1389 flow [2020-10-09 15:34:37,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 599 transitions, 1387 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:37,063 INFO L241 Difference]: Finished difference. Result has 610 places, 599 transitions, 1379 flow [2020-10-09 15:34:37,063 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1379, PETRI_PLACES=610, PETRI_TRANSITIONS=599} [2020-10-09 15:34:37,063 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 18 predicate places. [2020-10-09 15:34:37,063 INFO L481 AbstractCegarLoop]: Abstraction has has 610 places, 599 transitions, 1379 flow [2020-10-09 15:34:37,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:37,063 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:37,063 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:37,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 726 mathsat -unsat_core_generation=3 [2020-10-09 15:34:37,264 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:37,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:37,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1096905018, now seen corresponding path program 1 times [2020-10-09 15:34:37,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:37,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653538953] [2020-10-09 15:34:37,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 727 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 727 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:37,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:34:37,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:34:37,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:37,706 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:34:37,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653538953] [2020-10-09 15:34:37,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:37,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:37,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235579865] [2020-10-09 15:34:37,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:37,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:37,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:37,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:37,719 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:34:37,720 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 599 transitions, 1379 flow. Second operand 3 states. [2020-10-09 15:34:37,720 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:37,720 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:34:37,720 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:37,911 INFO L129 PetriNetUnfolder]: 54/679 cut-off events. [2020-10-09 15:34:37,911 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:34:37,945 INFO L80 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 679 events. 54/679 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2749 event pairs, 0 based on Foata normal form. 1/604 useless extension candidates. Maximal degree in co-relation 774. Up to 24 conditions per place. [2020-10-09 15:34:37,953 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/596 dead transitions. [2020-10-09 15:34:37,953 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 596 transitions, 1374 flow [2020-10-09 15:34:37,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:37,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:34:37,954 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:34:37,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:34:37,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:34:37,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:37,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:34:37,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:37,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:37,956 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:37,956 INFO L185 Difference]: Start difference. First operand has 610 places, 599 transitions, 1379 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:34:37,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 596 transitions, 1374 flow [2020-10-09 15:34:37,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 596 transitions, 1366 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:34:37,962 INFO L241 Difference]: Finished difference. Result has 609 places, 596 transitions, 1358 flow [2020-10-09 15:34:37,962 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1358, PETRI_PLACES=609, PETRI_TRANSITIONS=596} [2020-10-09 15:34:37,962 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 17 predicate places. [2020-10-09 15:34:37,962 INFO L481 AbstractCegarLoop]: Abstraction has has 609 places, 596 transitions, 1358 flow [2020-10-09 15:34:37,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:37,962 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:37,962 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:38,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 727 mathsat -unsat_core_generation=3 [2020-10-09 15:34:38,163 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:38,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:38,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1096906041, now seen corresponding path program 1 times [2020-10-09 15:34:38,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:38,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363753653] [2020-10-09 15:34:38,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 728 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 728 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:38,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:38,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:34:38,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:34:38,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363753653] [2020-10-09 15:34:38,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:38,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:38,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829878643] [2020-10-09 15:34:38,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:38,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:38,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:38,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:38,639 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:38,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 596 transitions, 1358 flow. Second operand 3 states. [2020-10-09 15:34:38,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:38,641 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:38,641 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:38,830 INFO L129 PetriNetUnfolder]: 54/677 cut-off events. [2020-10-09 15:34:38,830 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:34:38,864 INFO L80 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 677 events. 54/677 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2736 event pairs, 0 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 778. Up to 24 conditions per place. [2020-10-09 15:34:38,871 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 8 selfloop transitions, 1 changer transitions 0/594 dead transitions. [2020-10-09 15:34:38,871 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 594 transitions, 1371 flow [2020-10-09 15:34:38,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:38,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1816 transitions. [2020-10-09 15:34:38,873 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9487983281086729 [2020-10-09 15:34:38,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1816 transitions. [2020-10-09 15:34:38,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1816 transitions. [2020-10-09 15:34:38,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:38,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1816 transitions. [2020-10-09 15:34:38,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:38,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:38,875 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:38,875 INFO L185 Difference]: Start difference. First operand has 609 places, 596 transitions, 1358 flow. Second operand 3 states and 1816 transitions. [2020-10-09 15:34:38,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 594 transitions, 1371 flow [2020-10-09 15:34:38,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 594 transitions, 1370 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:38,881 INFO L241 Difference]: Finished difference. Result has 608 places, 594 transitions, 1354 flow [2020-10-09 15:34:38,881 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1354, PETRI_PLACES=608, PETRI_TRANSITIONS=594} [2020-10-09 15:34:38,881 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 16 predicate places. [2020-10-09 15:34:38,882 INFO L481 AbstractCegarLoop]: Abstraction has has 608 places, 594 transitions, 1354 flow [2020-10-09 15:34:38,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:38,882 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:38,882 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:39,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 728 mathsat -unsat_core_generation=3 [2020-10-09 15:34:39,083 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:39,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:39,083 INFO L82 PathProgramCache]: Analyzing trace with hash 33044303, now seen corresponding path program 1 times [2020-10-09 15:34:39,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:39,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730235660] [2020-10-09 15:34:39,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 729 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 729 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:39,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:39,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:34:39,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:34:39,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730235660] [2020-10-09 15:34:39,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:39,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:39,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111018064] [2020-10-09 15:34:39,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:39,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:39,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:39,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:39,541 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:34:39,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 594 transitions, 1354 flow. Second operand 3 states. [2020-10-09 15:34:39,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:39,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:34:39,543 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:39,743 INFO L129 PetriNetUnfolder]: 52/682 cut-off events. [2020-10-09 15:34:39,743 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:34:39,779 INFO L80 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 682 events. 52/682 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2784 event pairs, 0 based on Foata normal form. 0/606 useless extension candidates. Maximal degree in co-relation 781. Up to 24 conditions per place. [2020-10-09 15:34:39,786 INFO L132 encePairwiseOnDemand]: 635/638 looper letters, 5 selfloop transitions, 2 changer transitions 0/595 dead transitions. [2020-10-09 15:34:39,786 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 595 transitions, 1370 flow [2020-10-09 15:34:39,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1829 transitions. [2020-10-09 15:34:39,788 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9555903866248694 [2020-10-09 15:34:39,788 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1829 transitions. [2020-10-09 15:34:39,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1829 transitions. [2020-10-09 15:34:39,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:39,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1829 transitions. [2020-10-09 15:34:39,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:39,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:39,790 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:39,790 INFO L185 Difference]: Start difference. First operand has 608 places, 594 transitions, 1354 flow. Second operand 3 states and 1829 transitions. [2020-10-09 15:34:39,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 595 transitions, 1370 flow [2020-10-09 15:34:39,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 595 transitions, 1369 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:39,796 INFO L241 Difference]: Finished difference. Result has 611 places, 595 transitions, 1367 flow [2020-10-09 15:34:39,797 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1353, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1367, PETRI_PLACES=611, PETRI_TRANSITIONS=595} [2020-10-09 15:34:39,797 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 19 predicate places. [2020-10-09 15:34:39,797 INFO L481 AbstractCegarLoop]: Abstraction has has 611 places, 595 transitions, 1367 flow [2020-10-09 15:34:39,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:39,797 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:39,797 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:40,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 729 mathsat -unsat_core_generation=3 [2020-10-09 15:34:40,008 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:40,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:40,008 INFO L82 PathProgramCache]: Analyzing trace with hash 33043280, now seen corresponding path program 1 times [2020-10-09 15:34:40,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:40,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922432264] [2020-10-09 15:34:40,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 730 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 730 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:40,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:40,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:34:40,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:40,479 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:34:40,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922432264] [2020-10-09 15:34:40,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:40,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:40,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466404403] [2020-10-09 15:34:40,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:40,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:40,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:40,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:40,508 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:40,509 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 595 transitions, 1367 flow. Second operand 3 states. [2020-10-09 15:34:40,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:40,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:40,510 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:40,703 INFO L129 PetriNetUnfolder]: 52/683 cut-off events. [2020-10-09 15:34:40,703 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:34:40,738 INFO L80 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 683 events. 52/683 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2791 event pairs, 0 based on Foata normal form. 0/607 useless extension candidates. Maximal degree in co-relation 789. Up to 24 conditions per place. [2020-10-09 15:34:40,745 INFO L132 encePairwiseOnDemand]: 634/638 looper letters, 9 selfloop transitions, 3 changer transitions 0/596 dead transitions. [2020-10-09 15:34:40,745 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 596 transitions, 1393 flow [2020-10-09 15:34:40,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1819 transitions. [2020-10-09 15:34:40,746 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503657262277951 [2020-10-09 15:34:40,747 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1819 transitions. [2020-10-09 15:34:40,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1819 transitions. [2020-10-09 15:34:40,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:40,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1819 transitions. [2020-10-09 15:34:40,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:40,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:40,749 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:40,749 INFO L185 Difference]: Start difference. First operand has 611 places, 595 transitions, 1367 flow. Second operand 3 states and 1819 transitions. [2020-10-09 15:34:40,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 596 transitions, 1393 flow [2020-10-09 15:34:40,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 596 transitions, 1391 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:40,755 INFO L241 Difference]: Finished difference. Result has 614 places, 596 transitions, 1383 flow [2020-10-09 15:34:40,755 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1383, PETRI_PLACES=614, PETRI_TRANSITIONS=596} [2020-10-09 15:34:40,755 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 22 predicate places. [2020-10-09 15:34:40,755 INFO L481 AbstractCegarLoop]: Abstraction has has 614 places, 596 transitions, 1383 flow [2020-10-09 15:34:40,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:40,756 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:40,756 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:40,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 730 mathsat -unsat_core_generation=3 [2020-10-09 15:34:40,956 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:40,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:40,957 INFO L82 PathProgramCache]: Analyzing trace with hash 33996592, now seen corresponding path program 1 times [2020-10-09 15:34:40,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:40,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712167732] [2020-10-09 15:34:40,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 731 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 731 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:41,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:34:41,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:34:41,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:34:41,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712167732] [2020-10-09 15:34:41,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:41,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:41,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825784431] [2020-10-09 15:34:41,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:41,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:41,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:41,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:41,420 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:34:41,421 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 596 transitions, 1383 flow. Second operand 3 states. [2020-10-09 15:34:41,421 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:41,421 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:34:41,421 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:41,607 INFO L129 PetriNetUnfolder]: 51/679 cut-off events. [2020-10-09 15:34:41,607 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:34:41,640 INFO L80 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 679 events. 51/679 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2766 event pairs, 0 based on Foata normal form. 1/607 useless extension candidates. Maximal degree in co-relation 781. Up to 24 conditions per place. [2020-10-09 15:34:41,646 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/593 dead transitions. [2020-10-09 15:34:41,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 593 transitions, 1378 flow [2020-10-09 15:34:41,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:34:41,648 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:34:41,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:34:41,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:34:41,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:41,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:34:41,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:41,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:41,650 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:41,650 INFO L185 Difference]: Start difference. First operand has 614 places, 596 transitions, 1383 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:34:41,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 593 transitions, 1378 flow [2020-10-09 15:34:41,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 593 transitions, 1370 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:34:41,656 INFO L241 Difference]: Finished difference. Result has 613 places, 593 transitions, 1362 flow [2020-10-09 15:34:41,656 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1362, PETRI_PLACES=613, PETRI_TRANSITIONS=593} [2020-10-09 15:34:41,656 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 21 predicate places. [2020-10-09 15:34:41,656 INFO L481 AbstractCegarLoop]: Abstraction has has 613 places, 593 transitions, 1362 flow [2020-10-09 15:34:41,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:41,656 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:41,656 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:41,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 731 mathsat -unsat_core_generation=3 [2020-10-09 15:34:41,857 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:41,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:41,857 INFO L82 PathProgramCache]: Analyzing trace with hash 33997615, now seen corresponding path program 1 times [2020-10-09 15:34:41,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:41,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988653106] [2020-10-09 15:34:41,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 732 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 732 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:42,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:42,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:34:42,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:34:42,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988653106] [2020-10-09 15:34:42,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:42,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:42,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973721657] [2020-10-09 15:34:42,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:42,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:42,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:42,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:42,324 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:42,325 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 593 transitions, 1362 flow. Second operand 3 states. [2020-10-09 15:34:42,325 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:42,325 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:42,325 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:42,513 INFO L129 PetriNetUnfolder]: 51/677 cut-off events. [2020-10-09 15:34:42,513 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:34:42,545 INFO L80 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 677 events. 51/677 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2753 event pairs, 0 based on Foata normal form. 0/603 useless extension candidates. Maximal degree in co-relation 785. Up to 24 conditions per place. [2020-10-09 15:34:42,552 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 8 selfloop transitions, 1 changer transitions 0/591 dead transitions. [2020-10-09 15:34:42,552 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 591 transitions, 1375 flow [2020-10-09 15:34:42,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1816 transitions. [2020-10-09 15:34:42,553 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9487983281086729 [2020-10-09 15:34:42,553 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1816 transitions. [2020-10-09 15:34:42,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1816 transitions. [2020-10-09 15:34:42,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:42,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1816 transitions. [2020-10-09 15:34:42,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:42,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:42,556 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:42,556 INFO L185 Difference]: Start difference. First operand has 613 places, 593 transitions, 1362 flow. Second operand 3 states and 1816 transitions. [2020-10-09 15:34:42,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 591 transitions, 1375 flow [2020-10-09 15:34:42,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 591 transitions, 1374 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:42,561 INFO L241 Difference]: Finished difference. Result has 612 places, 591 transitions, 1358 flow [2020-10-09 15:34:42,562 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1358, PETRI_PLACES=612, PETRI_TRANSITIONS=591} [2020-10-09 15:34:42,562 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 20 predicate places. [2020-10-09 15:34:42,562 INFO L481 AbstractCegarLoop]: Abstraction has has 612 places, 591 transitions, 1358 flow [2020-10-09 15:34:42,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:42,562 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:42,562 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:42,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 732 mathsat -unsat_core_generation=3 [2020-10-09 15:34:42,763 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:42,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:42,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1467909081, now seen corresponding path program 1 times [2020-10-09 15:34:42,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:42,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448875909] [2020-10-09 15:34:42,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 733 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 733 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:43,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:34:43,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:34:43,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:43,210 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:34:43,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448875909] [2020-10-09 15:34:43,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:43,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:43,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383319259] [2020-10-09 15:34:43,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:43,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:43,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:43,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:43,223 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:34:43,224 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 591 transitions, 1358 flow. Second operand 3 states. [2020-10-09 15:34:43,224 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:43,224 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:34:43,224 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:43,413 INFO L129 PetriNetUnfolder]: 50/684 cut-off events. [2020-10-09 15:34:43,413 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:34:43,446 INFO L80 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 684 events. 50/684 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2812 event pairs, 0 based on Foata normal form. 1/612 useless extension candidates. Maximal degree in co-relation 788. Up to 24 conditions per place. [2020-10-09 15:34:43,453 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/591 dead transitions. [2020-10-09 15:34:43,453 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 591 transitions, 1368 flow [2020-10-09 15:34:43,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:34:43,454 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:34:43,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:34:43,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:34:43,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:43,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:34:43,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:43,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:43,456 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:43,456 INFO L185 Difference]: Start difference. First operand has 612 places, 591 transitions, 1358 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:34:43,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 591 transitions, 1368 flow [2020-10-09 15:34:43,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 591 transitions, 1367 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:43,462 INFO L241 Difference]: Finished difference. Result has 614 places, 591 transitions, 1362 flow [2020-10-09 15:34:43,462 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1362, PETRI_PLACES=614, PETRI_TRANSITIONS=591} [2020-10-09 15:34:43,462 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 22 predicate places. [2020-10-09 15:34:43,462 INFO L481 AbstractCegarLoop]: Abstraction has has 614 places, 591 transitions, 1362 flow [2020-10-09 15:34:43,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:43,462 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:43,463 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:43,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 733 mathsat -unsat_core_generation=3 [2020-10-09 15:34:43,663 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:43,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:43,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908058, now seen corresponding path program 1 times [2020-10-09 15:34:43,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:43,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246599740] [2020-10-09 15:34:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 734 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 734 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:44,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:44,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:34:44,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:34:44,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246599740] [2020-10-09 15:34:44,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:44,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:44,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113652391] [2020-10-09 15:34:44,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:44,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:44,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:44,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:44,153 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:44,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 591 transitions, 1362 flow. Second operand 3 states. [2020-10-09 15:34:44,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:44,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:44,154 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:44,351 INFO L129 PetriNetUnfolder]: 48/686 cut-off events. [2020-10-09 15:34:44,351 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:34:44,386 INFO L80 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 686 events. 48/686 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2849 event pairs, 0 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 801. Up to 24 conditions per place. [2020-10-09 15:34:44,392 INFO L132 encePairwiseOnDemand]: 634/638 looper letters, 9 selfloop transitions, 3 changer transitions 0/592 dead transitions. [2020-10-09 15:34:44,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 592 transitions, 1388 flow [2020-10-09 15:34:44,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:44,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1819 transitions. [2020-10-09 15:34:44,394 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503657262277951 [2020-10-09 15:34:44,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1819 transitions. [2020-10-09 15:34:44,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1819 transitions. [2020-10-09 15:34:44,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:44,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1819 transitions. [2020-10-09 15:34:44,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:44,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:44,396 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:44,396 INFO L185 Difference]: Start difference. First operand has 614 places, 591 transitions, 1362 flow. Second operand 3 states and 1819 transitions. [2020-10-09 15:34:44,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 592 transitions, 1388 flow [2020-10-09 15:34:44,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 592 transitions, 1387 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:44,401 INFO L241 Difference]: Finished difference. Result has 617 places, 592 transitions, 1379 flow [2020-10-09 15:34:44,401 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1379, PETRI_PLACES=617, PETRI_TRANSITIONS=592} [2020-10-09 15:34:44,401 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 25 predicate places. [2020-10-09 15:34:44,402 INFO L481 AbstractCegarLoop]: Abstraction has has 617 places, 592 transitions, 1379 flow [2020-10-09 15:34:44,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:44,402 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:44,402 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:44,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 734 mathsat -unsat_core_generation=3 [2020-10-09 15:34:44,609 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:44,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:44,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1468861370, now seen corresponding path program 1 times [2020-10-09 15:34:44,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:44,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647827501] [2020-10-09 15:34:44,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 735 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 735 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:45,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:45,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:45,057 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:34:45,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:34:45,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647827501] [2020-10-09 15:34:45,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:45,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:45,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912948742] [2020-10-09 15:34:45,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:45,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:45,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:45,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:45,070 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:34:45,071 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 592 transitions, 1379 flow. Second operand 3 states. [2020-10-09 15:34:45,071 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:45,072 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:34:45,072 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:45,268 INFO L129 PetriNetUnfolder]: 48/679 cut-off events. [2020-10-09 15:34:45,269 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:34:45,303 INFO L80 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 679 events. 48/679 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2787 event pairs, 0 based on Foata normal form. 1/610 useless extension candidates. Maximal degree in co-relation 787. Up to 24 conditions per place. [2020-10-09 15:34:45,309 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 5 selfloop transitions, 1 changer transitions 0/590 dead transitions. [2020-10-09 15:34:45,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 590 transitions, 1381 flow [2020-10-09 15:34:45,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:45,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2020-10-09 15:34:45,311 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955067920585162 [2020-10-09 15:34:45,311 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2020-10-09 15:34:45,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2020-10-09 15:34:45,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:45,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2020-10-09 15:34:45,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:45,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:45,313 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:45,313 INFO L185 Difference]: Start difference. First operand has 617 places, 592 transitions, 1379 flow. Second operand 3 states and 1828 transitions. [2020-10-09 15:34:45,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 590 transitions, 1381 flow [2020-10-09 15:34:45,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 590 transitions, 1373 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:34:45,319 INFO L241 Difference]: Finished difference. Result has 617 places, 590 transitions, 1366 flow [2020-10-09 15:34:45,319 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=614, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1366, PETRI_PLACES=617, PETRI_TRANSITIONS=590} [2020-10-09 15:34:45,319 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 25 predicate places. [2020-10-09 15:34:45,319 INFO L481 AbstractCegarLoop]: Abstraction has has 617 places, 590 transitions, 1366 flow [2020-10-09 15:34:45,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:45,319 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:45,319 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:45,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 735 mathsat -unsat_core_generation=3 [2020-10-09 15:34:45,532 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:45,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:45,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1468862393, now seen corresponding path program 1 times [2020-10-09 15:34:45,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:45,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467740116] [2020-10-09 15:34:45,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 736 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 736 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:45,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:45,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:34:45,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:34:45,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467740116] [2020-10-09 15:34:45,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:45,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:45,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555357268] [2020-10-09 15:34:45,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:45,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:45,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:45,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:45,997 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:45,998 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 590 transitions, 1366 flow. Second operand 3 states. [2020-10-09 15:34:45,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:45,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:45,998 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:46,196 INFO L129 PetriNetUnfolder]: 48/677 cut-off events. [2020-10-09 15:34:46,196 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:34:46,230 INFO L80 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 677 events. 48/677 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2771 event pairs, 0 based on Foata normal form. 0/606 useless extension candidates. Maximal degree in co-relation 791. Up to 24 conditions per place. [2020-10-09 15:34:46,236 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 8 selfloop transitions, 1 changer transitions 0/588 dead transitions. [2020-10-09 15:34:46,236 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 588 transitions, 1379 flow [2020-10-09 15:34:46,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:46,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1816 transitions. [2020-10-09 15:34:46,238 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9487983281086729 [2020-10-09 15:34:46,238 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1816 transitions. [2020-10-09 15:34:46,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1816 transitions. [2020-10-09 15:34:46,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:46,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1816 transitions. [2020-10-09 15:34:46,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:46,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:46,240 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:46,240 INFO L185 Difference]: Start difference. First operand has 617 places, 590 transitions, 1366 flow. Second operand 3 states and 1816 transitions. [2020-10-09 15:34:46,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 588 transitions, 1379 flow [2020-10-09 15:34:46,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 588 transitions, 1378 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:46,245 INFO L241 Difference]: Finished difference. Result has 616 places, 588 transitions, 1362 flow [2020-10-09 15:34:46,246 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=614, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1362, PETRI_PLACES=616, PETRI_TRANSITIONS=588} [2020-10-09 15:34:46,246 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 24 predicate places. [2020-10-09 15:34:46,246 INFO L481 AbstractCegarLoop]: Abstraction has has 616 places, 588 transitions, 1362 flow [2020-10-09 15:34:46,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:46,246 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:46,246 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:46,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 736 mathsat -unsat_core_generation=3 [2020-10-09 15:34:46,447 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:46,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:46,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1826376289, now seen corresponding path program 1 times [2020-10-09 15:34:46,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:46,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23568571] [2020-10-09 15:34:46,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 737 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 737 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:46,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:34:46,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:34:46,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:46,903 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:34:46,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23568571] [2020-10-09 15:34:46,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:46,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:46,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034720857] [2020-10-09 15:34:46,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:46,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:46,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:46,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:46,916 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:34:46,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 588 transitions, 1362 flow. Second operand 3 states. [2020-10-09 15:34:46,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:46,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:34:46,918 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:47,144 INFO L129 PetriNetUnfolder]: 47/684 cut-off events. [2020-10-09 15:34:47,145 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:34:47,177 INFO L80 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 684 events. 47/684 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2827 event pairs, 0 based on Foata normal form. 1/615 useless extension candidates. Maximal degree in co-relation 794. Up to 24 conditions per place. [2020-10-09 15:34:47,183 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/588 dead transitions. [2020-10-09 15:34:47,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 588 transitions, 1372 flow [2020-10-09 15:34:47,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:47,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:47,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:34:47,185 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:34:47,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:34:47,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:34:47,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:47,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:34:47,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:47,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:47,187 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:47,187 INFO L185 Difference]: Start difference. First operand has 616 places, 588 transitions, 1362 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:34:47,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 588 transitions, 1372 flow [2020-10-09 15:34:47,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 588 transitions, 1371 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:47,192 INFO L241 Difference]: Finished difference. Result has 618 places, 588 transitions, 1366 flow [2020-10-09 15:34:47,192 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=615, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1366, PETRI_PLACES=618, PETRI_TRANSITIONS=588} [2020-10-09 15:34:47,193 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 26 predicate places. [2020-10-09 15:34:47,193 INFO L481 AbstractCegarLoop]: Abstraction has has 618 places, 588 transitions, 1366 flow [2020-10-09 15:34:47,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:47,193 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:47,193 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:47,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 737 mathsat -unsat_core_generation=3 [2020-10-09 15:34:47,403 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:47,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:47,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1826375266, now seen corresponding path program 1 times [2020-10-09 15:34:47,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:47,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343306009] [2020-10-09 15:34:47,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 738 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 738 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:47,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:47,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:34:47,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:47,851 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:34:47,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343306009] [2020-10-09 15:34:47,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:47,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:47,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892225404] [2020-10-09 15:34:47,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:47,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:47,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:47,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:47,872 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:47,873 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 588 transitions, 1366 flow. Second operand 3 states. [2020-10-09 15:34:47,873 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:47,873 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:47,873 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:48,082 INFO L129 PetriNetUnfolder]: 45/686 cut-off events. [2020-10-09 15:34:48,083 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:34:48,118 INFO L80 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 686 events. 45/686 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2862 event pairs, 0 based on Foata normal form. 0/616 useless extension candidates. Maximal degree in co-relation 807. Up to 24 conditions per place. [2020-10-09 15:34:48,124 INFO L132 encePairwiseOnDemand]: 634/638 looper letters, 9 selfloop transitions, 3 changer transitions 0/589 dead transitions. [2020-10-09 15:34:48,124 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 589 transitions, 1392 flow [2020-10-09 15:34:48,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1819 transitions. [2020-10-09 15:34:48,126 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503657262277951 [2020-10-09 15:34:48,126 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1819 transitions. [2020-10-09 15:34:48,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1819 transitions. [2020-10-09 15:34:48,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:48,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1819 transitions. [2020-10-09 15:34:48,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:48,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:48,128 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:48,128 INFO L185 Difference]: Start difference. First operand has 618 places, 588 transitions, 1366 flow. Second operand 3 states and 1819 transitions. [2020-10-09 15:34:48,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 589 transitions, 1392 flow [2020-10-09 15:34:48,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 589 transitions, 1391 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:48,133 INFO L241 Difference]: Finished difference. Result has 621 places, 589 transitions, 1383 flow [2020-10-09 15:34:48,134 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1383, PETRI_PLACES=621, PETRI_TRANSITIONS=589} [2020-10-09 15:34:48,134 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 29 predicate places. [2020-10-09 15:34:48,134 INFO L481 AbstractCegarLoop]: Abstraction has has 621 places, 589 transitions, 1383 flow [2020-10-09 15:34:48,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:48,134 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:48,134 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:48,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 738 mathsat -unsat_core_generation=3 [2020-10-09 15:34:48,335 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:48,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:48,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1827328578, now seen corresponding path program 1 times [2020-10-09 15:34:48,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:48,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190317914] [2020-10-09 15:34:48,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 739 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 739 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:48,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:48,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:48,781 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:34:48,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:34:48,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190317914] [2020-10-09 15:34:48,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:48,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:48,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926908146] [2020-10-09 15:34:48,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:48,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:48,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:48,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:48,794 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:34:48,795 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 589 transitions, 1383 flow. Second operand 3 states. [2020-10-09 15:34:48,796 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:48,796 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:34:48,796 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:48,993 INFO L129 PetriNetUnfolder]: 45/679 cut-off events. [2020-10-09 15:34:48,993 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:34:49,029 INFO L80 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 679 events. 45/679 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2802 event pairs, 0 based on Foata normal form. 1/613 useless extension candidates. Maximal degree in co-relation 793. Up to 24 conditions per place. [2020-10-09 15:34:49,035 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 5 selfloop transitions, 1 changer transitions 0/587 dead transitions. [2020-10-09 15:34:49,035 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 587 transitions, 1385 flow [2020-10-09 15:34:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2020-10-09 15:34:49,036 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955067920585162 [2020-10-09 15:34:49,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2020-10-09 15:34:49,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2020-10-09 15:34:49,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:49,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2020-10-09 15:34:49,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:49,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:49,038 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:49,038 INFO L185 Difference]: Start difference. First operand has 621 places, 589 transitions, 1383 flow. Second operand 3 states and 1828 transitions. [2020-10-09 15:34:49,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 623 places, 587 transitions, 1385 flow [2020-10-09 15:34:49,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 587 transitions, 1377 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:34:49,044 INFO L241 Difference]: Finished difference. Result has 621 places, 587 transitions, 1370 flow [2020-10-09 15:34:49,044 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1370, PETRI_PLACES=621, PETRI_TRANSITIONS=587} [2020-10-09 15:34:49,044 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 29 predicate places. [2020-10-09 15:34:49,045 INFO L481 AbstractCegarLoop]: Abstraction has has 621 places, 587 transitions, 1370 flow [2020-10-09 15:34:49,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:49,045 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:49,045 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:49,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 739 mathsat -unsat_core_generation=3 [2020-10-09 15:34:49,246 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:49,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:49,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1827329601, now seen corresponding path program 1 times [2020-10-09 15:34:49,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:49,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510068622] [2020-10-09 15:34:49,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 740 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 740 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:49,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:49,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:34:49,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:34:49,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510068622] [2020-10-09 15:34:49,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:49,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:49,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792040463] [2020-10-09 15:34:49,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:49,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:49,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:49,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:49,730 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:49,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 587 transitions, 1370 flow. Second operand 3 states. [2020-10-09 15:34:49,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:49,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:49,731 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:49,939 INFO L129 PetriNetUnfolder]: 45/677 cut-off events. [2020-10-09 15:34:49,940 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:34:49,976 INFO L80 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 677 events. 45/677 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2787 event pairs, 0 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 797. Up to 24 conditions per place. [2020-10-09 15:34:49,982 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 8 selfloop transitions, 1 changer transitions 0/585 dead transitions. [2020-10-09 15:34:49,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 585 transitions, 1383 flow [2020-10-09 15:34:49,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1816 transitions. [2020-10-09 15:34:49,984 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9487983281086729 [2020-10-09 15:34:49,984 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1816 transitions. [2020-10-09 15:34:49,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1816 transitions. [2020-10-09 15:34:49,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:49,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1816 transitions. [2020-10-09 15:34:49,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:49,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:49,986 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:49,986 INFO L185 Difference]: Start difference. First operand has 621 places, 587 transitions, 1370 flow. Second operand 3 states and 1816 transitions. [2020-10-09 15:34:49,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 585 transitions, 1383 flow [2020-10-09 15:34:49,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 585 transitions, 1382 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:49,992 INFO L241 Difference]: Finished difference. Result has 620 places, 585 transitions, 1366 flow [2020-10-09 15:34:49,992 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1366, PETRI_PLACES=620, PETRI_TRANSITIONS=585} [2020-10-09 15:34:49,992 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 28 predicate places. [2020-10-09 15:34:49,992 INFO L481 AbstractCegarLoop]: Abstraction has has 620 places, 585 transitions, 1366 flow [2020-10-09 15:34:49,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:49,993 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:49,993 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:50,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 740 mathsat -unsat_core_generation=3 [2020-10-09 15:34:50,193 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:50,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:50,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1060663528, now seen corresponding path program 1 times [2020-10-09 15:34:50,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:50,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503809168] [2020-10-09 15:34:50,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 741 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 741 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:50,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:34:50,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:34:50,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:34:50,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503809168] [2020-10-09 15:34:50,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:50,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:50,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731283809] [2020-10-09 15:34:50,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:50,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:50,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:50,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:50,699 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:34:50,700 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 585 transitions, 1366 flow. Second operand 3 states. [2020-10-09 15:34:50,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:50,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:34:50,700 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:50,898 INFO L129 PetriNetUnfolder]: 44/684 cut-off events. [2020-10-09 15:34:50,898 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:34:50,934 INFO L80 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 684 events. 44/684 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2847 event pairs, 0 based on Foata normal form. 1/618 useless extension candidates. Maximal degree in co-relation 800. Up to 24 conditions per place. [2020-10-09 15:34:50,940 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/585 dead transitions. [2020-10-09 15:34:50,940 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 585 transitions, 1376 flow [2020-10-09 15:34:50,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:34:50,941 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:34:50,941 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:34:50,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:34:50,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:50,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:34:50,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:50,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:50,943 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:50,943 INFO L185 Difference]: Start difference. First operand has 620 places, 585 transitions, 1366 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:34:50,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 585 transitions, 1376 flow [2020-10-09 15:34:50,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 585 transitions, 1375 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:50,949 INFO L241 Difference]: Finished difference. Result has 622 places, 585 transitions, 1370 flow [2020-10-09 15:34:50,949 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1370, PETRI_PLACES=622, PETRI_TRANSITIONS=585} [2020-10-09 15:34:50,949 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 30 predicate places. [2020-10-09 15:34:50,949 INFO L481 AbstractCegarLoop]: Abstraction has has 622 places, 585 transitions, 1370 flow [2020-10-09 15:34:50,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:50,949 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:50,949 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:51,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 741 mathsat -unsat_core_generation=3 [2020-10-09 15:34:51,150 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:51,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:51,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1060662505, now seen corresponding path program 1 times [2020-10-09 15:34:51,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:51,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722236616] [2020-10-09 15:34:51,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 742 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 742 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:51,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:51,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:34:51,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:51,599 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:34:51,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722236616] [2020-10-09 15:34:51,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:51,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:51,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112037545] [2020-10-09 15:34:51,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:51,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:51,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:51,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:51,620 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:51,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 585 transitions, 1370 flow. Second operand 3 states. [2020-10-09 15:34:51,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:51,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:51,621 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:51,830 INFO L129 PetriNetUnfolder]: 42/686 cut-off events. [2020-10-09 15:34:51,830 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:34:51,866 INFO L80 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 686 events. 42/686 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2881 event pairs, 0 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 813. Up to 24 conditions per place. [2020-10-09 15:34:51,871 INFO L132 encePairwiseOnDemand]: 634/638 looper letters, 9 selfloop transitions, 3 changer transitions 0/586 dead transitions. [2020-10-09 15:34:51,872 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 586 transitions, 1396 flow [2020-10-09 15:34:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1819 transitions. [2020-10-09 15:34:51,873 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503657262277951 [2020-10-09 15:34:51,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1819 transitions. [2020-10-09 15:34:51,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1819 transitions. [2020-10-09 15:34:51,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:51,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1819 transitions. [2020-10-09 15:34:51,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:51,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:51,875 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:51,875 INFO L185 Difference]: Start difference. First operand has 622 places, 585 transitions, 1370 flow. Second operand 3 states and 1819 transitions. [2020-10-09 15:34:51,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 586 transitions, 1396 flow [2020-10-09 15:34:51,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 586 transitions, 1395 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:51,881 INFO L241 Difference]: Finished difference. Result has 625 places, 586 transitions, 1387 flow [2020-10-09 15:34:51,881 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1369, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1387, PETRI_PLACES=625, PETRI_TRANSITIONS=586} [2020-10-09 15:34:51,881 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 33 predicate places. [2020-10-09 15:34:51,881 INFO L481 AbstractCegarLoop]: Abstraction has has 625 places, 586 transitions, 1387 flow [2020-10-09 15:34:51,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:51,881 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:51,881 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:52,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 742 mathsat -unsat_core_generation=3 [2020-10-09 15:34:52,082 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:52,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:52,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1061615817, now seen corresponding path program 1 times [2020-10-09 15:34:52,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:52,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673359084] [2020-10-09 15:34:52,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 743 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 743 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:52,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:52,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:34:52,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:52,533 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:34:52,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673359084] [2020-10-09 15:34:52,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:52,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:52,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450838715] [2020-10-09 15:34:52,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:52,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:52,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:52,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:52,544 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:34:52,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 586 transitions, 1387 flow. Second operand 3 states. [2020-10-09 15:34:52,545 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:52,545 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:34:52,546 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:52,749 INFO L129 PetriNetUnfolder]: 42/679 cut-off events. [2020-10-09 15:34:52,749 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:34:52,784 INFO L80 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 679 events. 42/679 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2820 event pairs, 0 based on Foata normal form. 1/616 useless extension candidates. Maximal degree in co-relation 799. Up to 24 conditions per place. [2020-10-09 15:34:52,789 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 5 selfloop transitions, 1 changer transitions 0/584 dead transitions. [2020-10-09 15:34:52,789 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 584 transitions, 1389 flow [2020-10-09 15:34:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:52,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2020-10-09 15:34:52,790 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955067920585162 [2020-10-09 15:34:52,791 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2020-10-09 15:34:52,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2020-10-09 15:34:52,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:52,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2020-10-09 15:34:52,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:52,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:52,792 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:52,792 INFO L185 Difference]: Start difference. First operand has 625 places, 586 transitions, 1387 flow. Second operand 3 states and 1828 transitions. [2020-10-09 15:34:52,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 584 transitions, 1389 flow [2020-10-09 15:34:52,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 584 transitions, 1381 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:34:52,798 INFO L241 Difference]: Finished difference. Result has 625 places, 584 transitions, 1374 flow [2020-10-09 15:34:52,798 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1369, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1374, PETRI_PLACES=625, PETRI_TRANSITIONS=584} [2020-10-09 15:34:52,799 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 33 predicate places. [2020-10-09 15:34:52,799 INFO L481 AbstractCegarLoop]: Abstraction has has 625 places, 584 transitions, 1374 flow [2020-10-09 15:34:52,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:52,799 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:52,799 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:52,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 743 mathsat -unsat_core_generation=3 [2020-10-09 15:34:53,000 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:53,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:53,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1061616840, now seen corresponding path program 1 times [2020-10-09 15:34:53,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:53,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798676017] [2020-10-09 15:34:53,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 744 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 744 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:53,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:53,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:34:53,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:34:53,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798676017] [2020-10-09 15:34:53,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:53,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:53,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694586296] [2020-10-09 15:34:53,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:53,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:53,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:53,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:53,486 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:53,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 584 transitions, 1374 flow. Second operand 3 states. [2020-10-09 15:34:53,488 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:53,488 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:53,488 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:53,740 INFO L129 PetriNetUnfolder]: 42/677 cut-off events. [2020-10-09 15:34:53,741 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:34:53,762 INFO L80 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 677 events. 42/677 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2806 event pairs, 0 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 803. Up to 24 conditions per place. [2020-10-09 15:34:53,767 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 8 selfloop transitions, 1 changer transitions 0/582 dead transitions. [2020-10-09 15:34:53,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 582 transitions, 1387 flow [2020-10-09 15:34:53,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:53,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1816 transitions. [2020-10-09 15:34:53,769 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9487983281086729 [2020-10-09 15:34:53,769 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1816 transitions. [2020-10-09 15:34:53,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1816 transitions. [2020-10-09 15:34:53,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:53,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1816 transitions. [2020-10-09 15:34:53,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:53,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:53,771 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:53,771 INFO L185 Difference]: Start difference. First operand has 625 places, 584 transitions, 1374 flow. Second operand 3 states and 1816 transitions. [2020-10-09 15:34:53,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 582 transitions, 1387 flow [2020-10-09 15:34:53,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 582 transitions, 1386 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:53,776 INFO L241 Difference]: Finished difference. Result has 624 places, 582 transitions, 1370 flow [2020-10-09 15:34:53,776 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1370, PETRI_PLACES=624, PETRI_TRANSITIONS=582} [2020-10-09 15:34:53,776 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 32 predicate places. [2020-10-09 15:34:53,776 INFO L481 AbstractCegarLoop]: Abstraction has has 624 places, 582 transitions, 1370 flow [2020-10-09 15:34:53,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:53,776 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:53,777 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:53,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 744 mathsat -unsat_core_generation=3 [2020-10-09 15:34:53,977 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:53,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:53,978 INFO L82 PathProgramCache]: Analyzing trace with hash 103085073, now seen corresponding path program 1 times [2020-10-09 15:34:53,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:53,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833245179] [2020-10-09 15:34:53,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 745 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 745 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:54,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:54,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:34:54,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:34:54,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833245179] [2020-10-09 15:34:54,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:54,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:54,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913418587] [2020-10-09 15:34:54,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:54,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:54,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:54,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:54,468 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:54,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 582 transitions, 1370 flow. Second operand 3 states. [2020-10-09 15:34:54,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:54,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:54,470 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:54,687 INFO L129 PetriNetUnfolder]: 41/685 cut-off events. [2020-10-09 15:34:54,687 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:34:54,726 INFO L80 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 685 events. 41/685 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2876 event pairs, 0 based on Foata normal form. 0/620 useless extension candidates. Maximal degree in co-relation 815. Up to 24 conditions per place. [2020-10-09 15:34:54,732 INFO L132 encePairwiseOnDemand]: 633/638 looper letters, 10 selfloop transitions, 3 changer transitions 0/584 dead transitions. [2020-10-09 15:34:54,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 584 transitions, 1400 flow [2020-10-09 15:34:54,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1821 transitions. [2020-10-09 15:34:54,733 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.95141065830721 [2020-10-09 15:34:54,733 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1821 transitions. [2020-10-09 15:34:54,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1821 transitions. [2020-10-09 15:34:54,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:54,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1821 transitions. [2020-10-09 15:34:54,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:54,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:54,735 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:54,735 INFO L185 Difference]: Start difference. First operand has 624 places, 582 transitions, 1370 flow. Second operand 3 states and 1821 transitions. [2020-10-09 15:34:54,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 584 transitions, 1400 flow [2020-10-09 15:34:54,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 584 transitions, 1399 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:54,741 INFO L241 Difference]: Finished difference. Result has 627 places, 584 transitions, 1393 flow [2020-10-09 15:34:54,742 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1369, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1393, PETRI_PLACES=627, PETRI_TRANSITIONS=584} [2020-10-09 15:34:54,742 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 35 predicate places. [2020-10-09 15:34:54,742 INFO L481 AbstractCegarLoop]: Abstraction has has 627 places, 584 transitions, 1393 flow [2020-10-09 15:34:54,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:54,742 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:54,742 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:54,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 745 mathsat -unsat_core_generation=3 [2020-10-09 15:34:54,943 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:54,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:54,943 INFO L82 PathProgramCache]: Analyzing trace with hash 103084050, now seen corresponding path program 1 times [2020-10-09 15:34:54,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:54,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768765555] [2020-10-09 15:34:54,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 746 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 746 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:55,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:34:55,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:34:55,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:34:55,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768765555] [2020-10-09 15:34:55,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:55,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:55,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315660602] [2020-10-09 15:34:55,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:55,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:55,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:55,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:55,422 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:34:55,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 584 transitions, 1393 flow. Second operand 3 states. [2020-10-09 15:34:55,424 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:55,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:34:55,424 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:55,629 INFO L129 PetriNetUnfolder]: 39/686 cut-off events. [2020-10-09 15:34:55,629 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:34:55,666 INFO L80 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 686 events. 39/686 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2896 event pairs, 0 based on Foata normal form. 1/626 useless extension candidates. Maximal degree in co-relation 813. Up to 24 conditions per place. [2020-10-09 15:34:55,671 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/583 dead transitions. [2020-10-09 15:34:55,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 583 transitions, 1399 flow [2020-10-09 15:34:55,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:34:55,672 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:34:55,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:34:55,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:34:55,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:55,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:34:55,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:55,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:55,674 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:55,674 INFO L185 Difference]: Start difference. First operand has 627 places, 584 transitions, 1393 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:34:55,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 583 transitions, 1399 flow [2020-10-09 15:34:55,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 583 transitions, 1394 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:55,680 INFO L241 Difference]: Finished difference. Result has 629 places, 583 transitions, 1389 flow [2020-10-09 15:34:55,680 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1389, PETRI_PLACES=629, PETRI_TRANSITIONS=583} [2020-10-09 15:34:55,680 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 37 predicate places. [2020-10-09 15:34:55,680 INFO L481 AbstractCegarLoop]: Abstraction has has 629 places, 583 transitions, 1389 flow [2020-10-09 15:34:55,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:55,680 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:55,681 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:55,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 746 mathsat -unsat_core_generation=3 [2020-10-09 15:34:55,881 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:55,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:55,882 INFO L82 PathProgramCache]: Analyzing trace with hash 102131761, now seen corresponding path program 1 times [2020-10-09 15:34:55,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:55,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875342874] [2020-10-09 15:34:55,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 747 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 747 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:56,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:56,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:34:56,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:56,331 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:34:56,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875342874] [2020-10-09 15:34:56,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:56,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:56,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206674126] [2020-10-09 15:34:56,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:56,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:56,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:56,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:56,350 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:34:56,351 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 583 transitions, 1389 flow. Second operand 3 states. [2020-10-09 15:34:56,351 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:56,351 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:34:56,352 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:56,553 INFO L129 PetriNetUnfolder]: 39/679 cut-off events. [2020-10-09 15:34:56,553 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:34:56,587 INFO L80 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 679 events. 39/679 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2838 event pairs, 0 based on Foata normal form. 1/619 useless extension candidates. Maximal degree in co-relation 809. Up to 24 conditions per place. [2020-10-09 15:34:56,592 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 5 selfloop transitions, 1 changer transitions 0/581 dead transitions. [2020-10-09 15:34:56,592 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 581 transitions, 1392 flow [2020-10-09 15:34:56,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2020-10-09 15:34:56,594 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955067920585162 [2020-10-09 15:34:56,594 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2020-10-09 15:34:56,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2020-10-09 15:34:56,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:56,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2020-10-09 15:34:56,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:56,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:56,596 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:56,596 INFO L185 Difference]: Start difference. First operand has 629 places, 583 transitions, 1389 flow. Second operand 3 states and 1828 transitions. [2020-10-09 15:34:56,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 581 transitions, 1392 flow [2020-10-09 15:34:56,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 581 transitions, 1385 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:34:56,601 INFO L241 Difference]: Finished difference. Result has 629 places, 581 transitions, 1378 flow [2020-10-09 15:34:56,602 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1373, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1378, PETRI_PLACES=629, PETRI_TRANSITIONS=581} [2020-10-09 15:34:56,602 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 37 predicate places. [2020-10-09 15:34:56,602 INFO L481 AbstractCegarLoop]: Abstraction has has 629 places, 581 transitions, 1378 flow [2020-10-09 15:34:56,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:56,602 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:56,602 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:56,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 747 mathsat -unsat_core_generation=3 [2020-10-09 15:34:56,814 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:56,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:56,815 INFO L82 PathProgramCache]: Analyzing trace with hash 102130738, now seen corresponding path program 1 times [2020-10-09 15:34:56,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:56,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96332427] [2020-10-09 15:34:56,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 748 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 748 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:57,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:57,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:34:57,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:34:57,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96332427] [2020-10-09 15:34:57,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:57,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:57,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880695514] [2020-10-09 15:34:57,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:57,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:57,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:57,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:57,332 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:57,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 581 transitions, 1378 flow. Second operand 3 states. [2020-10-09 15:34:57,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:57,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:57,333 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:57,536 INFO L129 PetriNetUnfolder]: 39/677 cut-off events. [2020-10-09 15:34:57,536 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:34:57,570 INFO L80 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 677 events. 39/677 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2824 event pairs, 0 based on Foata normal form. 0/615 useless extension candidates. Maximal degree in co-relation 809. Up to 24 conditions per place. [2020-10-09 15:34:57,574 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 8 selfloop transitions, 1 changer transitions 0/579 dead transitions. [2020-10-09 15:34:57,575 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 579 transitions, 1391 flow [2020-10-09 15:34:57,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1816 transitions. [2020-10-09 15:34:57,576 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9487983281086729 [2020-10-09 15:34:57,576 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1816 transitions. [2020-10-09 15:34:57,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1816 transitions. [2020-10-09 15:34:57,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:57,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1816 transitions. [2020-10-09 15:34:57,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:57,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:57,578 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:57,578 INFO L185 Difference]: Start difference. First operand has 629 places, 581 transitions, 1378 flow. Second operand 3 states and 1816 transitions. [2020-10-09 15:34:57,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 579 transitions, 1391 flow [2020-10-09 15:34:57,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 579 transitions, 1390 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:57,584 INFO L241 Difference]: Finished difference. Result has 628 places, 579 transitions, 1374 flow [2020-10-09 15:34:57,584 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1372, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1374, PETRI_PLACES=628, PETRI_TRANSITIONS=579} [2020-10-09 15:34:57,584 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 36 predicate places. [2020-10-09 15:34:57,584 INFO L481 AbstractCegarLoop]: Abstraction has has 628 places, 579 transitions, 1374 flow [2020-10-09 15:34:57,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:57,584 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:57,584 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:57,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 748 mathsat -unsat_core_generation=3 [2020-10-09 15:34:57,785 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:57,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:57,786 INFO L82 PathProgramCache]: Analyzing trace with hash 253936684, now seen corresponding path program 1 times [2020-10-09 15:34:57,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:57,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254008199] [2020-10-09 15:34:57,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 749 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 749 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:58,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:58,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:34:58,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:58,239 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:34:58,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254008199] [2020-10-09 15:34:58,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:58,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:58,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797351431] [2020-10-09 15:34:58,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:58,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:58,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:58,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:58,250 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:34:58,251 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 579 transitions, 1374 flow. Second operand 3 states. [2020-10-09 15:34:58,251 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:58,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:34:58,252 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:58,459 INFO L129 PetriNetUnfolder]: 37/682 cut-off events. [2020-10-09 15:34:58,459 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:34:58,494 INFO L80 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 682 events. 37/682 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2874 event pairs, 0 based on Foata normal form. 0/621 useless extension candidates. Maximal degree in co-relation 812. Up to 24 conditions per place. [2020-10-09 15:34:58,499 INFO L132 encePairwiseOnDemand]: 635/638 looper letters, 5 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2020-10-09 15:34:58,499 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 580 transitions, 1390 flow [2020-10-09 15:34:58,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:58,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:58,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1829 transitions. [2020-10-09 15:34:58,501 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9555903866248694 [2020-10-09 15:34:58,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1829 transitions. [2020-10-09 15:34:58,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1829 transitions. [2020-10-09 15:34:58,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:58,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1829 transitions. [2020-10-09 15:34:58,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:58,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:58,503 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:58,503 INFO L185 Difference]: Start difference. First operand has 628 places, 579 transitions, 1374 flow. Second operand 3 states and 1829 transitions. [2020-10-09 15:34:58,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 580 transitions, 1390 flow [2020-10-09 15:34:58,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 580 transitions, 1389 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:58,508 INFO L241 Difference]: Finished difference. Result has 631 places, 580 transitions, 1387 flow [2020-10-09 15:34:58,508 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1373, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1387, PETRI_PLACES=631, PETRI_TRANSITIONS=580} [2020-10-09 15:34:58,509 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 39 predicate places. [2020-10-09 15:34:58,509 INFO L481 AbstractCegarLoop]: Abstraction has has 631 places, 580 transitions, 1387 flow [2020-10-09 15:34:58,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:58,509 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:58,509 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:58,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 749 mathsat -unsat_core_generation=3 [2020-10-09 15:34:58,710 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:58,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:58,710 INFO L82 PathProgramCache]: Analyzing trace with hash 253935661, now seen corresponding path program 1 times [2020-10-09 15:34:58,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:58,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839457812] [2020-10-09 15:34:58,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 750 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 750 with mathsat -unsat_core_generation=3 [2020-10-09 15:34:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:34:59,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:34:59,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:34:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:34:59,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:34:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:34:59,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839457812] [2020-10-09 15:34:59,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:34:59,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:34:59,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335456133] [2020-10-09 15:34:59,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:34:59,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:34:59,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:34:59,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:34:59,189 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:34:59,190 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 580 transitions, 1387 flow. Second operand 3 states. [2020-10-09 15:34:59,190 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:34:59,190 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:34:59,190 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:34:59,407 INFO L129 PetriNetUnfolder]: 37/683 cut-off events. [2020-10-09 15:34:59,407 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:34:59,442 INFO L80 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 683 events. 37/683 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2883 event pairs, 0 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 820. Up to 24 conditions per place. [2020-10-09 15:34:59,447 INFO L132 encePairwiseOnDemand]: 634/638 looper letters, 9 selfloop transitions, 3 changer transitions 0/581 dead transitions. [2020-10-09 15:34:59,447 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 581 transitions, 1413 flow [2020-10-09 15:34:59,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:34:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:34:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1819 transitions. [2020-10-09 15:34:59,448 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503657262277951 [2020-10-09 15:34:59,448 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1819 transitions. [2020-10-09 15:34:59,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1819 transitions. [2020-10-09 15:34:59,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:34:59,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1819 transitions. [2020-10-09 15:34:59,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:34:59,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:34:59,450 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:34:59,450 INFO L185 Difference]: Start difference. First operand has 631 places, 580 transitions, 1387 flow. Second operand 3 states and 1819 transitions. [2020-10-09 15:34:59,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 581 transitions, 1413 flow [2020-10-09 15:34:59,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 581 transitions, 1411 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:34:59,456 INFO L241 Difference]: Finished difference. Result has 634 places, 581 transitions, 1403 flow [2020-10-09 15:34:59,456 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1385, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1403, PETRI_PLACES=634, PETRI_TRANSITIONS=581} [2020-10-09 15:34:59,456 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 42 predicate places. [2020-10-09 15:34:59,456 INFO L481 AbstractCegarLoop]: Abstraction has has 634 places, 581 transitions, 1403 flow [2020-10-09 15:34:59,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:34:59,456 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:34:59,456 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:34:59,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 750 mathsat -unsat_core_generation=3 [2020-10-09 15:34:59,657 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:34:59,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:34:59,658 INFO L82 PathProgramCache]: Analyzing trace with hash 254888973, now seen corresponding path program 1 times [2020-10-09 15:34:59,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:34:59,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725000144] [2020-10-09 15:34:59,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 751 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 751 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:00,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:35:00,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:00,116 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:35:00,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:35:00,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725000144] [2020-10-09 15:35:00,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:00,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:00,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840466385] [2020-10-09 15:35:00,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:00,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:00,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:00,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:00,133 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:35:00,134 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 581 transitions, 1403 flow. Second operand 3 states. [2020-10-09 15:35:00,135 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:00,135 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:35:00,135 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:00,340 INFO L129 PetriNetUnfolder]: 36/679 cut-off events. [2020-10-09 15:35:00,340 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:35:00,374 INFO L80 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 679 events. 36/679 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2855 event pairs, 0 based on Foata normal form. 1/622 useless extension candidates. Maximal degree in co-relation 812. Up to 24 conditions per place. [2020-10-09 15:35:00,378 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/578 dead transitions. [2020-10-09 15:35:00,379 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 578 transitions, 1398 flow [2020-10-09 15:35:00,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:35:00,380 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:35:00,380 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:35:00,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:35:00,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:00,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:35:00,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:00,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:00,382 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:00,382 INFO L185 Difference]: Start difference. First operand has 634 places, 581 transitions, 1403 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:35:00,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 578 transitions, 1398 flow [2020-10-09 15:35:00,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 578 transitions, 1390 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:35:00,388 INFO L241 Difference]: Finished difference. Result has 633 places, 578 transitions, 1382 flow [2020-10-09 15:35:00,388 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1380, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1382, PETRI_PLACES=633, PETRI_TRANSITIONS=578} [2020-10-09 15:35:00,388 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 41 predicate places. [2020-10-09 15:35:00,388 INFO L481 AbstractCegarLoop]: Abstraction has has 633 places, 578 transitions, 1382 flow [2020-10-09 15:35:00,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:00,388 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:00,388 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:00,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 751 mathsat -unsat_core_generation=3 [2020-10-09 15:35:00,589 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:00,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:00,589 INFO L82 PathProgramCache]: Analyzing trace with hash 254889996, now seen corresponding path program 1 times [2020-10-09 15:35:00,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:00,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955114587] [2020-10-09 15:35:00,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 752 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 752 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:01,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:01,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:35:01,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:35:01,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955114587] [2020-10-09 15:35:01,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:01,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:01,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802255938] [2020-10-09 15:35:01,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:01,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:01,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:01,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:01,105 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:35:01,106 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 578 transitions, 1382 flow. Second operand 3 states. [2020-10-09 15:35:01,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:01,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:35:01,106 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:01,317 INFO L129 PetriNetUnfolder]: 36/677 cut-off events. [2020-10-09 15:35:01,317 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:35:01,353 INFO L80 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 677 events. 36/677 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2841 event pairs, 0 based on Foata normal form. 0/618 useless extension candidates. Maximal degree in co-relation 816. Up to 24 conditions per place. [2020-10-09 15:35:01,357 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 8 selfloop transitions, 1 changer transitions 0/576 dead transitions. [2020-10-09 15:35:01,357 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 576 transitions, 1395 flow [2020-10-09 15:35:01,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:01,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:01,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1816 transitions. [2020-10-09 15:35:01,359 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9487983281086729 [2020-10-09 15:35:01,359 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1816 transitions. [2020-10-09 15:35:01,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1816 transitions. [2020-10-09 15:35:01,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:01,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1816 transitions. [2020-10-09 15:35:01,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:01,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:01,361 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:01,361 INFO L185 Difference]: Start difference. First operand has 633 places, 578 transitions, 1382 flow. Second operand 3 states and 1816 transitions. [2020-10-09 15:35:01,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 576 transitions, 1395 flow [2020-10-09 15:35:01,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 576 transitions, 1394 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:01,367 INFO L241 Difference]: Finished difference. Result has 632 places, 576 transitions, 1378 flow [2020-10-09 15:35:01,367 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1378, PETRI_PLACES=632, PETRI_TRANSITIONS=576} [2020-10-09 15:35:01,367 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 40 predicate places. [2020-10-09 15:35:01,367 INFO L481 AbstractCegarLoop]: Abstraction has has 632 places, 576 transitions, 1378 flow [2020-10-09 15:35:01,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:01,367 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:01,367 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:01,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 752 mathsat -unsat_core_generation=3 [2020-10-09 15:35:01,568 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:01,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:01,568 INFO L82 PathProgramCache]: Analyzing trace with hash 4149896, now seen corresponding path program 1 times [2020-10-09 15:35:01,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:01,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43002755] [2020-10-09 15:35:01,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 753 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 753 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:02,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:02,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:35:02,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:35:02,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43002755] [2020-10-09 15:35:02,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:02,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:02,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333183173] [2020-10-09 15:35:02,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:02,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:02,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:02,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:02,060 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:35:02,061 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 576 transitions, 1378 flow. Second operand 3 states. [2020-10-09 15:35:02,061 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:02,061 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:35:02,062 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:02,284 INFO L129 PetriNetUnfolder]: 35/685 cut-off events. [2020-10-09 15:35:02,284 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:35:02,320 INFO L80 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 685 events. 35/685 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2911 event pairs, 0 based on Foata normal form. 0/626 useless extension candidates. Maximal degree in co-relation 828. Up to 24 conditions per place. [2020-10-09 15:35:02,325 INFO L132 encePairwiseOnDemand]: 633/638 looper letters, 10 selfloop transitions, 3 changer transitions 0/578 dead transitions. [2020-10-09 15:35:02,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 578 transitions, 1408 flow [2020-10-09 15:35:02,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1821 transitions. [2020-10-09 15:35:02,326 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.95141065830721 [2020-10-09 15:35:02,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1821 transitions. [2020-10-09 15:35:02,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1821 transitions. [2020-10-09 15:35:02,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:02,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1821 transitions. [2020-10-09 15:35:02,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:02,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:02,328 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:02,328 INFO L185 Difference]: Start difference. First operand has 632 places, 576 transitions, 1378 flow. Second operand 3 states and 1821 transitions. [2020-10-09 15:35:02,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 578 transitions, 1408 flow [2020-10-09 15:35:02,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 578 transitions, 1407 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:02,334 INFO L241 Difference]: Finished difference. Result has 635 places, 578 transitions, 1401 flow [2020-10-09 15:35:02,334 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1401, PETRI_PLACES=635, PETRI_TRANSITIONS=578} [2020-10-09 15:35:02,334 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 43 predicate places. [2020-10-09 15:35:02,335 INFO L481 AbstractCegarLoop]: Abstraction has has 635 places, 578 transitions, 1401 flow [2020-10-09 15:35:02,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:02,335 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:02,335 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:02,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 753 mathsat -unsat_core_generation=3 [2020-10-09 15:35:02,536 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:02,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:02,536 INFO L82 PathProgramCache]: Analyzing trace with hash 4148873, now seen corresponding path program 1 times [2020-10-09 15:35:02,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:02,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059840444] [2020-10-09 15:35:02,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 754 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 754 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:02,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:35:02,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:35:02,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:02,995 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:35:02,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059840444] [2020-10-09 15:35:02,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:02,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:02,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198241235] [2020-10-09 15:35:02,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:02,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:02,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:02,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:03,009 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:35:03,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 578 transitions, 1401 flow. Second operand 3 states. [2020-10-09 15:35:03,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:03,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:35:03,011 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:03,220 INFO L129 PetriNetUnfolder]: 33/686 cut-off events. [2020-10-09 15:35:03,220 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:35:03,256 INFO L80 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 686 events. 33/686 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2937 event pairs, 0 based on Foata normal form. 1/632 useless extension candidates. Maximal degree in co-relation 826. Up to 24 conditions per place. [2020-10-09 15:35:03,260 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/577 dead transitions. [2020-10-09 15:35:03,260 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 577 transitions, 1407 flow [2020-10-09 15:35:03,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:35:03,262 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:35:03,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:35:03,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:35:03,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:03,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:35:03,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:03,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:03,264 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:03,264 INFO L185 Difference]: Start difference. First operand has 635 places, 578 transitions, 1401 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:35:03,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 577 transitions, 1407 flow [2020-10-09 15:35:03,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 577 transitions, 1402 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:03,270 INFO L241 Difference]: Finished difference. Result has 637 places, 577 transitions, 1397 flow [2020-10-09 15:35:03,270 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1397, PETRI_PLACES=637, PETRI_TRANSITIONS=577} [2020-10-09 15:35:03,270 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 45 predicate places. [2020-10-09 15:35:03,270 INFO L481 AbstractCegarLoop]: Abstraction has has 637 places, 577 transitions, 1397 flow [2020-10-09 15:35:03,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:03,270 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:03,270 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:03,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 754 mathsat -unsat_core_generation=3 [2020-10-09 15:35:03,471 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:03,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:03,471 INFO L82 PathProgramCache]: Analyzing trace with hash 3196584, now seen corresponding path program 1 times [2020-10-09 15:35:03,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:03,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642665487] [2020-10-09 15:35:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 755 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 755 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:03,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:03,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:03,913 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:35:03,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:03,916 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:35:03,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642665487] [2020-10-09 15:35:03,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:03,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:03,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174911221] [2020-10-09 15:35:03,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:03,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:03,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:03,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:03,926 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:35:03,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 577 transitions, 1397 flow. Second operand 3 states. [2020-10-09 15:35:03,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:03,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:35:03,928 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:04,133 INFO L129 PetriNetUnfolder]: 33/679 cut-off events. [2020-10-09 15:35:04,133 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:35:04,236 INFO L80 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 679 events. 33/679 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2870 event pairs, 0 based on Foata normal form. 1/625 useless extension candidates. Maximal degree in co-relation 822. Up to 24 conditions per place. [2020-10-09 15:35:04,240 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 5 selfloop transitions, 1 changer transitions 0/575 dead transitions. [2020-10-09 15:35:04,240 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 575 transitions, 1400 flow [2020-10-09 15:35:04,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:04,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2020-10-09 15:35:04,241 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955067920585162 [2020-10-09 15:35:04,241 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2020-10-09 15:35:04,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2020-10-09 15:35:04,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:04,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2020-10-09 15:35:04,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:04,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:04,243 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:04,243 INFO L185 Difference]: Start difference. First operand has 637 places, 577 transitions, 1397 flow. Second operand 3 states and 1828 transitions. [2020-10-09 15:35:04,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 575 transitions, 1400 flow [2020-10-09 15:35:04,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 575 transitions, 1393 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:35:04,249 INFO L241 Difference]: Finished difference. Result has 637 places, 575 transitions, 1386 flow [2020-10-09 15:35:04,249 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1386, PETRI_PLACES=637, PETRI_TRANSITIONS=575} [2020-10-09 15:35:04,249 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 45 predicate places. [2020-10-09 15:35:04,249 INFO L481 AbstractCegarLoop]: Abstraction has has 637 places, 575 transitions, 1386 flow [2020-10-09 15:35:04,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:04,249 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:04,250 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:04,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 755 mathsat -unsat_core_generation=3 [2020-10-09 15:35:04,450 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:04,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:04,451 INFO L82 PathProgramCache]: Analyzing trace with hash 3195561, now seen corresponding path program 1 times [2020-10-09 15:35:04,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:04,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684884658] [2020-10-09 15:35:04,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 756 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 756 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:04,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:04,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:35:04,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:35:04,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684884658] [2020-10-09 15:35:04,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:04,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:04,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779990260] [2020-10-09 15:35:04,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:04,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:04,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:04,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:04,941 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:35:04,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 575 transitions, 1386 flow. Second operand 3 states. [2020-10-09 15:35:04,942 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:04,942 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:35:04,942 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:05,160 INFO L129 PetriNetUnfolder]: 33/677 cut-off events. [2020-10-09 15:35:05,160 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:05,196 INFO L80 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 677 events. 33/677 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2859 event pairs, 0 based on Foata normal form. 0/621 useless extension candidates. Maximal degree in co-relation 822. Up to 24 conditions per place. [2020-10-09 15:35:05,200 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 8 selfloop transitions, 1 changer transitions 0/573 dead transitions. [2020-10-09 15:35:05,200 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 573 transitions, 1399 flow [2020-10-09 15:35:05,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1816 transitions. [2020-10-09 15:35:05,201 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9487983281086729 [2020-10-09 15:35:05,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1816 transitions. [2020-10-09 15:35:05,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1816 transitions. [2020-10-09 15:35:05,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:05,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1816 transitions. [2020-10-09 15:35:05,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:05,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:05,203 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:05,203 INFO L185 Difference]: Start difference. First operand has 637 places, 575 transitions, 1386 flow. Second operand 3 states and 1816 transitions. [2020-10-09 15:35:05,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 573 transitions, 1399 flow [2020-10-09 15:35:05,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 573 transitions, 1398 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:05,209 INFO L241 Difference]: Finished difference. Result has 636 places, 573 transitions, 1382 flow [2020-10-09 15:35:05,209 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1380, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1382, PETRI_PLACES=636, PETRI_TRANSITIONS=573} [2020-10-09 15:35:05,209 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 44 predicate places. [2020-10-09 15:35:05,209 INFO L481 AbstractCegarLoop]: Abstraction has has 636 places, 573 transitions, 1382 flow [2020-10-09 15:35:05,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:05,210 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:05,210 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:05,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 756 mathsat -unsat_core_generation=3 [2020-10-09 15:35:05,410 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:05,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:05,411 INFO L82 PathProgramCache]: Analyzing trace with hash -317370107, now seen corresponding path program 1 times [2020-10-09 15:35:05,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:05,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662305414] [2020-10-09 15:35:05,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 757 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 757 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:05,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:05,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:35:05,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:35:05,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662305414] [2020-10-09 15:35:05,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:05,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:05,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447424976] [2020-10-09 15:35:05,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:05,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:05,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:05,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:05,904 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:35:05,905 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 573 transitions, 1382 flow. Second operand 3 states. [2020-10-09 15:35:05,906 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:05,906 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:35:05,906 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:06,124 INFO L129 PetriNetUnfolder]: 32/685 cut-off events. [2020-10-09 15:35:06,124 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:35:06,160 INFO L80 FinitePrefix]: Finished finitePrefix Result has 889 conditions, 685 events. 32/685 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2927 event pairs, 0 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 834. Up to 24 conditions per place. [2020-10-09 15:35:06,165 INFO L132 encePairwiseOnDemand]: 633/638 looper letters, 10 selfloop transitions, 3 changer transitions 0/575 dead transitions. [2020-10-09 15:35:06,165 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 575 transitions, 1412 flow [2020-10-09 15:35:06,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1821 transitions. [2020-10-09 15:35:06,166 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.95141065830721 [2020-10-09 15:35:06,166 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1821 transitions. [2020-10-09 15:35:06,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1821 transitions. [2020-10-09 15:35:06,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:06,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1821 transitions. [2020-10-09 15:35:06,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:06,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:06,168 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:06,168 INFO L185 Difference]: Start difference. First operand has 636 places, 573 transitions, 1382 flow. Second operand 3 states and 1821 transitions. [2020-10-09 15:35:06,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 575 transitions, 1412 flow [2020-10-09 15:35:06,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 575 transitions, 1411 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:06,174 INFO L241 Difference]: Finished difference. Result has 639 places, 575 transitions, 1405 flow [2020-10-09 15:35:06,174 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1405, PETRI_PLACES=639, PETRI_TRANSITIONS=575} [2020-10-09 15:35:06,175 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 47 predicate places. [2020-10-09 15:35:06,175 INFO L481 AbstractCegarLoop]: Abstraction has has 639 places, 575 transitions, 1405 flow [2020-10-09 15:35:06,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:06,175 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:06,175 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:06,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 757 mathsat -unsat_core_generation=3 [2020-10-09 15:35:06,376 INFO L429 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:06,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:06,376 INFO L82 PathProgramCache]: Analyzing trace with hash -317371130, now seen corresponding path program 1 times [2020-10-09 15:35:06,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:06,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519848415] [2020-10-09 15:35:06,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 758 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 758 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:06,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:35:06,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:35:06,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:35:06,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519848415] [2020-10-09 15:35:06,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:06,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:06,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216341298] [2020-10-09 15:35:06,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:06,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:06,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:06,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:06,856 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:35:06,857 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 575 transitions, 1405 flow. Second operand 3 states. [2020-10-09 15:35:06,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:06,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:35:06,858 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:07,085 INFO L129 PetriNetUnfolder]: 30/686 cut-off events. [2020-10-09 15:35:07,085 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:35:07,123 INFO L80 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 686 events. 30/686 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2954 event pairs, 0 based on Foata normal form. 1/635 useless extension candidates. Maximal degree in co-relation 832. Up to 24 conditions per place. [2020-10-09 15:35:07,127 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/574 dead transitions. [2020-10-09 15:35:07,127 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 574 transitions, 1411 flow [2020-10-09 15:35:07,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:07,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:35:07,128 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:35:07,128 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:35:07,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:35:07,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:07,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:35:07,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:07,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:07,130 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:07,130 INFO L185 Difference]: Start difference. First operand has 639 places, 575 transitions, 1405 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:35:07,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 641 places, 574 transitions, 1411 flow [2020-10-09 15:35:07,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 574 transitions, 1406 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:07,136 INFO L241 Difference]: Finished difference. Result has 641 places, 574 transitions, 1401 flow [2020-10-09 15:35:07,137 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1401, PETRI_PLACES=641, PETRI_TRANSITIONS=574} [2020-10-09 15:35:07,137 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 49 predicate places. [2020-10-09 15:35:07,137 INFO L481 AbstractCegarLoop]: Abstraction has has 641 places, 574 transitions, 1401 flow [2020-10-09 15:35:07,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:07,137 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:07,137 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:07,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 758 mathsat -unsat_core_generation=3 [2020-10-09 15:35:07,338 INFO L429 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:07,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:07,338 INFO L82 PathProgramCache]: Analyzing trace with hash -318323419, now seen corresponding path program 1 times [2020-10-09 15:35:07,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:07,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730098036] [2020-10-09 15:35:07,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 759 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 759 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:07,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:07,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:35:07,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:35:07,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730098036] [2020-10-09 15:35:07,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:07,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:07,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960300736] [2020-10-09 15:35:07,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:07,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:07,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:07,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:07,807 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:35:07,808 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 641 places, 574 transitions, 1401 flow. Second operand 3 states. [2020-10-09 15:35:07,808 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:07,809 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:35:07,809 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:08,082 INFO L129 PetriNetUnfolder]: 30/679 cut-off events. [2020-10-09 15:35:08,082 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:35:08,109 INFO L80 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 679 events. 30/679 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2887 event pairs, 0 based on Foata normal form. 1/628 useless extension candidates. Maximal degree in co-relation 828. Up to 24 conditions per place. [2020-10-09 15:35:08,113 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 5 selfloop transitions, 1 changer transitions 0/572 dead transitions. [2020-10-09 15:35:08,113 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 572 transitions, 1404 flow [2020-10-09 15:35:08,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:08,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:08,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2020-10-09 15:35:08,114 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955067920585162 [2020-10-09 15:35:08,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2020-10-09 15:35:08,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2020-10-09 15:35:08,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:08,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2020-10-09 15:35:08,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:08,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:08,116 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:08,116 INFO L185 Difference]: Start difference. First operand has 641 places, 574 transitions, 1401 flow. Second operand 3 states and 1828 transitions. [2020-10-09 15:35:08,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 572 transitions, 1404 flow [2020-10-09 15:35:08,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 572 transitions, 1397 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:35:08,122 INFO L241 Difference]: Finished difference. Result has 641 places, 572 transitions, 1390 flow [2020-10-09 15:35:08,122 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1385, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1390, PETRI_PLACES=641, PETRI_TRANSITIONS=572} [2020-10-09 15:35:08,122 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 49 predicate places. [2020-10-09 15:35:08,122 INFO L481 AbstractCegarLoop]: Abstraction has has 641 places, 572 transitions, 1390 flow [2020-10-09 15:35:08,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:08,122 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:08,122 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:08,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 759 mathsat -unsat_core_generation=3 [2020-10-09 15:35:08,323 INFO L429 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:08,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:08,324 INFO L82 PathProgramCache]: Analyzing trace with hash -318324442, now seen corresponding path program 1 times [2020-10-09 15:35:08,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:08,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210727382] [2020-10-09 15:35:08,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 760 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 760 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:08,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:08,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:35:08,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:35:08,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210727382] [2020-10-09 15:35:08,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:08,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:08,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406371343] [2020-10-09 15:35:08,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:08,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:08,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:08,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:08,819 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:35:08,820 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 641 places, 572 transitions, 1390 flow. Second operand 3 states. [2020-10-09 15:35:08,820 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:08,820 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:35:08,820 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:09,034 INFO L129 PetriNetUnfolder]: 30/677 cut-off events. [2020-10-09 15:35:09,034 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:09,072 INFO L80 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 677 events. 30/677 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2875 event pairs, 0 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 828. Up to 24 conditions per place. [2020-10-09 15:35:09,076 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 8 selfloop transitions, 1 changer transitions 0/570 dead transitions. [2020-10-09 15:35:09,076 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 570 transitions, 1403 flow [2020-10-09 15:35:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1816 transitions. [2020-10-09 15:35:09,077 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9487983281086729 [2020-10-09 15:35:09,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1816 transitions. [2020-10-09 15:35:09,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1816 transitions. [2020-10-09 15:35:09,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:09,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1816 transitions. [2020-10-09 15:35:09,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:09,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:09,079 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:09,079 INFO L185 Difference]: Start difference. First operand has 641 places, 572 transitions, 1390 flow. Second operand 3 states and 1816 transitions. [2020-10-09 15:35:09,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 641 places, 570 transitions, 1403 flow [2020-10-09 15:35:09,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 570 transitions, 1402 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:09,085 INFO L241 Difference]: Finished difference. Result has 640 places, 570 transitions, 1386 flow [2020-10-09 15:35:09,086 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1386, PETRI_PLACES=640, PETRI_TRANSITIONS=570} [2020-10-09 15:35:09,086 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 48 predicate places. [2020-10-09 15:35:09,086 INFO L481 AbstractCegarLoop]: Abstraction has has 640 places, 570 transitions, 1386 flow [2020-10-09 15:35:09,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:09,086 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:09,086 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:09,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 760 mathsat -unsat_core_generation=3 [2020-10-09 15:35:09,287 INFO L429 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:09,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:09,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1463775996, now seen corresponding path program 1 times [2020-10-09 15:35:09,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:09,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937338010] [2020-10-09 15:35:09,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 761 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 761 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:09,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:35:09,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:35:09,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:35:09,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937338010] [2020-10-09 15:35:09,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:09,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:09,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508805642] [2020-10-09 15:35:09,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:09,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:09,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:09,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:09,768 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:35:09,769 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 570 transitions, 1386 flow. Second operand 3 states. [2020-10-09 15:35:09,769 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:09,769 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:35:09,769 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:09,984 INFO L129 PetriNetUnfolder]: 29/684 cut-off events. [2020-10-09 15:35:09,984 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:35:10,022 INFO L80 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 684 events. 29/684 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2936 event pairs, 0 based on Foata normal form. 1/633 useless extension candidates. Maximal degree in co-relation 831. Up to 24 conditions per place. [2020-10-09 15:35:10,026 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/570 dead transitions. [2020-10-09 15:35:10,026 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 570 transitions, 1396 flow [2020-10-09 15:35:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:35:10,028 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:35:10,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:35:10,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:35:10,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:10,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:35:10,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:10,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:10,030 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:10,030 INFO L185 Difference]: Start difference. First operand has 640 places, 570 transitions, 1386 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:35:10,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 570 transitions, 1396 flow [2020-10-09 15:35:10,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 570 transitions, 1395 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:10,036 INFO L241 Difference]: Finished difference. Result has 642 places, 570 transitions, 1390 flow [2020-10-09 15:35:10,036 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1385, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1390, PETRI_PLACES=642, PETRI_TRANSITIONS=570} [2020-10-09 15:35:10,036 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 50 predicate places. [2020-10-09 15:35:10,036 INFO L481 AbstractCegarLoop]: Abstraction has has 642 places, 570 transitions, 1390 flow [2020-10-09 15:35:10,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:10,036 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:10,036 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:10,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 761 mathsat -unsat_core_generation=3 [2020-10-09 15:35:10,237 INFO L429 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:10,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:10,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1463774973, now seen corresponding path program 1 times [2020-10-09 15:35:10,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:10,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290864606] [2020-10-09 15:35:10,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 762 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 762 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:10,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:10,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:10,703 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:35:10,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:35:10,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290864606] [2020-10-09 15:35:10,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:10,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:10,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567938771] [2020-10-09 15:35:10,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:10,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:10,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:10,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:10,735 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:35:10,736 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 570 transitions, 1390 flow. Second operand 3 states. [2020-10-09 15:35:10,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:10,737 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:35:10,737 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:10,953 INFO L129 PetriNetUnfolder]: 27/686 cut-off events. [2020-10-09 15:35:10,953 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:10,989 INFO L80 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 686 events. 27/686 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2970 event pairs, 0 based on Foata normal form. 0/634 useless extension candidates. Maximal degree in co-relation 844. Up to 24 conditions per place. [2020-10-09 15:35:10,993 INFO L132 encePairwiseOnDemand]: 634/638 looper letters, 9 selfloop transitions, 3 changer transitions 0/571 dead transitions. [2020-10-09 15:35:10,993 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 644 places, 571 transitions, 1416 flow [2020-10-09 15:35:10,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1819 transitions. [2020-10-09 15:35:10,994 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503657262277951 [2020-10-09 15:35:10,995 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1819 transitions. [2020-10-09 15:35:10,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1819 transitions. [2020-10-09 15:35:10,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:10,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1819 transitions. [2020-10-09 15:35:10,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:10,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:10,997 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:10,997 INFO L185 Difference]: Start difference. First operand has 642 places, 570 transitions, 1390 flow. Second operand 3 states and 1819 transitions. [2020-10-09 15:35:10,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 644 places, 571 transitions, 1416 flow [2020-10-09 15:35:11,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 571 transitions, 1415 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:11,003 INFO L241 Difference]: Finished difference. Result has 645 places, 571 transitions, 1407 flow [2020-10-09 15:35:11,004 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1407, PETRI_PLACES=645, PETRI_TRANSITIONS=571} [2020-10-09 15:35:11,004 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 53 predicate places. [2020-10-09 15:35:11,004 INFO L481 AbstractCegarLoop]: Abstraction has has 645 places, 571 transitions, 1407 flow [2020-10-09 15:35:11,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:11,004 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:11,004 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:11,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 762 mathsat -unsat_core_generation=3 [2020-10-09 15:35:11,205 INFO L429 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:11,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:11,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1464728285, now seen corresponding path program 1 times [2020-10-09 15:35:11,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:11,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299090848] [2020-10-09 15:35:11,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 763 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 763 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:11,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:11,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:11,710 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:35:11,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:35:11,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299090848] [2020-10-09 15:35:11,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:11,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:11,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948657107] [2020-10-09 15:35:11,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:11,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:11,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:11,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:11,733 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:35:11,734 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 571 transitions, 1407 flow. Second operand 3 states. [2020-10-09 15:35:11,734 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:11,734 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:35:11,734 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:11,958 INFO L129 PetriNetUnfolder]: 27/679 cut-off events. [2020-10-09 15:35:11,958 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:35:11,995 INFO L80 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 679 events. 27/679 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2908 event pairs, 0 based on Foata normal form. 1/631 useless extension candidates. Maximal degree in co-relation 830. Up to 24 conditions per place. [2020-10-09 15:35:12,001 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 5 selfloop transitions, 1 changer transitions 0/569 dead transitions. [2020-10-09 15:35:12,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 569 transitions, 1409 flow [2020-10-09 15:35:12,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2020-10-09 15:35:12,006 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955067920585162 [2020-10-09 15:35:12,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2020-10-09 15:35:12,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2020-10-09 15:35:12,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:12,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2020-10-09 15:35:12,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:12,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:12,009 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:12,009 INFO L185 Difference]: Start difference. First operand has 645 places, 571 transitions, 1407 flow. Second operand 3 states and 1828 transitions. [2020-10-09 15:35:12,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 569 transitions, 1409 flow [2020-10-09 15:35:12,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 644 places, 569 transitions, 1401 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:35:12,016 INFO L241 Difference]: Finished difference. Result has 645 places, 569 transitions, 1394 flow [2020-10-09 15:35:12,016 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1394, PETRI_PLACES=645, PETRI_TRANSITIONS=569} [2020-10-09 15:35:12,016 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 53 predicate places. [2020-10-09 15:35:12,017 INFO L481 AbstractCegarLoop]: Abstraction has has 645 places, 569 transitions, 1394 flow [2020-10-09 15:35:12,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:12,017 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:12,017 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:12,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 763 mathsat -unsat_core_generation=3 [2020-10-09 15:35:12,217 INFO L429 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:12,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:12,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1464729308, now seen corresponding path program 1 times [2020-10-09 15:35:12,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:12,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316621971] [2020-10-09 15:35:12,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 764 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 764 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:12,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:12,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:12,676 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:35:12,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:35:12,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316621971] [2020-10-09 15:35:12,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:12,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:12,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770074119] [2020-10-09 15:35:12,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:12,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:12,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:12,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:12,709 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:35:12,710 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 569 transitions, 1394 flow. Second operand 3 states. [2020-10-09 15:35:12,710 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:12,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:35:12,711 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:12,921 INFO L129 PetriNetUnfolder]: 27/677 cut-off events. [2020-10-09 15:35:12,922 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:12,957 INFO L80 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 677 events. 27/677 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2894 event pairs, 0 based on Foata normal form. 0/627 useless extension candidates. Maximal degree in co-relation 834. Up to 24 conditions per place. [2020-10-09 15:35:12,962 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 8 selfloop transitions, 1 changer transitions 0/567 dead transitions. [2020-10-09 15:35:12,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 567 transitions, 1407 flow [2020-10-09 15:35:12,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:12,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1816 transitions. [2020-10-09 15:35:12,964 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9487983281086729 [2020-10-09 15:35:12,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1816 transitions. [2020-10-09 15:35:12,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1816 transitions. [2020-10-09 15:35:12,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:12,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1816 transitions. [2020-10-09 15:35:12,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:12,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:12,966 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:12,966 INFO L185 Difference]: Start difference. First operand has 645 places, 569 transitions, 1394 flow. Second operand 3 states and 1816 transitions. [2020-10-09 15:35:12,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 567 transitions, 1407 flow [2020-10-09 15:35:12,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 644 places, 567 transitions, 1406 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:12,972 INFO L241 Difference]: Finished difference. Result has 644 places, 567 transitions, 1390 flow [2020-10-09 15:35:12,972 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1390, PETRI_PLACES=644, PETRI_TRANSITIONS=567} [2020-10-09 15:35:12,972 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 52 predicate places. [2020-10-09 15:35:12,972 INFO L481 AbstractCegarLoop]: Abstraction has has 644 places, 567 transitions, 1390 flow [2020-10-09 15:35:12,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:12,972 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:12,972 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:13,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 764 mathsat -unsat_core_generation=3 [2020-10-09 15:35:13,173 INFO L429 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:13,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:13,174 INFO L82 PathProgramCache]: Analyzing trace with hash 894948867, now seen corresponding path program 1 times [2020-10-09 15:35:13,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:13,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62613000] [2020-10-09 15:35:13,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 765 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 765 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:13,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:35:13,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:35:13,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:35:13,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62613000] [2020-10-09 15:35:13,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:13,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:13,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667799326] [2020-10-09 15:35:13,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:13,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:13,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:13,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:13,655 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:35:13,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 567 transitions, 1390 flow. Second operand 3 states. [2020-10-09 15:35:13,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:13,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:35:13,657 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:13,875 INFO L129 PetriNetUnfolder]: 26/684 cut-off events. [2020-10-09 15:35:13,875 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:35:13,913 INFO L80 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 684 events. 26/684 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2953 event pairs, 0 based on Foata normal form. 1/636 useless extension candidates. Maximal degree in co-relation 837. Up to 24 conditions per place. [2020-10-09 15:35:13,917 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/567 dead transitions. [2020-10-09 15:35:13,917 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 567 transitions, 1400 flow [2020-10-09 15:35:13,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:35:13,918 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:35:13,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:35:13,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:35:13,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:13,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:35:13,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:13,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:13,920 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:13,920 INFO L185 Difference]: Start difference. First operand has 644 places, 567 transitions, 1390 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:35:13,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 567 transitions, 1400 flow [2020-10-09 15:35:13,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 567 transitions, 1399 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:13,926 INFO L241 Difference]: Finished difference. Result has 646 places, 567 transitions, 1394 flow [2020-10-09 15:35:13,927 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1394, PETRI_PLACES=646, PETRI_TRANSITIONS=567} [2020-10-09 15:35:13,927 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 54 predicate places. [2020-10-09 15:35:13,927 INFO L481 AbstractCegarLoop]: Abstraction has has 646 places, 567 transitions, 1394 flow [2020-10-09 15:35:13,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:13,927 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:13,927 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:14,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 765 mathsat -unsat_core_generation=3 [2020-10-09 15:35:14,128 INFO L429 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:14,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:14,128 INFO L82 PathProgramCache]: Analyzing trace with hash 894949890, now seen corresponding path program 1 times [2020-10-09 15:35:14,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:14,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895075201] [2020-10-09 15:35:14,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 766 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 766 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:14,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:14,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:14,586 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:35:14,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:14,590 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:35:14,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895075201] [2020-10-09 15:35:14,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:14,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:14,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149863146] [2020-10-09 15:35:14,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:14,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:14,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:14,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:14,610 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:35:14,611 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 567 transitions, 1394 flow. Second operand 3 states. [2020-10-09 15:35:14,611 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:14,612 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:35:14,612 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:14,836 INFO L129 PetriNetUnfolder]: 24/686 cut-off events. [2020-10-09 15:35:14,836 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:14,872 INFO L80 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 686 events. 24/686 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2988 event pairs, 0 based on Foata normal form. 0/637 useless extension candidates. Maximal degree in co-relation 850. Up to 24 conditions per place. [2020-10-09 15:35:14,876 INFO L132 encePairwiseOnDemand]: 634/638 looper letters, 9 selfloop transitions, 3 changer transitions 0/568 dead transitions. [2020-10-09 15:35:14,876 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 568 transitions, 1420 flow [2020-10-09 15:35:14,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1819 transitions. [2020-10-09 15:35:14,877 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503657262277951 [2020-10-09 15:35:14,877 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1819 transitions. [2020-10-09 15:35:14,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1819 transitions. [2020-10-09 15:35:14,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:14,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1819 transitions. [2020-10-09 15:35:14,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:14,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:14,880 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:14,880 INFO L185 Difference]: Start difference. First operand has 646 places, 567 transitions, 1394 flow. Second operand 3 states and 1819 transitions. [2020-10-09 15:35:14,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 568 transitions, 1420 flow [2020-10-09 15:35:14,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 568 transitions, 1419 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:14,886 INFO L241 Difference]: Finished difference. Result has 649 places, 568 transitions, 1411 flow [2020-10-09 15:35:14,887 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1393, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1411, PETRI_PLACES=649, PETRI_TRANSITIONS=568} [2020-10-09 15:35:14,887 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 57 predicate places. [2020-10-09 15:35:14,887 INFO L481 AbstractCegarLoop]: Abstraction has has 649 places, 568 transitions, 1411 flow [2020-10-09 15:35:14,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:14,887 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:14,887 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:15,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 766 mathsat -unsat_core_generation=3 [2020-10-09 15:35:15,088 INFO L429 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:15,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:15,088 INFO L82 PathProgramCache]: Analyzing trace with hash 893996578, now seen corresponding path program 1 times [2020-10-09 15:35:15,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:15,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346414357] [2020-10-09 15:35:15,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 767 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 767 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:15,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:15,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:35:15,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:35:15,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346414357] [2020-10-09 15:35:15,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:15,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:15,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589630424] [2020-10-09 15:35:15,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:15,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:15,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:15,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:15,605 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:35:15,606 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 568 transitions, 1411 flow. Second operand 3 states. [2020-10-09 15:35:15,606 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:15,606 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:35:15,606 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:15,822 INFO L129 PetriNetUnfolder]: 24/679 cut-off events. [2020-10-09 15:35:15,822 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:35:15,857 INFO L80 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 679 events. 24/679 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2927 event pairs, 0 based on Foata normal form. 1/634 useless extension candidates. Maximal degree in co-relation 836. Up to 24 conditions per place. [2020-10-09 15:35:15,861 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 5 selfloop transitions, 1 changer transitions 0/566 dead transitions. [2020-10-09 15:35:15,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 566 transitions, 1413 flow [2020-10-09 15:35:15,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:15,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2020-10-09 15:35:15,862 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955067920585162 [2020-10-09 15:35:15,863 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2020-10-09 15:35:15,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2020-10-09 15:35:15,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:15,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2020-10-09 15:35:15,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:15,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:15,865 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:15,865 INFO L185 Difference]: Start difference. First operand has 649 places, 568 transitions, 1411 flow. Second operand 3 states and 1828 transitions. [2020-10-09 15:35:15,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 566 transitions, 1413 flow [2020-10-09 15:35:15,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 566 transitions, 1405 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:35:15,871 INFO L241 Difference]: Finished difference. Result has 649 places, 566 transitions, 1398 flow [2020-10-09 15:35:15,871 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1393, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1398, PETRI_PLACES=649, PETRI_TRANSITIONS=566} [2020-10-09 15:35:15,871 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 57 predicate places. [2020-10-09 15:35:15,872 INFO L481 AbstractCegarLoop]: Abstraction has has 649 places, 566 transitions, 1398 flow [2020-10-09 15:35:15,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:15,872 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:15,872 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:16,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 767 mathsat -unsat_core_generation=3 [2020-10-09 15:35:16,073 INFO L429 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:16,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:16,073 INFO L82 PathProgramCache]: Analyzing trace with hash 893995555, now seen corresponding path program 1 times [2020-10-09 15:35:16,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:16,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353650670] [2020-10-09 15:35:16,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 768 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 768 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:16,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:16,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:35:16,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:35:16,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353650670] [2020-10-09 15:35:16,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:16,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:16,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43759031] [2020-10-09 15:35:16,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:16,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:16,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:16,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:16,552 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:35:16,553 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 566 transitions, 1398 flow. Second operand 3 states. [2020-10-09 15:35:16,553 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:16,553 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:35:16,554 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:16,774 INFO L129 PetriNetUnfolder]: 24/677 cut-off events. [2020-10-09 15:35:16,774 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:16,811 INFO L80 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 677 events. 24/677 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2911 event pairs, 0 based on Foata normal form. 0/630 useless extension candidates. Maximal degree in co-relation 840. Up to 24 conditions per place. [2020-10-09 15:35:16,814 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 8 selfloop transitions, 1 changer transitions 0/564 dead transitions. [2020-10-09 15:35:16,814 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 564 transitions, 1411 flow [2020-10-09 15:35:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1816 transitions. [2020-10-09 15:35:16,816 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9487983281086729 [2020-10-09 15:35:16,816 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1816 transitions. [2020-10-09 15:35:16,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1816 transitions. [2020-10-09 15:35:16,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:16,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1816 transitions. [2020-10-09 15:35:16,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:16,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:16,818 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:16,818 INFO L185 Difference]: Start difference. First operand has 649 places, 566 transitions, 1398 flow. Second operand 3 states and 1816 transitions. [2020-10-09 15:35:16,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 564 transitions, 1411 flow [2020-10-09 15:35:16,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 564 transitions, 1410 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:16,824 INFO L241 Difference]: Finished difference. Result has 648 places, 564 transitions, 1394 flow [2020-10-09 15:35:16,824 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1394, PETRI_PLACES=648, PETRI_TRANSITIONS=564} [2020-10-09 15:35:16,824 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 56 predicate places. [2020-10-09 15:35:16,824 INFO L481 AbstractCegarLoop]: Abstraction has has 648 places, 564 transitions, 1394 flow [2020-10-09 15:35:16,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:16,824 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:16,825 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:17,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 768 mathsat -unsat_core_generation=3 [2020-10-09 15:35:17,025 INFO L429 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:17,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:17,026 INFO L82 PathProgramCache]: Analyzing trace with hash 76484482, now seen corresponding path program 1 times [2020-10-09 15:35:17,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:17,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863540429] [2020-10-09 15:35:17,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 769 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 769 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:17,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:17,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:35:17,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:35:17,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863540429] [2020-10-09 15:35:17,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:17,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:17,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606561589] [2020-10-09 15:35:17,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:17,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:17,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:17,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:17,530 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:35:17,531 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 564 transitions, 1394 flow. Second operand 3 states. [2020-10-09 15:35:17,532 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:17,532 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:35:17,532 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:17,766 INFO L129 PetriNetUnfolder]: 23/685 cut-off events. [2020-10-09 15:35:17,766 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:35:17,804 INFO L80 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 685 events. 23/685 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2980 event pairs, 0 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 852. Up to 24 conditions per place. [2020-10-09 15:35:17,809 INFO L132 encePairwiseOnDemand]: 633/638 looper letters, 10 selfloop transitions, 3 changer transitions 0/566 dead transitions. [2020-10-09 15:35:17,810 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 566 transitions, 1424 flow [2020-10-09 15:35:17,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1821 transitions. [2020-10-09 15:35:17,820 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.95141065830721 [2020-10-09 15:35:17,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1821 transitions. [2020-10-09 15:35:17,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1821 transitions. [2020-10-09 15:35:17,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:17,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1821 transitions. [2020-10-09 15:35:17,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:17,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:17,823 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:17,823 INFO L185 Difference]: Start difference. First operand has 648 places, 564 transitions, 1394 flow. Second operand 3 states and 1821 transitions. [2020-10-09 15:35:17,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 566 transitions, 1424 flow [2020-10-09 15:35:17,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 566 transitions, 1423 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:17,833 INFO L241 Difference]: Finished difference. Result has 651 places, 566 transitions, 1417 flow [2020-10-09 15:35:17,834 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1393, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1417, PETRI_PLACES=651, PETRI_TRANSITIONS=566} [2020-10-09 15:35:17,834 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 59 predicate places. [2020-10-09 15:35:17,834 INFO L481 AbstractCegarLoop]: Abstraction has has 651 places, 566 transitions, 1417 flow [2020-10-09 15:35:17,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:17,834 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:17,834 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:18,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 769 mathsat -unsat_core_generation=3 [2020-10-09 15:35:18,047 INFO L429 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:18,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:18,047 INFO L82 PathProgramCache]: Analyzing trace with hash 76483459, now seen corresponding path program 1 times [2020-10-09 15:35:18,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:18,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919796667] [2020-10-09 15:35:18,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 770 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 770 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:18,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:35:18,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:35:18,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:35:18,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919796667] [2020-10-09 15:35:18,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:18,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:18,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234625141] [2020-10-09 15:35:18,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:18,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:18,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:18,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:18,523 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:35:18,524 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 566 transitions, 1417 flow. Second operand 3 states. [2020-10-09 15:35:18,524 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:18,524 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:35:18,524 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:18,749 INFO L129 PetriNetUnfolder]: 21/686 cut-off events. [2020-10-09 15:35:18,749 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:35:18,787 INFO L80 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 686 events. 21/686 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3001 event pairs, 0 based on Foata normal form. 1/644 useless extension candidates. Maximal degree in co-relation 850. Up to 24 conditions per place. [2020-10-09 15:35:18,791 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/565 dead transitions. [2020-10-09 15:35:18,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 565 transitions, 1423 flow [2020-10-09 15:35:18,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:18,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:35:18,794 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:35:18,794 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:35:18,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:35:18,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:18,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:35:18,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:18,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:18,797 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:18,797 INFO L185 Difference]: Start difference. First operand has 651 places, 566 transitions, 1417 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:35:18,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 565 transitions, 1423 flow [2020-10-09 15:35:18,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 565 transitions, 1418 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:18,806 INFO L241 Difference]: Finished difference. Result has 653 places, 565 transitions, 1413 flow [2020-10-09 15:35:18,807 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1413, PETRI_PLACES=653, PETRI_TRANSITIONS=565} [2020-10-09 15:35:18,807 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 61 predicate places. [2020-10-09 15:35:18,807 INFO L481 AbstractCegarLoop]: Abstraction has has 653 places, 565 transitions, 1413 flow [2020-10-09 15:35:18,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:18,807 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:18,808 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:19,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 770 mathsat -unsat_core_generation=3 [2020-10-09 15:35:19,020 INFO L429 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:19,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:19,020 INFO L82 PathProgramCache]: Analyzing trace with hash 75531170, now seen corresponding path program 1 times [2020-10-09 15:35:19,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:19,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117137813] [2020-10-09 15:35:19,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 771 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 771 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:19,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:19,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:35:19,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:35:19,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117137813] [2020-10-09 15:35:19,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:19,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:19,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379916344] [2020-10-09 15:35:19,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:19,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:19,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:19,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:19,526 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:35:19,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 565 transitions, 1413 flow. Second operand 3 states. [2020-10-09 15:35:19,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:19,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:35:19,527 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:19,737 INFO L129 PetriNetUnfolder]: 21/679 cut-off events. [2020-10-09 15:35:19,738 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:35:19,772 INFO L80 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 679 events. 21/679 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2941 event pairs, 0 based on Foata normal form. 1/637 useless extension candidates. Maximal degree in co-relation 846. Up to 24 conditions per place. [2020-10-09 15:35:19,776 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 5 selfloop transitions, 1 changer transitions 0/563 dead transitions. [2020-10-09 15:35:19,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 563 transitions, 1416 flow [2020-10-09 15:35:19,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:19,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2020-10-09 15:35:19,777 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955067920585162 [2020-10-09 15:35:19,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2020-10-09 15:35:19,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2020-10-09 15:35:19,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:19,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2020-10-09 15:35:19,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:19,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:19,779 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:19,779 INFO L185 Difference]: Start difference. First operand has 653 places, 565 transitions, 1413 flow. Second operand 3 states and 1828 transitions. [2020-10-09 15:35:19,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 563 transitions, 1416 flow [2020-10-09 15:35:19,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 563 transitions, 1409 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:35:19,785 INFO L241 Difference]: Finished difference. Result has 653 places, 563 transitions, 1402 flow [2020-10-09 15:35:19,785 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1402, PETRI_PLACES=653, PETRI_TRANSITIONS=563} [2020-10-09 15:35:19,785 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 61 predicate places. [2020-10-09 15:35:19,785 INFO L481 AbstractCegarLoop]: Abstraction has has 653 places, 563 transitions, 1402 flow [2020-10-09 15:35:19,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:19,786 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:19,786 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:19,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 771 mathsat -unsat_core_generation=3 [2020-10-09 15:35:19,986 INFO L429 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:19,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:19,987 INFO L82 PathProgramCache]: Analyzing trace with hash 75530147, now seen corresponding path program 1 times [2020-10-09 15:35:19,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:19,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580889315] [2020-10-09 15:35:19,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 772 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 772 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:20,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:20,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:20,448 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:35:20,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:35:20,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580889315] [2020-10-09 15:35:20,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:20,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:20,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217703961] [2020-10-09 15:35:20,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:20,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:20,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:20,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:20,488 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:35:20,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 563 transitions, 1402 flow. Second operand 3 states. [2020-10-09 15:35:20,489 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:20,489 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:35:20,489 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:20,705 INFO L129 PetriNetUnfolder]: 21/677 cut-off events. [2020-10-09 15:35:20,705 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:20,741 INFO L80 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 677 events. 21/677 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2928 event pairs, 0 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 846. Up to 24 conditions per place. [2020-10-09 15:35:20,743 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 8 selfloop transitions, 1 changer transitions 0/561 dead transitions. [2020-10-09 15:35:20,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 561 transitions, 1415 flow [2020-10-09 15:35:20,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1816 transitions. [2020-10-09 15:35:20,745 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9487983281086729 [2020-10-09 15:35:20,745 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1816 transitions. [2020-10-09 15:35:20,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1816 transitions. [2020-10-09 15:35:20,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:20,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1816 transitions. [2020-10-09 15:35:20,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:20,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:20,747 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:20,747 INFO L185 Difference]: Start difference. First operand has 653 places, 563 transitions, 1402 flow. Second operand 3 states and 1816 transitions. [2020-10-09 15:35:20,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 561 transitions, 1415 flow [2020-10-09 15:35:20,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 561 transitions, 1414 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:20,753 INFO L241 Difference]: Finished difference. Result has 652 places, 561 transitions, 1398 flow [2020-10-09 15:35:20,753 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1398, PETRI_PLACES=652, PETRI_TRANSITIONS=561} [2020-10-09 15:35:20,753 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 60 predicate places. [2020-10-09 15:35:20,753 INFO L481 AbstractCegarLoop]: Abstraction has has 652 places, 561 transitions, 1398 flow [2020-10-09 15:35:20,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:20,753 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:20,753 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:20,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 772 mathsat -unsat_core_generation=3 [2020-10-09 15:35:20,954 INFO L429 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:20,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:20,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1163820323, now seen corresponding path program 1 times [2020-10-09 15:35:20,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:20,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25805036] [2020-10-09 15:35:20,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 773 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 773 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:21,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:21,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:35:21,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:35:21,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25805036] [2020-10-09 15:35:21,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:21,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:21,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973430161] [2020-10-09 15:35:21,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:21,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:21,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:21,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:21,439 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:35:21,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 561 transitions, 1398 flow. Second operand 3 states. [2020-10-09 15:35:21,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:21,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:35:21,440 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:21,653 INFO L129 PetriNetUnfolder]: 19/682 cut-off events. [2020-10-09 15:35:21,653 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:35:21,688 INFO L80 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 682 events. 19/682 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2979 event pairs, 0 based on Foata normal form. 0/639 useless extension candidates. Maximal degree in co-relation 849. Up to 24 conditions per place. [2020-10-09 15:35:21,691 INFO L132 encePairwiseOnDemand]: 635/638 looper letters, 5 selfloop transitions, 2 changer transitions 0/562 dead transitions. [2020-10-09 15:35:21,691 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 562 transitions, 1414 flow [2020-10-09 15:35:21,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1829 transitions. [2020-10-09 15:35:21,693 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9555903866248694 [2020-10-09 15:35:21,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1829 transitions. [2020-10-09 15:35:21,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1829 transitions. [2020-10-09 15:35:21,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:21,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1829 transitions. [2020-10-09 15:35:21,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:21,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:21,695 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:21,695 INFO L185 Difference]: Start difference. First operand has 652 places, 561 transitions, 1398 flow. Second operand 3 states and 1829 transitions. [2020-10-09 15:35:21,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 562 transitions, 1414 flow [2020-10-09 15:35:21,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 562 transitions, 1413 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:21,700 INFO L241 Difference]: Finished difference. Result has 655 places, 562 transitions, 1411 flow [2020-10-09 15:35:21,701 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1411, PETRI_PLACES=655, PETRI_TRANSITIONS=562} [2020-10-09 15:35:21,701 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 63 predicate places. [2020-10-09 15:35:21,701 INFO L481 AbstractCegarLoop]: Abstraction has has 655 places, 562 transitions, 1411 flow [2020-10-09 15:35:21,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:21,701 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:21,701 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:21,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 773 mathsat -unsat_core_generation=3 [2020-10-09 15:35:21,902 INFO L429 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:21,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:21,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1163819300, now seen corresponding path program 1 times [2020-10-09 15:35:21,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:21,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333826815] [2020-10-09 15:35:21,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 774 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 774 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:22,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:22,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:35:22,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:22,375 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:35:22,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333826815] [2020-10-09 15:35:22,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:22,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:22,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469167335] [2020-10-09 15:35:22,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:22,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:22,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:22,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:22,401 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:35:22,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 562 transitions, 1411 flow. Second operand 3 states. [2020-10-09 15:35:22,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:22,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:35:22,402 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:22,636 INFO L129 PetriNetUnfolder]: 19/683 cut-off events. [2020-10-09 15:35:22,636 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:35:22,672 INFO L80 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 683 events. 19/683 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2988 event pairs, 0 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 857. Up to 24 conditions per place. [2020-10-09 15:35:22,675 INFO L132 encePairwiseOnDemand]: 634/638 looper letters, 9 selfloop transitions, 3 changer transitions 0/563 dead transitions. [2020-10-09 15:35:22,675 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 563 transitions, 1437 flow [2020-10-09 15:35:22,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1819 transitions. [2020-10-09 15:35:22,677 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503657262277951 [2020-10-09 15:35:22,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1819 transitions. [2020-10-09 15:35:22,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1819 transitions. [2020-10-09 15:35:22,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:22,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1819 transitions. [2020-10-09 15:35:22,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:22,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:22,679 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:22,679 INFO L185 Difference]: Start difference. First operand has 655 places, 562 transitions, 1411 flow. Second operand 3 states and 1819 transitions. [2020-10-09 15:35:22,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 563 transitions, 1437 flow [2020-10-09 15:35:22,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 563 transitions, 1435 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:22,685 INFO L241 Difference]: Finished difference. Result has 658 places, 563 transitions, 1427 flow [2020-10-09 15:35:22,685 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1409, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1427, PETRI_PLACES=658, PETRI_TRANSITIONS=563} [2020-10-09 15:35:22,685 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 66 predicate places. [2020-10-09 15:35:22,685 INFO L481 AbstractCegarLoop]: Abstraction has has 658 places, 563 transitions, 1427 flow [2020-10-09 15:35:22,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:22,685 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:22,685 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:22,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 774 mathsat -unsat_core_generation=3 [2020-10-09 15:35:22,886 INFO L429 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:22,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:22,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1164773635, now seen corresponding path program 1 times [2020-10-09 15:35:22,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:22,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222524961] [2020-10-09 15:35:22,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 775 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 775 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:23,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:23,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:23,398 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:35:23,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:35:23,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222524961] [2020-10-09 15:35:23,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:23,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:23,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705638519] [2020-10-09 15:35:23,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:23,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:23,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:23,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:23,439 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:35:23,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 563 transitions, 1427 flow. Second operand 3 states. [2020-10-09 15:35:23,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:23,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:35:23,441 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:23,661 INFO L129 PetriNetUnfolder]: 18/680 cut-off events. [2020-10-09 15:35:23,662 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2020-10-09 15:35:23,696 INFO L80 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 680 events. 18/680 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2968 event pairs, 0 based on Foata normal form. 2/641 useless extension candidates. Maximal degree in co-relation 856. Up to 24 conditions per place. [2020-10-09 15:35:23,699 INFO L132 encePairwiseOnDemand]: 635/638 looper letters, 9 selfloop transitions, 1 changer transitions 0/561 dead transitions. [2020-10-09 15:35:23,699 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 561 transitions, 1435 flow [2020-10-09 15:35:23,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2020-10-09 15:35:23,700 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9498432601880877 [2020-10-09 15:35:23,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1818 transitions. [2020-10-09 15:35:23,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1818 transitions. [2020-10-09 15:35:23,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:23,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1818 transitions. [2020-10-09 15:35:23,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:23,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:23,702 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:23,702 INFO L185 Difference]: Start difference. First operand has 658 places, 563 transitions, 1427 flow. Second operand 3 states and 1818 transitions. [2020-10-09 15:35:23,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 561 transitions, 1435 flow [2020-10-09 15:35:23,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 561 transitions, 1434 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:23,714 INFO L241 Difference]: Finished difference. Result has 659 places, 561 transitions, 1416 flow [2020-10-09 15:35:23,714 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1416, PETRI_PLACES=659, PETRI_TRANSITIONS=561} [2020-10-09 15:35:23,714 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 67 predicate places. [2020-10-09 15:35:23,714 INFO L481 AbstractCegarLoop]: Abstraction has has 659 places, 561 transitions, 1416 flow [2020-10-09 15:35:23,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:23,714 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:23,715 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:23,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 775 mathsat -unsat_core_generation=3 [2020-10-09 15:35:23,926 INFO L429 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:23,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:23,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1164772612, now seen corresponding path program 1 times [2020-10-09 15:35:23,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:23,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730647306] [2020-10-09 15:35:23,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 776 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 776 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:24,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:35:24,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:35:24,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:35:24,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730647306] [2020-10-09 15:35:24,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:24,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:24,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379216606] [2020-10-09 15:35:24,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:24,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:24,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:24,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:24,415 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:35:24,416 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 561 transitions, 1416 flow. Second operand 3 states. [2020-10-09 15:35:24,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:24,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:35:24,416 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:24,629 INFO L129 PetriNetUnfolder]: 18/677 cut-off events. [2020-10-09 15:35:24,630 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:24,665 INFO L80 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 677 events. 18/677 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2946 event pairs, 0 based on Foata normal form. 1/638 useless extension candidates. Maximal degree in co-relation 850. Up to 24 conditions per place. [2020-10-09 15:35:24,667 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/558 dead transitions. [2020-10-09 15:35:24,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 558 transitions, 1415 flow [2020-10-09 15:35:24,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:24,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:35:24,669 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:35:24,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:35:24,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:35:24,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:24,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:35:24,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:24,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:24,671 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:24,671 INFO L185 Difference]: Start difference. First operand has 659 places, 561 transitions, 1416 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:35:24,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 558 transitions, 1415 flow [2020-10-09 15:35:24,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 558 transitions, 1410 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:35:24,677 INFO L241 Difference]: Finished difference. Result has 656 places, 558 transitions, 1402 flow [2020-10-09 15:35:24,677 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1400, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1402, PETRI_PLACES=656, PETRI_TRANSITIONS=558} [2020-10-09 15:35:24,677 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 64 predicate places. [2020-10-09 15:35:24,677 INFO L481 AbstractCegarLoop]: Abstraction has has 656 places, 558 transitions, 1402 flow [2020-10-09 15:35:24,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:24,678 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:24,678 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:24,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 776 mathsat -unsat_core_generation=3 [2020-10-09 15:35:24,878 INFO L429 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:24,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:24,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1502893562, now seen corresponding path program 1 times [2020-10-09 15:35:24,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:24,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48145486] [2020-10-09 15:35:24,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 777 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 777 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:25,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:35:25,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:25,347 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:35:25,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:25,353 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:35:25,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48145486] [2020-10-09 15:35:25,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:25,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:25,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388561657] [2020-10-09 15:35:25,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:25,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:25,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:25,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:25,370 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:35:25,371 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 558 transitions, 1402 flow. Second operand 3 states. [2020-10-09 15:35:25,371 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:25,371 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:35:25,371 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:25,597 INFO L129 PetriNetUnfolder]: 17/684 cut-off events. [2020-10-09 15:35:25,598 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:35:25,634 INFO L80 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 684 events. 17/684 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3004 event pairs, 0 based on Foata normal form. 1/644 useless extension candidates. Maximal degree in co-relation 858. Up to 24 conditions per place. [2020-10-09 15:35:25,636 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/558 dead transitions. [2020-10-09 15:35:25,636 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 558 transitions, 1412 flow [2020-10-09 15:35:25,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:25,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:35:25,638 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:35:25,638 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:35:25,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:35:25,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:25,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:35:25,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:25,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:25,640 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:25,640 INFO L185 Difference]: Start difference. First operand has 656 places, 558 transitions, 1402 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:35:25,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 558 transitions, 1412 flow [2020-10-09 15:35:25,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 558 transitions, 1411 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:25,646 INFO L241 Difference]: Finished difference. Result has 658 places, 558 transitions, 1406 flow [2020-10-09 15:35:25,646 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1406, PETRI_PLACES=658, PETRI_TRANSITIONS=558} [2020-10-09 15:35:25,646 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 66 predicate places. [2020-10-09 15:35:25,646 INFO L481 AbstractCegarLoop]: Abstraction has has 658 places, 558 transitions, 1406 flow [2020-10-09 15:35:25,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:25,646 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:25,646 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:25,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 777 mathsat -unsat_core_generation=3 [2020-10-09 15:35:25,847 INFO L429 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:25,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:25,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1502892539, now seen corresponding path program 1 times [2020-10-09 15:35:25,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:25,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927612743] [2020-10-09 15:35:25,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 778 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 778 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:26,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:26,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:26,313 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:35:26,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:35:26,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927612743] [2020-10-09 15:35:26,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:26,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:26,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86835533] [2020-10-09 15:35:26,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:26,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:26,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:26,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:26,346 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:35:26,347 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 558 transitions, 1406 flow. Second operand 3 states. [2020-10-09 15:35:26,348 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:26,348 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:35:26,348 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:26,576 INFO L129 PetriNetUnfolder]: 15/686 cut-off events. [2020-10-09 15:35:26,577 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:26,614 INFO L80 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 686 events. 15/686 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3039 event pairs, 0 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 869. Up to 24 conditions per place. [2020-10-09 15:35:26,617 INFO L132 encePairwiseOnDemand]: 634/638 looper letters, 9 selfloop transitions, 3 changer transitions 0/559 dead transitions. [2020-10-09 15:35:26,617 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 559 transitions, 1432 flow [2020-10-09 15:35:26,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1819 transitions. [2020-10-09 15:35:26,618 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503657262277951 [2020-10-09 15:35:26,618 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1819 transitions. [2020-10-09 15:35:26,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1819 transitions. [2020-10-09 15:35:26,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:26,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1819 transitions. [2020-10-09 15:35:26,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:26,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:26,620 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:26,620 INFO L185 Difference]: Start difference. First operand has 658 places, 558 transitions, 1406 flow. Second operand 3 states and 1819 transitions. [2020-10-09 15:35:26,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 559 transitions, 1432 flow [2020-10-09 15:35:26,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 559 transitions, 1431 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:26,626 INFO L241 Difference]: Finished difference. Result has 661 places, 559 transitions, 1423 flow [2020-10-09 15:35:26,626 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1423, PETRI_PLACES=661, PETRI_TRANSITIONS=559} [2020-10-09 15:35:26,627 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 69 predicate places. [2020-10-09 15:35:26,627 INFO L481 AbstractCegarLoop]: Abstraction has has 661 places, 559 transitions, 1423 flow [2020-10-09 15:35:26,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:26,627 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:26,627 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:26,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 778 mathsat -unsat_core_generation=3 [2020-10-09 15:35:26,827 INFO L429 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:26,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:26,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1503845851, now seen corresponding path program 1 times [2020-10-09 15:35:26,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:26,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267094114] [2020-10-09 15:35:26,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 779 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 779 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:27,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:27,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:35:27,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:27,330 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:35:27,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267094114] [2020-10-09 15:35:27,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:27,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:27,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889453190] [2020-10-09 15:35:27,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:27,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:27,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:27,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:27,347 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:35:27,348 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 559 transitions, 1423 flow. Second operand 3 states. [2020-10-09 15:35:27,348 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:27,348 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:35:27,348 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:27,571 INFO L129 PetriNetUnfolder]: 15/679 cut-off events. [2020-10-09 15:35:27,571 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:35:27,607 INFO L80 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 679 events. 15/679 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2978 event pairs, 0 based on Foata normal form. 1/643 useless extension candidates. Maximal degree in co-relation 855. Up to 24 conditions per place. [2020-10-09 15:35:27,610 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 5 selfloop transitions, 1 changer transitions 0/557 dead transitions. [2020-10-09 15:35:27,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 557 transitions, 1425 flow [2020-10-09 15:35:27,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2020-10-09 15:35:27,611 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955067920585162 [2020-10-09 15:35:27,611 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2020-10-09 15:35:27,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2020-10-09 15:35:27,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:27,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2020-10-09 15:35:27,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:27,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:27,614 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:27,614 INFO L185 Difference]: Start difference. First operand has 661 places, 559 transitions, 1423 flow. Second operand 3 states and 1828 transitions. [2020-10-09 15:35:27,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 557 transitions, 1425 flow [2020-10-09 15:35:27,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 557 transitions, 1417 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:35:27,621 INFO L241 Difference]: Finished difference. Result has 661 places, 557 transitions, 1410 flow [2020-10-09 15:35:27,621 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1410, PETRI_PLACES=661, PETRI_TRANSITIONS=557} [2020-10-09 15:35:27,621 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 69 predicate places. [2020-10-09 15:35:27,621 INFO L481 AbstractCegarLoop]: Abstraction has has 661 places, 557 transitions, 1410 flow [2020-10-09 15:35:27,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:27,621 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:27,621 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:27,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 779 mathsat -unsat_core_generation=3 [2020-10-09 15:35:27,822 INFO L429 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:27,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:27,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1503846874, now seen corresponding path program 1 times [2020-10-09 15:35:27,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:27,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223311620] [2020-10-09 15:35:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 780 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 780 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:28,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:28,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:35:28,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:28,292 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:35:28,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223311620] [2020-10-09 15:35:28,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:28,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:28,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170614724] [2020-10-09 15:35:28,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:28,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:28,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:28,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:28,321 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:35:28,322 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 557 transitions, 1410 flow. Second operand 3 states. [2020-10-09 15:35:28,322 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:28,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:35:28,323 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:28,543 INFO L129 PetriNetUnfolder]: 15/677 cut-off events. [2020-10-09 15:35:28,544 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:28,579 INFO L80 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 677 events. 15/677 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2964 event pairs, 0 based on Foata normal form. 0/639 useless extension candidates. Maximal degree in co-relation 859. Up to 24 conditions per place. [2020-10-09 15:35:28,581 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 8 selfloop transitions, 1 changer transitions 0/555 dead transitions. [2020-10-09 15:35:28,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 555 transitions, 1423 flow [2020-10-09 15:35:28,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:28,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1816 transitions. [2020-10-09 15:35:28,583 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9487983281086729 [2020-10-09 15:35:28,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1816 transitions. [2020-10-09 15:35:28,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1816 transitions. [2020-10-09 15:35:28,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:28,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1816 transitions. [2020-10-09 15:35:28,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:28,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:28,585 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:28,585 INFO L185 Difference]: Start difference. First operand has 661 places, 557 transitions, 1410 flow. Second operand 3 states and 1816 transitions. [2020-10-09 15:35:28,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 555 transitions, 1423 flow [2020-10-09 15:35:28,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 555 transitions, 1422 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:28,591 INFO L241 Difference]: Finished difference. Result has 660 places, 555 transitions, 1406 flow [2020-10-09 15:35:28,591 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1404, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1406, PETRI_PLACES=660, PETRI_TRANSITIONS=555} [2020-10-09 15:35:28,591 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 68 predicate places. [2020-10-09 15:35:28,591 INFO L481 AbstractCegarLoop]: Abstraction has has 660 places, 555 transitions, 1406 flow [2020-10-09 15:35:28,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:28,592 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:28,592 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:28,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 780 mathsat -unsat_core_generation=3 [2020-10-09 15:35:28,792 INFO L429 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:28,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:28,793 INFO L82 PathProgramCache]: Analyzing trace with hash 779588616, now seen corresponding path program 1 times [2020-10-09 15:35:28,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:28,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745288190] [2020-10-09 15:35:28,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 781 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 781 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:29,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:29,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:29,263 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:35:29,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:29,268 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:35:29,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745288190] [2020-10-09 15:35:29,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:29,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:29,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422554089] [2020-10-09 15:35:29,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:29,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:29,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:29,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:29,288 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:35:29,289 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 555 transitions, 1406 flow. Second operand 3 states. [2020-10-09 15:35:29,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:29,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:35:29,289 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:29,522 INFO L129 PetriNetUnfolder]: 14/685 cut-off events. [2020-10-09 15:35:29,522 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 15:35:29,560 INFO L80 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 685 events. 14/685 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3035 event pairs, 0 based on Foata normal form. 0/647 useless extension candidates. Maximal degree in co-relation 871. Up to 24 conditions per place. [2020-10-09 15:35:29,563 INFO L132 encePairwiseOnDemand]: 633/638 looper letters, 10 selfloop transitions, 3 changer transitions 0/557 dead transitions. [2020-10-09 15:35:29,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 557 transitions, 1436 flow [2020-10-09 15:35:29,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1821 transitions. [2020-10-09 15:35:29,564 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.95141065830721 [2020-10-09 15:35:29,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1821 transitions. [2020-10-09 15:35:29,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1821 transitions. [2020-10-09 15:35:29,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:29,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1821 transitions. [2020-10-09 15:35:29,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:29,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:29,566 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:29,566 INFO L185 Difference]: Start difference. First operand has 660 places, 555 transitions, 1406 flow. Second operand 3 states and 1821 transitions. [2020-10-09 15:35:29,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 557 transitions, 1436 flow [2020-10-09 15:35:29,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 557 transitions, 1435 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:29,572 INFO L241 Difference]: Finished difference. Result has 663 places, 557 transitions, 1429 flow [2020-10-09 15:35:29,572 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1429, PETRI_PLACES=663, PETRI_TRANSITIONS=557} [2020-10-09 15:35:29,572 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 71 predicate places. [2020-10-09 15:35:29,572 INFO L481 AbstractCegarLoop]: Abstraction has has 663 places, 557 transitions, 1429 flow [2020-10-09 15:35:29,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:29,573 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:29,573 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:29,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 781 mathsat -unsat_core_generation=3 [2020-10-09 15:35:29,773 INFO L429 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:29,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:29,774 INFO L82 PathProgramCache]: Analyzing trace with hash 779587593, now seen corresponding path program 1 times [2020-10-09 15:35:29,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:29,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805656940] [2020-10-09 15:35:29,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 782 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 782 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:30,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:35:30,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:35:30,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:30,250 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:35:30,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805656940] [2020-10-09 15:35:30,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:30,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:30,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683329843] [2020-10-09 15:35:30,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:30,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:30,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:30,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:30,264 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 638 [2020-10-09 15:35:30,265 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 557 transitions, 1429 flow. Second operand 3 states. [2020-10-09 15:35:30,265 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:30,265 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 638 [2020-10-09 15:35:30,266 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:30,504 INFO L129 PetriNetUnfolder]: 12/686 cut-off events. [2020-10-09 15:35:30,504 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:35:30,544 INFO L80 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 686 events. 12/686 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3058 event pairs, 0 based on Foata normal form. 1/653 useless extension candidates. Maximal degree in co-relation 869. Up to 24 conditions per place. [2020-10-09 15:35:30,546 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 4 selfloop transitions, 1 changer transitions 0/556 dead transitions. [2020-10-09 15:35:30,546 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 556 transitions, 1435 flow [2020-10-09 15:35:30,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2020-10-09 15:35:30,547 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561128526645768 [2020-10-09 15:35:30,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2020-10-09 15:35:30,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2020-10-09 15:35:30,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:30,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2020-10-09 15:35:30,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:30,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:30,549 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:30,550 INFO L185 Difference]: Start difference. First operand has 663 places, 557 transitions, 1429 flow. Second operand 3 states and 1830 transitions. [2020-10-09 15:35:30,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 665 places, 556 transitions, 1435 flow [2020-10-09 15:35:30,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 556 transitions, 1430 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:30,556 INFO L241 Difference]: Finished difference. Result has 665 places, 556 transitions, 1425 flow [2020-10-09 15:35:30,556 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1420, PETRI_DIFFERENCE_MINUEND_PLACES=662, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1425, PETRI_PLACES=665, PETRI_TRANSITIONS=556} [2020-10-09 15:35:30,556 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 73 predicate places. [2020-10-09 15:35:30,556 INFO L481 AbstractCegarLoop]: Abstraction has has 665 places, 556 transitions, 1425 flow [2020-10-09 15:35:30,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:30,556 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:30,556 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:30,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 782 mathsat -unsat_core_generation=3 [2020-10-09 15:35:30,757 INFO L429 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:30,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:30,758 INFO L82 PathProgramCache]: Analyzing trace with hash 778635304, now seen corresponding path program 1 times [2020-10-09 15:35:30,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:30,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711272692] [2020-10-09 15:35:30,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 783 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 783 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:31,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:31,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:35:31,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:31,284 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:35:31,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711272692] [2020-10-09 15:35:31,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:31,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:31,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521628907] [2020-10-09 15:35:31,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:31,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:31,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:31,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:31,296 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 607 out of 638 [2020-10-09 15:35:31,297 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 556 transitions, 1425 flow. Second operand 3 states. [2020-10-09 15:35:31,297 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:31,297 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 607 of 638 [2020-10-09 15:35:31,297 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:31,522 INFO L129 PetriNetUnfolder]: 12/679 cut-off events. [2020-10-09 15:35:31,522 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:35:31,558 INFO L80 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 679 events. 12/679 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2999 event pairs, 0 based on Foata normal form. 1/646 useless extension candidates. Maximal degree in co-relation 865. Up to 24 conditions per place. [2020-10-09 15:35:31,560 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 5 selfloop transitions, 1 changer transitions 0/554 dead transitions. [2020-10-09 15:35:31,560 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 554 transitions, 1428 flow [2020-10-09 15:35:31,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:31,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2020-10-09 15:35:31,561 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.955067920585162 [2020-10-09 15:35:31,561 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2020-10-09 15:35:31,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2020-10-09 15:35:31,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:31,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2020-10-09 15:35:31,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:31,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:31,564 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:31,564 INFO L185 Difference]: Start difference. First operand has 665 places, 556 transitions, 1425 flow. Second operand 3 states and 1828 transitions. [2020-10-09 15:35:31,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 554 transitions, 1428 flow [2020-10-09 15:35:31,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 554 transitions, 1421 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:35:31,570 INFO L241 Difference]: Finished difference. Result has 665 places, 554 transitions, 1414 flow [2020-10-09 15:35:31,570 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1409, PETRI_DIFFERENCE_MINUEND_PLACES=662, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1414, PETRI_PLACES=665, PETRI_TRANSITIONS=554} [2020-10-09 15:35:31,570 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 73 predicate places. [2020-10-09 15:35:31,570 INFO L481 AbstractCegarLoop]: Abstraction has has 665 places, 554 transitions, 1414 flow [2020-10-09 15:35:31,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:31,571 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:31,571 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:31,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 783 mathsat -unsat_core_generation=3 [2020-10-09 15:35:31,783 INFO L429 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:31,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:31,783 INFO L82 PathProgramCache]: Analyzing trace with hash 778634281, now seen corresponding path program 1 times [2020-10-09 15:35:31,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:31,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136661729] [2020-10-09 15:35:31,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 784 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 784 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:32,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:32,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:35:32,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:35:32,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136661729] [2020-10-09 15:35:32,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:32,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:32,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237976173] [2020-10-09 15:35:32,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:32,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:32,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:32,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:32,273 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 638 [2020-10-09 15:35:32,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 554 transitions, 1414 flow. Second operand 3 states. [2020-10-09 15:35:32,274 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:32,274 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 638 [2020-10-09 15:35:32,274 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:32,508 INFO L129 PetriNetUnfolder]: 12/677 cut-off events. [2020-10-09 15:35:32,508 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:32,545 INFO L80 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 677 events. 12/677 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2983 event pairs, 0 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 865. Up to 24 conditions per place. [2020-10-09 15:35:32,547 INFO L132 encePairwiseOnDemand]: 636/638 looper letters, 8 selfloop transitions, 1 changer transitions 0/552 dead transitions. [2020-10-09 15:35:32,547 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 552 transitions, 1427 flow [2020-10-09 15:35:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:32,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1816 transitions. [2020-10-09 15:35:32,549 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9487983281086729 [2020-10-09 15:35:32,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1816 transitions. [2020-10-09 15:35:32,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1816 transitions. [2020-10-09 15:35:32,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:32,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1816 transitions. [2020-10-09 15:35:32,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:32,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:32,551 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:32,551 INFO L185 Difference]: Start difference. First operand has 665 places, 554 transitions, 1414 flow. Second operand 3 states and 1816 transitions. [2020-10-09 15:35:32,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 665 places, 552 transitions, 1427 flow [2020-10-09 15:35:32,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 552 transitions, 1426 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:32,557 INFO L241 Difference]: Finished difference. Result has 664 places, 552 transitions, 1410 flow [2020-10-09 15:35:32,557 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=638, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=662, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1410, PETRI_PLACES=664, PETRI_TRANSITIONS=552} [2020-10-09 15:35:32,557 INFO L341 CegarLoopForPetriNet]: 592 programPoint places, 72 predicate places. [2020-10-09 15:35:32,557 INFO L481 AbstractCegarLoop]: Abstraction has has 664 places, 552 transitions, 1410 flow [2020-10-09 15:35:32,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:32,557 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:32,557 INFO L255 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:32,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 784 mathsat -unsat_core_generation=3 [2020-10-09 15:35:32,758 INFO L429 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:32,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:32,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1527074403, now seen corresponding path program 1 times [2020-10-09 15:35:32,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:32,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271993839] [2020-10-09 15:35:32,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 785 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 785 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:35:33,230 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:35:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:35:33,270 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:35:33,333 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:35:33,333 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:35:33,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 785 mathsat -unsat_core_generation=3 [2020-10-09 15:35:33,536 WARN L371 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:35:33,536 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2020-10-09 15:35:33,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:35:33,690 INFO L253 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2020-10-09 15:35:33,690 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:35:33,691 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:35:33,691 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:35:33,691 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:35:33,691 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:35:33,691 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:35:33,691 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:35:33,691 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:35:33,695 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 617 places, 665 transitions, 2002 flow [2020-10-09 15:35:33,927 INFO L129 PetriNetUnfolder]: 121/880 cut-off events. [2020-10-09 15:35:33,927 INFO L130 PetriNetUnfolder]: For 2576/2576 co-relation queries the response was YES. [2020-10-09 15:35:33,981 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 880 events. 121/880 cut-off events. For 2576/2576 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3674 event pairs, 0 based on Foata normal form. 0/710 useless extension candidates. Maximal degree in co-relation 1184. Up to 50 conditions per place. [2020-10-09 15:35:33,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 617 places, 665 transitions, 2002 flow [2020-10-09 15:35:34,001 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 617 places, 665 transitions, 2002 flow [2020-10-09 15:35:34,007 INFO L129 PetriNetUnfolder]: 10/98 cut-off events. [2020-10-09 15:35:34,007 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:35:34,007 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:34,007 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:34,007 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:34,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:34,007 INFO L82 PathProgramCache]: Analyzing trace with hash -819681242, now seen corresponding path program 1 times [2020-10-09 15:35:34,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:34,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428227285] [2020-10-09 15:35:34,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 786 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 786 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:34,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:35:34,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:35:34,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:35:34,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428227285] [2020-10-09 15:35:34,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:34,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:34,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055382895] [2020-10-09 15:35:34,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:34,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:34,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:34,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:34,494 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:35:34,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 665 transitions, 2002 flow. Second operand 3 states. [2020-10-09 15:35:34,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:34,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:35:34,495 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:34,702 INFO L129 PetriNetUnfolder]: 71/713 cut-off events. [2020-10-09 15:35:34,702 INFO L130 PetriNetUnfolder]: For 2577/2577 co-relation queries the response was YES. [2020-10-09 15:35:34,743 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 713 events. 71/713 cut-off events. For 2577/2577 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2836 event pairs, 0 based on Foata normal form. 98/715 useless extension candidates. Maximal degree in co-relation 1026. Up to 25 conditions per place. [2020-10-09 15:35:34,754 INFO L132 encePairwiseOnDemand]: 637/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/635 dead transitions. [2020-10-09 15:35:34,755 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 635 transitions, 1952 flow [2020-10-09 15:35:34,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:34,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:34,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1960 transitions. [2020-10-09 15:35:34,756 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9824561403508771 [2020-10-09 15:35:34,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1960 transitions. [2020-10-09 15:35:34,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1960 transitions. [2020-10-09 15:35:34,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:34,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1960 transitions. [2020-10-09 15:35:34,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:34,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:34,758 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:34,758 INFO L185 Difference]: Start difference. First operand has 617 places, 665 transitions, 2002 flow. Second operand 3 states and 1960 transitions. [2020-10-09 15:35:34,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 635 transitions, 1952 flow [2020-10-09 15:35:34,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 635 transitions, 1400 flow, removed 276 selfloop flow, removed 0 redundant places. [2020-10-09 15:35:34,767 INFO L241 Difference]: Finished difference. Result has 615 places, 635 transitions, 1395 flow [2020-10-09 15:35:34,767 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1390, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1395, PETRI_PLACES=615, PETRI_TRANSITIONS=635} [2020-10-09 15:35:34,767 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, -2 predicate places. [2020-10-09 15:35:34,767 INFO L481 AbstractCegarLoop]: Abstraction has has 615 places, 635 transitions, 1395 flow [2020-10-09 15:35:34,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:34,767 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:34,767 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:34,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 786 mathsat -unsat_core_generation=3 [2020-10-09 15:35:34,968 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:34,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:34,969 INFO L82 PathProgramCache]: Analyzing trace with hash -820633531, now seen corresponding path program 1 times [2020-10-09 15:35:34,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:34,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058095112] [2020-10-09 15:35:34,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 787 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 787 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:35,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:35,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:35:35,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:35,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:35:35,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058095112] [2020-10-09 15:35:35,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:35,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:35,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762480346] [2020-10-09 15:35:35,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:35,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:35,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:35,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:35,495 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:35:35,496 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 635 transitions, 1395 flow. Second operand 3 states. [2020-10-09 15:35:35,496 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:35,496 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:35:35,496 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:35,689 INFO L129 PetriNetUnfolder]: 69/710 cut-off events. [2020-10-09 15:35:35,689 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:35:35,726 INFO L80 FinitePrefix]: Finished finitePrefix Result has 818 conditions, 710 events. 69/710 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2826 event pairs, 0 based on Foata normal form. 1/616 useless extension candidates. Maximal degree in co-relation 779. Up to 25 conditions per place. [2020-10-09 15:35:35,736 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/635 dead transitions. [2020-10-09 15:35:35,737 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 635 transitions, 1407 flow [2020-10-09 15:35:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2020-10-09 15:35:35,738 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9553884711779449 [2020-10-09 15:35:35,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2020-10-09 15:35:35,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2020-10-09 15:35:35,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:35,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2020-10-09 15:35:35,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:35,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:35,740 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:35,740 INFO L185 Difference]: Start difference. First operand has 615 places, 635 transitions, 1395 flow. Second operand 3 states and 1906 transitions. [2020-10-09 15:35:35,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 635 transitions, 1407 flow [2020-10-09 15:35:35,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 635 transitions, 1406 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:35,747 INFO L241 Difference]: Finished difference. Result has 617 places, 635 transitions, 1399 flow [2020-10-09 15:35:35,747 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1394, PETRI_DIFFERENCE_MINUEND_PLACES=614, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1399, PETRI_PLACES=617, PETRI_TRANSITIONS=635} [2020-10-09 15:35:35,748 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 0 predicate places. [2020-10-09 15:35:35,748 INFO L481 AbstractCegarLoop]: Abstraction has has 617 places, 635 transitions, 1399 flow [2020-10-09 15:35:35,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:35,748 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:35,748 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:35,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 787 mathsat -unsat_core_generation=3 [2020-10-09 15:35:35,949 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:35,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:35,949 INFO L82 PathProgramCache]: Analyzing trace with hash -820634554, now seen corresponding path program 1 times [2020-10-09 15:35:35,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:35,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852857658] [2020-10-09 15:35:35,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 788 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 788 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:36,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:36,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:35:36,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:36,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:35:36,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852857658] [2020-10-09 15:35:36,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:36,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:36,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038480733] [2020-10-09 15:35:36,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:36,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:36,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:36,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:36,455 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:35:36,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 635 transitions, 1399 flow. Second operand 3 states. [2020-10-09 15:35:36,457 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:36,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:35:36,457 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:36,650 INFO L129 PetriNetUnfolder]: 69/708 cut-off events. [2020-10-09 15:35:36,651 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:36,687 INFO L80 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 708 events. 69/708 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2813 event pairs, 0 based on Foata normal form. 0/614 useless extension candidates. Maximal degree in co-relation 785. Up to 25 conditions per place. [2020-10-09 15:35:36,697 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 8 selfloop transitions, 2 changer transitions 0/634 dead transitions. [2020-10-09 15:35:36,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 634 transitions, 1417 flow [2020-10-09 15:35:36,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1895 transitions. [2020-10-09 15:35:36,699 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.949874686716792 [2020-10-09 15:35:36,699 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1895 transitions. [2020-10-09 15:35:36,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1895 transitions. [2020-10-09 15:35:36,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:36,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1895 transitions. [2020-10-09 15:35:36,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:36,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:36,701 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:36,701 INFO L185 Difference]: Start difference. First operand has 617 places, 635 transitions, 1399 flow. Second operand 3 states and 1895 transitions. [2020-10-09 15:35:36,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 634 transitions, 1417 flow [2020-10-09 15:35:36,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 634 transitions, 1416 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:36,707 INFO L241 Difference]: Finished difference. Result has 618 places, 634 transitions, 1400 flow [2020-10-09 15:35:36,707 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1400, PETRI_PLACES=618, PETRI_TRANSITIONS=634} [2020-10-09 15:35:36,707 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 1 predicate places. [2020-10-09 15:35:36,707 INFO L481 AbstractCegarLoop]: Abstraction has has 618 places, 634 transitions, 1400 flow [2020-10-09 15:35:36,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:36,707 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:36,707 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:36,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 788 mathsat -unsat_core_generation=3 [2020-10-09 15:35:36,908 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:36,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:36,908 INFO L82 PathProgramCache]: Analyzing trace with hash -819680219, now seen corresponding path program 1 times [2020-10-09 15:35:36,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:36,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696503916] [2020-10-09 15:35:36,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 789 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 789 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:37,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:37,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:35:37,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:35:37,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696503916] [2020-10-09 15:35:37,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:37,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:37,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443854026] [2020-10-09 15:35:37,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:37,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:37,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:37,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:37,402 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:35:37,403 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 634 transitions, 1400 flow. Second operand 3 states. [2020-10-09 15:35:37,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:37,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:35:37,403 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:37,607 INFO L129 PetriNetUnfolder]: 69/706 cut-off events. [2020-10-09 15:35:37,607 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:35:37,647 INFO L80 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 706 events. 69/706 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2798 event pairs, 0 based on Foata normal form. 1/615 useless extension candidates. Maximal degree in co-relation 780. Up to 25 conditions per place. [2020-10-09 15:35:37,658 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/632 dead transitions. [2020-10-09 15:35:37,658 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 632 transitions, 1412 flow [2020-10-09 15:35:37,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:37,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:37,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2020-10-09 15:35:37,660 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9493734335839599 [2020-10-09 15:35:37,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2020-10-09 15:35:37,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2020-10-09 15:35:37,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:37,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2020-10-09 15:35:37,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:37,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:37,663 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:37,663 INFO L185 Difference]: Start difference. First operand has 618 places, 634 transitions, 1400 flow. Second operand 3 states and 1894 transitions. [2020-10-09 15:35:37,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 632 transitions, 1412 flow [2020-10-09 15:35:37,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 632 transitions, 1411 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:37,669 INFO L241 Difference]: Finished difference. Result has 617 places, 632 transitions, 1395 flow [2020-10-09 15:35:37,669 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1393, PETRI_DIFFERENCE_MINUEND_PLACES=615, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1395, PETRI_PLACES=617, PETRI_TRANSITIONS=632} [2020-10-09 15:35:37,669 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 0 predicate places. [2020-10-09 15:35:37,669 INFO L481 AbstractCegarLoop]: Abstraction has has 617 places, 632 transitions, 1395 flow [2020-10-09 15:35:37,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:37,670 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:37,670 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:35:37,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 789 mathsat -unsat_core_generation=3 [2020-10-09 15:35:37,870 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:37,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:37,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1700730001, now seen corresponding path program 1 times [2020-10-09 15:35:37,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:37,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289264558] [2020-10-09 15:35:37,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 790 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 790 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:38,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:38,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:38,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:35:38,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:35:38,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289264558] [2020-10-09 15:35:38,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:38,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:38,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462733012] [2020-10-09 15:35:38,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:38,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:38,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:38,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:38,361 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:35:38,362 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 632 transitions, 1395 flow. Second operand 3 states. [2020-10-09 15:35:38,362 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:38,362 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:35:38,362 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:38,574 INFO L129 PetriNetUnfolder]: 67/711 cut-off events. [2020-10-09 15:35:38,574 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:38,611 INFO L80 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 711 events. 67/711 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2851 event pairs, 0 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 786. Up to 25 conditions per place. [2020-10-09 15:35:38,621 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 5 selfloop transitions, 2 changer transitions 0/633 dead transitions. [2020-10-09 15:35:38,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 633 transitions, 1411 flow [2020-10-09 15:35:38,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1907 transitions. [2020-10-09 15:35:38,622 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9558897243107769 [2020-10-09 15:35:38,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1907 transitions. [2020-10-09 15:35:38,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1907 transitions. [2020-10-09 15:35:38,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:38,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1907 transitions. [2020-10-09 15:35:38,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:38,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:38,624 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:38,624 INFO L185 Difference]: Start difference. First operand has 617 places, 632 transitions, 1395 flow. Second operand 3 states and 1907 transitions. [2020-10-09 15:35:38,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 633 transitions, 1411 flow [2020-10-09 15:35:38,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 633 transitions, 1410 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:38,630 INFO L241 Difference]: Finished difference. Result has 620 places, 633 transitions, 1408 flow [2020-10-09 15:35:38,630 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1394, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1408, PETRI_PLACES=620, PETRI_TRANSITIONS=633} [2020-10-09 15:35:38,630 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 3 predicate places. [2020-10-09 15:35:38,630 INFO L481 AbstractCegarLoop]: Abstraction has has 620 places, 633 transitions, 1408 flow [2020-10-09 15:35:38,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:38,630 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:38,630 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:35:38,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 790 mathsat -unsat_core_generation=3 [2020-10-09 15:35:38,831 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:38,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:38,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1700728978, now seen corresponding path program 1 times [2020-10-09 15:35:38,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:38,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739973998] [2020-10-09 15:35:38,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 791 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 791 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:39,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:39,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:35:39,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:35:39,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739973998] [2020-10-09 15:35:39,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:39,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:39,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818223649] [2020-10-09 15:35:39,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:39,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:39,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:39,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:39,330 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:35:39,331 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 633 transitions, 1408 flow. Second operand 3 states. [2020-10-09 15:35:39,331 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:39,332 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:35:39,332 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:39,530 INFO L129 PetriNetUnfolder]: 67/712 cut-off events. [2020-10-09 15:35:39,530 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:35:39,571 INFO L80 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 712 events. 67/712 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2857 event pairs, 0 based on Foata normal form. 0/620 useless extension candidates. Maximal degree in co-relation 794. Up to 25 conditions per place. [2020-10-09 15:35:39,582 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/634 dead transitions. [2020-10-09 15:35:39,583 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 634 transitions, 1434 flow [2020-10-09 15:35:39,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1897 transitions. [2020-10-09 15:35:39,584 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508771929824561 [2020-10-09 15:35:39,585 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1897 transitions. [2020-10-09 15:35:39,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1897 transitions. [2020-10-09 15:35:39,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:39,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1897 transitions. [2020-10-09 15:35:39,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:39,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:39,587 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:39,587 INFO L185 Difference]: Start difference. First operand has 620 places, 633 transitions, 1408 flow. Second operand 3 states and 1897 transitions. [2020-10-09 15:35:39,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 634 transitions, 1434 flow [2020-10-09 15:35:39,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 634 transitions, 1432 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:39,594 INFO L241 Difference]: Finished difference. Result has 623 places, 634 transitions, 1424 flow [2020-10-09 15:35:39,595 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1424, PETRI_PLACES=623, PETRI_TRANSITIONS=634} [2020-10-09 15:35:39,595 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 6 predicate places. [2020-10-09 15:35:39,595 INFO L481 AbstractCegarLoop]: Abstraction has has 623 places, 634 transitions, 1424 flow [2020-10-09 15:35:39,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:39,595 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:39,595 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:35:39,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 791 mathsat -unsat_core_generation=3 [2020-10-09 15:35:39,796 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:39,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:39,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1701682290, now seen corresponding path program 1 times [2020-10-09 15:35:39,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:39,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962429644] [2020-10-09 15:35:39,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 792 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 792 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:40,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:35:40,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:35:40,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:40,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:35:40,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962429644] [2020-10-09 15:35:40,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:40,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:40,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594472660] [2020-10-09 15:35:40,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:40,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:40,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:40,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:40,318 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:35:40,319 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 634 transitions, 1424 flow. Second operand 3 states. [2020-10-09 15:35:40,320 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:40,320 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:35:40,320 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:40,512 INFO L129 PetriNetUnfolder]: 66/708 cut-off events. [2020-10-09 15:35:40,513 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:35:40,549 INFO L80 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 708 events. 66/708 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2833 event pairs, 0 based on Foata normal form. 1/620 useless extension candidates. Maximal degree in co-relation 786. Up to 25 conditions per place. [2020-10-09 15:35:40,559 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/631 dead transitions. [2020-10-09 15:35:40,559 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 631 transitions, 1419 flow [2020-10-09 15:35:40,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:40,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:35:40,561 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:35:40,561 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:35:40,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:35:40,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:40,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:35:40,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:40,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:40,563 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:40,563 INFO L185 Difference]: Start difference. First operand has 623 places, 634 transitions, 1424 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:35:40,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 631 transitions, 1419 flow [2020-10-09 15:35:40,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 631 transitions, 1411 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:35:40,568 INFO L241 Difference]: Finished difference. Result has 622 places, 631 transitions, 1403 flow [2020-10-09 15:35:40,569 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1403, PETRI_PLACES=622, PETRI_TRANSITIONS=631} [2020-10-09 15:35:40,569 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 5 predicate places. [2020-10-09 15:35:40,569 INFO L481 AbstractCegarLoop]: Abstraction has has 622 places, 631 transitions, 1403 flow [2020-10-09 15:35:40,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:40,569 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:40,569 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:35:40,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 792 mathsat -unsat_core_generation=3 [2020-10-09 15:35:40,770 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:40,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:40,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1701683313, now seen corresponding path program 1 times [2020-10-09 15:35:40,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:40,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082170660] [2020-10-09 15:35:40,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 793 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 793 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:41,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:41,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:35:41,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:35:41,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082170660] [2020-10-09 15:35:41,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:41,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:41,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163788503] [2020-10-09 15:35:41,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:41,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:41,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:41,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:41,265 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:35:41,266 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 631 transitions, 1403 flow. Second operand 3 states. [2020-10-09 15:35:41,266 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:41,266 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:35:41,266 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:41,460 INFO L129 PetriNetUnfolder]: 66/706 cut-off events. [2020-10-09 15:35:41,460 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:41,497 INFO L80 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 706 events. 66/706 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2819 event pairs, 0 based on Foata normal form. 0/616 useless extension candidates. Maximal degree in co-relation 790. Up to 25 conditions per place. [2020-10-09 15:35:41,506 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/629 dead transitions. [2020-10-09 15:35:41,507 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 629 transitions, 1416 flow [2020-10-09 15:35:41,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:41,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2020-10-09 15:35:41,508 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9493734335839599 [2020-10-09 15:35:41,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2020-10-09 15:35:41,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2020-10-09 15:35:41,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:41,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2020-10-09 15:35:41,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:41,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:41,510 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:41,510 INFO L185 Difference]: Start difference. First operand has 622 places, 631 transitions, 1403 flow. Second operand 3 states and 1894 transitions. [2020-10-09 15:35:41,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 629 transitions, 1416 flow [2020-10-09 15:35:41,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 629 transitions, 1415 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:41,516 INFO L241 Difference]: Finished difference. Result has 621 places, 629 transitions, 1399 flow [2020-10-09 15:35:41,516 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1399, PETRI_PLACES=621, PETRI_TRANSITIONS=629} [2020-10-09 15:35:41,516 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 4 predicate places. [2020-10-09 15:35:41,516 INFO L481 AbstractCegarLoop]: Abstraction has has 621 places, 629 transitions, 1399 flow [2020-10-09 15:35:41,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:41,516 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:41,516 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:35:41,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 793 mathsat -unsat_core_generation=3 [2020-10-09 15:35:41,717 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:41,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:41,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1557799102, now seen corresponding path program 1 times [2020-10-09 15:35:41,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:41,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790905901] [2020-10-09 15:35:41,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 794 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 794 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:42,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:42,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:35:42,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:35:42,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790905901] [2020-10-09 15:35:42,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:42,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:42,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603289145] [2020-10-09 15:35:42,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:42,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:42,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:42,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:42,220 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:35:42,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 629 transitions, 1399 flow. Second operand 3 states. [2020-10-09 15:35:42,221 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:42,221 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:35:42,222 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:42,422 INFO L129 PetriNetUnfolder]: 65/714 cut-off events. [2020-10-09 15:35:42,422 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:42,460 INFO L80 FinitePrefix]: Finished finitePrefix Result has 842 conditions, 714 events. 65/714 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2889 event pairs, 0 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 802. Up to 25 conditions per place. [2020-10-09 15:35:42,470 INFO L132 encePairwiseOnDemand]: 660/665 looper letters, 10 selfloop transitions, 3 changer transitions 0/631 dead transitions. [2020-10-09 15:35:42,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 631 transitions, 1429 flow [2020-10-09 15:35:42,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1899 transitions. [2020-10-09 15:35:42,471 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518796992481203 [2020-10-09 15:35:42,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1899 transitions. [2020-10-09 15:35:42,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1899 transitions. [2020-10-09 15:35:42,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:42,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1899 transitions. [2020-10-09 15:35:42,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:42,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:42,473 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:42,473 INFO L185 Difference]: Start difference. First operand has 621 places, 629 transitions, 1399 flow. Second operand 3 states and 1899 transitions. [2020-10-09 15:35:42,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 623 places, 631 transitions, 1429 flow [2020-10-09 15:35:42,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 631 transitions, 1428 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:42,479 INFO L241 Difference]: Finished difference. Result has 624 places, 631 transitions, 1422 flow [2020-10-09 15:35:42,479 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1422, PETRI_PLACES=624, PETRI_TRANSITIONS=631} [2020-10-09 15:35:42,480 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 7 predicate places. [2020-10-09 15:35:42,480 INFO L481 AbstractCegarLoop]: Abstraction has has 624 places, 631 transitions, 1422 flow [2020-10-09 15:35:42,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:42,480 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:42,480 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:35:42,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 794 mathsat -unsat_core_generation=3 [2020-10-09 15:35:42,681 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:42,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:42,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1557798079, now seen corresponding path program 1 times [2020-10-09 15:35:42,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:42,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825659544] [2020-10-09 15:35:42,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 795 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 795 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:43,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:35:43,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:35:43,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:35:43,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825659544] [2020-10-09 15:35:43,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:43,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:43,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746115026] [2020-10-09 15:35:43,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:43,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:43,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:43,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:43,167 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:35:43,168 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 631 transitions, 1422 flow. Second operand 3 states. [2020-10-09 15:35:43,169 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:43,169 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:35:43,169 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:43,368 INFO L129 PetriNetUnfolder]: 63/715 cut-off events. [2020-10-09 15:35:43,369 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:35:43,406 INFO L80 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 715 events. 63/715 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2913 event pairs, 0 based on Foata normal form. 1/630 useless extension candidates. Maximal degree in co-relation 800. Up to 25 conditions per place. [2020-10-09 15:35:43,416 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/630 dead transitions. [2020-10-09 15:35:43,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 630 transitions, 1428 flow [2020-10-09 15:35:43,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:43,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:35:43,417 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:35:43,417 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:35:43,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:35:43,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:43,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:35:43,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:43,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:43,419 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:43,419 INFO L185 Difference]: Start difference. First operand has 624 places, 631 transitions, 1422 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:35:43,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 630 transitions, 1428 flow [2020-10-09 15:35:43,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 630 transitions, 1423 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:43,425 INFO L241 Difference]: Finished difference. Result has 626 places, 630 transitions, 1418 flow [2020-10-09 15:35:43,425 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1413, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1418, PETRI_PLACES=626, PETRI_TRANSITIONS=630} [2020-10-09 15:35:43,426 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 9 predicate places. [2020-10-09 15:35:43,426 INFO L481 AbstractCegarLoop]: Abstraction has has 626 places, 630 transitions, 1418 flow [2020-10-09 15:35:43,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:43,426 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:43,426 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:35:43,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 795 mathsat -unsat_core_generation=3 [2020-10-09 15:35:43,627 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:43,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:43,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1556845790, now seen corresponding path program 1 times [2020-10-09 15:35:43,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:43,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293089929] [2020-10-09 15:35:43,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 796 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 796 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:44,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:44,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:35:44,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:44,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:35:44,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293089929] [2020-10-09 15:35:44,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:44,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:44,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750580306] [2020-10-09 15:35:44,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:44,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:44,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:44,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:44,152 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:35:44,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 630 transitions, 1418 flow. Second operand 3 states. [2020-10-09 15:35:44,153 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:44,153 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:35:44,153 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:44,351 INFO L129 PetriNetUnfolder]: 63/708 cut-off events. [2020-10-09 15:35:44,351 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:35:44,388 INFO L80 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 708 events. 63/708 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2852 event pairs, 0 based on Foata normal form. 1/623 useless extension candidates. Maximal degree in co-relation 796. Up to 25 conditions per place. [2020-10-09 15:35:44,398 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/628 dead transitions. [2020-10-09 15:35:44,398 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 628 transitions, 1421 flow [2020-10-09 15:35:44,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:44,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2020-10-09 15:35:44,399 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9553884711779449 [2020-10-09 15:35:44,399 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2020-10-09 15:35:44,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2020-10-09 15:35:44,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:44,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2020-10-09 15:35:44,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:44,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:44,401 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:44,401 INFO L185 Difference]: Start difference. First operand has 626 places, 630 transitions, 1418 flow. Second operand 3 states and 1906 transitions. [2020-10-09 15:35:44,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 628 transitions, 1421 flow [2020-10-09 15:35:44,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 628 transitions, 1414 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:35:44,407 INFO L241 Difference]: Finished difference. Result has 626 places, 628 transitions, 1407 flow [2020-10-09 15:35:44,407 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1407, PETRI_PLACES=626, PETRI_TRANSITIONS=628} [2020-10-09 15:35:44,407 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 9 predicate places. [2020-10-09 15:35:44,408 INFO L481 AbstractCegarLoop]: Abstraction has has 626 places, 628 transitions, 1407 flow [2020-10-09 15:35:44,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:44,408 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:44,408 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:35:44,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 796 mathsat -unsat_core_generation=3 [2020-10-09 15:35:44,608 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:44,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:44,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1556844767, now seen corresponding path program 1 times [2020-10-09 15:35:44,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:44,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137203021] [2020-10-09 15:35:44,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 797 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 797 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:45,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:45,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:35:45,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:35:45,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137203021] [2020-10-09 15:35:45,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:45,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:45,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314145813] [2020-10-09 15:35:45,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:45,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:45,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:45,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:45,097 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:35:45,098 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 628 transitions, 1407 flow. Second operand 3 states. [2020-10-09 15:35:45,098 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:45,099 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:35:45,099 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:45,304 INFO L129 PetriNetUnfolder]: 63/706 cut-off events. [2020-10-09 15:35:45,305 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:35:45,354 INFO L80 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 706 events. 63/706 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2839 event pairs, 0 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 796. Up to 25 conditions per place. [2020-10-09 15:35:45,365 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/626 dead transitions. [2020-10-09 15:35:45,365 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 626 transitions, 1420 flow [2020-10-09 15:35:45,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:45,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:45,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2020-10-09 15:35:45,366 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9493734335839599 [2020-10-09 15:35:45,366 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2020-10-09 15:35:45,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2020-10-09 15:35:45,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:45,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2020-10-09 15:35:45,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:45,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:45,368 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:45,368 INFO L185 Difference]: Start difference. First operand has 626 places, 628 transitions, 1407 flow. Second operand 3 states and 1894 transitions. [2020-10-09 15:35:45,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 626 transitions, 1420 flow [2020-10-09 15:35:45,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 626 transitions, 1419 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:45,374 INFO L241 Difference]: Finished difference. Result has 625 places, 626 transitions, 1403 flow [2020-10-09 15:35:45,375 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1403, PETRI_PLACES=625, PETRI_TRANSITIONS=626} [2020-10-09 15:35:45,375 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 8 predicate places. [2020-10-09 15:35:45,375 INFO L481 AbstractCegarLoop]: Abstraction has has 625 places, 626 transitions, 1403 flow [2020-10-09 15:35:45,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:45,375 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:45,375 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:35:45,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 797 mathsat -unsat_core_generation=3 [2020-10-09 15:35:45,576 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:45,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:45,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1423806124, now seen corresponding path program 1 times [2020-10-09 15:35:45,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:45,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097516126] [2020-10-09 15:35:45,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 798 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 798 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:46,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:46,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:35:46,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:35:46,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097516126] [2020-10-09 15:35:46,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:46,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:46,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767004092] [2020-10-09 15:35:46,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:46,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:46,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:46,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:46,066 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:35:46,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 626 transitions, 1403 flow. Second operand 3 states. [2020-10-09 15:35:46,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:46,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:35:46,068 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:46,272 INFO L129 PetriNetUnfolder]: 61/711 cut-off events. [2020-10-09 15:35:46,273 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:46,311 INFO L80 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 711 events. 61/711 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2887 event pairs, 0 based on Foata normal form. 0/625 useless extension candidates. Maximal degree in co-relation 799. Up to 25 conditions per place. [2020-10-09 15:35:46,320 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 5 selfloop transitions, 2 changer transitions 0/627 dead transitions. [2020-10-09 15:35:46,321 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 627 transitions, 1419 flow [2020-10-09 15:35:46,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1907 transitions. [2020-10-09 15:35:46,322 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9558897243107769 [2020-10-09 15:35:46,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1907 transitions. [2020-10-09 15:35:46,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1907 transitions. [2020-10-09 15:35:46,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:46,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1907 transitions. [2020-10-09 15:35:46,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:46,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:46,325 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:46,325 INFO L185 Difference]: Start difference. First operand has 625 places, 626 transitions, 1403 flow. Second operand 3 states and 1907 transitions. [2020-10-09 15:35:46,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 627 transitions, 1419 flow [2020-10-09 15:35:46,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 627 transitions, 1418 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:46,331 INFO L241 Difference]: Finished difference. Result has 628 places, 627 transitions, 1416 flow [2020-10-09 15:35:46,331 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1416, PETRI_PLACES=628, PETRI_TRANSITIONS=627} [2020-10-09 15:35:46,331 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 11 predicate places. [2020-10-09 15:35:46,331 INFO L481 AbstractCegarLoop]: Abstraction has has 628 places, 627 transitions, 1416 flow [2020-10-09 15:35:46,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:46,331 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:46,331 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:35:46,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 798 mathsat -unsat_core_generation=3 [2020-10-09 15:35:46,532 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:46,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:46,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1423805101, now seen corresponding path program 1 times [2020-10-09 15:35:46,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:46,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888979642] [2020-10-09 15:35:46,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 799 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 799 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:47,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:47,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:35:47,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:35:47,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888979642] [2020-10-09 15:35:47,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:47,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:47,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277271814] [2020-10-09 15:35:47,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:47,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:47,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:47,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:47,045 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:35:47,046 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 627 transitions, 1416 flow. Second operand 3 states. [2020-10-09 15:35:47,046 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:47,046 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:35:47,046 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:47,255 INFO L129 PetriNetUnfolder]: 61/712 cut-off events. [2020-10-09 15:35:47,255 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:35:47,295 INFO L80 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 712 events. 61/712 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2893 event pairs, 0 based on Foata normal form. 0/626 useless extension candidates. Maximal degree in co-relation 807. Up to 25 conditions per place. [2020-10-09 15:35:47,304 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/628 dead transitions. [2020-10-09 15:35:47,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 628 transitions, 1442 flow [2020-10-09 15:35:47,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:47,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1897 transitions. [2020-10-09 15:35:47,306 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508771929824561 [2020-10-09 15:35:47,306 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1897 transitions. [2020-10-09 15:35:47,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1897 transitions. [2020-10-09 15:35:47,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:47,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1897 transitions. [2020-10-09 15:35:47,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:47,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:47,308 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:47,308 INFO L185 Difference]: Start difference. First operand has 628 places, 627 transitions, 1416 flow. Second operand 3 states and 1897 transitions. [2020-10-09 15:35:47,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 628 transitions, 1442 flow [2020-10-09 15:35:47,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 628 transitions, 1440 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:47,313 INFO L241 Difference]: Finished difference. Result has 631 places, 628 transitions, 1432 flow [2020-10-09 15:35:47,314 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1432, PETRI_PLACES=631, PETRI_TRANSITIONS=628} [2020-10-09 15:35:47,314 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 14 predicate places. [2020-10-09 15:35:47,314 INFO L481 AbstractCegarLoop]: Abstraction has has 631 places, 628 transitions, 1432 flow [2020-10-09 15:35:47,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:47,314 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:47,314 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:35:47,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 799 mathsat -unsat_core_generation=3 [2020-10-09 15:35:47,515 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:47,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:47,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1424759436, now seen corresponding path program 1 times [2020-10-09 15:35:47,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:47,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620220773] [2020-10-09 15:35:47,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 800 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 800 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:47,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:47,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:35:47,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:47,986 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:35:47,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620220773] [2020-10-09 15:35:47,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:47,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:47,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237919057] [2020-10-09 15:35:47,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:47,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:47,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:47,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:48,023 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:35:48,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 628 transitions, 1432 flow. Second operand 3 states. [2020-10-09 15:35:48,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:48,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:35:48,024 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:48,234 INFO L129 PetriNetUnfolder]: 60/709 cut-off events. [2020-10-09 15:35:48,234 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2020-10-09 15:35:48,273 INFO L80 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 709 events. 60/709 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2875 event pairs, 0 based on Foata normal form. 2/627 useless extension candidates. Maximal degree in co-relation 806. Up to 25 conditions per place. [2020-10-09 15:35:48,282 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 9 selfloop transitions, 1 changer transitions 0/626 dead transitions. [2020-10-09 15:35:48,282 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 626 transitions, 1440 flow [2020-10-09 15:35:48,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2020-10-09 15:35:48,284 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503759398496241 [2020-10-09 15:35:48,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1896 transitions. [2020-10-09 15:35:48,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1896 transitions. [2020-10-09 15:35:48,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:48,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1896 transitions. [2020-10-09 15:35:48,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:48,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:48,286 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:48,286 INFO L185 Difference]: Start difference. First operand has 631 places, 628 transitions, 1432 flow. Second operand 3 states and 1896 transitions. [2020-10-09 15:35:48,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 626 transitions, 1440 flow [2020-10-09 15:35:48,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 626 transitions, 1439 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:48,291 INFO L241 Difference]: Finished difference. Result has 632 places, 626 transitions, 1421 flow [2020-10-09 15:35:48,292 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1421, PETRI_PLACES=632, PETRI_TRANSITIONS=626} [2020-10-09 15:35:48,292 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 15 predicate places. [2020-10-09 15:35:48,292 INFO L481 AbstractCegarLoop]: Abstraction has has 632 places, 626 transitions, 1421 flow [2020-10-09 15:35:48,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:48,292 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:48,292 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:35:48,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 800 mathsat -unsat_core_generation=3 [2020-10-09 15:35:48,493 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:48,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:48,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1424758413, now seen corresponding path program 1 times [2020-10-09 15:35:48,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:48,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562522971] [2020-10-09 15:35:48,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 801 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 801 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:49,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:35:49,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:35:49,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:49,022 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:35:49,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562522971] [2020-10-09 15:35:49,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:49,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:49,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26979856] [2020-10-09 15:35:49,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:49,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:49,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:49,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:49,036 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:35:49,037 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 626 transitions, 1421 flow. Second operand 3 states. [2020-10-09 15:35:49,037 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:49,037 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:35:49,038 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:49,238 INFO L129 PetriNetUnfolder]: 60/706 cut-off events. [2020-10-09 15:35:49,238 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:35:49,275 INFO L80 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 706 events. 60/706 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2853 event pairs, 0 based on Foata normal form. 1/624 useless extension candidates. Maximal degree in co-relation 800. Up to 25 conditions per place. [2020-10-09 15:35:49,283 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/623 dead transitions. [2020-10-09 15:35:49,283 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 623 transitions, 1420 flow [2020-10-09 15:35:49,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:49,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:35:49,285 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:35:49,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:35:49,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:35:49,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:49,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:35:49,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:49,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:49,287 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:49,287 INFO L185 Difference]: Start difference. First operand has 632 places, 626 transitions, 1421 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:35:49,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 623 transitions, 1420 flow [2020-10-09 15:35:49,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 623 transitions, 1415 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:35:49,292 INFO L241 Difference]: Finished difference. Result has 629 places, 623 transitions, 1407 flow [2020-10-09 15:35:49,293 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1407, PETRI_PLACES=629, PETRI_TRANSITIONS=623} [2020-10-09 15:35:49,293 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 12 predicate places. [2020-10-09 15:35:49,293 INFO L481 AbstractCegarLoop]: Abstraction has has 629 places, 623 transitions, 1407 flow [2020-10-09 15:35:49,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:49,293 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:49,293 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:49,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 801 mathsat -unsat_core_generation=3 [2020-10-09 15:35:49,494 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:49,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:49,494 INFO L82 PathProgramCache]: Analyzing trace with hash -525445797, now seen corresponding path program 1 times [2020-10-09 15:35:49,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:49,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376987635] [2020-10-09 15:35:49,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 802 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 802 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:49,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:49,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:35:49,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:35:49,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376987635] [2020-10-09 15:35:49,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:49,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:49,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005331255] [2020-10-09 15:35:49,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:49,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:49,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:49,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:50,004 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:35:50,005 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 623 transitions, 1407 flow. Second operand 3 states. [2020-10-09 15:35:50,005 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:50,005 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:35:50,006 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:50,218 INFO L129 PetriNetUnfolder]: 59/714 cut-off events. [2020-10-09 15:35:50,218 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:50,257 INFO L80 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 714 events. 59/714 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2923 event pairs, 0 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 817. Up to 25 conditions per place. [2020-10-09 15:35:50,266 INFO L132 encePairwiseOnDemand]: 660/665 looper letters, 10 selfloop transitions, 3 changer transitions 0/625 dead transitions. [2020-10-09 15:35:50,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 625 transitions, 1437 flow [2020-10-09 15:35:50,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:50,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1899 transitions. [2020-10-09 15:35:50,267 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518796992481203 [2020-10-09 15:35:50,267 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1899 transitions. [2020-10-09 15:35:50,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1899 transitions. [2020-10-09 15:35:50,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:50,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1899 transitions. [2020-10-09 15:35:50,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:50,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:50,269 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:50,269 INFO L185 Difference]: Start difference. First operand has 629 places, 623 transitions, 1407 flow. Second operand 3 states and 1899 transitions. [2020-10-09 15:35:50,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 625 transitions, 1437 flow [2020-10-09 15:35:50,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 625 transitions, 1436 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:50,275 INFO L241 Difference]: Finished difference. Result has 632 places, 625 transitions, 1430 flow [2020-10-09 15:35:50,276 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1430, PETRI_PLACES=632, PETRI_TRANSITIONS=625} [2020-10-09 15:35:50,276 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 15 predicate places. [2020-10-09 15:35:50,276 INFO L481 AbstractCegarLoop]: Abstraction has has 632 places, 625 transitions, 1430 flow [2020-10-09 15:35:50,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:50,276 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:50,276 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:50,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 802 mathsat -unsat_core_generation=3 [2020-10-09 15:35:50,477 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:50,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:50,477 INFO L82 PathProgramCache]: Analyzing trace with hash -525446820, now seen corresponding path program 1 times [2020-10-09 15:35:50,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:50,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254460677] [2020-10-09 15:35:50,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 803 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 803 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:50,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:35:50,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:35:50,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:35:50,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254460677] [2020-10-09 15:35:50,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:50,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:50,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975343419] [2020-10-09 15:35:50,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:50,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:50,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:50,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:50,976 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:35:50,977 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 625 transitions, 1430 flow. Second operand 3 states. [2020-10-09 15:35:50,977 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:50,977 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:35:50,977 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:51,200 INFO L129 PetriNetUnfolder]: 57/715 cut-off events. [2020-10-09 15:35:51,200 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:35:51,238 INFO L80 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 715 events. 57/715 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2949 event pairs, 0 based on Foata normal form. 1/636 useless extension candidates. Maximal degree in co-relation 813. Up to 25 conditions per place. [2020-10-09 15:35:51,246 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/624 dead transitions. [2020-10-09 15:35:51,246 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 624 transitions, 1436 flow [2020-10-09 15:35:51,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:35:51,248 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:35:51,248 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:35:51,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:35:51,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:51,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:35:51,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:51,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:51,250 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:51,250 INFO L185 Difference]: Start difference. First operand has 632 places, 625 transitions, 1430 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:35:51,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 624 transitions, 1436 flow [2020-10-09 15:35:51,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 624 transitions, 1431 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:51,256 INFO L241 Difference]: Finished difference. Result has 634 places, 624 transitions, 1426 flow [2020-10-09 15:35:51,256 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1421, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1426, PETRI_PLACES=634, PETRI_TRANSITIONS=624} [2020-10-09 15:35:51,256 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 17 predicate places. [2020-10-09 15:35:51,256 INFO L481 AbstractCegarLoop]: Abstraction has has 634 places, 624 transitions, 1426 flow [2020-10-09 15:35:51,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:51,257 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:51,257 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:51,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 803 mathsat -unsat_core_generation=3 [2020-10-09 15:35:51,457 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:51,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:51,458 INFO L82 PathProgramCache]: Analyzing trace with hash -526399109, now seen corresponding path program 1 times [2020-10-09 15:35:51,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:51,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889764214] [2020-10-09 15:35:51,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 804 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 804 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:51,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:51,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:35:51,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:51,934 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:35:51,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889764214] [2020-10-09 15:35:51,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:51,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:51,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237354098] [2020-10-09 15:35:51,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:51,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:51,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:51,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:51,952 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:35:51,953 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 624 transitions, 1426 flow. Second operand 3 states. [2020-10-09 15:35:51,953 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:51,953 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:35:51,953 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:52,161 INFO L129 PetriNetUnfolder]: 57/708 cut-off events. [2020-10-09 15:35:52,161 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:35:52,200 INFO L80 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 708 events. 57/708 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2885 event pairs, 0 based on Foata normal form. 1/629 useless extension candidates. Maximal degree in co-relation 809. Up to 25 conditions per place. [2020-10-09 15:35:52,208 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/622 dead transitions. [2020-10-09 15:35:52,208 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 622 transitions, 1429 flow [2020-10-09 15:35:52,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2020-10-09 15:35:52,210 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9553884711779449 [2020-10-09 15:35:52,210 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2020-10-09 15:35:52,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2020-10-09 15:35:52,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:52,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2020-10-09 15:35:52,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:52,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:52,212 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:52,212 INFO L185 Difference]: Start difference. First operand has 634 places, 624 transitions, 1426 flow. Second operand 3 states and 1906 transitions. [2020-10-09 15:35:52,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 622 transitions, 1429 flow [2020-10-09 15:35:52,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 622 transitions, 1422 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:35:52,218 INFO L241 Difference]: Finished difference. Result has 634 places, 622 transitions, 1415 flow [2020-10-09 15:35:52,218 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1410, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1415, PETRI_PLACES=634, PETRI_TRANSITIONS=622} [2020-10-09 15:35:52,218 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 17 predicate places. [2020-10-09 15:35:52,218 INFO L481 AbstractCegarLoop]: Abstraction has has 634 places, 622 transitions, 1415 flow [2020-10-09 15:35:52,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:52,218 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:52,219 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:52,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 804 mathsat -unsat_core_generation=3 [2020-10-09 15:35:52,419 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:52,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:52,420 INFO L82 PathProgramCache]: Analyzing trace with hash -526400132, now seen corresponding path program 1 times [2020-10-09 15:35:52,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:52,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679162225] [2020-10-09 15:35:52,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 805 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 805 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:52,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:52,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:35:52,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:52,893 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:35:52,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679162225] [2020-10-09 15:35:52,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:52,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:52,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151445626] [2020-10-09 15:35:52,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:52,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:52,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:52,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:52,912 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:35:52,913 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 622 transitions, 1415 flow. Second operand 3 states. [2020-10-09 15:35:52,913 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:52,913 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:35:52,914 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:53,120 INFO L129 PetriNetUnfolder]: 57/706 cut-off events. [2020-10-09 15:35:53,120 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:35:53,157 INFO L80 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 706 events. 57/706 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2871 event pairs, 0 based on Foata normal form. 0/625 useless extension candidates. Maximal degree in co-relation 809. Up to 25 conditions per place. [2020-10-09 15:35:53,165 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/620 dead transitions. [2020-10-09 15:35:53,165 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 620 transitions, 1428 flow [2020-10-09 15:35:53,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2020-10-09 15:35:53,167 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9493734335839599 [2020-10-09 15:35:53,167 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2020-10-09 15:35:53,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2020-10-09 15:35:53,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:53,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2020-10-09 15:35:53,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:53,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:53,169 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:53,169 INFO L185 Difference]: Start difference. First operand has 634 places, 622 transitions, 1415 flow. Second operand 3 states and 1894 transitions. [2020-10-09 15:35:53,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 620 transitions, 1428 flow [2020-10-09 15:35:53,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 620 transitions, 1427 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:53,175 INFO L241 Difference]: Finished difference. Result has 633 places, 620 transitions, 1411 flow [2020-10-09 15:35:53,175 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1409, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1411, PETRI_PLACES=633, PETRI_TRANSITIONS=620} [2020-10-09 15:35:53,175 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 16 predicate places. [2020-10-09 15:35:53,175 INFO L481 AbstractCegarLoop]: Abstraction has has 633 places, 620 transitions, 1411 flow [2020-10-09 15:35:53,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:53,175 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:53,175 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:53,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 805 mathsat -unsat_core_generation=3 [2020-10-09 15:35:53,376 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:53,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:53,376 INFO L82 PathProgramCache]: Analyzing trace with hash -9954645, now seen corresponding path program 1 times [2020-10-09 15:35:53,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:53,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559343868] [2020-10-09 15:35:53,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 806 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 806 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:53,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:53,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:35:53,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:35:53,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559343868] [2020-10-09 15:35:53,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:53,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:53,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809008593] [2020-10-09 15:35:53,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:53,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:53,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:53,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:53,917 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:35:53,918 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 620 transitions, 1411 flow. Second operand 3 states. [2020-10-09 15:35:53,918 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:53,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:35:53,918 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:54,132 INFO L129 PetriNetUnfolder]: 56/714 cut-off events. [2020-10-09 15:35:54,132 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:54,172 INFO L80 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 714 events. 56/714 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2939 event pairs, 0 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 821. Up to 25 conditions per place. [2020-10-09 15:35:54,181 INFO L132 encePairwiseOnDemand]: 660/665 looper letters, 10 selfloop transitions, 3 changer transitions 0/622 dead transitions. [2020-10-09 15:35:54,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 622 transitions, 1441 flow [2020-10-09 15:35:54,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1899 transitions. [2020-10-09 15:35:54,182 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518796992481203 [2020-10-09 15:35:54,182 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1899 transitions. [2020-10-09 15:35:54,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1899 transitions. [2020-10-09 15:35:54,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:54,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1899 transitions. [2020-10-09 15:35:54,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:54,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:54,184 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:54,184 INFO L185 Difference]: Start difference. First operand has 633 places, 620 transitions, 1411 flow. Second operand 3 states and 1899 transitions. [2020-10-09 15:35:54,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 622 transitions, 1441 flow [2020-10-09 15:35:54,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 622 transitions, 1440 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:54,190 INFO L241 Difference]: Finished difference. Result has 636 places, 622 transitions, 1434 flow [2020-10-09 15:35:54,190 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1410, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1434, PETRI_PLACES=636, PETRI_TRANSITIONS=622} [2020-10-09 15:35:54,190 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 19 predicate places. [2020-10-09 15:35:54,190 INFO L481 AbstractCegarLoop]: Abstraction has has 636 places, 622 transitions, 1434 flow [2020-10-09 15:35:54,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:54,190 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:54,191 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:54,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 806 mathsat -unsat_core_generation=3 [2020-10-09 15:35:54,391 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:54,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:54,392 INFO L82 PathProgramCache]: Analyzing trace with hash -9955668, now seen corresponding path program 1 times [2020-10-09 15:35:54,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:54,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292769373] [2020-10-09 15:35:54,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 807 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 807 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:54,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:35:54,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:54,867 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:35:54,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:35:54,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292769373] [2020-10-09 15:35:54,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:54,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:54,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782880789] [2020-10-09 15:35:54,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:54,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:54,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:54,892 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:35:54,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 622 transitions, 1434 flow. Second operand 3 states. [2020-10-09 15:35:54,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:54,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:35:54,894 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:55,112 INFO L129 PetriNetUnfolder]: 54/715 cut-off events. [2020-10-09 15:35:55,112 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:35:55,154 INFO L80 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 715 events. 54/715 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2966 event pairs, 0 based on Foata normal form. 1/639 useless extension candidates. Maximal degree in co-relation 819. Up to 25 conditions per place. [2020-10-09 15:35:55,162 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/621 dead transitions. [2020-10-09 15:35:55,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 621 transitions, 1440 flow [2020-10-09 15:35:55,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:35:55,164 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:35:55,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:35:55,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:35:55,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:55,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:35:55,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:55,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:55,167 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:55,167 INFO L185 Difference]: Start difference. First operand has 636 places, 622 transitions, 1434 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:35:55,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 621 transitions, 1440 flow [2020-10-09 15:35:55,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 621 transitions, 1435 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:55,173 INFO L241 Difference]: Finished difference. Result has 638 places, 621 transitions, 1430 flow [2020-10-09 15:35:55,173 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1430, PETRI_PLACES=638, PETRI_TRANSITIONS=621} [2020-10-09 15:35:55,174 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 21 predicate places. [2020-10-09 15:35:55,174 INFO L481 AbstractCegarLoop]: Abstraction has has 638 places, 621 transitions, 1430 flow [2020-10-09 15:35:55,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:55,174 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:55,174 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:55,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 807 mathsat -unsat_core_generation=3 [2020-10-09 15:35:55,375 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:55,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:55,375 INFO L82 PathProgramCache]: Analyzing trace with hash -10907957, now seen corresponding path program 1 times [2020-10-09 15:35:55,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:55,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294626910] [2020-10-09 15:35:55,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 808 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 808 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:55,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:55,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:35:55,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:35:55,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294626910] [2020-10-09 15:35:55,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:55,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:55,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514439151] [2020-10-09 15:35:55,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:55,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:55,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:55,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:55,868 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:35:55,869 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 621 transitions, 1430 flow. Second operand 3 states. [2020-10-09 15:35:55,869 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:55,869 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:35:55,869 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:56,086 INFO L129 PetriNetUnfolder]: 54/708 cut-off events. [2020-10-09 15:35:56,086 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:35:56,126 INFO L80 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 708 events. 54/708 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2902 event pairs, 0 based on Foata normal form. 1/632 useless extension candidates. Maximal degree in co-relation 815. Up to 25 conditions per place. [2020-10-09 15:35:56,134 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/619 dead transitions. [2020-10-09 15:35:56,134 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 619 transitions, 1433 flow [2020-10-09 15:35:56,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:56,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:56,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2020-10-09 15:35:56,135 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9553884711779449 [2020-10-09 15:35:56,136 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2020-10-09 15:35:56,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2020-10-09 15:35:56,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:56,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2020-10-09 15:35:56,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:56,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:56,138 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:56,138 INFO L185 Difference]: Start difference. First operand has 638 places, 621 transitions, 1430 flow. Second operand 3 states and 1906 transitions. [2020-10-09 15:35:56,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 619 transitions, 1433 flow [2020-10-09 15:35:56,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 619 transitions, 1426 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:35:56,144 INFO L241 Difference]: Finished difference. Result has 638 places, 619 transitions, 1419 flow [2020-10-09 15:35:56,144 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=618, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1419, PETRI_PLACES=638, PETRI_TRANSITIONS=619} [2020-10-09 15:35:56,144 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 21 predicate places. [2020-10-09 15:35:56,144 INFO L481 AbstractCegarLoop]: Abstraction has has 638 places, 619 transitions, 1419 flow [2020-10-09 15:35:56,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:56,144 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:56,145 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:56,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 808 mathsat -unsat_core_generation=3 [2020-10-09 15:35:56,345 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:56,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:56,346 INFO L82 PathProgramCache]: Analyzing trace with hash -10908980, now seen corresponding path program 1 times [2020-10-09 15:35:56,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:56,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892394030] [2020-10-09 15:35:56,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 809 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 809 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:56,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:56,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:35:56,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:35:56,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892394030] [2020-10-09 15:35:56,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:56,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:56,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413022210] [2020-10-09 15:35:56,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:56,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:56,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:56,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:56,858 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:35:56,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 619 transitions, 1419 flow. Second operand 3 states. [2020-10-09 15:35:56,860 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:56,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:35:56,860 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:57,072 INFO L129 PetriNetUnfolder]: 54/706 cut-off events. [2020-10-09 15:35:57,072 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:35:57,109 INFO L80 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 706 events. 54/706 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2885 event pairs, 0 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 815. Up to 25 conditions per place. [2020-10-09 15:35:57,117 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/617 dead transitions. [2020-10-09 15:35:57,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 617 transitions, 1432 flow [2020-10-09 15:35:57,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:57,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2020-10-09 15:35:57,119 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9493734335839599 [2020-10-09 15:35:57,119 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2020-10-09 15:35:57,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2020-10-09 15:35:57,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:57,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2020-10-09 15:35:57,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:57,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:57,121 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:57,121 INFO L185 Difference]: Start difference. First operand has 638 places, 619 transitions, 1419 flow. Second operand 3 states and 1894 transitions. [2020-10-09 15:35:57,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 617 transitions, 1432 flow [2020-10-09 15:35:57,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 617 transitions, 1431 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:57,127 INFO L241 Difference]: Finished difference. Result has 637 places, 617 transitions, 1415 flow [2020-10-09 15:35:57,127 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1413, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1415, PETRI_PLACES=637, PETRI_TRANSITIONS=617} [2020-10-09 15:35:57,127 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 20 predicate places. [2020-10-09 15:35:57,127 INFO L481 AbstractCegarLoop]: Abstraction has has 637 places, 617 transitions, 1415 flow [2020-10-09 15:35:57,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:57,127 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:57,127 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:57,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 809 mathsat -unsat_core_generation=3 [2020-10-09 15:35:57,328 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:57,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:57,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1751768573, now seen corresponding path program 1 times [2020-10-09 15:35:57,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:57,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612392282] [2020-10-09 15:35:57,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 810 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 810 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:57,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:35:57,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:57,806 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:35:57,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:57,810 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:35:57,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612392282] [2020-10-09 15:35:57,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:57,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:57,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530050985] [2020-10-09 15:35:57,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:57,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:57,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:57,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:57,822 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:35:57,823 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 617 transitions, 1415 flow. Second operand 3 states. [2020-10-09 15:35:57,823 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:57,824 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:35:57,824 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:58,099 INFO L129 PetriNetUnfolder]: 53/713 cut-off events. [2020-10-09 15:35:58,099 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:35:58,123 INFO L80 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 713 events. 53/713 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2948 event pairs, 0 based on Foata normal form. 1/637 useless extension candidates. Maximal degree in co-relation 818. Up to 25 conditions per place. [2020-10-09 15:35:58,130 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/617 dead transitions. [2020-10-09 15:35:58,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 617 transitions, 1425 flow [2020-10-09 15:35:58,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:58,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:58,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:35:58,131 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:35:58,132 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:35:58,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:35:58,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:58,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:35:58,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:58,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:58,133 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:58,134 INFO L185 Difference]: Start difference. First operand has 637 places, 617 transitions, 1415 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:35:58,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 617 transitions, 1425 flow [2020-10-09 15:35:58,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 617 transitions, 1424 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:58,139 INFO L241 Difference]: Finished difference. Result has 639 places, 617 transitions, 1419 flow [2020-10-09 15:35:58,139 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1419, PETRI_PLACES=639, PETRI_TRANSITIONS=617} [2020-10-09 15:35:58,139 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 22 predicate places. [2020-10-09 15:35:58,139 INFO L481 AbstractCegarLoop]: Abstraction has has 639 places, 617 transitions, 1419 flow [2020-10-09 15:35:58,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:58,139 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:58,139 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:58,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 810 mathsat -unsat_core_generation=3 [2020-10-09 15:35:58,340 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:58,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:58,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1751769596, now seen corresponding path program 1 times [2020-10-09 15:35:58,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:58,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802132063] [2020-10-09 15:35:58,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 811 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 811 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:58,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:58,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:35:58,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:35:58,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802132063] [2020-10-09 15:35:58,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:58,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:58,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905232502] [2020-10-09 15:35:58,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:58,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:58,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:58,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:58,841 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:35:58,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 617 transitions, 1419 flow. Second operand 3 states. [2020-10-09 15:35:58,843 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:58,843 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:35:58,843 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:35:59,056 INFO L129 PetriNetUnfolder]: 51/715 cut-off events. [2020-10-09 15:35:59,057 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:35:59,095 INFO L80 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 715 events. 51/715 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2980 event pairs, 0 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 831. Up to 25 conditions per place. [2020-10-09 15:35:59,102 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/618 dead transitions. [2020-10-09 15:35:59,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 618 transitions, 1445 flow [2020-10-09 15:35:59,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:35:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:35:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1897 transitions. [2020-10-09 15:35:59,103 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508771929824561 [2020-10-09 15:35:59,103 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1897 transitions. [2020-10-09 15:35:59,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1897 transitions. [2020-10-09 15:35:59,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:35:59,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1897 transitions. [2020-10-09 15:35:59,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:35:59,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:35:59,105 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:35:59,105 INFO L185 Difference]: Start difference. First operand has 639 places, 617 transitions, 1419 flow. Second operand 3 states and 1897 transitions. [2020-10-09 15:35:59,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 641 places, 618 transitions, 1445 flow [2020-10-09 15:35:59,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 618 transitions, 1444 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:35:59,111 INFO L241 Difference]: Finished difference. Result has 642 places, 618 transitions, 1436 flow [2020-10-09 15:35:59,111 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1436, PETRI_PLACES=642, PETRI_TRANSITIONS=618} [2020-10-09 15:35:59,111 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 25 predicate places. [2020-10-09 15:35:59,111 INFO L481 AbstractCegarLoop]: Abstraction has has 642 places, 618 transitions, 1436 flow [2020-10-09 15:35:59,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:35:59,112 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:35:59,112 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:35:59,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 811 mathsat -unsat_core_generation=3 [2020-10-09 15:35:59,312 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:35:59,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:35:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1750816284, now seen corresponding path program 1 times [2020-10-09 15:35:59,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:35:59,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261692760] [2020-10-09 15:35:59,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 812 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 812 with mathsat -unsat_core_generation=3 [2020-10-09 15:35:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:35:59,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:35:59,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:35:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:35:59,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:35:59,790 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:35:59,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261692760] [2020-10-09 15:35:59,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:35:59,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:35:59,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699069533] [2020-10-09 15:35:59,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:35:59,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:35:59,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:35:59,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:35:59,802 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:35:59,803 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 618 transitions, 1436 flow. Second operand 3 states. [2020-10-09 15:35:59,803 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:35:59,803 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:35:59,803 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:00,011 INFO L129 PetriNetUnfolder]: 51/708 cut-off events. [2020-10-09 15:36:00,011 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:36:00,048 INFO L80 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 708 events. 51/708 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2921 event pairs, 0 based on Foata normal form. 1/635 useless extension candidates. Maximal degree in co-relation 817. Up to 25 conditions per place. [2020-10-09 15:36:00,055 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/616 dead transitions. [2020-10-09 15:36:00,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 644 places, 616 transitions, 1438 flow [2020-10-09 15:36:00,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:00,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2020-10-09 15:36:00,057 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9553884711779449 [2020-10-09 15:36:00,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2020-10-09 15:36:00,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2020-10-09 15:36:00,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:00,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2020-10-09 15:36:00,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:00,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:00,059 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:00,059 INFO L185 Difference]: Start difference. First operand has 642 places, 618 transitions, 1436 flow. Second operand 3 states and 1906 transitions. [2020-10-09 15:36:00,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 644 places, 616 transitions, 1438 flow [2020-10-09 15:36:00,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 616 transitions, 1430 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:36:00,065 INFO L241 Difference]: Finished difference. Result has 642 places, 616 transitions, 1423 flow [2020-10-09 15:36:00,065 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1423, PETRI_PLACES=642, PETRI_TRANSITIONS=616} [2020-10-09 15:36:00,065 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 25 predicate places. [2020-10-09 15:36:00,065 INFO L481 AbstractCegarLoop]: Abstraction has has 642 places, 616 transitions, 1423 flow [2020-10-09 15:36:00,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:00,065 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:00,065 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:00,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 812 mathsat -unsat_core_generation=3 [2020-10-09 15:36:00,266 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:00,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:00,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1750815261, now seen corresponding path program 1 times [2020-10-09 15:36:00,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:00,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970114486] [2020-10-09 15:36:00,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 813 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 813 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:00,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:00,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:36:00,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:36:00,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970114486] [2020-10-09 15:36:00,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:00,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:00,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478569188] [2020-10-09 15:36:00,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:00,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:00,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:00,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:00,763 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:00,765 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 616 transitions, 1423 flow. Second operand 3 states. [2020-10-09 15:36:00,765 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:00,765 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:00,765 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:00,969 INFO L129 PetriNetUnfolder]: 51/706 cut-off events. [2020-10-09 15:36:00,969 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:01,005 INFO L80 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 706 events. 51/706 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2906 event pairs, 0 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 821. Up to 25 conditions per place. [2020-10-09 15:36:01,012 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/614 dead transitions. [2020-10-09 15:36:01,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 614 transitions, 1436 flow [2020-10-09 15:36:01,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:01,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2020-10-09 15:36:01,013 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9493734335839599 [2020-10-09 15:36:01,013 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2020-10-09 15:36:01,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2020-10-09 15:36:01,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:01,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2020-10-09 15:36:01,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:01,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:01,015 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:01,015 INFO L185 Difference]: Start difference. First operand has 642 places, 616 transitions, 1423 flow. Second operand 3 states and 1894 transitions. [2020-10-09 15:36:01,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 614 transitions, 1436 flow [2020-10-09 15:36:01,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 614 transitions, 1435 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:01,021 INFO L241 Difference]: Finished difference. Result has 641 places, 614 transitions, 1419 flow [2020-10-09 15:36:01,021 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1417, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1419, PETRI_PLACES=641, PETRI_TRANSITIONS=614} [2020-10-09 15:36:01,021 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 24 predicate places. [2020-10-09 15:36:01,021 INFO L481 AbstractCegarLoop]: Abstraction has has 641 places, 614 transitions, 1419 flow [2020-10-09 15:36:01,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:01,021 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:01,021 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:01,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 813 mathsat -unsat_core_generation=3 [2020-10-09 15:36:01,222 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:01,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:01,222 INFO L82 PathProgramCache]: Analyzing trace with hash -457086770, now seen corresponding path program 1 times [2020-10-09 15:36:01,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:01,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172170988] [2020-10-09 15:36:01,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 814 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 814 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:01,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:01,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:36:01,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:36:01,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172170988] [2020-10-09 15:36:01,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:01,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:01,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753192070] [2020-10-09 15:36:01,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:01,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:01,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:01,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:01,725 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:01,726 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 641 places, 614 transitions, 1419 flow. Second operand 3 states. [2020-10-09 15:36:01,726 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:01,726 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:01,726 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:01,945 INFO L129 PetriNetUnfolder]: 50/714 cut-off events. [2020-10-09 15:36:01,945 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:36:01,984 INFO L80 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 714 events. 50/714 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2975 event pairs, 0 based on Foata normal form. 0/639 useless extension candidates. Maximal degree in co-relation 833. Up to 25 conditions per place. [2020-10-09 15:36:01,991 INFO L132 encePairwiseOnDemand]: 660/665 looper letters, 10 selfloop transitions, 3 changer transitions 0/616 dead transitions. [2020-10-09 15:36:01,991 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 616 transitions, 1449 flow [2020-10-09 15:36:01,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:01,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1899 transitions. [2020-10-09 15:36:01,993 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518796992481203 [2020-10-09 15:36:01,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1899 transitions. [2020-10-09 15:36:01,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1899 transitions. [2020-10-09 15:36:01,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:01,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1899 transitions. [2020-10-09 15:36:01,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:01,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:01,995 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:01,995 INFO L185 Difference]: Start difference. First operand has 641 places, 614 transitions, 1419 flow. Second operand 3 states and 1899 transitions. [2020-10-09 15:36:01,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 616 transitions, 1449 flow [2020-10-09 15:36:01,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 642 places, 616 transitions, 1448 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:02,001 INFO L241 Difference]: Finished difference. Result has 644 places, 616 transitions, 1442 flow [2020-10-09 15:36:02,001 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=640, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1442, PETRI_PLACES=644, PETRI_TRANSITIONS=616} [2020-10-09 15:36:02,001 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 27 predicate places. [2020-10-09 15:36:02,001 INFO L481 AbstractCegarLoop]: Abstraction has has 644 places, 616 transitions, 1442 flow [2020-10-09 15:36:02,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:02,001 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:02,001 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:02,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 814 mathsat -unsat_core_generation=3 [2020-10-09 15:36:02,202 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:02,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:02,202 INFO L82 PathProgramCache]: Analyzing trace with hash -457087793, now seen corresponding path program 1 times [2020-10-09 15:36:02,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:02,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879677070] [2020-10-09 15:36:02,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 815 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 815 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:02,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:36:02,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:36:02,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:02,685 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:36:02,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879677070] [2020-10-09 15:36:02,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:02,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:02,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191713032] [2020-10-09 15:36:02,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:02,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:02,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:02,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:02,707 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:36:02,708 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 616 transitions, 1442 flow. Second operand 3 states. [2020-10-09 15:36:02,709 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:02,709 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:36:02,709 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:02,957 INFO L129 PetriNetUnfolder]: 48/715 cut-off events. [2020-10-09 15:36:02,957 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:36:02,993 INFO L80 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 715 events. 48/715 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2998 event pairs, 0 based on Foata normal form. 1/645 useless extension candidates. Maximal degree in co-relation 831. Up to 25 conditions per place. [2020-10-09 15:36:02,999 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/615 dead transitions. [2020-10-09 15:36:02,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 615 transitions, 1448 flow [2020-10-09 15:36:03,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:03,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:03,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:36:03,001 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:36:03,001 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:36:03,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:36:03,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:03,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:36:03,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:03,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:03,003 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:03,003 INFO L185 Difference]: Start difference. First operand has 644 places, 616 transitions, 1442 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:36:03,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 615 transitions, 1448 flow [2020-10-09 15:36:03,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 615 transitions, 1443 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:03,008 INFO L241 Difference]: Finished difference. Result has 646 places, 615 transitions, 1438 flow [2020-10-09 15:36:03,008 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1438, PETRI_PLACES=646, PETRI_TRANSITIONS=615} [2020-10-09 15:36:03,009 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 29 predicate places. [2020-10-09 15:36:03,009 INFO L481 AbstractCegarLoop]: Abstraction has has 646 places, 615 transitions, 1438 flow [2020-10-09 15:36:03,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:03,009 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:03,009 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:03,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 815 mathsat -unsat_core_generation=3 [2020-10-09 15:36:03,210 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:03,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:03,210 INFO L82 PathProgramCache]: Analyzing trace with hash -458040082, now seen corresponding path program 1 times [2020-10-09 15:36:03,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:03,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158829284] [2020-10-09 15:36:03,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 816 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 816 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:03,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:03,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:03,689 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:36:03,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:36:03,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158829284] [2020-10-09 15:36:03,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:03,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:03,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193815033] [2020-10-09 15:36:03,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:03,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:03,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:03,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:03,703 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:36:03,704 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 615 transitions, 1438 flow. Second operand 3 states. [2020-10-09 15:36:03,704 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:03,704 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:36:03,704 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:03,910 INFO L129 PetriNetUnfolder]: 48/708 cut-off events. [2020-10-09 15:36:03,910 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:36:03,946 INFO L80 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 708 events. 48/708 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2935 event pairs, 0 based on Foata normal form. 1/638 useless extension candidates. Maximal degree in co-relation 827. Up to 25 conditions per place. [2020-10-09 15:36:03,953 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/613 dead transitions. [2020-10-09 15:36:03,953 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 613 transitions, 1441 flow [2020-10-09 15:36:03,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:03,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2020-10-09 15:36:03,954 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9553884711779449 [2020-10-09 15:36:03,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2020-10-09 15:36:03,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2020-10-09 15:36:03,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:03,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2020-10-09 15:36:03,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:03,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:03,957 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:03,957 INFO L185 Difference]: Start difference. First operand has 646 places, 615 transitions, 1438 flow. Second operand 3 states and 1906 transitions. [2020-10-09 15:36:03,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 613 transitions, 1441 flow [2020-10-09 15:36:03,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 613 transitions, 1434 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:36:03,963 INFO L241 Difference]: Finished difference. Result has 646 places, 613 transitions, 1427 flow [2020-10-09 15:36:03,963 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1427, PETRI_PLACES=646, PETRI_TRANSITIONS=613} [2020-10-09 15:36:03,963 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 29 predicate places. [2020-10-09 15:36:03,963 INFO L481 AbstractCegarLoop]: Abstraction has has 646 places, 613 transitions, 1427 flow [2020-10-09 15:36:03,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:03,963 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:03,964 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:04,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 816 mathsat -unsat_core_generation=3 [2020-10-09 15:36:04,164 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:04,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:04,165 INFO L82 PathProgramCache]: Analyzing trace with hash -458041105, now seen corresponding path program 1 times [2020-10-09 15:36:04,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:04,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813153020] [2020-10-09 15:36:04,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 817 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 817 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:04,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:04,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:36:04,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:04,646 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:36:04,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813153020] [2020-10-09 15:36:04,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:04,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:04,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336867899] [2020-10-09 15:36:04,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:04,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:04,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:04,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:04,666 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:04,667 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 613 transitions, 1427 flow. Second operand 3 states. [2020-10-09 15:36:04,667 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:04,667 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:04,667 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:04,878 INFO L129 PetriNetUnfolder]: 48/706 cut-off events. [2020-10-09 15:36:04,878 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:04,915 INFO L80 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 706 events. 48/706 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2919 event pairs, 0 based on Foata normal form. 0/634 useless extension candidates. Maximal degree in co-relation 827. Up to 25 conditions per place. [2020-10-09 15:36:04,921 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/611 dead transitions. [2020-10-09 15:36:04,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 611 transitions, 1440 flow [2020-10-09 15:36:04,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2020-10-09 15:36:04,922 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9493734335839599 [2020-10-09 15:36:04,923 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2020-10-09 15:36:04,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2020-10-09 15:36:04,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:04,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2020-10-09 15:36:04,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:04,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:04,924 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:04,925 INFO L185 Difference]: Start difference. First operand has 646 places, 613 transitions, 1427 flow. Second operand 3 states and 1894 transitions. [2020-10-09 15:36:04,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 611 transitions, 1440 flow [2020-10-09 15:36:04,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 611 transitions, 1439 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:04,930 INFO L241 Difference]: Finished difference. Result has 645 places, 611 transitions, 1423 flow [2020-10-09 15:36:04,930 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1421, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1423, PETRI_PLACES=645, PETRI_TRANSITIONS=611} [2020-10-09 15:36:04,931 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 28 predicate places. [2020-10-09 15:36:04,931 INFO L481 AbstractCegarLoop]: Abstraction has has 645 places, 611 transitions, 1423 flow [2020-10-09 15:36:04,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:04,931 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:04,931 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:05,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 817 mathsat -unsat_core_generation=3 [2020-10-09 15:36:05,132 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:05,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:05,132 INFO L82 PathProgramCache]: Analyzing trace with hash -184480575, now seen corresponding path program 1 times [2020-10-09 15:36:05,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:05,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619821252] [2020-10-09 15:36:05,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 818 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 818 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:05,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:05,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:36:05,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:36:05,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619821252] [2020-10-09 15:36:05,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:05,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:05,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098658599] [2020-10-09 15:36:05,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:05,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:05,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:05,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:05,626 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:36:05,627 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 611 transitions, 1423 flow. Second operand 3 states. [2020-10-09 15:36:05,627 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:05,627 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:36:05,627 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:05,854 INFO L129 PetriNetUnfolder]: 46/711 cut-off events. [2020-10-09 15:36:05,854 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:36:05,891 INFO L80 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 711 events. 46/711 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2971 event pairs, 0 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 830. Up to 25 conditions per place. [2020-10-09 15:36:05,897 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 5 selfloop transitions, 2 changer transitions 0/612 dead transitions. [2020-10-09 15:36:05,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 612 transitions, 1439 flow [2020-10-09 15:36:05,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:05,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1907 transitions. [2020-10-09 15:36:05,899 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9558897243107769 [2020-10-09 15:36:05,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1907 transitions. [2020-10-09 15:36:05,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1907 transitions. [2020-10-09 15:36:05,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:05,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1907 transitions. [2020-10-09 15:36:05,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:05,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:05,901 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:05,901 INFO L185 Difference]: Start difference. First operand has 645 places, 611 transitions, 1423 flow. Second operand 3 states and 1907 transitions. [2020-10-09 15:36:05,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 612 transitions, 1439 flow [2020-10-09 15:36:05,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 646 places, 612 transitions, 1438 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:05,907 INFO L241 Difference]: Finished difference. Result has 648 places, 612 transitions, 1436 flow [2020-10-09 15:36:05,907 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1436, PETRI_PLACES=648, PETRI_TRANSITIONS=612} [2020-10-09 15:36:05,907 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 31 predicate places. [2020-10-09 15:36:05,907 INFO L481 AbstractCegarLoop]: Abstraction has has 648 places, 612 transitions, 1436 flow [2020-10-09 15:36:05,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:05,907 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:05,907 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:06,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 818 mathsat -unsat_core_generation=3 [2020-10-09 15:36:06,108 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:06,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:06,109 INFO L82 PathProgramCache]: Analyzing trace with hash -184481598, now seen corresponding path program 1 times [2020-10-09 15:36:06,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:06,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723063190] [2020-10-09 15:36:06,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 819 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 819 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:06,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:06,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:06,591 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:36:06,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:06,593 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:36:06,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723063190] [2020-10-09 15:36:06,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:06,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:06,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834897885] [2020-10-09 15:36:06,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:06,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:06,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:06,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:06,628 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:06,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 612 transitions, 1436 flow. Second operand 3 states. [2020-10-09 15:36:06,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:06,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:06,629 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:06,848 INFO L129 PetriNetUnfolder]: 46/712 cut-off events. [2020-10-09 15:36:06,848 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:36:06,886 INFO L80 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 712 events. 46/712 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2981 event pairs, 0 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 838. Up to 25 conditions per place. [2020-10-09 15:36:06,893 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/613 dead transitions. [2020-10-09 15:36:06,893 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 613 transitions, 1462 flow [2020-10-09 15:36:06,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:06,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:06,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1897 transitions. [2020-10-09 15:36:06,894 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508771929824561 [2020-10-09 15:36:06,894 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1897 transitions. [2020-10-09 15:36:06,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1897 transitions. [2020-10-09 15:36:06,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:06,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1897 transitions. [2020-10-09 15:36:06,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:06,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:06,896 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:06,896 INFO L185 Difference]: Start difference. First operand has 648 places, 612 transitions, 1436 flow. Second operand 3 states and 1897 transitions. [2020-10-09 15:36:06,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 613 transitions, 1462 flow [2020-10-09 15:36:06,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 613 transitions, 1460 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:06,902 INFO L241 Difference]: Finished difference. Result has 651 places, 613 transitions, 1452 flow [2020-10-09 15:36:06,902 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1452, PETRI_PLACES=651, PETRI_TRANSITIONS=613} [2020-10-09 15:36:06,902 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 34 predicate places. [2020-10-09 15:36:06,902 INFO L481 AbstractCegarLoop]: Abstraction has has 651 places, 613 transitions, 1452 flow [2020-10-09 15:36:06,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:06,902 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:06,903 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:07,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 819 mathsat -unsat_core_generation=3 [2020-10-09 15:36:07,103 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:07,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:07,104 INFO L82 PathProgramCache]: Analyzing trace with hash -183527263, now seen corresponding path program 1 times [2020-10-09 15:36:07,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:07,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624178398] [2020-10-09 15:36:07,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 820 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 820 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:07,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:07,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:07,592 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:36:07,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:07,596 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:36:07,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624178398] [2020-10-09 15:36:07,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:07,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:07,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467338035] [2020-10-09 15:36:07,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:07,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:07,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:07,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:07,656 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:07,657 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 613 transitions, 1452 flow. Second operand 3 states. [2020-10-09 15:36:07,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:07,658 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:07,658 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:07,876 INFO L129 PetriNetUnfolder]: 45/709 cut-off events. [2020-10-09 15:36:07,876 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2020-10-09 15:36:07,915 INFO L80 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 709 events. 45/709 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2962 event pairs, 0 based on Foata normal form. 2/642 useless extension candidates. Maximal degree in co-relation 837. Up to 25 conditions per place. [2020-10-09 15:36:07,921 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 9 selfloop transitions, 1 changer transitions 0/611 dead transitions. [2020-10-09 15:36:07,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 611 transitions, 1460 flow [2020-10-09 15:36:07,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:07,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2020-10-09 15:36:07,922 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503759398496241 [2020-10-09 15:36:07,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1896 transitions. [2020-10-09 15:36:07,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1896 transitions. [2020-10-09 15:36:07,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:07,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1896 transitions. [2020-10-09 15:36:07,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:07,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:07,924 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:07,924 INFO L185 Difference]: Start difference. First operand has 651 places, 613 transitions, 1452 flow. Second operand 3 states and 1896 transitions. [2020-10-09 15:36:07,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 611 transitions, 1460 flow [2020-10-09 15:36:07,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 611 transitions, 1459 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:07,930 INFO L241 Difference]: Finished difference. Result has 652 places, 611 transitions, 1441 flow [2020-10-09 15:36:07,930 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1441, PETRI_PLACES=652, PETRI_TRANSITIONS=611} [2020-10-09 15:36:07,931 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 35 predicate places. [2020-10-09 15:36:07,931 INFO L481 AbstractCegarLoop]: Abstraction has has 652 places, 611 transitions, 1441 flow [2020-10-09 15:36:07,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:07,931 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:07,931 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:08,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 820 mathsat -unsat_core_generation=3 [2020-10-09 15:36:08,132 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:08,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:08,132 INFO L82 PathProgramCache]: Analyzing trace with hash -183528286, now seen corresponding path program 1 times [2020-10-09 15:36:08,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:08,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968517965] [2020-10-09 15:36:08,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 821 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 821 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:08,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:36:08,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:36:08,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:36:08,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968517965] [2020-10-09 15:36:08,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:08,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:08,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762089937] [2020-10-09 15:36:08,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:08,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:08,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:08,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:08,633 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:36:08,634 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 611 transitions, 1441 flow. Second operand 3 states. [2020-10-09 15:36:08,634 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:08,634 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:36:08,634 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:08,845 INFO L129 PetriNetUnfolder]: 45/706 cut-off events. [2020-10-09 15:36:08,845 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:08,882 INFO L80 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 706 events. 45/706 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2941 event pairs, 0 based on Foata normal form. 1/639 useless extension candidates. Maximal degree in co-relation 831. Up to 25 conditions per place. [2020-10-09 15:36:08,888 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/608 dead transitions. [2020-10-09 15:36:08,888 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 608 transitions, 1440 flow [2020-10-09 15:36:08,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:36:08,889 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:36:08,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:36:08,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:36:08,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:08,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:36:08,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:08,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:08,891 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:08,891 INFO L185 Difference]: Start difference. First operand has 652 places, 611 transitions, 1441 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:36:08,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 608 transitions, 1440 flow [2020-10-09 15:36:08,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 608 transitions, 1435 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:36:08,897 INFO L241 Difference]: Finished difference. Result has 649 places, 608 transitions, 1427 flow [2020-10-09 15:36:08,897 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1427, PETRI_PLACES=649, PETRI_TRANSITIONS=608} [2020-10-09 15:36:08,897 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 32 predicate places. [2020-10-09 15:36:08,897 INFO L481 AbstractCegarLoop]: Abstraction has has 649 places, 608 transitions, 1427 flow [2020-10-09 15:36:08,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:08,898 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:08,898 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:09,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 821 mathsat -unsat_core_generation=3 [2020-10-09 15:36:09,098 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:09,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:09,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1460826870, now seen corresponding path program 1 times [2020-10-09 15:36:09,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:09,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342065988] [2020-10-09 15:36:09,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 822 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 822 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:09,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:36:09,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:36:09,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:36:09,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342065988] [2020-10-09 15:36:09,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:09,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:09,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679905833] [2020-10-09 15:36:09,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:09,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:09,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:09,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:09,606 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:36:09,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 608 transitions, 1427 flow. Second operand 3 states. [2020-10-09 15:36:09,607 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:09,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:36:09,607 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:09,821 INFO L129 PetriNetUnfolder]: 44/713 cut-off events. [2020-10-09 15:36:09,822 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:36:09,860 INFO L80 FinitePrefix]: Finished finitePrefix Result has 889 conditions, 713 events. 44/713 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2997 event pairs, 0 based on Foata normal form. 1/645 useless extension candidates. Maximal degree in co-relation 839. Up to 25 conditions per place. [2020-10-09 15:36:09,866 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/608 dead transitions. [2020-10-09 15:36:09,867 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 608 transitions, 1437 flow [2020-10-09 15:36:09,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:09,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:09,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:36:09,868 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:36:09,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:36:09,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:36:09,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:09,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:36:09,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:09,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:09,870 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:09,870 INFO L185 Difference]: Start difference. First operand has 649 places, 608 transitions, 1427 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:36:09,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 608 transitions, 1437 flow [2020-10-09 15:36:09,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 608 transitions, 1436 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:09,876 INFO L241 Difference]: Finished difference. Result has 651 places, 608 transitions, 1431 flow [2020-10-09 15:36:09,876 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1431, PETRI_PLACES=651, PETRI_TRANSITIONS=608} [2020-10-09 15:36:09,876 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 34 predicate places. [2020-10-09 15:36:09,876 INFO L481 AbstractCegarLoop]: Abstraction has has 651 places, 608 transitions, 1431 flow [2020-10-09 15:36:09,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:09,876 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:09,876 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:10,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 822 mathsat -unsat_core_generation=3 [2020-10-09 15:36:10,077 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:10,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:10,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1460827893, now seen corresponding path program 1 times [2020-10-09 15:36:10,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:10,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526500284] [2020-10-09 15:36:10,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 823 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 823 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:10,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:10,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:36:10,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:10,567 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:36:10,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526500284] [2020-10-09 15:36:10,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:10,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:10,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850638727] [2020-10-09 15:36:10,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:10,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:10,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:10,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:10,596 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:10,597 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 608 transitions, 1431 flow. Second operand 3 states. [2020-10-09 15:36:10,597 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:10,597 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:10,598 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:10,818 INFO L129 PetriNetUnfolder]: 42/715 cut-off events. [2020-10-09 15:36:10,818 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:10,857 INFO L80 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 715 events. 42/715 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3032 event pairs, 0 based on Foata normal form. 0/647 useless extension candidates. Maximal degree in co-relation 850. Up to 25 conditions per place. [2020-10-09 15:36:10,863 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/609 dead transitions. [2020-10-09 15:36:10,863 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 609 transitions, 1457 flow [2020-10-09 15:36:10,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:10,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1897 transitions. [2020-10-09 15:36:10,865 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508771929824561 [2020-10-09 15:36:10,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1897 transitions. [2020-10-09 15:36:10,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1897 transitions. [2020-10-09 15:36:10,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:10,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1897 transitions. [2020-10-09 15:36:10,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:10,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:10,867 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:10,867 INFO L185 Difference]: Start difference. First operand has 651 places, 608 transitions, 1431 flow. Second operand 3 states and 1897 transitions. [2020-10-09 15:36:10,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 609 transitions, 1457 flow [2020-10-09 15:36:10,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 609 transitions, 1456 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:10,873 INFO L241 Difference]: Finished difference. Result has 654 places, 609 transitions, 1448 flow [2020-10-09 15:36:10,873 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1448, PETRI_PLACES=654, PETRI_TRANSITIONS=609} [2020-10-09 15:36:10,873 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 37 predicate places. [2020-10-09 15:36:10,873 INFO L481 AbstractCegarLoop]: Abstraction has has 654 places, 609 transitions, 1448 flow [2020-10-09 15:36:10,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:10,873 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:10,873 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:11,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 823 mathsat -unsat_core_generation=3 [2020-10-09 15:36:11,074 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:11,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:11,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1459874581, now seen corresponding path program 1 times [2020-10-09 15:36:11,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:11,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557555820] [2020-10-09 15:36:11,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 824 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 824 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:11,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:11,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:36:11,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:11,558 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:36:11,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557555820] [2020-10-09 15:36:11,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:11,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:11,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441295979] [2020-10-09 15:36:11,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:11,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:11,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:11,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:11,569 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:36:11,570 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 609 transitions, 1448 flow. Second operand 3 states. [2020-10-09 15:36:11,570 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:11,571 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:36:11,571 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:11,783 INFO L129 PetriNetUnfolder]: 42/708 cut-off events. [2020-10-09 15:36:11,784 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:36:11,820 INFO L80 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 708 events. 42/708 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2970 event pairs, 0 based on Foata normal form. 1/644 useless extension candidates. Maximal degree in co-relation 836. Up to 25 conditions per place. [2020-10-09 15:36:11,829 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/607 dead transitions. [2020-10-09 15:36:11,830 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 607 transitions, 1450 flow [2020-10-09 15:36:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:11,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:11,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2020-10-09 15:36:11,831 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9553884711779449 [2020-10-09 15:36:11,831 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2020-10-09 15:36:11,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2020-10-09 15:36:11,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:11,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2020-10-09 15:36:11,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:11,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:11,833 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:11,833 INFO L185 Difference]: Start difference. First operand has 654 places, 609 transitions, 1448 flow. Second operand 3 states and 1906 transitions. [2020-10-09 15:36:11,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 607 transitions, 1450 flow [2020-10-09 15:36:11,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 607 transitions, 1442 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:36:11,840 INFO L241 Difference]: Finished difference. Result has 654 places, 607 transitions, 1435 flow [2020-10-09 15:36:11,840 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1435, PETRI_PLACES=654, PETRI_TRANSITIONS=607} [2020-10-09 15:36:11,840 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 37 predicate places. [2020-10-09 15:36:11,840 INFO L481 AbstractCegarLoop]: Abstraction has has 654 places, 607 transitions, 1435 flow [2020-10-09 15:36:11,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:11,840 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:11,840 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:12,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 824 mathsat -unsat_core_generation=3 [2020-10-09 15:36:12,041 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:12,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:12,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1459873558, now seen corresponding path program 1 times [2020-10-09 15:36:12,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:12,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078557357] [2020-10-09 15:36:12,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 825 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 825 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:12,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:12,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:12,550 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:36:12,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:36:12,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078557357] [2020-10-09 15:36:12,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:12,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:12,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994762660] [2020-10-09 15:36:12,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:12,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:12,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:12,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:12,582 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:12,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 607 transitions, 1435 flow. Second operand 3 states. [2020-10-09 15:36:12,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:12,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:12,583 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:12,802 INFO L129 PetriNetUnfolder]: 42/706 cut-off events. [2020-10-09 15:36:12,802 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:12,840 INFO L80 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 706 events. 42/706 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2954 event pairs, 0 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 840. Up to 25 conditions per place. [2020-10-09 15:36:12,846 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/605 dead transitions. [2020-10-09 15:36:12,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 605 transitions, 1448 flow [2020-10-09 15:36:12,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:12,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2020-10-09 15:36:12,847 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9493734335839599 [2020-10-09 15:36:12,847 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2020-10-09 15:36:12,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2020-10-09 15:36:12,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:12,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2020-10-09 15:36:12,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:12,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:12,849 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:12,849 INFO L185 Difference]: Start difference. First operand has 654 places, 607 transitions, 1435 flow. Second operand 3 states and 1894 transitions. [2020-10-09 15:36:12,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 605 transitions, 1448 flow [2020-10-09 15:36:12,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 605 transitions, 1447 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:12,855 INFO L241 Difference]: Finished difference. Result has 653 places, 605 transitions, 1431 flow [2020-10-09 15:36:12,856 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1431, PETRI_PLACES=653, PETRI_TRANSITIONS=605} [2020-10-09 15:36:12,856 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 36 predicate places. [2020-10-09 15:36:12,856 INFO L481 AbstractCegarLoop]: Abstraction has has 653 places, 605 transitions, 1431 flow [2020-10-09 15:36:12,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:12,856 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:12,856 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:13,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 825 mathsat -unsat_core_generation=3 [2020-10-09 15:36:13,057 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:13,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:13,057 INFO L82 PathProgramCache]: Analyzing trace with hash -54815925, now seen corresponding path program 1 times [2020-10-09 15:36:13,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:13,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864164671] [2020-10-09 15:36:13,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 826 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 826 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:13,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:36:13,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:36:13,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:36:13,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864164671] [2020-10-09 15:36:13,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:13,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:13,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038016159] [2020-10-09 15:36:13,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:13,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:13,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:13,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:13,559 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:36:13,560 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 605 transitions, 1431 flow. Second operand 3 states. [2020-10-09 15:36:13,560 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:13,560 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:36:13,560 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:13,782 INFO L129 PetriNetUnfolder]: 41/713 cut-off events. [2020-10-09 15:36:13,782 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:36:13,821 INFO L80 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 713 events. 41/713 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3015 event pairs, 0 based on Foata normal form. 1/649 useless extension candidates. Maximal degree in co-relation 843. Up to 25 conditions per place. [2020-10-09 15:36:13,827 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/605 dead transitions. [2020-10-09 15:36:13,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 605 transitions, 1441 flow [2020-10-09 15:36:13,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:36:13,828 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:36:13,828 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:36:13,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:36:13,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:13,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:36:13,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:13,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:13,830 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:13,830 INFO L185 Difference]: Start difference. First operand has 653 places, 605 transitions, 1431 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:36:13,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 605 transitions, 1441 flow [2020-10-09 15:36:13,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 605 transitions, 1440 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:13,836 INFO L241 Difference]: Finished difference. Result has 655 places, 605 transitions, 1435 flow [2020-10-09 15:36:13,836 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1435, PETRI_PLACES=655, PETRI_TRANSITIONS=605} [2020-10-09 15:36:13,837 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 38 predicate places. [2020-10-09 15:36:13,837 INFO L481 AbstractCegarLoop]: Abstraction has has 655 places, 605 transitions, 1435 flow [2020-10-09 15:36:13,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:13,837 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:13,837 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:14,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 826 mathsat -unsat_core_generation=3 [2020-10-09 15:36:14,038 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:14,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:14,038 INFO L82 PathProgramCache]: Analyzing trace with hash -54814902, now seen corresponding path program 1 times [2020-10-09 15:36:14,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:14,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86425874] [2020-10-09 15:36:14,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 827 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 827 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:14,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:14,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:36:14,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:36:14,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86425874] [2020-10-09 15:36:14,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:14,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:14,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005750306] [2020-10-09 15:36:14,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:14,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:14,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:14,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:14,547 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:14,548 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 605 transitions, 1435 flow. Second operand 3 states. [2020-10-09 15:36:14,548 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:14,548 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:14,548 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:14,780 INFO L129 PetriNetUnfolder]: 39/715 cut-off events. [2020-10-09 15:36:14,780 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:14,819 INFO L80 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 715 events. 39/715 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3050 event pairs, 0 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 856. Up to 25 conditions per place. [2020-10-09 15:36:14,825 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/606 dead transitions. [2020-10-09 15:36:14,825 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 606 transitions, 1461 flow [2020-10-09 15:36:14,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:14,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1897 transitions. [2020-10-09 15:36:14,826 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508771929824561 [2020-10-09 15:36:14,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1897 transitions. [2020-10-09 15:36:14,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1897 transitions. [2020-10-09 15:36:14,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:14,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1897 transitions. [2020-10-09 15:36:14,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:14,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:14,828 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:14,828 INFO L185 Difference]: Start difference. First operand has 655 places, 605 transitions, 1435 flow. Second operand 3 states and 1897 transitions. [2020-10-09 15:36:14,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 606 transitions, 1461 flow [2020-10-09 15:36:14,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 606 transitions, 1460 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:14,834 INFO L241 Difference]: Finished difference. Result has 658 places, 606 transitions, 1452 flow [2020-10-09 15:36:14,835 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1452, PETRI_PLACES=658, PETRI_TRANSITIONS=606} [2020-10-09 15:36:14,835 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 41 predicate places. [2020-10-09 15:36:14,835 INFO L481 AbstractCegarLoop]: Abstraction has has 658 places, 606 transitions, 1452 flow [2020-10-09 15:36:14,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:14,835 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:14,835 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:15,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 827 mathsat -unsat_core_generation=3 [2020-10-09 15:36:15,036 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:15,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:15,036 INFO L82 PathProgramCache]: Analyzing trace with hash -55768214, now seen corresponding path program 1 times [2020-10-09 15:36:15,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:15,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964091142] [2020-10-09 15:36:15,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 828 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 828 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:15,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:15,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:36:15,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:36:15,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964091142] [2020-10-09 15:36:15,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:15,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:15,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764964970] [2020-10-09 15:36:15,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:15,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:15,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:15,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:15,533 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:36:15,534 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 606 transitions, 1452 flow. Second operand 3 states. [2020-10-09 15:36:15,534 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:15,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:36:15,535 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:15,755 INFO L129 PetriNetUnfolder]: 39/708 cut-off events. [2020-10-09 15:36:15,756 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:36:15,794 INFO L80 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 708 events. 39/708 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2989 event pairs, 0 based on Foata normal form. 1/647 useless extension candidates. Maximal degree in co-relation 842. Up to 25 conditions per place. [2020-10-09 15:36:15,799 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/604 dead transitions. [2020-10-09 15:36:15,799 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 604 transitions, 1454 flow [2020-10-09 15:36:15,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2020-10-09 15:36:15,801 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9553884711779449 [2020-10-09 15:36:15,801 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2020-10-09 15:36:15,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2020-10-09 15:36:15,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:15,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2020-10-09 15:36:15,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:15,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:15,803 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:15,803 INFO L185 Difference]: Start difference. First operand has 658 places, 606 transitions, 1452 flow. Second operand 3 states and 1906 transitions. [2020-10-09 15:36:15,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 604 transitions, 1454 flow [2020-10-09 15:36:15,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 604 transitions, 1446 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:36:15,809 INFO L241 Difference]: Finished difference. Result has 658 places, 604 transitions, 1439 flow [2020-10-09 15:36:15,809 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1439, PETRI_PLACES=658, PETRI_TRANSITIONS=604} [2020-10-09 15:36:15,809 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 41 predicate places. [2020-10-09 15:36:15,809 INFO L481 AbstractCegarLoop]: Abstraction has has 658 places, 604 transitions, 1439 flow [2020-10-09 15:36:15,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:15,809 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:15,810 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:16,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 828 mathsat -unsat_core_generation=3 [2020-10-09 15:36:16,010 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:16,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:16,011 INFO L82 PathProgramCache]: Analyzing trace with hash -55769237, now seen corresponding path program 1 times [2020-10-09 15:36:16,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:16,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358171629] [2020-10-09 15:36:16,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 829 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 829 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:16,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:16,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:16,498 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:36:16,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:36:16,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358171629] [2020-10-09 15:36:16,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:16,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:16,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518808365] [2020-10-09 15:36:16,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:16,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:16,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:16,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:16,545 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:16,546 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 604 transitions, 1439 flow. Second operand 3 states. [2020-10-09 15:36:16,546 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:16,546 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:16,546 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:16,778 INFO L129 PetriNetUnfolder]: 39/706 cut-off events. [2020-10-09 15:36:16,779 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:16,817 INFO L80 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 706 events. 39/706 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2976 event pairs, 0 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 846. Up to 25 conditions per place. [2020-10-09 15:36:16,822 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/602 dead transitions. [2020-10-09 15:36:16,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 602 transitions, 1452 flow [2020-10-09 15:36:16,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:16,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2020-10-09 15:36:16,824 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9493734335839599 [2020-10-09 15:36:16,824 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2020-10-09 15:36:16,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2020-10-09 15:36:16,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:16,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2020-10-09 15:36:16,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:16,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:16,826 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:16,826 INFO L185 Difference]: Start difference. First operand has 658 places, 604 transitions, 1439 flow. Second operand 3 states and 1894 transitions. [2020-10-09 15:36:16,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 602 transitions, 1452 flow [2020-10-09 15:36:16,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 602 transitions, 1451 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:16,832 INFO L241 Difference]: Finished difference. Result has 657 places, 602 transitions, 1435 flow [2020-10-09 15:36:16,832 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1435, PETRI_PLACES=657, PETRI_TRANSITIONS=602} [2020-10-09 15:36:16,832 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 40 predicate places. [2020-10-09 15:36:16,832 INFO L481 AbstractCegarLoop]: Abstraction has has 657 places, 602 transitions, 1435 flow [2020-10-09 15:36:16,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:16,832 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:16,833 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:17,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 829 mathsat -unsat_core_generation=3 [2020-10-09 15:36:17,033 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:17,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:17,034 INFO L82 PathProgramCache]: Analyzing trace with hash 486789408, now seen corresponding path program 1 times [2020-10-09 15:36:17,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:17,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894824719] [2020-10-09 15:36:17,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 830 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 830 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:17,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:17,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:17,521 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:36:17,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:36:17,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894824719] [2020-10-09 15:36:17,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:17,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:17,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024267577] [2020-10-09 15:36:17,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:17,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:17,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:17,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:17,544 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:17,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 602 transitions, 1435 flow. Second operand 3 states. [2020-10-09 15:36:17,545 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:17,546 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:17,546 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:17,778 INFO L129 PetriNetUnfolder]: 38/714 cut-off events. [2020-10-09 15:36:17,778 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:36:17,818 INFO L80 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 714 events. 38/714 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3041 event pairs, 0 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 858. Up to 25 conditions per place. [2020-10-09 15:36:17,823 INFO L132 encePairwiseOnDemand]: 660/665 looper letters, 10 selfloop transitions, 3 changer transitions 0/604 dead transitions. [2020-10-09 15:36:17,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 604 transitions, 1465 flow [2020-10-09 15:36:17,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1899 transitions. [2020-10-09 15:36:17,825 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518796992481203 [2020-10-09 15:36:17,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1899 transitions. [2020-10-09 15:36:17,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1899 transitions. [2020-10-09 15:36:17,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:17,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1899 transitions. [2020-10-09 15:36:17,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:17,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:17,827 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:17,827 INFO L185 Difference]: Start difference. First operand has 657 places, 602 transitions, 1435 flow. Second operand 3 states and 1899 transitions. [2020-10-09 15:36:17,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 604 transitions, 1465 flow [2020-10-09 15:36:17,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 604 transitions, 1464 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:17,833 INFO L241 Difference]: Finished difference. Result has 660 places, 604 transitions, 1458 flow [2020-10-09 15:36:17,833 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1458, PETRI_PLACES=660, PETRI_TRANSITIONS=604} [2020-10-09 15:36:17,833 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 43 predicate places. [2020-10-09 15:36:17,833 INFO L481 AbstractCegarLoop]: Abstraction has has 660 places, 604 transitions, 1458 flow [2020-10-09 15:36:17,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:17,834 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:17,834 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:18,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 830 mathsat -unsat_core_generation=3 [2020-10-09 15:36:18,034 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:18,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:18,035 INFO L82 PathProgramCache]: Analyzing trace with hash 486788385, now seen corresponding path program 1 times [2020-10-09 15:36:18,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:18,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351765958] [2020-10-09 15:36:18,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 831 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 831 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:18,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:36:18,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:36:18,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:36:18,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351765958] [2020-10-09 15:36:18,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:18,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:18,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739349963] [2020-10-09 15:36:18,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:18,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:18,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:18,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:18,548 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:36:18,549 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 604 transitions, 1458 flow. Second operand 3 states. [2020-10-09 15:36:18,549 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:18,549 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:36:18,549 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:18,774 INFO L129 PetriNetUnfolder]: 36/715 cut-off events. [2020-10-09 15:36:18,774 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:36:18,814 INFO L80 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 715 events. 36/715 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3064 event pairs, 0 based on Foata normal form. 1/657 useless extension candidates. Maximal degree in co-relation 856. Up to 25 conditions per place. [2020-10-09 15:36:18,819 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/603 dead transitions. [2020-10-09 15:36:18,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 603 transitions, 1464 flow [2020-10-09 15:36:18,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:36:18,820 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:36:18,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:36:18,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:36:18,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:18,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:36:18,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:18,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:18,823 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:18,823 INFO L185 Difference]: Start difference. First operand has 660 places, 604 transitions, 1458 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:36:18,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 603 transitions, 1464 flow [2020-10-09 15:36:18,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 603 transitions, 1459 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:18,829 INFO L241 Difference]: Finished difference. Result has 662 places, 603 transitions, 1454 flow [2020-10-09 15:36:18,830 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1454, PETRI_PLACES=662, PETRI_TRANSITIONS=603} [2020-10-09 15:36:18,830 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 45 predicate places. [2020-10-09 15:36:18,830 INFO L481 AbstractCegarLoop]: Abstraction has has 662 places, 603 transitions, 1454 flow [2020-10-09 15:36:18,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:18,830 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:18,830 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:19,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 831 mathsat -unsat_core_generation=3 [2020-10-09 15:36:19,031 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:19,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:19,031 INFO L82 PathProgramCache]: Analyzing trace with hash 485836096, now seen corresponding path program 1 times [2020-10-09 15:36:19,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:19,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260090296] [2020-10-09 15:36:19,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 832 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 832 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:19,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:19,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:36:19,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:36:19,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260090296] [2020-10-09 15:36:19,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:19,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:19,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700221171] [2020-10-09 15:36:19,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:19,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:19,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:19,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:19,532 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:36:19,533 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 603 transitions, 1454 flow. Second operand 3 states. [2020-10-09 15:36:19,533 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:19,533 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:36:19,533 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:19,756 INFO L129 PetriNetUnfolder]: 36/708 cut-off events. [2020-10-09 15:36:19,756 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:36:19,794 INFO L80 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 708 events. 36/708 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3004 event pairs, 0 based on Foata normal form. 1/650 useless extension candidates. Maximal degree in co-relation 852. Up to 25 conditions per place. [2020-10-09 15:36:19,799 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/601 dead transitions. [2020-10-09 15:36:19,799 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 601 transitions, 1457 flow [2020-10-09 15:36:19,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2020-10-09 15:36:19,801 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9553884711779449 [2020-10-09 15:36:19,801 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2020-10-09 15:36:19,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2020-10-09 15:36:19,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:19,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2020-10-09 15:36:19,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:19,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:19,803 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:19,803 INFO L185 Difference]: Start difference. First operand has 662 places, 603 transitions, 1454 flow. Second operand 3 states and 1906 transitions. [2020-10-09 15:36:19,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 601 transitions, 1457 flow [2020-10-09 15:36:19,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 601 transitions, 1450 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:36:19,810 INFO L241 Difference]: Finished difference. Result has 662 places, 601 transitions, 1443 flow [2020-10-09 15:36:19,810 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1443, PETRI_PLACES=662, PETRI_TRANSITIONS=601} [2020-10-09 15:36:19,810 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 45 predicate places. [2020-10-09 15:36:19,810 INFO L481 AbstractCegarLoop]: Abstraction has has 662 places, 601 transitions, 1443 flow [2020-10-09 15:36:19,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:19,810 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:19,810 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:20,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 832 mathsat -unsat_core_generation=3 [2020-10-09 15:36:20,021 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:20,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:20,021 INFO L82 PathProgramCache]: Analyzing trace with hash 485835073, now seen corresponding path program 1 times [2020-10-09 15:36:20,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:20,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902516978] [2020-10-09 15:36:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 833 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 833 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:20,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:20,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:20,509 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:36:20,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:36:20,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902516978] [2020-10-09 15:36:20,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:20,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:20,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11951230] [2020-10-09 15:36:20,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:20,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:20,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:20,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:20,532 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:20,533 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 601 transitions, 1443 flow. Second operand 3 states. [2020-10-09 15:36:20,533 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:20,533 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:20,533 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:20,803 INFO L129 PetriNetUnfolder]: 36/706 cut-off events. [2020-10-09 15:36:20,803 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:20,838 INFO L80 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 706 events. 36/706 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2991 event pairs, 0 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 852. Up to 25 conditions per place. [2020-10-09 15:36:20,842 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/599 dead transitions. [2020-10-09 15:36:20,843 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 599 transitions, 1456 flow [2020-10-09 15:36:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:20,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:20,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2020-10-09 15:36:20,844 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9493734335839599 [2020-10-09 15:36:20,844 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2020-10-09 15:36:20,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2020-10-09 15:36:20,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:20,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2020-10-09 15:36:20,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:20,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:20,846 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:20,846 INFO L185 Difference]: Start difference. First operand has 662 places, 601 transitions, 1443 flow. Second operand 3 states and 1894 transitions. [2020-10-09 15:36:20,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 599 transitions, 1456 flow [2020-10-09 15:36:20,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 599 transitions, 1455 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:20,852 INFO L241 Difference]: Finished difference. Result has 661 places, 599 transitions, 1439 flow [2020-10-09 15:36:20,852 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1439, PETRI_PLACES=661, PETRI_TRANSITIONS=599} [2020-10-09 15:36:20,852 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 44 predicate places. [2020-10-09 15:36:20,853 INFO L481 AbstractCegarLoop]: Abstraction has has 661 places, 599 transitions, 1439 flow [2020-10-09 15:36:20,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:20,853 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:20,853 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:21,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 833 mathsat -unsat_core_generation=3 [2020-10-09 15:36:21,053 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:21,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:21,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1896377352, now seen corresponding path program 1 times [2020-10-09 15:36:21,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:21,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944427574] [2020-10-09 15:36:21,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 834 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 834 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:21,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:36:21,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:36:21,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:36:21,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944427574] [2020-10-09 15:36:21,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:21,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:21,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57256201] [2020-10-09 15:36:21,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:21,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:21,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:21,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:21,564 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:36:21,565 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 599 transitions, 1439 flow. Second operand 3 states. [2020-10-09 15:36:21,565 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:21,565 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:36:21,565 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:21,799 INFO L129 PetriNetUnfolder]: 35/713 cut-off events. [2020-10-09 15:36:21,799 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:36:21,844 INFO L80 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 713 events. 35/713 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3050 event pairs, 0 based on Foata normal form. 1/655 useless extension candidates. Maximal degree in co-relation 855. Up to 25 conditions per place. [2020-10-09 15:36:21,850 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/599 dead transitions. [2020-10-09 15:36:21,850 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 599 transitions, 1449 flow [2020-10-09 15:36:21,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:36:21,852 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:36:21,852 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:36:21,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:36:21,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:21,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:36:21,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:21,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:21,854 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:21,854 INFO L185 Difference]: Start difference. First operand has 661 places, 599 transitions, 1439 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:36:21,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 599 transitions, 1449 flow [2020-10-09 15:36:21,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 599 transitions, 1448 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:21,860 INFO L241 Difference]: Finished difference. Result has 663 places, 599 transitions, 1443 flow [2020-10-09 15:36:21,861 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1443, PETRI_PLACES=663, PETRI_TRANSITIONS=599} [2020-10-09 15:36:21,861 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 46 predicate places. [2020-10-09 15:36:21,861 INFO L481 AbstractCegarLoop]: Abstraction has has 663 places, 599 transitions, 1443 flow [2020-10-09 15:36:21,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:21,861 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:21,861 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:22,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 834 mathsat -unsat_core_generation=3 [2020-10-09 15:36:22,062 INFO L429 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:22,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:22,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1896376329, now seen corresponding path program 1 times [2020-10-09 15:36:22,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:22,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498686809] [2020-10-09 15:36:22,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 835 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 835 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:22,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:22,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:36:22,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:36:22,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498686809] [2020-10-09 15:36:22,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:22,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:22,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592064166] [2020-10-09 15:36:22,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:22,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:22,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:22,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:22,591 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:22,592 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 599 transitions, 1443 flow. Second operand 3 states. [2020-10-09 15:36:22,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:22,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:22,593 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:22,830 INFO L129 PetriNetUnfolder]: 33/715 cut-off events. [2020-10-09 15:36:22,830 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:22,872 INFO L80 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 715 events. 33/715 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3082 event pairs, 0 based on Foata normal form. 0/656 useless extension candidates. Maximal degree in co-relation 868. Up to 25 conditions per place. [2020-10-09 15:36:22,877 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/600 dead transitions. [2020-10-09 15:36:22,877 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 600 transitions, 1469 flow [2020-10-09 15:36:22,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:22,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:22,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1897 transitions. [2020-10-09 15:36:22,878 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508771929824561 [2020-10-09 15:36:22,878 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1897 transitions. [2020-10-09 15:36:22,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1897 transitions. [2020-10-09 15:36:22,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:22,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1897 transitions. [2020-10-09 15:36:22,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:22,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:22,880 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:22,880 INFO L185 Difference]: Start difference. First operand has 663 places, 599 transitions, 1443 flow. Second operand 3 states and 1897 transitions. [2020-10-09 15:36:22,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 665 places, 600 transitions, 1469 flow [2020-10-09 15:36:22,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 600 transitions, 1468 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:22,886 INFO L241 Difference]: Finished difference. Result has 666 places, 600 transitions, 1460 flow [2020-10-09 15:36:22,887 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=662, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1460, PETRI_PLACES=666, PETRI_TRANSITIONS=600} [2020-10-09 15:36:22,887 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 49 predicate places. [2020-10-09 15:36:22,887 INFO L481 AbstractCegarLoop]: Abstraction has has 666 places, 600 transitions, 1460 flow [2020-10-09 15:36:22,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:22,887 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:22,887 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:23,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 835 mathsat -unsat_core_generation=3 [2020-10-09 15:36:23,088 INFO L429 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:23,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:23,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1897329641, now seen corresponding path program 1 times [2020-10-09 15:36:23,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:23,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584605616] [2020-10-09 15:36:23,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 836 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 836 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:23,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:23,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:36:23,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:36:23,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584605616] [2020-10-09 15:36:23,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:23,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:23,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360943436] [2020-10-09 15:36:23,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:23,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:23,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:23,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:23,601 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:36:23,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 600 transitions, 1460 flow. Second operand 3 states. [2020-10-09 15:36:23,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:23,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:36:23,603 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:23,834 INFO L129 PetriNetUnfolder]: 33/708 cut-off events. [2020-10-09 15:36:23,834 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:36:23,875 INFO L80 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 708 events. 33/708 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3020 event pairs, 0 based on Foata normal form. 1/653 useless extension candidates. Maximal degree in co-relation 854. Up to 25 conditions per place. [2020-10-09 15:36:23,879 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/598 dead transitions. [2020-10-09 15:36:23,879 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 598 transitions, 1462 flow [2020-10-09 15:36:23,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2020-10-09 15:36:23,881 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9553884711779449 [2020-10-09 15:36:23,881 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2020-10-09 15:36:23,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2020-10-09 15:36:23,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:23,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2020-10-09 15:36:23,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:23,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:23,883 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:23,883 INFO L185 Difference]: Start difference. First operand has 666 places, 600 transitions, 1460 flow. Second operand 3 states and 1906 transitions. [2020-10-09 15:36:23,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 598 transitions, 1462 flow [2020-10-09 15:36:23,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 665 places, 598 transitions, 1454 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:36:23,889 INFO L241 Difference]: Finished difference. Result has 666 places, 598 transitions, 1447 flow [2020-10-09 15:36:23,889 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=663, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1447, PETRI_PLACES=666, PETRI_TRANSITIONS=598} [2020-10-09 15:36:23,889 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 49 predicate places. [2020-10-09 15:36:23,890 INFO L481 AbstractCegarLoop]: Abstraction has has 666 places, 598 transitions, 1447 flow [2020-10-09 15:36:23,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:23,890 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:23,890 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:24,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 836 mathsat -unsat_core_generation=3 [2020-10-09 15:36:24,090 INFO L429 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:24,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:24,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1897330664, now seen corresponding path program 1 times [2020-10-09 15:36:24,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:24,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48138806] [2020-10-09 15:36:24,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 837 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 837 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:24,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:24,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:24,583 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:36:24,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:36:24,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48138806] [2020-10-09 15:36:24,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:24,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:24,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534187795] [2020-10-09 15:36:24,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:24,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:24,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:24,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:24,605 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:24,606 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 598 transitions, 1447 flow. Second operand 3 states. [2020-10-09 15:36:24,606 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:24,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:24,607 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:24,871 INFO L129 PetriNetUnfolder]: 33/706 cut-off events. [2020-10-09 15:36:24,871 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:24,909 INFO L80 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 706 events. 33/706 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3005 event pairs, 0 based on Foata normal form. 0/649 useless extension candidates. Maximal degree in co-relation 858. Up to 25 conditions per place. [2020-10-09 15:36:24,914 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/596 dead transitions. [2020-10-09 15:36:24,914 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 596 transitions, 1460 flow [2020-10-09 15:36:24,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2020-10-09 15:36:24,915 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9493734335839599 [2020-10-09 15:36:24,915 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2020-10-09 15:36:24,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2020-10-09 15:36:24,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:24,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2020-10-09 15:36:24,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:24,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:24,918 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:24,918 INFO L185 Difference]: Start difference. First operand has 666 places, 598 transitions, 1447 flow. Second operand 3 states and 1894 transitions. [2020-10-09 15:36:24,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 596 transitions, 1460 flow [2020-10-09 15:36:24,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 665 places, 596 transitions, 1459 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:24,924 INFO L241 Difference]: Finished difference. Result has 665 places, 596 transitions, 1443 flow [2020-10-09 15:36:24,925 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=663, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1443, PETRI_PLACES=665, PETRI_TRANSITIONS=596} [2020-10-09 15:36:24,925 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 48 predicate places. [2020-10-09 15:36:24,925 INFO L481 AbstractCegarLoop]: Abstraction has has 665 places, 596 transitions, 1443 flow [2020-10-09 15:36:24,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:24,925 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:24,925 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:25,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 837 mathsat -unsat_core_generation=3 [2020-10-09 15:36:25,126 INFO L429 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:25,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:25,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2088567152, now seen corresponding path program 1 times [2020-10-09 15:36:25,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:25,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380407431] [2020-10-09 15:36:25,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 838 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 838 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:25,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:25,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:36:25,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:36:25,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380407431] [2020-10-09 15:36:25,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:25,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:25,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832119296] [2020-10-09 15:36:25,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:25,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:25,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:25,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:25,652 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:25,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 596 transitions, 1443 flow. Second operand 3 states. [2020-10-09 15:36:25,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:25,653 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:25,653 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:25,896 INFO L129 PetriNetUnfolder]: 32/714 cut-off events. [2020-10-09 15:36:25,896 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:36:25,938 INFO L80 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 714 events. 32/714 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3077 event pairs, 0 based on Foata normal form. 0/657 useless extension candidates. Maximal degree in co-relation 870. Up to 25 conditions per place. [2020-10-09 15:36:25,943 INFO L132 encePairwiseOnDemand]: 660/665 looper letters, 10 selfloop transitions, 3 changer transitions 0/598 dead transitions. [2020-10-09 15:36:25,943 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 598 transitions, 1473 flow [2020-10-09 15:36:25,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:25,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1899 transitions. [2020-10-09 15:36:25,944 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518796992481203 [2020-10-09 15:36:25,944 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1899 transitions. [2020-10-09 15:36:25,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1899 transitions. [2020-10-09 15:36:25,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:25,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1899 transitions. [2020-10-09 15:36:25,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:25,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:25,946 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:25,947 INFO L185 Difference]: Start difference. First operand has 665 places, 596 transitions, 1443 flow. Second operand 3 states and 1899 transitions. [2020-10-09 15:36:25,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 598 transitions, 1473 flow [2020-10-09 15:36:25,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 598 transitions, 1472 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:25,953 INFO L241 Difference]: Finished difference. Result has 668 places, 598 transitions, 1466 flow [2020-10-09 15:36:25,953 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=668, PETRI_TRANSITIONS=598} [2020-10-09 15:36:25,953 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 51 predicate places. [2020-10-09 15:36:25,953 INFO L481 AbstractCegarLoop]: Abstraction has has 668 places, 598 transitions, 1466 flow [2020-10-09 15:36:25,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:25,953 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:25,953 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:26,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 838 mathsat -unsat_core_generation=3 [2020-10-09 15:36:26,154 INFO L429 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:26,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:26,155 INFO L82 PathProgramCache]: Analyzing trace with hash 2088568175, now seen corresponding path program 1 times [2020-10-09 15:36:26,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:26,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277595691] [2020-10-09 15:36:26,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 839 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 839 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:26,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:26,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:36:26,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:26,653 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:36:26,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277595691] [2020-10-09 15:36:26,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:26,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:26,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026761885] [2020-10-09 15:36:26,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:26,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:26,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:26,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:26,672 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:36:26,673 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 668 places, 598 transitions, 1466 flow. Second operand 3 states. [2020-10-09 15:36:26,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:26,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:36:26,674 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:26,911 INFO L129 PetriNetUnfolder]: 31/712 cut-off events. [2020-10-09 15:36:26,911 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:36:26,954 INFO L80 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 712 events. 31/712 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3063 event pairs, 0 based on Foata normal form. 0/658 useless extension candidates. Maximal degree in co-relation 867. Up to 25 conditions per place. [2020-10-09 15:36:26,959 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 5 selfloop transitions, 2 changer transitions 0/598 dead transitions. [2020-10-09 15:36:26,960 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 598 transitions, 1478 flow [2020-10-09 15:36:26,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:26,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:26,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1907 transitions. [2020-10-09 15:36:26,961 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9558897243107769 [2020-10-09 15:36:26,961 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1907 transitions. [2020-10-09 15:36:26,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1907 transitions. [2020-10-09 15:36:26,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:26,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1907 transitions. [2020-10-09 15:36:26,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:26,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:26,963 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:26,963 INFO L185 Difference]: Start difference. First operand has 668 places, 598 transitions, 1466 flow. Second operand 3 states and 1907 transitions. [2020-10-09 15:36:26,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 598 transitions, 1478 flow [2020-10-09 15:36:26,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 669 places, 598 transitions, 1473 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:26,969 INFO L241 Difference]: Finished difference. Result has 671 places, 598 transitions, 1471 flow [2020-10-09 15:36:26,970 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=667, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1471, PETRI_PLACES=671, PETRI_TRANSITIONS=598} [2020-10-09 15:36:26,970 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 54 predicate places. [2020-10-09 15:36:26,970 INFO L481 AbstractCegarLoop]: Abstraction has has 671 places, 598 transitions, 1471 flow [2020-10-09 15:36:26,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:26,970 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:26,970 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:27,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 839 mathsat -unsat_core_generation=3 [2020-10-09 15:36:27,171 INFO L429 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:27,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:27,171 INFO L82 PathProgramCache]: Analyzing trace with hash 2089520464, now seen corresponding path program 1 times [2020-10-09 15:36:27,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:27,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224346258] [2020-10-09 15:36:27,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 840 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 840 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:27,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:36:27,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:36:27,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:36:27,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224346258] [2020-10-09 15:36:27,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:27,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:27,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013960015] [2020-10-09 15:36:27,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:27,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:27,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:27,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:27,683 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:36:27,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 598 transitions, 1471 flow. Second operand 3 states. [2020-10-09 15:36:27,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:27,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:36:27,684 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:27,915 INFO L129 PetriNetUnfolder]: 30/708 cut-off events. [2020-10-09 15:36:27,915 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:36:27,954 INFO L80 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 708 events. 30/708 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3036 event pairs, 0 based on Foata normal form. 1/656 useless extension candidates. Maximal degree in co-relation 863. Up to 25 conditions per place. [2020-10-09 15:36:27,959 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/595 dead transitions. [2020-10-09 15:36:27,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 595 transitions, 1466 flow [2020-10-09 15:36:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:27,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:36:27,960 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:36:27,961 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:36:27,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:36:27,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:27,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:36:27,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:27,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:27,963 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:27,963 INFO L185 Difference]: Start difference. First operand has 671 places, 598 transitions, 1471 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:36:27,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 595 transitions, 1466 flow [2020-10-09 15:36:27,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 670 places, 595 transitions, 1459 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:36:27,969 INFO L241 Difference]: Finished difference. Result has 670 places, 595 transitions, 1451 flow [2020-10-09 15:36:27,970 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=668, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1451, PETRI_PLACES=670, PETRI_TRANSITIONS=595} [2020-10-09 15:36:27,970 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 53 predicate places. [2020-10-09 15:36:27,970 INFO L481 AbstractCegarLoop]: Abstraction has has 670 places, 595 transitions, 1451 flow [2020-10-09 15:36:27,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:27,970 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:27,970 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:28,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 840 mathsat -unsat_core_generation=3 [2020-10-09 15:36:28,171 INFO L429 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:28,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:28,171 INFO L82 PathProgramCache]: Analyzing trace with hash 2089521487, now seen corresponding path program 1 times [2020-10-09 15:36:28,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:28,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225866943] [2020-10-09 15:36:28,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 841 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 841 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:28,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:28,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:36:28,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:36:28,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225866943] [2020-10-09 15:36:28,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:28,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:28,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22886561] [2020-10-09 15:36:28,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:28,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:28,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:28,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:28,718 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:28,720 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 670 places, 595 transitions, 1451 flow. Second operand 3 states. [2020-10-09 15:36:28,720 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:28,720 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:28,720 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:28,997 INFO L129 PetriNetUnfolder]: 30/706 cut-off events. [2020-10-09 15:36:28,997 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:36:29,036 INFO L80 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 706 events. 30/706 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3021 event pairs, 0 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 865. Up to 25 conditions per place. [2020-10-09 15:36:29,040 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/593 dead transitions. [2020-10-09 15:36:29,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 593 transitions, 1464 flow [2020-10-09 15:36:29,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:29,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:29,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2020-10-09 15:36:29,042 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9493734335839599 [2020-10-09 15:36:29,042 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2020-10-09 15:36:29,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2020-10-09 15:36:29,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:29,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2020-10-09 15:36:29,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:29,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:29,044 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:29,044 INFO L185 Difference]: Start difference. First operand has 670 places, 595 transitions, 1451 flow. Second operand 3 states and 1894 transitions. [2020-10-09 15:36:29,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 593 transitions, 1464 flow [2020-10-09 15:36:29,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 669 places, 593 transitions, 1463 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:29,050 INFO L241 Difference]: Finished difference. Result has 669 places, 593 transitions, 1447 flow [2020-10-09 15:36:29,050 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=667, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1447, PETRI_PLACES=669, PETRI_TRANSITIONS=593} [2020-10-09 15:36:29,050 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 52 predicate places. [2020-10-09 15:36:29,050 INFO L481 AbstractCegarLoop]: Abstraction has has 669 places, 593 transitions, 1447 flow [2020-10-09 15:36:29,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:29,051 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:29,051 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:29,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 841 mathsat -unsat_core_generation=3 [2020-10-09 15:36:29,251 INFO L429 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:29,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:29,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1485699415, now seen corresponding path program 1 times [2020-10-09 15:36:29,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:29,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678248601] [2020-10-09 15:36:29,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 842 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 842 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:29,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:36:29,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:29,746 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:36:29,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:29,751 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:36:29,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678248601] [2020-10-09 15:36:29,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:29,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:29,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547156091] [2020-10-09 15:36:29,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:29,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:29,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:29,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:29,765 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:36:29,766 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 669 places, 593 transitions, 1447 flow. Second operand 3 states. [2020-10-09 15:36:29,766 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:29,766 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:36:29,766 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:30,003 INFO L129 PetriNetUnfolder]: 29/713 cut-off events. [2020-10-09 15:36:30,003 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:36:30,044 INFO L80 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 713 events. 29/713 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3081 event pairs, 0 based on Foata normal form. 1/661 useless extension candidates. Maximal degree in co-relation 868. Up to 25 conditions per place. [2020-10-09 15:36:30,048 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/593 dead transitions. [2020-10-09 15:36:30,048 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 593 transitions, 1457 flow [2020-10-09 15:36:30,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:30,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:36:30,050 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:36:30,050 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:36:30,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:36:30,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:30,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:36:30,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:30,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:30,052 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:30,052 INFO L185 Difference]: Start difference. First operand has 669 places, 593 transitions, 1447 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:36:30,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 671 places, 593 transitions, 1457 flow [2020-10-09 15:36:30,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 670 places, 593 transitions, 1456 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:30,059 INFO L241 Difference]: Finished difference. Result has 671 places, 593 transitions, 1451 flow [2020-10-09 15:36:30,059 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=668, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1451, PETRI_PLACES=671, PETRI_TRANSITIONS=593} [2020-10-09 15:36:30,059 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 54 predicate places. [2020-10-09 15:36:30,059 INFO L481 AbstractCegarLoop]: Abstraction has has 671 places, 593 transitions, 1451 flow [2020-10-09 15:36:30,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:30,059 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:30,059 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:30,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 842 mathsat -unsat_core_generation=3 [2020-10-09 15:36:30,260 INFO L429 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:30,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:30,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1485698392, now seen corresponding path program 1 times [2020-10-09 15:36:30,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:30,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141162946] [2020-10-09 15:36:30,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 843 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 843 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:30,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:30,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:36:30,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:36:30,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141162946] [2020-10-09 15:36:30,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:30,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:30,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366217125] [2020-10-09 15:36:30,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:30,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:30,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:30,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:30,779 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:30,780 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 593 transitions, 1451 flow. Second operand 3 states. [2020-10-09 15:36:30,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:30,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:30,781 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:31,027 INFO L129 PetriNetUnfolder]: 27/715 cut-off events. [2020-10-09 15:36:31,027 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:31,068 INFO L80 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 715 events. 27/715 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3115 event pairs, 0 based on Foata normal form. 0/662 useless extension candidates. Maximal degree in co-relation 881. Up to 25 conditions per place. [2020-10-09 15:36:31,072 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/594 dead transitions. [2020-10-09 15:36:31,072 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 594 transitions, 1477 flow [2020-10-09 15:36:31,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:31,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1897 transitions. [2020-10-09 15:36:31,074 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508771929824561 [2020-10-09 15:36:31,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1897 transitions. [2020-10-09 15:36:31,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1897 transitions. [2020-10-09 15:36:31,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:31,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1897 transitions. [2020-10-09 15:36:31,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:31,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:31,076 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:31,076 INFO L185 Difference]: Start difference. First operand has 671 places, 593 transitions, 1451 flow. Second operand 3 states and 1897 transitions. [2020-10-09 15:36:31,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 594 transitions, 1477 flow [2020-10-09 15:36:31,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 672 places, 594 transitions, 1476 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:31,082 INFO L241 Difference]: Finished difference. Result has 674 places, 594 transitions, 1468 flow [2020-10-09 15:36:31,082 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=670, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1468, PETRI_PLACES=674, PETRI_TRANSITIONS=594} [2020-10-09 15:36:31,082 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 57 predicate places. [2020-10-09 15:36:31,083 INFO L481 AbstractCegarLoop]: Abstraction has has 674 places, 594 transitions, 1468 flow [2020-10-09 15:36:31,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:31,083 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:31,083 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:31,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 843 mathsat -unsat_core_generation=3 [2020-10-09 15:36:31,283 INFO L429 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:31,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:31,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1486651704, now seen corresponding path program 1 times [2020-10-09 15:36:31,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:31,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279605034] [2020-10-09 15:36:31,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 844 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 844 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:31,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:31,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:36:31,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:31,782 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:36:31,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279605034] [2020-10-09 15:36:31,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:31,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:31,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841987490] [2020-10-09 15:36:31,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:31,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:31,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:31,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:31,794 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:36:31,795 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 674 places, 594 transitions, 1468 flow. Second operand 3 states. [2020-10-09 15:36:31,795 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:31,796 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:36:31,796 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:32,096 INFO L129 PetriNetUnfolder]: 27/708 cut-off events. [2020-10-09 15:36:32,096 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:36:32,124 INFO L80 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 708 events. 27/708 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3058 event pairs, 0 based on Foata normal form. 1/659 useless extension candidates. Maximal degree in co-relation 867. Up to 25 conditions per place. [2020-10-09 15:36:32,128 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/592 dead transitions. [2020-10-09 15:36:32,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 592 transitions, 1470 flow [2020-10-09 15:36:32,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:32,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:32,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2020-10-09 15:36:32,130 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9553884711779449 [2020-10-09 15:36:32,130 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2020-10-09 15:36:32,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2020-10-09 15:36:32,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:32,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2020-10-09 15:36:32,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:32,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:32,132 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:32,132 INFO L185 Difference]: Start difference. First operand has 674 places, 594 transitions, 1468 flow. Second operand 3 states and 1906 transitions. [2020-10-09 15:36:32,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 592 transitions, 1470 flow [2020-10-09 15:36:32,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 673 places, 592 transitions, 1462 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:36:32,138 INFO L241 Difference]: Finished difference. Result has 674 places, 592 transitions, 1455 flow [2020-10-09 15:36:32,138 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=671, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1455, PETRI_PLACES=674, PETRI_TRANSITIONS=592} [2020-10-09 15:36:32,139 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 57 predicate places. [2020-10-09 15:36:32,139 INFO L481 AbstractCegarLoop]: Abstraction has has 674 places, 592 transitions, 1455 flow [2020-10-09 15:36:32,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:32,139 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:32,139 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:32,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 844 mathsat -unsat_core_generation=3 [2020-10-09 15:36:32,351 INFO L429 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:32,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:32,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1486652727, now seen corresponding path program 1 times [2020-10-09 15:36:32,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:32,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288703263] [2020-10-09 15:36:32,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 845 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 845 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:32,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:32,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:36:32,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:36:32,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288703263] [2020-10-09 15:36:32,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:32,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:32,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831919238] [2020-10-09 15:36:32,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:32,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:32,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:32,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:32,873 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:32,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 674 places, 592 transitions, 1455 flow. Second operand 3 states. [2020-10-09 15:36:32,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:32,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:32,874 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:33,119 INFO L129 PetriNetUnfolder]: 27/706 cut-off events. [2020-10-09 15:36:33,119 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:33,161 INFO L80 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 706 events. 27/706 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3040 event pairs, 0 based on Foata normal form. 0/655 useless extension candidates. Maximal degree in co-relation 871. Up to 25 conditions per place. [2020-10-09 15:36:33,165 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/590 dead transitions. [2020-10-09 15:36:33,165 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 674 places, 590 transitions, 1468 flow [2020-10-09 15:36:33,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:33,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:33,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2020-10-09 15:36:33,166 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9493734335839599 [2020-10-09 15:36:33,167 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2020-10-09 15:36:33,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2020-10-09 15:36:33,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:33,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2020-10-09 15:36:33,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:33,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:33,168 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:33,169 INFO L185 Difference]: Start difference. First operand has 674 places, 592 transitions, 1455 flow. Second operand 3 states and 1894 transitions. [2020-10-09 15:36:33,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 674 places, 590 transitions, 1468 flow [2020-10-09 15:36:33,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 673 places, 590 transitions, 1467 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:33,175 INFO L241 Difference]: Finished difference. Result has 673 places, 590 transitions, 1451 flow [2020-10-09 15:36:33,175 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=671, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1451, PETRI_PLACES=673, PETRI_TRANSITIONS=590} [2020-10-09 15:36:33,175 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 56 predicate places. [2020-10-09 15:36:33,175 INFO L481 AbstractCegarLoop]: Abstraction has has 673 places, 590 transitions, 1451 flow [2020-10-09 15:36:33,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:33,176 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:33,176 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:33,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 845 mathsat -unsat_core_generation=3 [2020-10-09 15:36:33,376 INFO L429 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:33,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:33,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1204118403, now seen corresponding path program 1 times [2020-10-09 15:36:33,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:33,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285165766] [2020-10-09 15:36:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 846 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 846 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:33,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:36:33,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:36:33,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:36:33,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285165766] [2020-10-09 15:36:33,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:33,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:33,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980368614] [2020-10-09 15:36:33,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:33,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:33,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:33,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:33,895 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:36:33,896 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 673 places, 590 transitions, 1451 flow. Second operand 3 states. [2020-10-09 15:36:33,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:33,897 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:36:33,897 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:34,133 INFO L129 PetriNetUnfolder]: 26/713 cut-off events. [2020-10-09 15:36:34,133 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:36:34,172 INFO L80 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 713 events. 26/713 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3103 event pairs, 0 based on Foata normal form. 1/664 useless extension candidates. Maximal degree in co-relation 874. Up to 25 conditions per place. [2020-10-09 15:36:34,176 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/590 dead transitions. [2020-10-09 15:36:34,176 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 675 places, 590 transitions, 1461 flow [2020-10-09 15:36:34,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:34,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:36:34,178 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:36:34,178 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:36:34,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:36:34,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:34,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:36:34,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:34,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:34,180 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:34,180 INFO L185 Difference]: Start difference. First operand has 673 places, 590 transitions, 1451 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:36:34,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 675 places, 590 transitions, 1461 flow [2020-10-09 15:36:34,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 674 places, 590 transitions, 1460 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:34,186 INFO L241 Difference]: Finished difference. Result has 675 places, 590 transitions, 1455 flow [2020-10-09 15:36:34,186 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=672, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1455, PETRI_PLACES=675, PETRI_TRANSITIONS=590} [2020-10-09 15:36:34,186 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 58 predicate places. [2020-10-09 15:36:34,186 INFO L481 AbstractCegarLoop]: Abstraction has has 675 places, 590 transitions, 1455 flow [2020-10-09 15:36:34,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:34,186 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:34,187 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:34,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 846 mathsat -unsat_core_generation=3 [2020-10-09 15:36:34,387 INFO L429 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:34,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:34,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1204119426, now seen corresponding path program 1 times [2020-10-09 15:36:34,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:34,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927574114] [2020-10-09 15:36:34,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 847 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 847 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:34,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:34,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:36:34,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:36:34,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927574114] [2020-10-09 15:36:34,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:34,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:34,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889327908] [2020-10-09 15:36:34,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:34,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:34,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:34,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:34,925 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:34,926 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 590 transitions, 1455 flow. Second operand 3 states. [2020-10-09 15:36:34,926 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:34,926 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:34,926 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:35,173 INFO L129 PetriNetUnfolder]: 24/715 cut-off events. [2020-10-09 15:36:35,174 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:35,214 INFO L80 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 715 events. 24/715 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3134 event pairs, 0 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 887. Up to 25 conditions per place. [2020-10-09 15:36:35,218 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/591 dead transitions. [2020-10-09 15:36:35,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 677 places, 591 transitions, 1481 flow [2020-10-09 15:36:35,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1897 transitions. [2020-10-09 15:36:35,219 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508771929824561 [2020-10-09 15:36:35,219 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1897 transitions. [2020-10-09 15:36:35,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1897 transitions. [2020-10-09 15:36:35,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:35,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1897 transitions. [2020-10-09 15:36:35,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:35,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:35,221 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:35,221 INFO L185 Difference]: Start difference. First operand has 675 places, 590 transitions, 1455 flow. Second operand 3 states and 1897 transitions. [2020-10-09 15:36:35,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 677 places, 591 transitions, 1481 flow [2020-10-09 15:36:35,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 676 places, 591 transitions, 1480 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:35,228 INFO L241 Difference]: Finished difference. Result has 678 places, 591 transitions, 1472 flow [2020-10-09 15:36:35,228 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=674, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=678, PETRI_TRANSITIONS=591} [2020-10-09 15:36:35,228 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 61 predicate places. [2020-10-09 15:36:35,228 INFO L481 AbstractCegarLoop]: Abstraction has has 678 places, 591 transitions, 1472 flow [2020-10-09 15:36:35,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:35,228 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:35,228 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:35,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 847 mathsat -unsat_core_generation=3 [2020-10-09 15:36:35,429 INFO L429 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:35,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:35,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1203166114, now seen corresponding path program 1 times [2020-10-09 15:36:35,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:35,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398445395] [2020-10-09 15:36:35,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 848 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 848 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:35,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:35,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:35,961 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:36:35,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:36:35,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398445395] [2020-10-09 15:36:35,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:35,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:35,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867226233] [2020-10-09 15:36:35,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:35,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:35,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:35,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:35,976 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:36:35,977 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 591 transitions, 1472 flow. Second operand 3 states. [2020-10-09 15:36:35,977 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:35,977 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:36:35,977 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:36,209 INFO L129 PetriNetUnfolder]: 24/708 cut-off events. [2020-10-09 15:36:36,210 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:36:36,248 INFO L80 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 708 events. 24/708 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3076 event pairs, 0 based on Foata normal form. 1/662 useless extension candidates. Maximal degree in co-relation 873. Up to 25 conditions per place. [2020-10-09 15:36:36,252 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/589 dead transitions. [2020-10-09 15:36:36,252 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 589 transitions, 1474 flow [2020-10-09 15:36:36,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:36,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2020-10-09 15:36:36,253 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9553884711779449 [2020-10-09 15:36:36,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2020-10-09 15:36:36,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2020-10-09 15:36:36,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:36,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2020-10-09 15:36:36,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:36,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:36,256 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:36,256 INFO L185 Difference]: Start difference. First operand has 678 places, 591 transitions, 1472 flow. Second operand 3 states and 1906 transitions. [2020-10-09 15:36:36,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 589 transitions, 1474 flow [2020-10-09 15:36:36,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 677 places, 589 transitions, 1466 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:36:36,262 INFO L241 Difference]: Finished difference. Result has 678 places, 589 transitions, 1459 flow [2020-10-09 15:36:36,262 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=675, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1459, PETRI_PLACES=678, PETRI_TRANSITIONS=589} [2020-10-09 15:36:36,262 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 61 predicate places. [2020-10-09 15:36:36,262 INFO L481 AbstractCegarLoop]: Abstraction has has 678 places, 589 transitions, 1459 flow [2020-10-09 15:36:36,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:36,262 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:36,262 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:36,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 848 mathsat -unsat_core_generation=3 [2020-10-09 15:36:36,463 INFO L429 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:36,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:36,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1203165091, now seen corresponding path program 1 times [2020-10-09 15:36:36,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:36,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800512261] [2020-10-09 15:36:36,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 849 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 849 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:36,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:36,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:36:36,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:36,964 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:36:36,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800512261] [2020-10-09 15:36:36,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:36,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:36,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473082569] [2020-10-09 15:36:36,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:36,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:36,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:36,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:36,984 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:36,985 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 589 transitions, 1459 flow. Second operand 3 states. [2020-10-09 15:36:36,985 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:36,985 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:36,985 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:37,227 INFO L129 PetriNetUnfolder]: 24/706 cut-off events. [2020-10-09 15:36:37,227 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:37,268 INFO L80 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 706 events. 24/706 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3062 event pairs, 0 based on Foata normal form. 0/658 useless extension candidates. Maximal degree in co-relation 877. Up to 25 conditions per place. [2020-10-09 15:36:37,271 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/587 dead transitions. [2020-10-09 15:36:37,271 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 678 places, 587 transitions, 1472 flow [2020-10-09 15:36:37,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:37,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2020-10-09 15:36:37,273 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9493734335839599 [2020-10-09 15:36:37,273 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2020-10-09 15:36:37,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2020-10-09 15:36:37,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:37,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2020-10-09 15:36:37,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:37,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:37,275 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:37,275 INFO L185 Difference]: Start difference. First operand has 678 places, 589 transitions, 1459 flow. Second operand 3 states and 1894 transitions. [2020-10-09 15:36:37,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 678 places, 587 transitions, 1472 flow [2020-10-09 15:36:37,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 677 places, 587 transitions, 1471 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:37,281 INFO L241 Difference]: Finished difference. Result has 677 places, 587 transitions, 1455 flow [2020-10-09 15:36:37,281 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=675, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1455, PETRI_PLACES=677, PETRI_TRANSITIONS=587} [2020-10-09 15:36:37,281 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 60 predicate places. [2020-10-09 15:36:37,282 INFO L481 AbstractCegarLoop]: Abstraction has has 677 places, 587 transitions, 1455 flow [2020-10-09 15:36:37,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:37,282 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:37,282 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:37,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 849 mathsat -unsat_core_generation=3 [2020-10-09 15:36:37,495 INFO L429 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:37,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:37,495 INFO L82 PathProgramCache]: Analyzing trace with hash 736399229, now seen corresponding path program 1 times [2020-10-09 15:36:37,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:37,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726362414] [2020-10-09 15:36:37,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 850 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 850 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:37,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:37,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:36:37,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:37,999 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:36:37,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726362414] [2020-10-09 15:36:37,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:37,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:37,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912086040] [2020-10-09 15:36:37,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:37,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:38,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:38,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:38,011 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:36:38,012 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 587 transitions, 1455 flow. Second operand 3 states. [2020-10-09 15:36:38,012 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:38,012 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:36:38,012 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:38,252 INFO L129 PetriNetUnfolder]: 22/711 cut-off events. [2020-10-09 15:36:38,252 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:36:38,292 INFO L80 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 711 events. 22/711 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3112 event pairs, 0 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 880. Up to 25 conditions per place. [2020-10-09 15:36:38,296 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 5 selfloop transitions, 2 changer transitions 0/588 dead transitions. [2020-10-09 15:36:38,296 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 588 transitions, 1471 flow [2020-10-09 15:36:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1907 transitions. [2020-10-09 15:36:38,297 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9558897243107769 [2020-10-09 15:36:38,297 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1907 transitions. [2020-10-09 15:36:38,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1907 transitions. [2020-10-09 15:36:38,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:38,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1907 transitions. [2020-10-09 15:36:38,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:38,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:38,300 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:38,300 INFO L185 Difference]: Start difference. First operand has 677 places, 587 transitions, 1455 flow. Second operand 3 states and 1907 transitions. [2020-10-09 15:36:38,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 679 places, 588 transitions, 1471 flow [2020-10-09 15:36:38,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 588 transitions, 1470 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:38,309 INFO L241 Difference]: Finished difference. Result has 680 places, 588 transitions, 1468 flow [2020-10-09 15:36:38,310 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1468, PETRI_PLACES=680, PETRI_TRANSITIONS=588} [2020-10-09 15:36:38,310 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 63 predicate places. [2020-10-09 15:36:38,310 INFO L481 AbstractCegarLoop]: Abstraction has has 680 places, 588 transitions, 1468 flow [2020-10-09 15:36:38,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:38,310 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:38,310 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:38,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 850 mathsat -unsat_core_generation=3 [2020-10-09 15:36:38,511 INFO L429 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:38,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:38,511 INFO L82 PathProgramCache]: Analyzing trace with hash 736398206, now seen corresponding path program 1 times [2020-10-09 15:36:38,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:38,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045358897] [2020-10-09 15:36:38,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 851 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 851 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:39,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:39,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:36:39,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:36:39,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045358897] [2020-10-09 15:36:39,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:39,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:39,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177000849] [2020-10-09 15:36:39,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:39,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:39,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:39,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:39,048 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:39,049 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 588 transitions, 1468 flow. Second operand 3 states. [2020-10-09 15:36:39,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:39,050 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:39,050 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:39,290 INFO L129 PetriNetUnfolder]: 22/712 cut-off events. [2020-10-09 15:36:39,291 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:36:39,332 INFO L80 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 712 events. 22/712 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3119 event pairs, 0 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 888. Up to 25 conditions per place. [2020-10-09 15:36:39,335 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/589 dead transitions. [2020-10-09 15:36:39,336 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 589 transitions, 1494 flow [2020-10-09 15:36:39,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:39,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:39,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1897 transitions. [2020-10-09 15:36:39,337 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508771929824561 [2020-10-09 15:36:39,337 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1897 transitions. [2020-10-09 15:36:39,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1897 transitions. [2020-10-09 15:36:39,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:39,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1897 transitions. [2020-10-09 15:36:39,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:39,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:39,339 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:39,339 INFO L185 Difference]: Start difference. First operand has 680 places, 588 transitions, 1468 flow. Second operand 3 states and 1897 transitions. [2020-10-09 15:36:39,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 589 transitions, 1494 flow [2020-10-09 15:36:39,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 681 places, 589 transitions, 1492 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:39,346 INFO L241 Difference]: Finished difference. Result has 683 places, 589 transitions, 1484 flow [2020-10-09 15:36:39,346 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1484, PETRI_PLACES=683, PETRI_TRANSITIONS=589} [2020-10-09 15:36:39,346 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 66 predicate places. [2020-10-09 15:36:39,346 INFO L481 AbstractCegarLoop]: Abstraction has has 683 places, 589 transitions, 1484 flow [2020-10-09 15:36:39,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:39,346 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:39,346 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:39,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 851 mathsat -unsat_core_generation=3 [2020-10-09 15:36:39,547 INFO L429 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:39,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:39,547 INFO L82 PathProgramCache]: Analyzing trace with hash 737352541, now seen corresponding path program 1 times [2020-10-09 15:36:39,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:39,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131860810] [2020-10-09 15:36:39,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 852 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 852 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:40,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:40,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:36:40,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:36:40,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131860810] [2020-10-09 15:36:40,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:40,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:40,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540749324] [2020-10-09 15:36:40,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:40,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:40,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:40,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:40,112 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:40,113 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 589 transitions, 1484 flow. Second operand 3 states. [2020-10-09 15:36:40,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:40,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:40,114 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:40,353 INFO L129 PetriNetUnfolder]: 21/709 cut-off events. [2020-10-09 15:36:40,353 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2020-10-09 15:36:40,393 INFO L80 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 709 events. 21/709 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3100 event pairs, 0 based on Foata normal form. 2/666 useless extension candidates. Maximal degree in co-relation 887. Up to 25 conditions per place. [2020-10-09 15:36:40,396 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 9 selfloop transitions, 1 changer transitions 0/587 dead transitions. [2020-10-09 15:36:40,396 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 587 transitions, 1492 flow [2020-10-09 15:36:40,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:40,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2020-10-09 15:36:40,397 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503759398496241 [2020-10-09 15:36:40,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1896 transitions. [2020-10-09 15:36:40,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1896 transitions. [2020-10-09 15:36:40,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:40,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1896 transitions. [2020-10-09 15:36:40,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:40,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:40,399 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:40,400 INFO L185 Difference]: Start difference. First operand has 683 places, 589 transitions, 1484 flow. Second operand 3 states and 1896 transitions. [2020-10-09 15:36:40,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 685 places, 587 transitions, 1492 flow [2020-10-09 15:36:40,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 587 transitions, 1491 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:40,406 INFO L241 Difference]: Finished difference. Result has 684 places, 587 transitions, 1473 flow [2020-10-09 15:36:40,406 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1473, PETRI_PLACES=684, PETRI_TRANSITIONS=587} [2020-10-09 15:36:40,406 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 67 predicate places. [2020-10-09 15:36:40,406 INFO L481 AbstractCegarLoop]: Abstraction has has 684 places, 587 transitions, 1473 flow [2020-10-09 15:36:40,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:40,406 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:40,406 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:40,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 852 mathsat -unsat_core_generation=3 [2020-10-09 15:36:40,607 INFO L429 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:40,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:40,608 INFO L82 PathProgramCache]: Analyzing trace with hash 737351518, now seen corresponding path program 1 times [2020-10-09 15:36:40,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:40,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008890435] [2020-10-09 15:36:40,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 853 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 853 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:41,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:36:41,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:36:41,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:36:41,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008890435] [2020-10-09 15:36:41,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:41,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:41,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417936288] [2020-10-09 15:36:41,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:41,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:41,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:41,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:41,125 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:36:41,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 587 transitions, 1473 flow. Second operand 3 states. [2020-10-09 15:36:41,126 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:41,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:36:41,126 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:41,359 INFO L129 PetriNetUnfolder]: 21/706 cut-off events. [2020-10-09 15:36:41,359 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:41,398 INFO L80 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 706 events. 21/706 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3079 event pairs, 0 based on Foata normal form. 1/663 useless extension candidates. Maximal degree in co-relation 881. Up to 25 conditions per place. [2020-10-09 15:36:41,401 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/584 dead transitions. [2020-10-09 15:36:41,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 584 transitions, 1472 flow [2020-10-09 15:36:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:36:41,402 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:36:41,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:36:41,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:36:41,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:41,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:36:41,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:41,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:41,404 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:41,405 INFO L185 Difference]: Start difference. First operand has 684 places, 587 transitions, 1473 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:36:41,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 584 transitions, 1472 flow [2020-10-09 15:36:41,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 681 places, 584 transitions, 1467 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:36:41,411 INFO L241 Difference]: Finished difference. Result has 681 places, 584 transitions, 1459 flow [2020-10-09 15:36:41,411 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1459, PETRI_PLACES=681, PETRI_TRANSITIONS=584} [2020-10-09 15:36:41,411 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 64 predicate places. [2020-10-09 15:36:41,411 INFO L481 AbstractCegarLoop]: Abstraction has has 681 places, 584 transitions, 1459 flow [2020-10-09 15:36:41,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:41,411 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:41,411 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:41,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 853 mathsat -unsat_core_generation=3 [2020-10-09 15:36:41,612 INFO L429 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:41,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:41,613 INFO L82 PathProgramCache]: Analyzing trace with hash 565920698, now seen corresponding path program 1 times [2020-10-09 15:36:41,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:41,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059597851] [2020-10-09 15:36:41,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 854 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 854 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:42,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:36:42,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:36:42,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:42,123 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:36:42,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059597851] [2020-10-09 15:36:42,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:42,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:42,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088823324] [2020-10-09 15:36:42,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:42,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:42,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:42,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:42,145 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:36:42,146 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 584 transitions, 1459 flow. Second operand 3 states. [2020-10-09 15:36:42,146 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:42,146 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:36:42,146 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:42,389 INFO L129 PetriNetUnfolder]: 20/713 cut-off events. [2020-10-09 15:36:42,389 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:36:42,429 INFO L80 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 713 events. 20/713 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3137 event pairs, 0 based on Foata normal form. 1/669 useless extension candidates. Maximal degree in co-relation 889. Up to 25 conditions per place. [2020-10-09 15:36:42,432 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/584 dead transitions. [2020-10-09 15:36:42,432 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 584 transitions, 1469 flow [2020-10-09 15:36:42,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:36:42,433 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:36:42,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:36:42,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:36:42,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:42,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:36:42,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:42,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:42,435 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:42,435 INFO L185 Difference]: Start difference. First operand has 681 places, 584 transitions, 1459 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:36:42,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 683 places, 584 transitions, 1469 flow [2020-10-09 15:36:42,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 682 places, 584 transitions, 1468 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:42,442 INFO L241 Difference]: Finished difference. Result has 683 places, 584 transitions, 1463 flow [2020-10-09 15:36:42,442 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1463, PETRI_PLACES=683, PETRI_TRANSITIONS=584} [2020-10-09 15:36:42,442 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 66 predicate places. [2020-10-09 15:36:42,442 INFO L481 AbstractCegarLoop]: Abstraction has has 683 places, 584 transitions, 1463 flow [2020-10-09 15:36:42,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:42,442 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:42,442 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:42,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 854 mathsat -unsat_core_generation=3 [2020-10-09 15:36:42,643 INFO L429 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:42,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:42,643 INFO L82 PathProgramCache]: Analyzing trace with hash 565921721, now seen corresponding path program 1 times [2020-10-09 15:36:42,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:42,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490483086] [2020-10-09 15:36:42,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 855 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 855 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:43,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:43,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:43,145 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:36:43,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:43,149 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:36:43,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490483086] [2020-10-09 15:36:43,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:43,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:43,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103279045] [2020-10-09 15:36:43,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:43,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:43,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:43,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:43,179 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:43,180 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 584 transitions, 1463 flow. Second operand 3 states. [2020-10-09 15:36:43,180 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:43,180 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:43,180 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:43,423 INFO L129 PetriNetUnfolder]: 18/715 cut-off events. [2020-10-09 15:36:43,424 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:43,464 INFO L80 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 715 events. 18/715 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3174 event pairs, 0 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 900. Up to 25 conditions per place. [2020-10-09 15:36:43,467 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/585 dead transitions. [2020-10-09 15:36:43,467 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 585 transitions, 1489 flow [2020-10-09 15:36:43,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1897 transitions. [2020-10-09 15:36:43,468 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508771929824561 [2020-10-09 15:36:43,468 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1897 transitions. [2020-10-09 15:36:43,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1897 transitions. [2020-10-09 15:36:43,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:43,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1897 transitions. [2020-10-09 15:36:43,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:43,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:43,470 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:43,470 INFO L185 Difference]: Start difference. First operand has 683 places, 584 transitions, 1463 flow. Second operand 3 states and 1897 transitions. [2020-10-09 15:36:43,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 685 places, 585 transitions, 1489 flow [2020-10-09 15:36:43,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 585 transitions, 1488 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:43,476 INFO L241 Difference]: Finished difference. Result has 686 places, 585 transitions, 1480 flow [2020-10-09 15:36:43,477 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1480, PETRI_PLACES=686, PETRI_TRANSITIONS=585} [2020-10-09 15:36:43,477 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 69 predicate places. [2020-10-09 15:36:43,477 INFO L481 AbstractCegarLoop]: Abstraction has has 686 places, 585 transitions, 1480 flow [2020-10-09 15:36:43,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:43,477 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:43,477 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:43,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 855 mathsat -unsat_core_generation=3 [2020-10-09 15:36:43,678 INFO L429 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:43,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:43,678 INFO L82 PathProgramCache]: Analyzing trace with hash 564968409, now seen corresponding path program 1 times [2020-10-09 15:36:43,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:43,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430387281] [2020-10-09 15:36:43,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 856 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 856 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:44,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:44,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:36:44,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:36:44,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430387281] [2020-10-09 15:36:44,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:44,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:44,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465018549] [2020-10-09 15:36:44,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:44,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:44,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:44,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:44,225 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:36:44,226 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 686 places, 585 transitions, 1480 flow. Second operand 3 states. [2020-10-09 15:36:44,227 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:44,227 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:36:44,227 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:44,470 INFO L129 PetriNetUnfolder]: 18/708 cut-off events. [2020-10-09 15:36:44,470 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:36:44,513 INFO L80 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 708 events. 18/708 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3109 event pairs, 0 based on Foata normal form. 1/668 useless extension candidates. Maximal degree in co-relation 886. Up to 25 conditions per place. [2020-10-09 15:36:44,516 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/583 dead transitions. [2020-10-09 15:36:44,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 583 transitions, 1482 flow [2020-10-09 15:36:44,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2020-10-09 15:36:44,518 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9553884711779449 [2020-10-09 15:36:44,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2020-10-09 15:36:44,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2020-10-09 15:36:44,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:44,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2020-10-09 15:36:44,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:44,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:44,520 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:44,520 INFO L185 Difference]: Start difference. First operand has 686 places, 585 transitions, 1480 flow. Second operand 3 states and 1906 transitions. [2020-10-09 15:36:44,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 583 transitions, 1482 flow [2020-10-09 15:36:44,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 583 transitions, 1474 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:36:44,526 INFO L241 Difference]: Finished difference. Result has 686 places, 583 transitions, 1467 flow [2020-10-09 15:36:44,526 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=683, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1467, PETRI_PLACES=686, PETRI_TRANSITIONS=583} [2020-10-09 15:36:44,527 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 69 predicate places. [2020-10-09 15:36:44,527 INFO L481 AbstractCegarLoop]: Abstraction has has 686 places, 583 transitions, 1467 flow [2020-10-09 15:36:44,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:44,527 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:44,527 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:44,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 856 mathsat -unsat_core_generation=3 [2020-10-09 15:36:44,728 INFO L429 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:44,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:44,728 INFO L82 PathProgramCache]: Analyzing trace with hash 564967386, now seen corresponding path program 1 times [2020-10-09 15:36:44,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:44,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895781289] [2020-10-09 15:36:44,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 857 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 857 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:45,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:45,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:36:45,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:36:45,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895781289] [2020-10-09 15:36:45,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:45,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:45,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814661082] [2020-10-09 15:36:45,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:45,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:45,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:45,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:45,266 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:45,267 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 686 places, 583 transitions, 1467 flow. Second operand 3 states. [2020-10-09 15:36:45,267 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:45,267 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:45,267 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:45,510 INFO L129 PetriNetUnfolder]: 18/706 cut-off events. [2020-10-09 15:36:45,510 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:45,550 INFO L80 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 706 events. 18/706 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3092 event pairs, 0 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 890. Up to 25 conditions per place. [2020-10-09 15:36:45,553 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/581 dead transitions. [2020-10-09 15:36:45,553 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 686 places, 581 transitions, 1480 flow [2020-10-09 15:36:45,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2020-10-09 15:36:45,554 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9493734335839599 [2020-10-09 15:36:45,554 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2020-10-09 15:36:45,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2020-10-09 15:36:45,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:45,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2020-10-09 15:36:45,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:45,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:45,556 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:45,556 INFO L185 Difference]: Start difference. First operand has 686 places, 583 transitions, 1467 flow. Second operand 3 states and 1894 transitions. [2020-10-09 15:36:45,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 686 places, 581 transitions, 1480 flow [2020-10-09 15:36:45,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 581 transitions, 1479 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:45,563 INFO L241 Difference]: Finished difference. Result has 685 places, 581 transitions, 1463 flow [2020-10-09 15:36:45,563 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=683, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1463, PETRI_PLACES=685, PETRI_TRANSITIONS=581} [2020-10-09 15:36:45,563 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 68 predicate places. [2020-10-09 15:36:45,563 INFO L481 AbstractCegarLoop]: Abstraction has has 685 places, 581 transitions, 1463 flow [2020-10-09 15:36:45,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:45,563 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:45,564 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:45,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 857 mathsat -unsat_core_generation=3 [2020-10-09 15:36:45,764 INFO L429 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:45,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:45,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1503931882, now seen corresponding path program 1 times [2020-10-09 15:36:45,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:45,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647053131] [2020-10-09 15:36:45,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 858 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 858 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:46,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:46,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:36:46,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:36:46,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647053131] [2020-10-09 15:36:46,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:46,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:46,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924202096] [2020-10-09 15:36:46,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:46,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:46,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:46,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:46,307 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:46,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 581 transitions, 1463 flow. Second operand 3 states. [2020-10-09 15:36:46,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:46,309 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:46,309 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:46,555 INFO L129 PetriNetUnfolder]: 17/714 cut-off events. [2020-10-09 15:36:46,555 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:36:46,595 INFO L80 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 714 events. 17/714 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3165 event pairs, 0 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 902. Up to 25 conditions per place. [2020-10-09 15:36:46,598 INFO L132 encePairwiseOnDemand]: 660/665 looper letters, 10 selfloop transitions, 3 changer transitions 0/583 dead transitions. [2020-10-09 15:36:46,598 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 687 places, 583 transitions, 1493 flow [2020-10-09 15:36:46,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1899 transitions. [2020-10-09 15:36:46,600 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9518796992481203 [2020-10-09 15:36:46,600 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1899 transitions. [2020-10-09 15:36:46,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1899 transitions. [2020-10-09 15:36:46,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:46,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1899 transitions. [2020-10-09 15:36:46,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:46,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:46,602 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:46,602 INFO L185 Difference]: Start difference. First operand has 685 places, 581 transitions, 1463 flow. Second operand 3 states and 1899 transitions. [2020-10-09 15:36:46,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 687 places, 583 transitions, 1493 flow [2020-10-09 15:36:46,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 583 transitions, 1492 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:46,608 INFO L241 Difference]: Finished difference. Result has 688 places, 583 transitions, 1486 flow [2020-10-09 15:36:46,608 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=684, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1486, PETRI_PLACES=688, PETRI_TRANSITIONS=583} [2020-10-09 15:36:46,608 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 71 predicate places. [2020-10-09 15:36:46,609 INFO L481 AbstractCegarLoop]: Abstraction has has 688 places, 583 transitions, 1486 flow [2020-10-09 15:36:46,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:46,609 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:46,609 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:46,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 858 mathsat -unsat_core_generation=3 [2020-10-09 15:36:46,809 INFO L429 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:46,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1503932905, now seen corresponding path program 1 times [2020-10-09 15:36:46,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:46,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483434497] [2020-10-09 15:36:46,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 859 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 859 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:47,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:36:47,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:47,316 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:36:47,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:36:47,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483434497] [2020-10-09 15:36:47,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:47,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:47,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586909437] [2020-10-09 15:36:47,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:47,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:47,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:47,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:47,335 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:36:47,336 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 583 transitions, 1486 flow. Second operand 3 states. [2020-10-09 15:36:47,336 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:47,336 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:36:47,336 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:47,612 INFO L129 PetriNetUnfolder]: 15/715 cut-off events. [2020-10-09 15:36:47,612 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:36:47,650 INFO L80 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 715 events. 15/715 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3187 event pairs, 0 based on Foata normal form. 1/678 useless extension candidates. Maximal degree in co-relation 900. Up to 25 conditions per place. [2020-10-09 15:36:47,653 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/582 dead transitions. [2020-10-09 15:36:47,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 690 places, 582 transitions, 1492 flow [2020-10-09 15:36:47,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:36:47,654 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:36:47,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:36:47,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:36:47,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:47,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:36:47,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:47,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:47,656 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:47,656 INFO L185 Difference]: Start difference. First operand has 688 places, 583 transitions, 1486 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:36:47,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 690 places, 582 transitions, 1492 flow [2020-10-09 15:36:47,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 582 transitions, 1487 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:47,662 INFO L241 Difference]: Finished difference. Result has 690 places, 582 transitions, 1482 flow [2020-10-09 15:36:47,663 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1477, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1482, PETRI_PLACES=690, PETRI_TRANSITIONS=582} [2020-10-09 15:36:47,663 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 73 predicate places. [2020-10-09 15:36:47,663 INFO L481 AbstractCegarLoop]: Abstraction has has 690 places, 582 transitions, 1482 flow [2020-10-09 15:36:47,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:47,663 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:47,663 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:47,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 859 mathsat -unsat_core_generation=3 [2020-10-09 15:36:47,864 INFO L429 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:47,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:47,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1504885194, now seen corresponding path program 1 times [2020-10-09 15:36:47,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:47,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215302359] [2020-10-09 15:36:47,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 860 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 860 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:48,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:48,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:48,368 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:36:48,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:36:48,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215302359] [2020-10-09 15:36:48,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:48,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:48,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15879888] [2020-10-09 15:36:48,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:48,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:48,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:48,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:48,384 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:36:48,385 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 582 transitions, 1482 flow. Second operand 3 states. [2020-10-09 15:36:48,385 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:48,385 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:36:48,385 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:48,626 INFO L129 PetriNetUnfolder]: 15/708 cut-off events. [2020-10-09 15:36:48,626 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:36:48,665 INFO L80 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 708 events. 15/708 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3128 event pairs, 0 based on Foata normal form. 1/671 useless extension candidates. Maximal degree in co-relation 896. Up to 25 conditions per place. [2020-10-09 15:36:48,668 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/580 dead transitions. [2020-10-09 15:36:48,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 692 places, 580 transitions, 1485 flow [2020-10-09 15:36:48,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:48,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2020-10-09 15:36:48,669 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9553884711779449 [2020-10-09 15:36:48,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2020-10-09 15:36:48,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2020-10-09 15:36:48,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:48,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2020-10-09 15:36:48,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:48,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:48,671 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:48,672 INFO L185 Difference]: Start difference. First operand has 690 places, 582 transitions, 1482 flow. Second operand 3 states and 1906 transitions. [2020-10-09 15:36:48,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 692 places, 580 transitions, 1485 flow [2020-10-09 15:36:48,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 580 transitions, 1478 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:36:48,678 INFO L241 Difference]: Finished difference. Result has 690 places, 580 transitions, 1471 flow [2020-10-09 15:36:48,678 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1471, PETRI_PLACES=690, PETRI_TRANSITIONS=580} [2020-10-09 15:36:48,678 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 73 predicate places. [2020-10-09 15:36:48,678 INFO L481 AbstractCegarLoop]: Abstraction has has 690 places, 580 transitions, 1471 flow [2020-10-09 15:36:48,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:48,678 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:48,679 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:48,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 860 mathsat -unsat_core_generation=3 [2020-10-09 15:36:48,879 INFO L429 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:48,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:48,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1504886217, now seen corresponding path program 1 times [2020-10-09 15:36:48,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:48,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840839504] [2020-10-09 15:36:48,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 861 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 861 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:49,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:49,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:36:49,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:36:49,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840839504] [2020-10-09 15:36:49,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:49,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:49,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371622173] [2020-10-09 15:36:49,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:49,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:49,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:49,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:49,407 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:49,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 580 transitions, 1471 flow. Second operand 3 states. [2020-10-09 15:36:49,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:49,409 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:49,409 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:49,653 INFO L129 PetriNetUnfolder]: 15/706 cut-off events. [2020-10-09 15:36:49,653 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:49,692 INFO L80 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 706 events. 15/706 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3113 event pairs, 0 based on Foata normal form. 0/667 useless extension candidates. Maximal degree in co-relation 896. Up to 25 conditions per place. [2020-10-09 15:36:49,694 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/578 dead transitions. [2020-10-09 15:36:49,694 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 690 places, 578 transitions, 1484 flow [2020-10-09 15:36:49,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2020-10-09 15:36:49,696 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9493734335839599 [2020-10-09 15:36:49,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2020-10-09 15:36:49,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2020-10-09 15:36:49,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:49,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2020-10-09 15:36:49,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:49,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:49,698 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:49,698 INFO L185 Difference]: Start difference. First operand has 690 places, 580 transitions, 1471 flow. Second operand 3 states and 1894 transitions. [2020-10-09 15:36:49,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 690 places, 578 transitions, 1484 flow [2020-10-09 15:36:49,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 578 transitions, 1483 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:49,704 INFO L241 Difference]: Finished difference. Result has 689 places, 578 transitions, 1467 flow [2020-10-09 15:36:49,704 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1467, PETRI_PLACES=689, PETRI_TRANSITIONS=578} [2020-10-09 15:36:49,704 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 72 predicate places. [2020-10-09 15:36:49,704 INFO L481 AbstractCegarLoop]: Abstraction has has 689 places, 578 transitions, 1467 flow [2020-10-09 15:36:49,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:49,705 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:49,705 INFO L255 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:49,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 861 mathsat -unsat_core_generation=3 [2020-10-09 15:36:49,905 INFO L429 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:49,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:49,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1052448779, now seen corresponding path program 1 times [2020-10-09 15:36:49,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:49,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756906692] [2020-10-09 15:36:49,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 862 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 862 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:50,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:36:50,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:36:50,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:36:50,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756906692] [2020-10-09 15:36:50,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:50,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:50,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337076867] [2020-10-09 15:36:50,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:50,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:50,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:50,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:50,434 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 665 [2020-10-09 15:36:50,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 689 places, 578 transitions, 1467 flow. Second operand 3 states. [2020-10-09 15:36:50,435 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:50,435 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 665 [2020-10-09 15:36:50,435 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:50,678 INFO L129 PetriNetUnfolder]: 14/713 cut-off events. [2020-10-09 15:36:50,679 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2020-10-09 15:36:50,719 INFO L80 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 713 events. 14/713 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3167 event pairs, 0 based on Foata normal form. 1/676 useless extension candidates. Maximal degree in co-relation 899. Up to 25 conditions per place. [2020-10-09 15:36:50,721 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 4 selfloop transitions, 1 changer transitions 0/578 dead transitions. [2020-10-09 15:36:50,721 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 578 transitions, 1477 flow [2020-10-09 15:36:50,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2020-10-09 15:36:50,723 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956390977443609 [2020-10-09 15:36:50,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2020-10-09 15:36:50,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2020-10-09 15:36:50,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:50,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2020-10-09 15:36:50,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:50,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:50,725 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:50,725 INFO L185 Difference]: Start difference. First operand has 689 places, 578 transitions, 1467 flow. Second operand 3 states and 1908 transitions. [2020-10-09 15:36:50,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 578 transitions, 1477 flow [2020-10-09 15:36:50,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 690 places, 578 transitions, 1476 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:50,731 INFO L241 Difference]: Finished difference. Result has 691 places, 578 transitions, 1471 flow [2020-10-09 15:36:50,731 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=688, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1471, PETRI_PLACES=691, PETRI_TRANSITIONS=578} [2020-10-09 15:36:50,731 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 74 predicate places. [2020-10-09 15:36:50,732 INFO L481 AbstractCegarLoop]: Abstraction has has 691 places, 578 transitions, 1471 flow [2020-10-09 15:36:50,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:50,732 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:50,732 INFO L255 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:50,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 862 mathsat -unsat_core_generation=3 [2020-10-09 15:36:50,932 INFO L429 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:50,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:50,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1052447756, now seen corresponding path program 1 times [2020-10-09 15:36:50,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:50,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219105837] [2020-10-09 15:36:50,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 863 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 863 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:51,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:51,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:36:51,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:36:51,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219105837] [2020-10-09 15:36:51,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:51,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:51,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800072511] [2020-10-09 15:36:51,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:51,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:51,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:51,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:51,499 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:51,500 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 578 transitions, 1471 flow. Second operand 3 states. [2020-10-09 15:36:51,500 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:51,500 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:51,500 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:51,751 INFO L129 PetriNetUnfolder]: 12/715 cut-off events. [2020-10-09 15:36:51,751 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:51,791 INFO L80 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 715 events. 12/715 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3202 event pairs, 0 based on Foata normal form. 0/677 useless extension candidates. Maximal degree in co-relation 912. Up to 25 conditions per place. [2020-10-09 15:36:51,793 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/579 dead transitions. [2020-10-09 15:36:51,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 579 transitions, 1497 flow [2020-10-09 15:36:51,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1897 transitions. [2020-10-09 15:36:51,794 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508771929824561 [2020-10-09 15:36:51,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1897 transitions. [2020-10-09 15:36:51,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1897 transitions. [2020-10-09 15:36:51,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:51,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1897 transitions. [2020-10-09 15:36:51,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:51,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:51,796 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:51,797 INFO L185 Difference]: Start difference. First operand has 691 places, 578 transitions, 1471 flow. Second operand 3 states and 1897 transitions. [2020-10-09 15:36:51,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 579 transitions, 1497 flow [2020-10-09 15:36:51,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 579 transitions, 1496 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:51,803 INFO L241 Difference]: Finished difference. Result has 694 places, 579 transitions, 1488 flow [2020-10-09 15:36:51,803 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=690, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1488, PETRI_PLACES=694, PETRI_TRANSITIONS=579} [2020-10-09 15:36:51,803 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 77 predicate places. [2020-10-09 15:36:51,803 INFO L481 AbstractCegarLoop]: Abstraction has has 694 places, 579 transitions, 1488 flow [2020-10-09 15:36:51,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:51,803 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:51,804 INFO L255 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:52,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 863 mathsat -unsat_core_generation=3 [2020-10-09 15:36:52,004 INFO L429 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:52,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:52,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1053401068, now seen corresponding path program 1 times [2020-10-09 15:36:52,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:52,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925400098] [2020-10-09 15:36:52,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 864 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 864 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:52,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:52,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:36:52,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:36:52,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925400098] [2020-10-09 15:36:52,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:52,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:52,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590043140] [2020-10-09 15:36:52,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:52,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:52,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:52,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:52,526 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 633 out of 665 [2020-10-09 15:36:52,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 579 transitions, 1488 flow. Second operand 3 states. [2020-10-09 15:36:52,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:52,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 665 [2020-10-09 15:36:52,527 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:52,778 INFO L129 PetriNetUnfolder]: 12/708 cut-off events. [2020-10-09 15:36:52,778 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:36:52,818 INFO L80 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 708 events. 12/708 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3142 event pairs, 0 based on Foata normal form. 1/674 useless extension candidates. Maximal degree in co-relation 898. Up to 25 conditions per place. [2020-10-09 15:36:52,820 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/577 dead transitions. [2020-10-09 15:36:52,820 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 577 transitions, 1490 flow [2020-10-09 15:36:52,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2020-10-09 15:36:52,822 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9553884711779449 [2020-10-09 15:36:52,822 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2020-10-09 15:36:52,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2020-10-09 15:36:52,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:52,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2020-10-09 15:36:52,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:52,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:52,824 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:52,824 INFO L185 Difference]: Start difference. First operand has 694 places, 579 transitions, 1488 flow. Second operand 3 states and 1906 transitions. [2020-10-09 15:36:52,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 577 transitions, 1490 flow [2020-10-09 15:36:52,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 577 transitions, 1482 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:36:52,830 INFO L241 Difference]: Finished difference. Result has 694 places, 577 transitions, 1475 flow [2020-10-09 15:36:52,830 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1475, PETRI_PLACES=694, PETRI_TRANSITIONS=577} [2020-10-09 15:36:52,830 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 77 predicate places. [2020-10-09 15:36:52,831 INFO L481 AbstractCegarLoop]: Abstraction has has 694 places, 577 transitions, 1475 flow [2020-10-09 15:36:52,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:52,831 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:52,831 INFO L255 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:53,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 864 mathsat -unsat_core_generation=3 [2020-10-09 15:36:53,031 INFO L429 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:53,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:53,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1053402091, now seen corresponding path program 1 times [2020-10-09 15:36:53,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:53,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884585855] [2020-10-09 15:36:53,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 865 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 865 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:53,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:53,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:36:53,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:53,540 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:36:53,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884585855] [2020-10-09 15:36:53,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:53,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:53,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531483344] [2020-10-09 15:36:53,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:53,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:53,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:53,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:53,560 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 665 [2020-10-09 15:36:53,561 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 577 transitions, 1475 flow. Second operand 3 states. [2020-10-09 15:36:53,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:53,561 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 665 [2020-10-09 15:36:53,561 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:53,807 INFO L129 PetriNetUnfolder]: 12/706 cut-off events. [2020-10-09 15:36:53,808 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:53,847 INFO L80 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 706 events. 12/706 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3126 event pairs, 0 based on Foata normal form. 0/670 useless extension candidates. Maximal degree in co-relation 902. Up to 25 conditions per place. [2020-10-09 15:36:53,850 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/575 dead transitions. [2020-10-09 15:36:53,850 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 575 transitions, 1488 flow [2020-10-09 15:36:53,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:53,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:53,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2020-10-09 15:36:53,851 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9493734335839599 [2020-10-09 15:36:53,851 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1894 transitions. [2020-10-09 15:36:53,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1894 transitions. [2020-10-09 15:36:53,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:53,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1894 transitions. [2020-10-09 15:36:53,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:53,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:53,853 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:53,854 INFO L185 Difference]: Start difference. First operand has 694 places, 577 transitions, 1475 flow. Second operand 3 states and 1894 transitions. [2020-10-09 15:36:53,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 575 transitions, 1488 flow [2020-10-09 15:36:53,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 575 transitions, 1487 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:53,860 INFO L241 Difference]: Finished difference. Result has 693 places, 575 transitions, 1471 flow [2020-10-09 15:36:53,860 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1469, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1471, PETRI_PLACES=693, PETRI_TRANSITIONS=575} [2020-10-09 15:36:53,860 INFO L341 CegarLoopForPetriNet]: 617 programPoint places, 76 predicate places. [2020-10-09 15:36:53,860 INFO L481 AbstractCegarLoop]: Abstraction has has 693 places, 575 transitions, 1471 flow [2020-10-09 15:36:53,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:53,861 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:53,861 INFO L255 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:54,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 865 mathsat -unsat_core_generation=3 [2020-10-09 15:36:54,061 INFO L429 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:54,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:54,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1986776085, now seen corresponding path program 1 times [2020-10-09 15:36:54,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:54,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207878732] [2020-10-09 15:36:54,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 866 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 866 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:36:54,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:36:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:36:54,632 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:36:54,693 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:36:54,693 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:36:54,902 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 866 mathsat -unsat_core_generation=3 [2020-10-09 15:36:54,902 WARN L371 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:36:54,903 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2020-10-09 15:36:54,940 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,940 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,942 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,942 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,943 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,945 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,945 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,945 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,945 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,947 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,947 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,947 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,947 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,947 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,947 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,947 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,948 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,948 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,949 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,949 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,949 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,949 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,949 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,950 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,950 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,950 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,950 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,950 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,950 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,950 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,952 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,952 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,952 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,952 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,952 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,952 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,952 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,954 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,954 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,955 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,955 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,955 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,955 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,955 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,955 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,955 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,955 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,956 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,956 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,957 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,957 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,957 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,957 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,957 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,958 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,958 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,958 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,958 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,958 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,958 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,958 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,960 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,960 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,960 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,960 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,960 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,960 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,960 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,961 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,961 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,961 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,961 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,961 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,961 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,961 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,961 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,961 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,961 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,961 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,961 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,961 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,961 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,962 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,962 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,964 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,964 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,965 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,965 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,965 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,965 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,965 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,966 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,966 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,966 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,966 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,966 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,966 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,966 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,968 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,968 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,968 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,968 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,968 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,968 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,968 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,969 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,969 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,969 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,969 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,969 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,969 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,969 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,969 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,969 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,969 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,969 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,969 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,969 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,969 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,969 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,970 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,970 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,970 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,972 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,972 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,981 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,981 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,981 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,981 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,981 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:54,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,008 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,008 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,008 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,008 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,008 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,008 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,008 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,050 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,050 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,050 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,050 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,050 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,050 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,050 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,051 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,051 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:36:55,052 INFO L253 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2020-10-09 15:36:55,052 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:36:55,052 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:36:55,052 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:36:55,052 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:36:55,053 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:36:55,053 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:36:55,053 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:36:55,053 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:36:55,056 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 642 places, 692 transitions, 2109 flow [2020-10-09 15:36:55,308 INFO L129 PetriNetUnfolder]: 126/916 cut-off events. [2020-10-09 15:36:55,308 INFO L130 PetriNetUnfolder]: For 2900/2900 co-relation queries the response was YES. [2020-10-09 15:36:55,371 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 916 events. 126/916 cut-off events. For 2900/2900 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3856 event pairs, 0 based on Foata normal form. 0/739 useless extension candidates. Maximal degree in co-relation 1247. Up to 52 conditions per place. [2020-10-09 15:36:55,372 INFO L82 GeneralOperation]: Start removeDead. Operand has 642 places, 692 transitions, 2109 flow [2020-10-09 15:36:55,395 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 642 places, 692 transitions, 2109 flow [2020-10-09 15:36:55,401 INFO L129 PetriNetUnfolder]: 10/99 cut-off events. [2020-10-09 15:36:55,401 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:36:55,401 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:55,401 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:55,401 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:55,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:55,401 INFO L82 PathProgramCache]: Analyzing trace with hash 739616480, now seen corresponding path program 1 times [2020-10-09 15:36:55,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:55,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239775782] [2020-10-09 15:36:55,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 867 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 867 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:55,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:55,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:36:55,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:55,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:36:55,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239775782] [2020-10-09 15:36:55,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:55,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:55,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309959138] [2020-10-09 15:36:55,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:55,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:55,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:55,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:55,946 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:36:55,947 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 692 transitions, 2109 flow. Second operand 3 states. [2020-10-09 15:36:55,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:55,947 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:36:55,947 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:56,191 INFO L129 PetriNetUnfolder]: 74/743 cut-off events. [2020-10-09 15:36:56,191 INFO L130 PetriNetUnfolder]: For 2901/2901 co-relation queries the response was YES. [2020-10-09 15:36:56,240 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 743 events. 74/743 cut-off events. For 2901/2901 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2970 event pairs, 0 based on Foata normal form. 108/750 useless extension candidates. Maximal degree in co-relation 1086. Up to 26 conditions per place. [2020-10-09 15:36:56,253 INFO L132 encePairwiseOnDemand]: 660/692 looper letters, 10 selfloop transitions, 3 changer transitions 0/663 dead transitions. [2020-10-09 15:36:56,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 663 transitions, 2077 flow [2020-10-09 15:36:56,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:56,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:56,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2031 transitions. [2020-10-09 15:36:56,255 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9783236994219653 [2020-10-09 15:36:56,255 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2031 transitions. [2020-10-09 15:36:56,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2031 transitions. [2020-10-09 15:36:56,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:56,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2031 transitions. [2020-10-09 15:36:56,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:56,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:56,257 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:56,257 INFO L185 Difference]: Start difference. First operand has 642 places, 692 transitions, 2109 flow. Second operand 3 states and 2031 transitions. [2020-10-09 15:36:56,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 663 transitions, 2077 flow [2020-10-09 15:36:56,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 663 transitions, 1477 flow, removed 300 selfloop flow, removed 0 redundant places. [2020-10-09 15:36:56,268 INFO L241 Difference]: Finished difference. Result has 641 places, 663 transitions, 1471 flow [2020-10-09 15:36:56,268 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1447, PETRI_DIFFERENCE_MINUEND_PLACES=637, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1471, PETRI_PLACES=641, PETRI_TRANSITIONS=663} [2020-10-09 15:36:56,268 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, -1 predicate places. [2020-10-09 15:36:56,268 INFO L481 AbstractCegarLoop]: Abstraction has has 641 places, 663 transitions, 1471 flow [2020-10-09 15:36:56,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:56,269 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:56,269 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:56,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 867 mathsat -unsat_core_generation=3 [2020-10-09 15:36:56,469 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:56,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:56,470 INFO L82 PathProgramCache]: Analyzing trace with hash 739617503, now seen corresponding path program 1 times [2020-10-09 15:36:56,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:56,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797457753] [2020-10-09 15:36:56,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 868 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 868 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:56,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:56,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:36:56,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:36:56,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797457753] [2020-10-09 15:36:56,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:56,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:56,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070659928] [2020-10-09 15:36:56,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:56,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:56,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:56,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:56,996 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:36:56,997 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 641 places, 663 transitions, 1471 flow. Second operand 3 states. [2020-10-09 15:36:56,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:56,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:36:56,997 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:57,219 INFO L129 PetriNetUnfolder]: 73/741 cut-off events. [2020-10-09 15:36:57,219 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:36:57,262 INFO L80 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 741 events. 73/741 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2964 event pairs, 0 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 813. Up to 26 conditions per place. [2020-10-09 15:36:57,275 INFO L132 encePairwiseOnDemand]: 689/692 looper letters, 5 selfloop transitions, 2 changer transitions 0/663 dead transitions. [2020-10-09 15:36:57,275 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 663 transitions, 1483 flow [2020-10-09 15:36:57,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1985 transitions. [2020-10-09 15:36:57,276 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561657032755299 [2020-10-09 15:36:57,276 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1985 transitions. [2020-10-09 15:36:57,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1985 transitions. [2020-10-09 15:36:57,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:57,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1985 transitions. [2020-10-09 15:36:57,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:57,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:57,278 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:57,278 INFO L185 Difference]: Start difference. First operand has 641 places, 663 transitions, 1471 flow. Second operand 3 states and 1985 transitions. [2020-10-09 15:36:57,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 663 transitions, 1483 flow [2020-10-09 15:36:57,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 642 places, 663 transitions, 1478 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:57,285 INFO L241 Difference]: Finished difference. Result has 644 places, 663 transitions, 1476 flow [2020-10-09 15:36:57,285 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=640, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=660, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=644, PETRI_TRANSITIONS=663} [2020-10-09 15:36:57,285 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 2 predicate places. [2020-10-09 15:36:57,285 INFO L481 AbstractCegarLoop]: Abstraction has has 644 places, 663 transitions, 1476 flow [2020-10-09 15:36:57,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:57,285 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:57,285 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:57,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 868 mathsat -unsat_core_generation=3 [2020-10-09 15:36:57,486 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:57,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:57,487 INFO L82 PathProgramCache]: Analyzing trace with hash 740570815, now seen corresponding path program 1 times [2020-10-09 15:36:57,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:57,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858369428] [2020-10-09 15:36:57,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 869 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 869 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:58,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:36:58,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:58,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:36:58,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:36:58,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858369428] [2020-10-09 15:36:58,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:58,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:58,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120985767] [2020-10-09 15:36:58,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:58,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:58,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:58,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:58,052 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:36:58,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 663 transitions, 1476 flow. Second operand 3 states. [2020-10-09 15:36:58,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:58,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:36:58,053 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:58,259 INFO L129 PetriNetUnfolder]: 72/738 cut-off events. [2020-10-09 15:36:58,259 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:36:58,298 INFO L80 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 738 events. 72/738 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2944 event pairs, 0 based on Foata normal form. 1/643 useless extension candidates. Maximal degree in co-relation 815. Up to 26 conditions per place. [2020-10-09 15:36:58,309 INFO L132 encePairwiseOnDemand]: 689/692 looper letters, 9 selfloop transitions, 1 changer transitions 0/661 dead transitions. [2020-10-09 15:36:58,309 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 661 transitions, 1486 flow [2020-10-09 15:36:58,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1974 transitions. [2020-10-09 15:36:58,311 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508670520231214 [2020-10-09 15:36:58,311 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1974 transitions. [2020-10-09 15:36:58,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1974 transitions. [2020-10-09 15:36:58,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:58,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1974 transitions. [2020-10-09 15:36:58,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:58,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:58,313 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:58,313 INFO L185 Difference]: Start difference. First operand has 644 places, 663 transitions, 1476 flow. Second operand 3 states and 1974 transitions. [2020-10-09 15:36:58,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 661 transitions, 1486 flow [2020-10-09 15:36:58,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 661 transitions, 1484 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:36:58,319 INFO L241 Difference]: Finished difference. Result has 645 places, 661 transitions, 1466 flow [2020-10-09 15:36:58,320 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=660, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=645, PETRI_TRANSITIONS=661} [2020-10-09 15:36:58,320 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 3 predicate places. [2020-10-09 15:36:58,320 INFO L481 AbstractCegarLoop]: Abstraction has has 645 places, 661 transitions, 1466 flow [2020-10-09 15:36:58,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:58,320 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:58,320 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:36:58,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 869 mathsat -unsat_core_generation=3 [2020-10-09 15:36:58,521 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:58,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:58,521 INFO L82 PathProgramCache]: Analyzing trace with hash 740569792, now seen corresponding path program 1 times [2020-10-09 15:36:58,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:58,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306985596] [2020-10-09 15:36:58,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 870 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 870 with mathsat -unsat_core_generation=3 [2020-10-09 15:36:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:36:59,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:36:59,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:36:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:36:59,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:36:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:36:59,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306985596] [2020-10-09 15:36:59,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:36:59,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:36:59,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50902438] [2020-10-09 15:36:59,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:36:59,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:36:59,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:36:59,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:36:59,050 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:36:59,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 661 transitions, 1466 flow. Second operand 3 states. [2020-10-09 15:36:59,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:36:59,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:36:59,051 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:36:59,255 INFO L129 PetriNetUnfolder]: 72/735 cut-off events. [2020-10-09 15:36:59,255 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:36:59,294 INFO L80 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 735 events. 72/735 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2925 event pairs, 0 based on Foata normal form. 1/640 useless extension candidates. Maximal degree in co-relation 813. Up to 26 conditions per place. [2020-10-09 15:36:59,305 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/658 dead transitions. [2020-10-09 15:36:59,305 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 658 transitions, 1465 flow [2020-10-09 15:36:59,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:36:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:36:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:36:59,307 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:36:59,307 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:36:59,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:36:59,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:36:59,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:36:59,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:36:59,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:36:59,309 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:36:59,309 INFO L185 Difference]: Start difference. First operand has 645 places, 661 transitions, 1466 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:36:59,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 658 transitions, 1465 flow [2020-10-09 15:36:59,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 642 places, 658 transitions, 1460 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:36:59,315 INFO L241 Difference]: Finished difference. Result has 642 places, 658 transitions, 1452 flow [2020-10-09 15:36:59,315 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=640, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1452, PETRI_PLACES=642, PETRI_TRANSITIONS=658} [2020-10-09 15:36:59,316 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 0 predicate places. [2020-10-09 15:36:59,316 INFO L481 AbstractCegarLoop]: Abstraction has has 642 places, 658 transitions, 1452 flow [2020-10-09 15:36:59,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:36:59,316 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:36:59,316 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:36:59,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 870 mathsat -unsat_core_generation=3 [2020-10-09 15:36:59,517 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:36:59,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:36:59,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1512017189, now seen corresponding path program 1 times [2020-10-09 15:36:59,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:36:59,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760338529] [2020-10-09 15:36:59,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 871 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 871 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:00,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:00,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:37:00,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:00,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:37:00,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760338529] [2020-10-09 15:37:00,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:00,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:00,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467728554] [2020-10-09 15:37:00,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:00,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:00,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:00,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:00,048 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:00,049 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 658 transitions, 1452 flow. Second operand 3 states. [2020-10-09 15:37:00,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:00,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:00,049 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:00,260 INFO L129 PetriNetUnfolder]: 71/743 cut-off events. [2020-10-09 15:37:00,260 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:00,301 INFO L80 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 743 events. 71/743 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2996 event pairs, 0 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 830. Up to 26 conditions per place. [2020-10-09 15:37:00,311 INFO L132 encePairwiseOnDemand]: 687/692 looper letters, 10 selfloop transitions, 3 changer transitions 0/660 dead transitions. [2020-10-09 15:37:00,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 644 places, 660 transitions, 1482 flow [2020-10-09 15:37:00,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions. [2020-10-09 15:37:00,313 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523121387283237 [2020-10-09 15:37:00,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions. [2020-10-09 15:37:00,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions. [2020-10-09 15:37:00,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:00,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions. [2020-10-09 15:37:00,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:00,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:00,316 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:00,316 INFO L185 Difference]: Start difference. First operand has 642 places, 658 transitions, 1452 flow. Second operand 3 states and 1977 transitions. [2020-10-09 15:37:00,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 644 places, 660 transitions, 1482 flow [2020-10-09 15:37:00,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 660 transitions, 1481 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:00,322 INFO L241 Difference]: Finished difference. Result has 645 places, 660 transitions, 1475 flow [2020-10-09 15:37:00,322 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1451, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1475, PETRI_PLACES=645, PETRI_TRANSITIONS=660} [2020-10-09 15:37:00,322 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 3 predicate places. [2020-10-09 15:37:00,322 INFO L481 AbstractCegarLoop]: Abstraction has has 645 places, 660 transitions, 1475 flow [2020-10-09 15:37:00,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:00,322 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:00,322 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:37:00,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 871 mathsat -unsat_core_generation=3 [2020-10-09 15:37:00,523 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:00,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:00,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1512016166, now seen corresponding path program 1 times [2020-10-09 15:37:00,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:00,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673397784] [2020-10-09 15:37:00,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 872 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 872 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:01,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:37:01,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:37:01,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:37:01,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673397784] [2020-10-09 15:37:01,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:01,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:01,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289266241] [2020-10-09 15:37:01,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:01,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:01,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:01,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:01,050 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:37:01,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 660 transitions, 1475 flow. Second operand 3 states. [2020-10-09 15:37:01,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:01,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:37:01,051 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:01,260 INFO L129 PetriNetUnfolder]: 69/744 cut-off events. [2020-10-09 15:37:01,260 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:01,301 INFO L80 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 744 events. 69/744 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3015 event pairs, 0 based on Foata normal form. 1/652 useless extension candidates. Maximal degree in co-relation 825. Up to 26 conditions per place. [2020-10-09 15:37:01,311 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/659 dead transitions. [2020-10-09 15:37:01,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 659 transitions, 1481 flow [2020-10-09 15:37:01,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:37:01,312 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:37:01,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:37:01,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:37:01,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:01,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:37:01,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:01,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:01,314 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:01,315 INFO L185 Difference]: Start difference. First operand has 645 places, 660 transitions, 1475 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:37:01,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 659 transitions, 1481 flow [2020-10-09 15:37:01,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 646 places, 659 transitions, 1476 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:01,320 INFO L241 Difference]: Finished difference. Result has 647 places, 659 transitions, 1471 flow [2020-10-09 15:37:01,321 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1471, PETRI_PLACES=647, PETRI_TRANSITIONS=659} [2020-10-09 15:37:01,321 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 5 predicate places. [2020-10-09 15:37:01,321 INFO L481 AbstractCegarLoop]: Abstraction has has 647 places, 659 transitions, 1471 flow [2020-10-09 15:37:01,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:01,321 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:01,321 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:37:01,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 872 mathsat -unsat_core_generation=3 [2020-10-09 15:37:01,522 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:01,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:01,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1511063877, now seen corresponding path program 1 times [2020-10-09 15:37:01,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:01,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903395969] [2020-10-09 15:37:01,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 873 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 873 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:02,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:02,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:37:02,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:37:02,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903395969] [2020-10-09 15:37:02,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:02,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:02,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379242719] [2020-10-09 15:37:02,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:02,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:02,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:02,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:02,284 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:37:02,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 659 transitions, 1471 flow. Second operand 3 states. [2020-10-09 15:37:02,285 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:02,285 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:37:02,285 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:02,495 INFO L129 PetriNetUnfolder]: 69/737 cut-off events. [2020-10-09 15:37:02,495 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:02,534 INFO L80 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 737 events. 69/737 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2961 event pairs, 0 based on Foata normal form. 1/645 useless extension candidates. Maximal degree in co-relation 822. Up to 26 conditions per place. [2020-10-09 15:37:02,544 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 5 selfloop transitions, 1 changer transitions 0/657 dead transitions. [2020-10-09 15:37:02,545 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 657 transitions, 1474 flow [2020-10-09 15:37:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2020-10-09 15:37:02,546 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9556840077071291 [2020-10-09 15:37:02,546 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2020-10-09 15:37:02,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2020-10-09 15:37:02,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:02,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2020-10-09 15:37:02,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:02,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:02,548 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:02,548 INFO L185 Difference]: Start difference. First operand has 647 places, 659 transitions, 1471 flow. Second operand 3 states and 1984 transitions. [2020-10-09 15:37:02,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 657 transitions, 1474 flow [2020-10-09 15:37:02,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 646 places, 657 transitions, 1467 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:37:02,554 INFO L241 Difference]: Finished difference. Result has 647 places, 657 transitions, 1460 flow [2020-10-09 15:37:02,554 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1455, PETRI_DIFFERENCE_MINUEND_PLACES=644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1460, PETRI_PLACES=647, PETRI_TRANSITIONS=657} [2020-10-09 15:37:02,554 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 5 predicate places. [2020-10-09 15:37:02,554 INFO L481 AbstractCegarLoop]: Abstraction has has 647 places, 657 transitions, 1460 flow [2020-10-09 15:37:02,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:02,554 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:02,554 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:37:02,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 873 mathsat -unsat_core_generation=3 [2020-10-09 15:37:02,755 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:02,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:02,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1511062854, now seen corresponding path program 1 times [2020-10-09 15:37:02,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:02,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734070378] [2020-10-09 15:37:02,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 874 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 874 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:03,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:03,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:37:03,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:37:03,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734070378] [2020-10-09 15:37:03,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:03,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:03,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633430168] [2020-10-09 15:37:03,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:03,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:03,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:03,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:03,289 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:03,289 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 657 transitions, 1460 flow. Second operand 3 states. [2020-10-09 15:37:03,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:03,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:03,289 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:03,492 INFO L129 PetriNetUnfolder]: 69/735 cut-off events. [2020-10-09 15:37:03,493 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:37:03,531 INFO L80 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 735 events. 69/735 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2944 event pairs, 0 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 822. Up to 26 conditions per place. [2020-10-09 15:37:03,541 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 8 selfloop transitions, 1 changer transitions 0/655 dead transitions. [2020-10-09 15:37:03,541 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 655 transitions, 1473 flow [2020-10-09 15:37:03,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:03,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2020-10-09 15:37:03,543 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2020-10-09 15:37:03,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1972 transitions. [2020-10-09 15:37:03,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1972 transitions. [2020-10-09 15:37:03,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:03,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1972 transitions. [2020-10-09 15:37:03,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:03,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:03,545 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:03,545 INFO L185 Difference]: Start difference. First operand has 647 places, 657 transitions, 1460 flow. Second operand 3 states and 1972 transitions. [2020-10-09 15:37:03,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 655 transitions, 1473 flow [2020-10-09 15:37:03,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 646 places, 655 transitions, 1472 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:03,551 INFO L241 Difference]: Finished difference. Result has 646 places, 655 transitions, 1456 flow [2020-10-09 15:37:03,551 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1456, PETRI_PLACES=646, PETRI_TRANSITIONS=655} [2020-10-09 15:37:03,551 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 4 predicate places. [2020-10-09 15:37:03,552 INFO L481 AbstractCegarLoop]: Abstraction has has 646 places, 655 transitions, 1456 flow [2020-10-09 15:37:03,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:03,552 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:03,552 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:37:03,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 874 mathsat -unsat_core_generation=3 [2020-10-09 15:37:03,752 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:03,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:03,753 INFO L82 PathProgramCache]: Analyzing trace with hash -259071860, now seen corresponding path program 1 times [2020-10-09 15:37:03,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:03,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016641706] [2020-10-09 15:37:03,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 875 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 875 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:04,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:04,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:37:04,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:37:04,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016641706] [2020-10-09 15:37:04,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:04,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:04,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001925181] [2020-10-09 15:37:04,263 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:04,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:04,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:04,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:04,282 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:04,282 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 655 transitions, 1456 flow. Second operand 3 states. [2020-10-09 15:37:04,282 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:04,283 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:04,283 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:04,490 INFO L129 PetriNetUnfolder]: 68/743 cut-off events. [2020-10-09 15:37:04,490 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:04,529 INFO L80 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 743 events. 68/743 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3014 event pairs, 0 based on Foata normal form. 0/649 useless extension candidates. Maximal degree in co-relation 834. Up to 26 conditions per place. [2020-10-09 15:37:04,539 INFO L132 encePairwiseOnDemand]: 687/692 looper letters, 10 selfloop transitions, 3 changer transitions 0/657 dead transitions. [2020-10-09 15:37:04,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 657 transitions, 1486 flow [2020-10-09 15:37:04,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions. [2020-10-09 15:37:04,541 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523121387283237 [2020-10-09 15:37:04,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions. [2020-10-09 15:37:04,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions. [2020-10-09 15:37:04,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:04,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions. [2020-10-09 15:37:04,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:04,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:04,543 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:04,543 INFO L185 Difference]: Start difference. First operand has 646 places, 655 transitions, 1456 flow. Second operand 3 states and 1977 transitions. [2020-10-09 15:37:04,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 657 transitions, 1486 flow [2020-10-09 15:37:04,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 657 transitions, 1485 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:04,549 INFO L241 Difference]: Finished difference. Result has 649 places, 657 transitions, 1479 flow [2020-10-09 15:37:04,549 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1455, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1479, PETRI_PLACES=649, PETRI_TRANSITIONS=657} [2020-10-09 15:37:04,549 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 7 predicate places. [2020-10-09 15:37:04,549 INFO L481 AbstractCegarLoop]: Abstraction has has 649 places, 657 transitions, 1479 flow [2020-10-09 15:37:04,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:04,549 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:04,549 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:37:04,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 875 mathsat -unsat_core_generation=3 [2020-10-09 15:37:04,750 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:04,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:04,750 INFO L82 PathProgramCache]: Analyzing trace with hash -259072883, now seen corresponding path program 1 times [2020-10-09 15:37:04,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:04,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801548456] [2020-10-09 15:37:04,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 876 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 876 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:05,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:37:05,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:05,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:37:05,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:05,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:37:05,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801548456] [2020-10-09 15:37:05,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:05,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:05,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3816107] [2020-10-09 15:37:05,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:05,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:05,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:05,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:05,290 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:37:05,291 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 657 transitions, 1479 flow. Second operand 3 states. [2020-10-09 15:37:05,291 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:05,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:37:05,291 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:05,503 INFO L129 PetriNetUnfolder]: 66/744 cut-off events. [2020-10-09 15:37:05,503 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:05,546 INFO L80 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 744 events. 66/744 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3035 event pairs, 0 based on Foata normal form. 1/655 useless extension candidates. Maximal degree in co-relation 832. Up to 26 conditions per place. [2020-10-09 15:37:05,556 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/656 dead transitions. [2020-10-09 15:37:05,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 656 transitions, 1485 flow [2020-10-09 15:37:05,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:05,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:37:05,558 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:37:05,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:37:05,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:37:05,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:05,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:37:05,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:05,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:05,560 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:05,560 INFO L185 Difference]: Start difference. First operand has 649 places, 657 transitions, 1479 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:37:05,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 656 transitions, 1485 flow [2020-10-09 15:37:05,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 656 transitions, 1480 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:05,566 INFO L241 Difference]: Finished difference. Result has 651 places, 656 transitions, 1475 flow [2020-10-09 15:37:05,566 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1475, PETRI_PLACES=651, PETRI_TRANSITIONS=656} [2020-10-09 15:37:05,566 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 9 predicate places. [2020-10-09 15:37:05,566 INFO L481 AbstractCegarLoop]: Abstraction has has 651 places, 656 transitions, 1475 flow [2020-10-09 15:37:05,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:05,566 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:05,566 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:37:05,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 876 mathsat -unsat_core_generation=3 [2020-10-09 15:37:05,767 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:05,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:05,767 INFO L82 PathProgramCache]: Analyzing trace with hash -260025172, now seen corresponding path program 1 times [2020-10-09 15:37:05,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:05,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849254723] [2020-10-09 15:37:05,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 877 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 877 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:06,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:06,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:06,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:37:06,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:06,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:37:06,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849254723] [2020-10-09 15:37:06,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:06,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:06,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500290688] [2020-10-09 15:37:06,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:06,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:06,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:06,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:06,283 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:37:06,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 656 transitions, 1475 flow. Second operand 3 states. [2020-10-09 15:37:06,284 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:06,284 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:37:06,285 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:06,491 INFO L129 PetriNetUnfolder]: 66/737 cut-off events. [2020-10-09 15:37:06,491 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:06,530 INFO L80 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 737 events. 66/737 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2977 event pairs, 0 based on Foata normal form. 1/648 useless extension candidates. Maximal degree in co-relation 828. Up to 26 conditions per place. [2020-10-09 15:37:06,539 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 5 selfloop transitions, 1 changer transitions 0/654 dead transitions. [2020-10-09 15:37:06,540 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 654 transitions, 1478 flow [2020-10-09 15:37:06,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2020-10-09 15:37:06,541 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9556840077071291 [2020-10-09 15:37:06,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2020-10-09 15:37:06,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2020-10-09 15:37:06,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:06,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2020-10-09 15:37:06,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:06,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:06,543 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:06,543 INFO L185 Difference]: Start difference. First operand has 651 places, 656 transitions, 1475 flow. Second operand 3 states and 1984 transitions. [2020-10-09 15:37:06,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 654 transitions, 1478 flow [2020-10-09 15:37:06,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 654 transitions, 1471 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:37:06,549 INFO L241 Difference]: Finished difference. Result has 651 places, 654 transitions, 1464 flow [2020-10-09 15:37:06,549 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=653, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1464, PETRI_PLACES=651, PETRI_TRANSITIONS=654} [2020-10-09 15:37:06,549 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 9 predicate places. [2020-10-09 15:37:06,549 INFO L481 AbstractCegarLoop]: Abstraction has has 651 places, 654 transitions, 1464 flow [2020-10-09 15:37:06,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:06,549 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:06,550 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:37:06,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 877 mathsat -unsat_core_generation=3 [2020-10-09 15:37:06,750 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:06,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:06,751 INFO L82 PathProgramCache]: Analyzing trace with hash -260026195, now seen corresponding path program 1 times [2020-10-09 15:37:06,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:06,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086748747] [2020-10-09 15:37:06,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 878 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 878 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:07,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:07,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:37:07,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:07,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:37:07,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086748747] [2020-10-09 15:37:07,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:07,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:07,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822013235] [2020-10-09 15:37:07,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:07,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:07,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:07,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:07,283 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:07,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 654 transitions, 1464 flow. Second operand 3 states. [2020-10-09 15:37:07,284 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:07,284 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:07,284 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:07,491 INFO L129 PetriNetUnfolder]: 66/735 cut-off events. [2020-10-09 15:37:07,492 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:37:07,531 INFO L80 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 735 events. 66/735 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2961 event pairs, 0 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 828. Up to 26 conditions per place. [2020-10-09 15:37:07,540 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 8 selfloop transitions, 1 changer transitions 0/652 dead transitions. [2020-10-09 15:37:07,540 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 652 transitions, 1477 flow [2020-10-09 15:37:07,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2020-10-09 15:37:07,542 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2020-10-09 15:37:07,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1972 transitions. [2020-10-09 15:37:07,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1972 transitions. [2020-10-09 15:37:07,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:07,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1972 transitions. [2020-10-09 15:37:07,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:07,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:07,544 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:07,544 INFO L185 Difference]: Start difference. First operand has 651 places, 654 transitions, 1464 flow. Second operand 3 states and 1972 transitions. [2020-10-09 15:37:07,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 652 transitions, 1477 flow [2020-10-09 15:37:07,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 652 transitions, 1476 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:07,550 INFO L241 Difference]: Finished difference. Result has 650 places, 652 transitions, 1460 flow [2020-10-09 15:37:07,550 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1460, PETRI_PLACES=650, PETRI_TRANSITIONS=652} [2020-10-09 15:37:07,550 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 8 predicate places. [2020-10-09 15:37:07,550 INFO L481 AbstractCegarLoop]: Abstraction has has 650 places, 652 transitions, 1460 flow [2020-10-09 15:37:07,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:07,550 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:07,550 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:37:07,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 878 mathsat -unsat_core_generation=3 [2020-10-09 15:37:07,751 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash -683231084, now seen corresponding path program 1 times [2020-10-09 15:37:07,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:07,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175338609] [2020-10-09 15:37:07,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 879 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 879 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:08,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:08,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:08,258 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:37:08,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:37:08,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175338609] [2020-10-09 15:37:08,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:08,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:08,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329120412] [2020-10-09 15:37:08,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:08,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:08,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:08,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:08,276 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:37:08,277 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 652 transitions, 1460 flow. Second operand 3 states. [2020-10-09 15:37:08,277 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:08,277 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:37:08,277 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:08,489 INFO L129 PetriNetUnfolder]: 64/740 cut-off events. [2020-10-09 15:37:08,490 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:08,531 INFO L80 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 740 events. 64/740 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3013 event pairs, 0 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 831. Up to 26 conditions per place. [2020-10-09 15:37:08,540 INFO L132 encePairwiseOnDemand]: 689/692 looper letters, 5 selfloop transitions, 2 changer transitions 0/653 dead transitions. [2020-10-09 15:37:08,541 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 653 transitions, 1476 flow [2020-10-09 15:37:08,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1985 transitions. [2020-10-09 15:37:08,542 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561657032755299 [2020-10-09 15:37:08,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1985 transitions. [2020-10-09 15:37:08,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1985 transitions. [2020-10-09 15:37:08,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:08,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1985 transitions. [2020-10-09 15:37:08,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:08,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:08,545 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:08,545 INFO L185 Difference]: Start difference. First operand has 650 places, 652 transitions, 1460 flow. Second operand 3 states and 1985 transitions. [2020-10-09 15:37:08,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 653 transitions, 1476 flow [2020-10-09 15:37:08,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 653 transitions, 1475 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:08,551 INFO L241 Difference]: Finished difference. Result has 653 places, 653 transitions, 1473 flow [2020-10-09 15:37:08,551 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=650, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1473, PETRI_PLACES=653, PETRI_TRANSITIONS=653} [2020-10-09 15:37:08,551 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 11 predicate places. [2020-10-09 15:37:08,551 INFO L481 AbstractCegarLoop]: Abstraction has has 653 places, 653 transitions, 1473 flow [2020-10-09 15:37:08,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:08,551 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:08,551 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:37:08,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 879 mathsat -unsat_core_generation=3 [2020-10-09 15:37:08,752 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:08,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:08,753 INFO L82 PathProgramCache]: Analyzing trace with hash -683232107, now seen corresponding path program 1 times [2020-10-09 15:37:08,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:08,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765207962] [2020-10-09 15:37:08,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 880 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 880 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:09,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:09,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:37:09,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:37:09,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765207962] [2020-10-09 15:37:09,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:09,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:09,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368841877] [2020-10-09 15:37:09,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:09,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:09,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:09,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:09,294 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:09,295 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 653 transitions, 1473 flow. Second operand 3 states. [2020-10-09 15:37:09,295 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:09,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:09,296 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:09,514 INFO L129 PetriNetUnfolder]: 64/741 cut-off events. [2020-10-09 15:37:09,514 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:37:09,555 INFO L80 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 741 events. 64/741 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3021 event pairs, 0 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 839. Up to 26 conditions per place. [2020-10-09 15:37:09,565 INFO L132 encePairwiseOnDemand]: 688/692 looper letters, 9 selfloop transitions, 3 changer transitions 0/654 dead transitions. [2020-10-09 15:37:09,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 654 transitions, 1499 flow [2020-10-09 15:37:09,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1975 transitions. [2020-10-09 15:37:09,566 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9513487475915221 [2020-10-09 15:37:09,567 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1975 transitions. [2020-10-09 15:37:09,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1975 transitions. [2020-10-09 15:37:09,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:09,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1975 transitions. [2020-10-09 15:37:09,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:09,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:09,569 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:09,569 INFO L185 Difference]: Start difference. First operand has 653 places, 653 transitions, 1473 flow. Second operand 3 states and 1975 transitions. [2020-10-09 15:37:09,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 654 transitions, 1499 flow [2020-10-09 15:37:09,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 654 transitions, 1497 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:09,574 INFO L241 Difference]: Finished difference. Result has 656 places, 654 transitions, 1489 flow [2020-10-09 15:37:09,575 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=650, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1489, PETRI_PLACES=656, PETRI_TRANSITIONS=654} [2020-10-09 15:37:09,575 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 14 predicate places. [2020-10-09 15:37:09,575 INFO L481 AbstractCegarLoop]: Abstraction has has 656 places, 654 transitions, 1489 flow [2020-10-09 15:37:09,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:09,575 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:09,575 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:37:09,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 880 mathsat -unsat_core_generation=3 [2020-10-09 15:37:09,776 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:09,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:09,776 INFO L82 PathProgramCache]: Analyzing trace with hash -682278795, now seen corresponding path program 1 times [2020-10-09 15:37:09,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:09,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252328692] [2020-10-09 15:37:09,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 881 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 881 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:10,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:37:10,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:37:10,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:37:10,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252328692] [2020-10-09 15:37:10,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:10,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:10,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761138934] [2020-10-09 15:37:10,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:10,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:10,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:10,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:10,312 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:37:10,313 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 654 transitions, 1489 flow. Second operand 3 states. [2020-10-09 15:37:10,313 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:10,313 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:37:10,313 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:10,527 INFO L129 PetriNetUnfolder]: 63/737 cut-off events. [2020-10-09 15:37:10,527 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:10,567 INFO L80 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 737 events. 63/737 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2997 event pairs, 0 based on Foata normal form. 1/651 useless extension candidates. Maximal degree in co-relation 831. Up to 26 conditions per place. [2020-10-09 15:37:10,577 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/651 dead transitions. [2020-10-09 15:37:10,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 651 transitions, 1484 flow [2020-10-09 15:37:10,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:10,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:37:10,578 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:37:10,578 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:37:10,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:37:10,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:10,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:37:10,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:10,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:10,580 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:10,580 INFO L185 Difference]: Start difference. First operand has 656 places, 654 transitions, 1489 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:37:10,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 651 transitions, 1484 flow [2020-10-09 15:37:10,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 655 places, 651 transitions, 1476 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:37:10,586 INFO L241 Difference]: Finished difference. Result has 655 places, 651 transitions, 1468 flow [2020-10-09 15:37:10,586 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=653, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=650, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1468, PETRI_PLACES=655, PETRI_TRANSITIONS=651} [2020-10-09 15:37:10,586 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 13 predicate places. [2020-10-09 15:37:10,586 INFO L481 AbstractCegarLoop]: Abstraction has has 655 places, 651 transitions, 1468 flow [2020-10-09 15:37:10,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:10,587 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:10,587 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:37:10,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 881 mathsat -unsat_core_generation=3 [2020-10-09 15:37:10,787 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:10,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:10,788 INFO L82 PathProgramCache]: Analyzing trace with hash -682277772, now seen corresponding path program 1 times [2020-10-09 15:37:10,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:10,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372275042] [2020-10-09 15:37:10,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 882 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 882 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:11,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:11,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:11,297 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:37:11,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:37:11,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372275042] [2020-10-09 15:37:11,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:11,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:11,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477368053] [2020-10-09 15:37:11,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:11,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:11,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:11,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:11,333 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:11,334 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 651 transitions, 1468 flow. Second operand 3 states. [2020-10-09 15:37:11,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:11,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:11,334 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:11,546 INFO L129 PetriNetUnfolder]: 63/735 cut-off events. [2020-10-09 15:37:11,546 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:11,587 INFO L80 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 735 events. 63/735 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2979 event pairs, 0 based on Foata normal form. 0/647 useless extension candidates. Maximal degree in co-relation 835. Up to 26 conditions per place. [2020-10-09 15:37:11,596 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 8 selfloop transitions, 1 changer transitions 0/649 dead transitions. [2020-10-09 15:37:11,596 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 649 transitions, 1481 flow [2020-10-09 15:37:11,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2020-10-09 15:37:11,598 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2020-10-09 15:37:11,598 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1972 transitions. [2020-10-09 15:37:11,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1972 transitions. [2020-10-09 15:37:11,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:11,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1972 transitions. [2020-10-09 15:37:11,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:11,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:11,600 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:11,600 INFO L185 Difference]: Start difference. First operand has 655 places, 651 transitions, 1468 flow. Second operand 3 states and 1972 transitions. [2020-10-09 15:37:11,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 649 transitions, 1481 flow [2020-10-09 15:37:11,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 649 transitions, 1480 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:11,606 INFO L241 Difference]: Finished difference. Result has 654 places, 649 transitions, 1464 flow [2020-10-09 15:37:11,606 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1464, PETRI_PLACES=654, PETRI_TRANSITIONS=649} [2020-10-09 15:37:11,606 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 12 predicate places. [2020-10-09 15:37:11,606 INFO L481 AbstractCegarLoop]: Abstraction has has 654 places, 649 transitions, 1464 flow [2020-10-09 15:37:11,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:11,606 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:11,606 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:11,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 882 mathsat -unsat_core_generation=3 [2020-10-09 15:37:11,807 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:11,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:11,807 INFO L82 PathProgramCache]: Analyzing trace with hash -866939810, now seen corresponding path program 1 times [2020-10-09 15:37:11,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:11,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870524473] [2020-10-09 15:37:11,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 883 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 883 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:12,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:37:12,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:37:12,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:37:12,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870524473] [2020-10-09 15:37:12,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:12,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:12,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127029898] [2020-10-09 15:37:12,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:12,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:12,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:12,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:12,339 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:37:12,340 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 649 transitions, 1464 flow. Second operand 3 states. [2020-10-09 15:37:12,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:12,341 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:37:12,341 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:12,572 INFO L129 PetriNetUnfolder]: 62/742 cut-off events. [2020-10-09 15:37:12,572 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:12,605 INFO L80 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 742 events. 62/742 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3041 event pairs, 0 based on Foata normal form. 1/656 useless extension candidates. Maximal degree in co-relation 838. Up to 26 conditions per place. [2020-10-09 15:37:12,614 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/649 dead transitions. [2020-10-09 15:37:12,614 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 649 transitions, 1474 flow [2020-10-09 15:37:12,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:37:12,615 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:37:12,615 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:37:12,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:37:12,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:12,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:37:12,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:12,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:12,617 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:12,617 INFO L185 Difference]: Start difference. First operand has 654 places, 649 transitions, 1464 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:37:12,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 649 transitions, 1474 flow [2020-10-09 15:37:12,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 655 places, 649 transitions, 1473 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:12,623 INFO L241 Difference]: Finished difference. Result has 656 places, 649 transitions, 1468 flow [2020-10-09 15:37:12,623 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=653, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1468, PETRI_PLACES=656, PETRI_TRANSITIONS=649} [2020-10-09 15:37:12,623 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 14 predicate places. [2020-10-09 15:37:12,624 INFO L481 AbstractCegarLoop]: Abstraction has has 656 places, 649 transitions, 1468 flow [2020-10-09 15:37:12,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:12,624 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:12,624 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:12,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 883 mathsat -unsat_core_generation=3 [2020-10-09 15:37:12,824 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:12,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:12,825 INFO L82 PathProgramCache]: Analyzing trace with hash -866938787, now seen corresponding path program 1 times [2020-10-09 15:37:12,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:12,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946935064] [2020-10-09 15:37:12,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 884 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 884 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:13,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:13,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:13,335 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:37:13,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:37:13,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946935064] [2020-10-09 15:37:13,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:13,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:13,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156401038] [2020-10-09 15:37:13,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:13,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:13,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:13,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:13,372 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:13,373 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 649 transitions, 1468 flow. Second operand 3 states. [2020-10-09 15:37:13,373 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:13,373 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:13,373 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:13,590 INFO L129 PetriNetUnfolder]: 60/744 cut-off events. [2020-10-09 15:37:13,590 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:37:13,631 INFO L80 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 744 events. 60/744 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3070 event pairs, 0 based on Foata normal form. 0/657 useless extension candidates. Maximal degree in co-relation 851. Up to 26 conditions per place. [2020-10-09 15:37:13,640 INFO L132 encePairwiseOnDemand]: 688/692 looper letters, 9 selfloop transitions, 3 changer transitions 0/650 dead transitions. [2020-10-09 15:37:13,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 650 transitions, 1494 flow [2020-10-09 15:37:13,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1975 transitions. [2020-10-09 15:37:13,641 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9513487475915221 [2020-10-09 15:37:13,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1975 transitions. [2020-10-09 15:37:13,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1975 transitions. [2020-10-09 15:37:13,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:13,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1975 transitions. [2020-10-09 15:37:13,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:13,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:13,643 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:13,643 INFO L185 Difference]: Start difference. First operand has 656 places, 649 transitions, 1468 flow. Second operand 3 states and 1975 transitions. [2020-10-09 15:37:13,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 650 transitions, 1494 flow [2020-10-09 15:37:13,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 650 transitions, 1493 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:13,649 INFO L241 Difference]: Finished difference. Result has 659 places, 650 transitions, 1485 flow [2020-10-09 15:37:13,649 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=646, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1485, PETRI_PLACES=659, PETRI_TRANSITIONS=650} [2020-10-09 15:37:13,650 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 17 predicate places. [2020-10-09 15:37:13,650 INFO L481 AbstractCegarLoop]: Abstraction has has 659 places, 650 transitions, 1485 flow [2020-10-09 15:37:13,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:13,650 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:13,650 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:13,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 884 mathsat -unsat_core_generation=3 [2020-10-09 15:37:13,851 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:13,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:13,851 INFO L82 PathProgramCache]: Analyzing trace with hash -867892099, now seen corresponding path program 1 times [2020-10-09 15:37:13,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:13,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248683622] [2020-10-09 15:37:13,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 885 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 885 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:14,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:14,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:14,359 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:37:14,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:14,361 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:37:14,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248683622] [2020-10-09 15:37:14,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:14,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:14,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944277353] [2020-10-09 15:37:14,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:14,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:14,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:14,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:14,372 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:37:14,373 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 650 transitions, 1485 flow. Second operand 3 states. [2020-10-09 15:37:14,373 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:14,373 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:37:14,373 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:14,587 INFO L129 PetriNetUnfolder]: 60/737 cut-off events. [2020-10-09 15:37:14,587 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:14,626 INFO L80 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 737 events. 60/737 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3013 event pairs, 0 based on Foata normal form. 1/654 useless extension candidates. Maximal degree in co-relation 837. Up to 26 conditions per place. [2020-10-09 15:37:14,635 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 5 selfloop transitions, 1 changer transitions 0/648 dead transitions. [2020-10-09 15:37:14,635 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 648 transitions, 1487 flow [2020-10-09 15:37:14,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2020-10-09 15:37:14,636 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9556840077071291 [2020-10-09 15:37:14,636 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2020-10-09 15:37:14,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2020-10-09 15:37:14,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:14,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2020-10-09 15:37:14,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:14,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:14,639 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:14,639 INFO L185 Difference]: Start difference. First operand has 659 places, 650 transitions, 1485 flow. Second operand 3 states and 1984 transitions. [2020-10-09 15:37:14,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 648 transitions, 1487 flow [2020-10-09 15:37:14,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 648 transitions, 1479 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:37:14,645 INFO L241 Difference]: Finished difference. Result has 659 places, 648 transitions, 1472 flow [2020-10-09 15:37:14,645 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=659, PETRI_TRANSITIONS=648} [2020-10-09 15:37:14,645 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 17 predicate places. [2020-10-09 15:37:14,646 INFO L481 AbstractCegarLoop]: Abstraction has has 659 places, 648 transitions, 1472 flow [2020-10-09 15:37:14,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:14,646 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:14,646 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:14,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 885 mathsat -unsat_core_generation=3 [2020-10-09 15:37:14,852 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:14,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:14,852 INFO L82 PathProgramCache]: Analyzing trace with hash -867893122, now seen corresponding path program 1 times [2020-10-09 15:37:14,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:14,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469097248] [2020-10-09 15:37:14,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 886 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 886 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:15,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:15,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:37:15,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:15,364 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:37:15,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469097248] [2020-10-09 15:37:15,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:15,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:15,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030886756] [2020-10-09 15:37:15,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:15,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:15,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:15,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:15,399 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:15,399 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 648 transitions, 1472 flow. Second operand 3 states. [2020-10-09 15:37:15,400 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:15,400 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:15,400 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:15,613 INFO L129 PetriNetUnfolder]: 60/735 cut-off events. [2020-10-09 15:37:15,613 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:37:15,653 INFO L80 FinitePrefix]: Finished finitePrefix Result has 886 conditions, 735 events. 60/735 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2997 event pairs, 0 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 841. Up to 26 conditions per place. [2020-10-09 15:37:15,661 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 8 selfloop transitions, 1 changer transitions 0/646 dead transitions. [2020-10-09 15:37:15,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 646 transitions, 1485 flow [2020-10-09 15:37:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:15,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:15,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2020-10-09 15:37:15,663 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2020-10-09 15:37:15,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1972 transitions. [2020-10-09 15:37:15,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1972 transitions. [2020-10-09 15:37:15,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:15,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1972 transitions. [2020-10-09 15:37:15,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:15,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:15,665 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:15,665 INFO L185 Difference]: Start difference. First operand has 659 places, 648 transitions, 1472 flow. Second operand 3 states and 1972 transitions. [2020-10-09 15:37:15,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 646 transitions, 1485 flow [2020-10-09 15:37:15,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 646 transitions, 1484 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:15,671 INFO L241 Difference]: Finished difference. Result has 658 places, 646 transitions, 1468 flow [2020-10-09 15:37:15,671 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1468, PETRI_PLACES=658, PETRI_TRANSITIONS=646} [2020-10-09 15:37:15,671 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 16 predicate places. [2020-10-09 15:37:15,671 INFO L481 AbstractCegarLoop]: Abstraction has has 658 places, 646 transitions, 1468 flow [2020-10-09 15:37:15,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:15,671 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:15,671 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:15,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 886 mathsat -unsat_core_generation=3 [2020-10-09 15:37:15,872 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:15,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:15,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1930938937, now seen corresponding path program 1 times [2020-10-09 15:37:15,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:15,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967358803] [2020-10-09 15:37:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 887 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 887 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:16,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:16,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:37:16,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:37:16,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967358803] [2020-10-09 15:37:16,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:16,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:16,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013553198] [2020-10-09 15:37:16,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:16,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:16,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:16,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:16,431 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:16,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 646 transitions, 1468 flow. Second operand 3 states. [2020-10-09 15:37:16,432 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:16,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:16,432 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:16,658 INFO L129 PetriNetUnfolder]: 59/743 cut-off events. [2020-10-09 15:37:16,659 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:16,701 INFO L80 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 743 events. 59/743 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3067 event pairs, 0 based on Foata normal form. 0/658 useless extension candidates. Maximal degree in co-relation 853. Up to 26 conditions per place. [2020-10-09 15:37:16,709 INFO L132 encePairwiseOnDemand]: 687/692 looper letters, 10 selfloop transitions, 3 changer transitions 0/648 dead transitions. [2020-10-09 15:37:16,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 648 transitions, 1498 flow [2020-10-09 15:37:16,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions. [2020-10-09 15:37:16,711 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523121387283237 [2020-10-09 15:37:16,711 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions. [2020-10-09 15:37:16,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions. [2020-10-09 15:37:16,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:16,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions. [2020-10-09 15:37:16,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:16,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:16,713 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:16,713 INFO L185 Difference]: Start difference. First operand has 658 places, 646 transitions, 1468 flow. Second operand 3 states and 1977 transitions. [2020-10-09 15:37:16,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 648 transitions, 1498 flow [2020-10-09 15:37:16,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 648 transitions, 1497 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:16,719 INFO L241 Difference]: Finished difference. Result has 661 places, 648 transitions, 1491 flow [2020-10-09 15:37:16,719 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1491, PETRI_PLACES=661, PETRI_TRANSITIONS=648} [2020-10-09 15:37:16,719 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 19 predicate places. [2020-10-09 15:37:16,719 INFO L481 AbstractCegarLoop]: Abstraction has has 661 places, 648 transitions, 1491 flow [2020-10-09 15:37:16,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:16,719 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:16,719 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:16,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 887 mathsat -unsat_core_generation=3 [2020-10-09 15:37:16,920 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:16,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:16,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1930939960, now seen corresponding path program 1 times [2020-10-09 15:37:16,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:16,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057736984] [2020-10-09 15:37:16,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 888 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 888 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:17,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:37:17,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:37:17,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:37:17,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057736984] [2020-10-09 15:37:17,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:17,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:17,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52046282] [2020-10-09 15:37:17,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:17,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:17,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:17,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:17,458 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:37:17,459 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 648 transitions, 1491 flow. Second operand 3 states. [2020-10-09 15:37:17,459 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:17,459 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:37:17,459 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:17,677 INFO L129 PetriNetUnfolder]: 57/744 cut-off events. [2020-10-09 15:37:17,677 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:17,717 INFO L80 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 744 events. 57/744 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3086 event pairs, 0 based on Foata normal form. 1/664 useless extension candidates. Maximal degree in co-relation 851. Up to 26 conditions per place. [2020-10-09 15:37:17,726 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/647 dead transitions. [2020-10-09 15:37:17,726 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 647 transitions, 1497 flow [2020-10-09 15:37:17,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:17,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:37:17,727 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:37:17,727 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:37:17,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:37:17,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:17,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:37:17,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:17,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:17,729 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:17,729 INFO L185 Difference]: Start difference. First operand has 661 places, 648 transitions, 1491 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:37:17,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 647 transitions, 1497 flow [2020-10-09 15:37:17,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 647 transitions, 1492 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:17,735 INFO L241 Difference]: Finished difference. Result has 663 places, 647 transitions, 1487 flow [2020-10-09 15:37:17,735 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=646, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1487, PETRI_PLACES=663, PETRI_TRANSITIONS=647} [2020-10-09 15:37:17,735 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 21 predicate places. [2020-10-09 15:37:17,735 INFO L481 AbstractCegarLoop]: Abstraction has has 663 places, 647 transitions, 1487 flow [2020-10-09 15:37:17,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:17,736 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:17,736 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:17,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 888 mathsat -unsat_core_generation=3 [2020-10-09 15:37:17,936 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:17,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:17,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1931892249, now seen corresponding path program 1 times [2020-10-09 15:37:17,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:17,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040072534] [2020-10-09 15:37:17,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 889 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 889 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:18,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:18,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:37:18,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:18,448 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:37:18,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040072534] [2020-10-09 15:37:18,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:18,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:18,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737162087] [2020-10-09 15:37:18,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:18,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:18,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:18,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:18,470 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:37:18,470 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 647 transitions, 1487 flow. Second operand 3 states. [2020-10-09 15:37:18,471 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:18,471 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:37:18,471 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:18,694 INFO L129 PetriNetUnfolder]: 57/737 cut-off events. [2020-10-09 15:37:18,694 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:18,736 INFO L80 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 737 events. 57/737 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3032 event pairs, 0 based on Foata normal form. 1/657 useless extension candidates. Maximal degree in co-relation 847. Up to 26 conditions per place. [2020-10-09 15:37:18,744 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 5 selfloop transitions, 1 changer transitions 0/645 dead transitions. [2020-10-09 15:37:18,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 645 transitions, 1490 flow [2020-10-09 15:37:18,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2020-10-09 15:37:18,746 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9556840077071291 [2020-10-09 15:37:18,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2020-10-09 15:37:18,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2020-10-09 15:37:18,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:18,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2020-10-09 15:37:18,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:18,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:18,748 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:18,748 INFO L185 Difference]: Start difference. First operand has 663 places, 647 transitions, 1487 flow. Second operand 3 states and 1984 transitions. [2020-10-09 15:37:18,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 665 places, 645 transitions, 1490 flow [2020-10-09 15:37:18,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 645 transitions, 1483 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:37:18,754 INFO L241 Difference]: Finished difference. Result has 663 places, 645 transitions, 1476 flow [2020-10-09 15:37:18,754 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=663, PETRI_TRANSITIONS=645} [2020-10-09 15:37:18,754 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 21 predicate places. [2020-10-09 15:37:18,754 INFO L481 AbstractCegarLoop]: Abstraction has has 663 places, 645 transitions, 1476 flow [2020-10-09 15:37:18,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:18,754 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:18,754 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:18,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 889 mathsat -unsat_core_generation=3 [2020-10-09 15:37:18,955 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:18,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:18,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1931893272, now seen corresponding path program 1 times [2020-10-09 15:37:18,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:18,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967732308] [2020-10-09 15:37:18,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 890 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 890 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:19,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:19,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:37:19,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:37:19,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967732308] [2020-10-09 15:37:19,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:19,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:19,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396139754] [2020-10-09 15:37:19,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:19,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:19,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:19,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:19,497 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:19,497 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 645 transitions, 1476 flow. Second operand 3 states. [2020-10-09 15:37:19,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:19,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:19,498 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:19,718 INFO L129 PetriNetUnfolder]: 57/735 cut-off events. [2020-10-09 15:37:19,718 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:37:19,759 INFO L80 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 735 events. 57/735 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3014 event pairs, 0 based on Foata normal form. 0/653 useless extension candidates. Maximal degree in co-relation 847. Up to 26 conditions per place. [2020-10-09 15:37:19,767 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 8 selfloop transitions, 1 changer transitions 0/643 dead transitions. [2020-10-09 15:37:19,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 643 transitions, 1489 flow [2020-10-09 15:37:19,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2020-10-09 15:37:19,769 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2020-10-09 15:37:19,769 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1972 transitions. [2020-10-09 15:37:19,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1972 transitions. [2020-10-09 15:37:19,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:19,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1972 transitions. [2020-10-09 15:37:19,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:19,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:19,771 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:19,772 INFO L185 Difference]: Start difference. First operand has 663 places, 645 transitions, 1476 flow. Second operand 3 states and 1972 transitions. [2020-10-09 15:37:19,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 643 transitions, 1489 flow [2020-10-09 15:37:19,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 643 transitions, 1488 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:19,777 INFO L241 Difference]: Finished difference. Result has 662 places, 643 transitions, 1472 flow [2020-10-09 15:37:19,778 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=642, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=662, PETRI_TRANSITIONS=643} [2020-10-09 15:37:19,778 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 20 predicate places. [2020-10-09 15:37:19,778 INFO L481 AbstractCegarLoop]: Abstraction has has 662 places, 643 transitions, 1472 flow [2020-10-09 15:37:19,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:19,778 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:19,778 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:19,978 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 890 mathsat -unsat_core_generation=3 [2020-10-09 15:37:19,979 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:19,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:19,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2053497294, now seen corresponding path program 1 times [2020-10-09 15:37:19,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:19,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180505230] [2020-10-09 15:37:19,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 891 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 891 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:20,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:20,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:37:20,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:37:20,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180505230] [2020-10-09 15:37:20,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:20,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:20,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15123165] [2020-10-09 15:37:20,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:20,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:20,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:20,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:20,532 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:20,533 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 643 transitions, 1472 flow. Second operand 3 states. [2020-10-09 15:37:20,533 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:20,533 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:20,533 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:20,759 INFO L129 PetriNetUnfolder]: 56/743 cut-off events. [2020-10-09 15:37:20,760 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:20,801 INFO L80 FinitePrefix]: Finished finitePrefix Result has 907 conditions, 743 events. 56/743 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3084 event pairs, 0 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 859. Up to 26 conditions per place. [2020-10-09 15:37:20,810 INFO L132 encePairwiseOnDemand]: 687/692 looper letters, 10 selfloop transitions, 3 changer transitions 0/645 dead transitions. [2020-10-09 15:37:20,810 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 645 transitions, 1502 flow [2020-10-09 15:37:20,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions. [2020-10-09 15:37:20,811 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523121387283237 [2020-10-09 15:37:20,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions. [2020-10-09 15:37:20,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions. [2020-10-09 15:37:20,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:20,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions. [2020-10-09 15:37:20,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:20,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:20,813 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:20,813 INFO L185 Difference]: Start difference. First operand has 662 places, 643 transitions, 1472 flow. Second operand 3 states and 1977 transitions. [2020-10-09 15:37:20,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 645 transitions, 1502 flow [2020-10-09 15:37:20,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 663 places, 645 transitions, 1501 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:20,819 INFO L241 Difference]: Finished difference. Result has 665 places, 645 transitions, 1495 flow [2020-10-09 15:37:20,820 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=661, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1495, PETRI_PLACES=665, PETRI_TRANSITIONS=645} [2020-10-09 15:37:20,820 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 23 predicate places. [2020-10-09 15:37:20,820 INFO L481 AbstractCegarLoop]: Abstraction has has 665 places, 645 transitions, 1495 flow [2020-10-09 15:37:20,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:20,820 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:20,820 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:21,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 891 mathsat -unsat_core_generation=3 [2020-10-09 15:37:21,025 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:21,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:21,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2053498317, now seen corresponding path program 1 times [2020-10-09 15:37:21,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:21,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596128860] [2020-10-09 15:37:21,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 892 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 892 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:21,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:37:21,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:37:21,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:21,543 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:37:21,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596128860] [2020-10-09 15:37:21,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:21,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:21,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341716979] [2020-10-09 15:37:21,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:21,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:21,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:21,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:21,557 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:37:21,558 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 645 transitions, 1495 flow. Second operand 3 states. [2020-10-09 15:37:21,558 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:21,558 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:37:21,558 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:21,783 INFO L129 PetriNetUnfolder]: 54/744 cut-off events. [2020-10-09 15:37:21,783 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:21,825 INFO L80 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 744 events. 54/744 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3103 event pairs, 0 based on Foata normal form. 1/667 useless extension candidates. Maximal degree in co-relation 857. Up to 26 conditions per place. [2020-10-09 15:37:21,833 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/644 dead transitions. [2020-10-09 15:37:21,833 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 644 transitions, 1501 flow [2020-10-09 15:37:21,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:37:21,835 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:37:21,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:37:21,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:37:21,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:21,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:37:21,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:21,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:21,837 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:21,837 INFO L185 Difference]: Start difference. First operand has 665 places, 645 transitions, 1495 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:37:21,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 644 transitions, 1501 flow [2020-10-09 15:37:21,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 644 transitions, 1496 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:21,843 INFO L241 Difference]: Finished difference. Result has 667 places, 644 transitions, 1491 flow [2020-10-09 15:37:21,843 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1491, PETRI_PLACES=667, PETRI_TRANSITIONS=644} [2020-10-09 15:37:21,843 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 25 predicate places. [2020-10-09 15:37:21,843 INFO L481 AbstractCegarLoop]: Abstraction has has 667 places, 644 transitions, 1491 flow [2020-10-09 15:37:21,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:21,844 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:21,844 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:22,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 892 mathsat -unsat_core_generation=3 [2020-10-09 15:37:22,048 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:22,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:22,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2054450606, now seen corresponding path program 1 times [2020-10-09 15:37:22,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:22,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195870896] [2020-10-09 15:37:22,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 893 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 893 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:22,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:22,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:37:22,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:37:22,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195870896] [2020-10-09 15:37:22,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:22,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:22,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641812691] [2020-10-09 15:37:22,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:22,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:22,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:22,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:22,573 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:37:22,574 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 644 transitions, 1491 flow. Second operand 3 states. [2020-10-09 15:37:22,574 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:22,574 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:37:22,574 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:22,796 INFO L129 PetriNetUnfolder]: 54/737 cut-off events. [2020-10-09 15:37:22,796 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:22,837 INFO L80 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 737 events. 54/737 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3048 event pairs, 0 based on Foata normal form. 1/660 useless extension candidates. Maximal degree in co-relation 853. Up to 26 conditions per place. [2020-10-09 15:37:22,845 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 5 selfloop transitions, 1 changer transitions 0/642 dead transitions. [2020-10-09 15:37:22,845 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 669 places, 642 transitions, 1494 flow [2020-10-09 15:37:22,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:22,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2020-10-09 15:37:22,846 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9556840077071291 [2020-10-09 15:37:22,846 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2020-10-09 15:37:22,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2020-10-09 15:37:22,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:22,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2020-10-09 15:37:22,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:22,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:22,848 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:22,848 INFO L185 Difference]: Start difference. First operand has 667 places, 644 transitions, 1491 flow. Second operand 3 states and 1984 transitions. [2020-10-09 15:37:22,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 669 places, 642 transitions, 1494 flow [2020-10-09 15:37:22,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 642 transitions, 1487 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:37:22,855 INFO L241 Difference]: Finished difference. Result has 667 places, 642 transitions, 1480 flow [2020-10-09 15:37:22,855 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=641, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1480, PETRI_PLACES=667, PETRI_TRANSITIONS=642} [2020-10-09 15:37:22,855 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 25 predicate places. [2020-10-09 15:37:22,855 INFO L481 AbstractCegarLoop]: Abstraction has has 667 places, 642 transitions, 1480 flow [2020-10-09 15:37:22,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:22,855 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:22,855 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:23,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 893 mathsat -unsat_core_generation=3 [2020-10-09 15:37:23,056 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:23,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:23,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2054451629, now seen corresponding path program 1 times [2020-10-09 15:37:23,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:23,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856059987] [2020-10-09 15:37:23,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 894 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 894 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:23,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:23,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:37:23,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:37:23,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856059987] [2020-10-09 15:37:23,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:23,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:23,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367085791] [2020-10-09 15:37:23,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:23,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:23,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:23,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:23,599 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:23,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 642 transitions, 1480 flow. Second operand 3 states. [2020-10-09 15:37:23,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:23,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:23,600 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:23,825 INFO L129 PetriNetUnfolder]: 54/735 cut-off events. [2020-10-09 15:37:23,825 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:37:23,865 INFO L80 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 735 events. 54/735 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3034 event pairs, 0 based on Foata normal form. 0/656 useless extension candidates. Maximal degree in co-relation 853. Up to 26 conditions per place. [2020-10-09 15:37:23,873 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 8 selfloop transitions, 1 changer transitions 0/640 dead transitions. [2020-10-09 15:37:23,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 640 transitions, 1493 flow [2020-10-09 15:37:23,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2020-10-09 15:37:23,874 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2020-10-09 15:37:23,874 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1972 transitions. [2020-10-09 15:37:23,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1972 transitions. [2020-10-09 15:37:23,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:23,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1972 transitions. [2020-10-09 15:37:23,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:23,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:23,877 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:23,877 INFO L185 Difference]: Start difference. First operand has 667 places, 642 transitions, 1480 flow. Second operand 3 states and 1972 transitions. [2020-10-09 15:37:23,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 640 transitions, 1493 flow [2020-10-09 15:37:23,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 640 transitions, 1492 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:23,883 INFO L241 Difference]: Finished difference. Result has 666 places, 640 transitions, 1476 flow [2020-10-09 15:37:23,883 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=666, PETRI_TRANSITIONS=640} [2020-10-09 15:37:23,884 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 24 predicate places. [2020-10-09 15:37:23,884 INFO L481 AbstractCegarLoop]: Abstraction has has 666 places, 640 transitions, 1476 flow [2020-10-09 15:37:23,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:23,884 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:23,884 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:24,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 894 mathsat -unsat_core_generation=3 [2020-10-09 15:37:24,085 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:24,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:24,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1205087038, now seen corresponding path program 1 times [2020-10-09 15:37:24,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:24,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545841005] [2020-10-09 15:37:24,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 895 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 895 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:24,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:24,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:37:24,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:24,619 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:37:24,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545841005] [2020-10-09 15:37:24,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:24,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:24,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433987759] [2020-10-09 15:37:24,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:24,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:24,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:24,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:24,629 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:37:24,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 640 transitions, 1476 flow. Second operand 3 states. [2020-10-09 15:37:24,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:24,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:37:24,630 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:24,845 INFO L129 PetriNetUnfolder]: 52/740 cut-off events. [2020-10-09 15:37:24,845 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:24,885 INFO L80 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 740 events. 52/740 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3082 event pairs, 0 based on Foata normal form. 0/662 useless extension candidates. Maximal degree in co-relation 856. Up to 26 conditions per place. [2020-10-09 15:37:24,893 INFO L132 encePairwiseOnDemand]: 689/692 looper letters, 5 selfloop transitions, 2 changer transitions 0/641 dead transitions. [2020-10-09 15:37:24,893 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 641 transitions, 1492 flow [2020-10-09 15:37:24,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1985 transitions. [2020-10-09 15:37:24,894 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561657032755299 [2020-10-09 15:37:24,894 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1985 transitions. [2020-10-09 15:37:24,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1985 transitions. [2020-10-09 15:37:24,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:24,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1985 transitions. [2020-10-09 15:37:24,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:24,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:24,896 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:24,896 INFO L185 Difference]: Start difference. First operand has 666 places, 640 transitions, 1476 flow. Second operand 3 states and 1985 transitions. [2020-10-09 15:37:24,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 641 transitions, 1492 flow [2020-10-09 15:37:24,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 641 transitions, 1491 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:24,902 INFO L241 Difference]: Finished difference. Result has 669 places, 641 transitions, 1489 flow [2020-10-09 15:37:24,903 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=665, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1489, PETRI_PLACES=669, PETRI_TRANSITIONS=641} [2020-10-09 15:37:24,903 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 27 predicate places. [2020-10-09 15:37:24,903 INFO L481 AbstractCegarLoop]: Abstraction has has 669 places, 641 transitions, 1489 flow [2020-10-09 15:37:24,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:24,903 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:24,903 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:25,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 895 mathsat -unsat_core_generation=3 [2020-10-09 15:37:25,104 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:25,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:25,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1205086015, now seen corresponding path program 1 times [2020-10-09 15:37:25,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:25,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984308759] [2020-10-09 15:37:25,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 896 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 896 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:25,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:25,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:37:25,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:37:25,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984308759] [2020-10-09 15:37:25,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:25,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:25,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599319667] [2020-10-09 15:37:25,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:25,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:25,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:25,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:25,605 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:25,605 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 669 places, 641 transitions, 1489 flow. Second operand 3 states. [2020-10-09 15:37:25,606 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:25,606 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:25,606 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:25,839 INFO L129 PetriNetUnfolder]: 52/741 cut-off events. [2020-10-09 15:37:25,839 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:37:25,883 INFO L80 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 741 events. 52/741 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3089 event pairs, 0 based on Foata normal form. 0/663 useless extension candidates. Maximal degree in co-relation 864. Up to 26 conditions per place. [2020-10-09 15:37:25,891 INFO L132 encePairwiseOnDemand]: 688/692 looper letters, 9 selfloop transitions, 3 changer transitions 0/642 dead transitions. [2020-10-09 15:37:25,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 642 transitions, 1515 flow [2020-10-09 15:37:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1975 transitions. [2020-10-09 15:37:25,893 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9513487475915221 [2020-10-09 15:37:25,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1975 transitions. [2020-10-09 15:37:25,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1975 transitions. [2020-10-09 15:37:25,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:25,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1975 transitions. [2020-10-09 15:37:25,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:25,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:25,895 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:25,895 INFO L185 Difference]: Start difference. First operand has 669 places, 641 transitions, 1489 flow. Second operand 3 states and 1975 transitions. [2020-10-09 15:37:25,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 671 places, 642 transitions, 1515 flow [2020-10-09 15:37:25,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 670 places, 642 transitions, 1513 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:25,901 INFO L241 Difference]: Finished difference. Result has 672 places, 642 transitions, 1505 flow [2020-10-09 15:37:25,901 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=668, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1505, PETRI_PLACES=672, PETRI_TRANSITIONS=642} [2020-10-09 15:37:25,902 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 30 predicate places. [2020-10-09 15:37:25,902 INFO L481 AbstractCegarLoop]: Abstraction has has 672 places, 642 transitions, 1505 flow [2020-10-09 15:37:25,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:25,902 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:25,902 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:26,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 896 mathsat -unsat_core_generation=3 [2020-10-09 15:37:26,103 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:26,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1206040350, now seen corresponding path program 1 times [2020-10-09 15:37:26,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:26,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549030750] [2020-10-09 15:37:26,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 897 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 897 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:26,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:26,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:37:26,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:37:26,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549030750] [2020-10-09 15:37:26,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:26,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:26,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654876066] [2020-10-09 15:37:26,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:26,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:26,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:26,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:26,660 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:26,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 672 places, 642 transitions, 1505 flow. Second operand 3 states. [2020-10-09 15:37:26,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:26,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:26,661 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:26,908 INFO L129 PetriNetUnfolder]: 51/738 cut-off events. [2020-10-09 15:37:26,908 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2020-10-09 15:37:26,952 INFO L80 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 738 events. 51/738 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3074 event pairs, 0 based on Foata normal form. 2/664 useless extension candidates. Maximal degree in co-relation 863. Up to 26 conditions per place. [2020-10-09 15:37:26,960 INFO L132 encePairwiseOnDemand]: 689/692 looper letters, 9 selfloop transitions, 1 changer transitions 0/640 dead transitions. [2020-10-09 15:37:26,960 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 674 places, 640 transitions, 1513 flow [2020-10-09 15:37:26,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:26,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:26,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1974 transitions. [2020-10-09 15:37:26,961 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508670520231214 [2020-10-09 15:37:26,961 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1974 transitions. [2020-10-09 15:37:26,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1974 transitions. [2020-10-09 15:37:26,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:26,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1974 transitions. [2020-10-09 15:37:26,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:26,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:26,963 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:26,963 INFO L185 Difference]: Start difference. First operand has 672 places, 642 transitions, 1505 flow. Second operand 3 states and 1974 transitions. [2020-10-09 15:37:26,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 674 places, 640 transitions, 1513 flow [2020-10-09 15:37:26,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 673 places, 640 transitions, 1512 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:26,970 INFO L241 Difference]: Finished difference. Result has 673 places, 640 transitions, 1494 flow [2020-10-09 15:37:26,970 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=671, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1494, PETRI_PLACES=673, PETRI_TRANSITIONS=640} [2020-10-09 15:37:26,970 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 31 predicate places. [2020-10-09 15:37:26,971 INFO L481 AbstractCegarLoop]: Abstraction has has 673 places, 640 transitions, 1494 flow [2020-10-09 15:37:26,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:26,971 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:26,971 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:27,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 897 mathsat -unsat_core_generation=3 [2020-10-09 15:37:27,172 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:27,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:27,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1206039327, now seen corresponding path program 1 times [2020-10-09 15:37:27,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:27,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044031466] [2020-10-09 15:37:27,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 898 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 898 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:27,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:37:27,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:37:27,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:27,697 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:37:27,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044031466] [2020-10-09 15:37:27,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:27,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:27,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977893905] [2020-10-09 15:37:27,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:27,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:27,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:27,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:27,718 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:37:27,719 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 673 places, 640 transitions, 1494 flow. Second operand 3 states. [2020-10-09 15:37:27,719 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:27,720 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:37:27,720 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:27,950 INFO L129 PetriNetUnfolder]: 51/735 cut-off events. [2020-10-09 15:37:27,950 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:37:27,994 INFO L80 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 735 events. 51/735 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3047 event pairs, 0 based on Foata normal form. 1/661 useless extension candidates. Maximal degree in co-relation 857. Up to 26 conditions per place. [2020-10-09 15:37:28,002 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/637 dead transitions. [2020-10-09 15:37:28,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 637 transitions, 1493 flow [2020-10-09 15:37:28,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:37:28,004 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:37:28,004 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:37:28,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:37:28,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:28,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:37:28,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:28,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:28,006 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:28,006 INFO L185 Difference]: Start difference. First operand has 673 places, 640 transitions, 1494 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:37:28,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 637 transitions, 1493 flow [2020-10-09 15:37:28,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 670 places, 637 transitions, 1488 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:37:28,012 INFO L241 Difference]: Finished difference. Result has 670 places, 637 transitions, 1480 flow [2020-10-09 15:37:28,013 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=668, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1480, PETRI_PLACES=670, PETRI_TRANSITIONS=637} [2020-10-09 15:37:28,013 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 28 predicate places. [2020-10-09 15:37:28,013 INFO L481 AbstractCegarLoop]: Abstraction has has 670 places, 637 transitions, 1480 flow [2020-10-09 15:37:28,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:28,013 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:28,013 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:28,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 898 mathsat -unsat_core_generation=3 [2020-10-09 15:37:28,214 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:28,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:28,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1919584811, now seen corresponding path program 1 times [2020-10-09 15:37:28,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:28,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288276700] [2020-10-09 15:37:28,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 899 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 899 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:28,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:28,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:37:28,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:37:28,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288276700] [2020-10-09 15:37:28,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:28,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:28,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385751229] [2020-10-09 15:37:28,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:28,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:28,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:28,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:28,770 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:37:28,771 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 670 places, 637 transitions, 1480 flow. Second operand 3 states. [2020-10-09 15:37:28,771 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:28,771 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:37:28,771 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:29,001 INFO L129 PetriNetUnfolder]: 49/740 cut-off events. [2020-10-09 15:37:29,001 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:29,042 INFO L80 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 740 events. 49/740 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3099 event pairs, 0 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 865. Up to 26 conditions per place. [2020-10-09 15:37:29,049 INFO L132 encePairwiseOnDemand]: 689/692 looper letters, 5 selfloop transitions, 2 changer transitions 0/638 dead transitions. [2020-10-09 15:37:29,050 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 672 places, 638 transitions, 1496 flow [2020-10-09 15:37:29,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:29,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1985 transitions. [2020-10-09 15:37:29,051 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561657032755299 [2020-10-09 15:37:29,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1985 transitions. [2020-10-09 15:37:29,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1985 transitions. [2020-10-09 15:37:29,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:29,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1985 transitions. [2020-10-09 15:37:29,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:29,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:29,053 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:29,053 INFO L185 Difference]: Start difference. First operand has 670 places, 637 transitions, 1480 flow. Second operand 3 states and 1985 transitions. [2020-10-09 15:37:29,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 672 places, 638 transitions, 1496 flow [2020-10-09 15:37:29,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 671 places, 638 transitions, 1495 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:29,059 INFO L241 Difference]: Finished difference. Result has 673 places, 638 transitions, 1493 flow [2020-10-09 15:37:29,059 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1479, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1493, PETRI_PLACES=673, PETRI_TRANSITIONS=638} [2020-10-09 15:37:29,059 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 31 predicate places. [2020-10-09 15:37:29,060 INFO L481 AbstractCegarLoop]: Abstraction has has 673 places, 638 transitions, 1493 flow [2020-10-09 15:37:29,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:29,060 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:29,060 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:29,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 899 mathsat -unsat_core_generation=3 [2020-10-09 15:37:29,260 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:29,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:29,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1919583788, now seen corresponding path program 1 times [2020-10-09 15:37:29,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:29,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026686435] [2020-10-09 15:37:29,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 900 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 900 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:29,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:29,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:37:29,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:29,778 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:37:29,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026686435] [2020-10-09 15:37:29,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:29,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:29,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591205244] [2020-10-09 15:37:29,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:29,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:29,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:29,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:29,812 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:29,813 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 673 places, 638 transitions, 1493 flow. Second operand 3 states. [2020-10-09 15:37:29,813 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:29,814 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:29,814 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:30,045 INFO L129 PetriNetUnfolder]: 49/741 cut-off events. [2020-10-09 15:37:30,046 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:37:30,088 INFO L80 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 741 events. 49/741 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3107 event pairs, 0 based on Foata normal form. 0/666 useless extension candidates. Maximal degree in co-relation 871. Up to 26 conditions per place. [2020-10-09 15:37:30,095 INFO L132 encePairwiseOnDemand]: 688/692 looper letters, 9 selfloop transitions, 3 changer transitions 0/639 dead transitions. [2020-10-09 15:37:30,095 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 675 places, 639 transitions, 1519 flow [2020-10-09 15:37:30,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1975 transitions. [2020-10-09 15:37:30,097 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9513487475915221 [2020-10-09 15:37:30,097 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1975 transitions. [2020-10-09 15:37:30,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1975 transitions. [2020-10-09 15:37:30,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:30,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1975 transitions. [2020-10-09 15:37:30,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:30,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:30,099 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:30,099 INFO L185 Difference]: Start difference. First operand has 673 places, 638 transitions, 1493 flow. Second operand 3 states and 1975 transitions. [2020-10-09 15:37:30,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 675 places, 639 transitions, 1519 flow [2020-10-09 15:37:30,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 674 places, 639 transitions, 1517 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:30,105 INFO L241 Difference]: Finished difference. Result has 676 places, 639 transitions, 1509 flow [2020-10-09 15:37:30,105 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1491, PETRI_DIFFERENCE_MINUEND_PLACES=672, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1509, PETRI_PLACES=676, PETRI_TRANSITIONS=639} [2020-10-09 15:37:30,105 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 34 predicate places. [2020-10-09 15:37:30,105 INFO L481 AbstractCegarLoop]: Abstraction has has 676 places, 639 transitions, 1509 flow [2020-10-09 15:37:30,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:30,105 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:30,105 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:30,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 900 mathsat -unsat_core_generation=3 [2020-10-09 15:37:30,306 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:30,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:30,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1920538123, now seen corresponding path program 1 times [2020-10-09 15:37:30,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:30,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654169232] [2020-10-09 15:37:30,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 901 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 901 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:30,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:30,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:37:30,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:37:30,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654169232] [2020-10-09 15:37:30,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:30,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:30,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393771812] [2020-10-09 15:37:30,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:30,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:30,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:30,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:30,846 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:30,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 676 places, 639 transitions, 1509 flow. Second operand 3 states. [2020-10-09 15:37:30,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:30,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:30,847 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:31,079 INFO L129 PetriNetUnfolder]: 48/738 cut-off events. [2020-10-09 15:37:31,079 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2020-10-09 15:37:31,120 INFO L80 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 738 events. 48/738 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3090 event pairs, 0 based on Foata normal form. 2/667 useless extension candidates. Maximal degree in co-relation 870. Up to 26 conditions per place. [2020-10-09 15:37:31,127 INFO L132 encePairwiseOnDemand]: 689/692 looper letters, 9 selfloop transitions, 1 changer transitions 0/637 dead transitions. [2020-10-09 15:37:31,127 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 678 places, 637 transitions, 1517 flow [2020-10-09 15:37:31,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1974 transitions. [2020-10-09 15:37:31,129 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508670520231214 [2020-10-09 15:37:31,129 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1974 transitions. [2020-10-09 15:37:31,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1974 transitions. [2020-10-09 15:37:31,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:31,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1974 transitions. [2020-10-09 15:37:31,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:31,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:31,131 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:31,131 INFO L185 Difference]: Start difference. First operand has 676 places, 639 transitions, 1509 flow. Second operand 3 states and 1974 transitions. [2020-10-09 15:37:31,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 678 places, 637 transitions, 1517 flow [2020-10-09 15:37:31,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 677 places, 637 transitions, 1516 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:31,137 INFO L241 Difference]: Finished difference. Result has 677 places, 637 transitions, 1498 flow [2020-10-09 15:37:31,137 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=675, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1498, PETRI_PLACES=677, PETRI_TRANSITIONS=637} [2020-10-09 15:37:31,138 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 35 predicate places. [2020-10-09 15:37:31,138 INFO L481 AbstractCegarLoop]: Abstraction has has 677 places, 637 transitions, 1498 flow [2020-10-09 15:37:31,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:31,138 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:31,138 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:31,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 901 mathsat -unsat_core_generation=3 [2020-10-09 15:37:31,339 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:31,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:31,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1920537100, now seen corresponding path program 1 times [2020-10-09 15:37:31,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:31,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163986096] [2020-10-09 15:37:31,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 902 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 902 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:31,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:37:31,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:31,857 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:37:31,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:37:31,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163986096] [2020-10-09 15:37:31,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:31,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:31,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009714980] [2020-10-09 15:37:31,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:31,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:31,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:31,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:31,883 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:37:31,884 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 637 transitions, 1498 flow. Second operand 3 states. [2020-10-09 15:37:31,884 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:31,884 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:37:31,884 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:32,107 INFO L129 PetriNetUnfolder]: 48/735 cut-off events. [2020-10-09 15:37:32,107 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:37:32,148 INFO L80 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 735 events. 48/735 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3065 event pairs, 0 based on Foata normal form. 1/664 useless extension candidates. Maximal degree in co-relation 864. Up to 26 conditions per place. [2020-10-09 15:37:32,155 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/634 dead transitions. [2020-10-09 15:37:32,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 677 places, 634 transitions, 1497 flow [2020-10-09 15:37:32,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:32,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:37:32,156 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:37:32,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:37:32,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:37:32,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:32,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:37:32,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:32,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:32,159 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:32,159 INFO L185 Difference]: Start difference. First operand has 677 places, 637 transitions, 1498 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:37:32,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 677 places, 634 transitions, 1497 flow [2020-10-09 15:37:32,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 674 places, 634 transitions, 1492 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:37:32,165 INFO L241 Difference]: Finished difference. Result has 674 places, 634 transitions, 1484 flow [2020-10-09 15:37:32,166 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=672, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1484, PETRI_PLACES=674, PETRI_TRANSITIONS=634} [2020-10-09 15:37:32,166 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 32 predicate places. [2020-10-09 15:37:32,166 INFO L481 AbstractCegarLoop]: Abstraction has has 674 places, 634 transitions, 1484 flow [2020-10-09 15:37:32,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:32,166 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:32,166 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:32,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 902 mathsat -unsat_core_generation=3 [2020-10-09 15:37:32,367 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:32,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:32,367 INFO L82 PathProgramCache]: Analyzing trace with hash 746848922, now seen corresponding path program 1 times [2020-10-09 15:37:32,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:32,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052936655] [2020-10-09 15:37:32,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 903 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 903 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:32,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:32,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:37:32,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:37:32,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052936655] [2020-10-09 15:37:32,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:32,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:32,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274108024] [2020-10-09 15:37:32,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:32,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:32,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:32,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:32,921 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:32,922 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 674 places, 634 transitions, 1484 flow. Second operand 3 states. [2020-10-09 15:37:32,922 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:32,922 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:32,922 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:33,168 INFO L129 PetriNetUnfolder]: 47/743 cut-off events. [2020-10-09 15:37:33,168 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:33,212 INFO L80 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 743 events. 47/743 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3136 event pairs, 0 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 881. Up to 26 conditions per place. [2020-10-09 15:37:33,219 INFO L132 encePairwiseOnDemand]: 687/692 looper letters, 10 selfloop transitions, 3 changer transitions 0/636 dead transitions. [2020-10-09 15:37:33,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 636 transitions, 1514 flow [2020-10-09 15:37:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions. [2020-10-09 15:37:33,221 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523121387283237 [2020-10-09 15:37:33,221 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions. [2020-10-09 15:37:33,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions. [2020-10-09 15:37:33,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:33,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions. [2020-10-09 15:37:33,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:33,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:33,223 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:33,223 INFO L185 Difference]: Start difference. First operand has 674 places, 634 transitions, 1484 flow. Second operand 3 states and 1977 transitions. [2020-10-09 15:37:33,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 636 transitions, 1514 flow [2020-10-09 15:37:33,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 636 transitions, 1513 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:33,230 INFO L241 Difference]: Finished difference. Result has 677 places, 636 transitions, 1507 flow [2020-10-09 15:37:33,230 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=673, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1507, PETRI_PLACES=677, PETRI_TRANSITIONS=636} [2020-10-09 15:37:33,230 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 35 predicate places. [2020-10-09 15:37:33,230 INFO L481 AbstractCegarLoop]: Abstraction has has 677 places, 636 transitions, 1507 flow [2020-10-09 15:37:33,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:33,230 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:33,230 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:33,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 903 mathsat -unsat_core_generation=3 [2020-10-09 15:37:33,431 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:33,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:33,432 INFO L82 PathProgramCache]: Analyzing trace with hash 746849945, now seen corresponding path program 1 times [2020-10-09 15:37:33,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:33,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138192255] [2020-10-09 15:37:33,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 904 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 904 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:33,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:33,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:33,958 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:37:33,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:33,960 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:37:33,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138192255] [2020-10-09 15:37:33,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:33,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:33,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656000571] [2020-10-09 15:37:33,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:33,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:33,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:33,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:33,979 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:37:33,980 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 636 transitions, 1507 flow. Second operand 3 states. [2020-10-09 15:37:33,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:33,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:37:33,981 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:34,225 INFO L129 PetriNetUnfolder]: 46/741 cut-off events. [2020-10-09 15:37:34,225 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:34,269 INFO L80 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 741 events. 46/741 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3126 event pairs, 0 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 876. Up to 26 conditions per place. [2020-10-09 15:37:34,276 INFO L132 encePairwiseOnDemand]: 689/692 looper letters, 5 selfloop transitions, 2 changer transitions 0/636 dead transitions. [2020-10-09 15:37:34,276 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 636 transitions, 1519 flow [2020-10-09 15:37:34,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:34,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1985 transitions. [2020-10-09 15:37:34,277 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561657032755299 [2020-10-09 15:37:34,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1985 transitions. [2020-10-09 15:37:34,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1985 transitions. [2020-10-09 15:37:34,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:34,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1985 transitions. [2020-10-09 15:37:34,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:34,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:34,280 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:34,280 INFO L185 Difference]: Start difference. First operand has 677 places, 636 transitions, 1507 flow. Second operand 3 states and 1985 transitions. [2020-10-09 15:37:34,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 679 places, 636 transitions, 1519 flow [2020-10-09 15:37:34,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 636 transitions, 1514 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:34,287 INFO L241 Difference]: Finished difference. Result has 680 places, 636 transitions, 1512 flow [2020-10-09 15:37:34,287 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1512, PETRI_PLACES=680, PETRI_TRANSITIONS=636} [2020-10-09 15:37:34,287 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 38 predicate places. [2020-10-09 15:37:34,287 INFO L481 AbstractCegarLoop]: Abstraction has has 680 places, 636 transitions, 1512 flow [2020-10-09 15:37:34,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:34,287 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:34,287 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:34,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 904 mathsat -unsat_core_generation=3 [2020-10-09 15:37:34,488 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:34,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:34,489 INFO L82 PathProgramCache]: Analyzing trace with hash 747802234, now seen corresponding path program 1 times [2020-10-09 15:37:34,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:34,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354349440] [2020-10-09 15:37:34,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 905 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 905 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:35,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:37:35,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:37:35,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:35,020 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:37:35,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354349440] [2020-10-09 15:37:35,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:35,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:35,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113381018] [2020-10-09 15:37:35,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:35,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:35,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:35,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:35,041 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:37:35,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 636 transitions, 1512 flow. Second operand 3 states. [2020-10-09 15:37:35,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:35,042 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:37:35,042 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:35,273 INFO L129 PetriNetUnfolder]: 45/737 cut-off events. [2020-10-09 15:37:35,273 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:37:35,315 INFO L80 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 737 events. 45/737 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3101 event pairs, 0 based on Foata normal form. 1/669 useless extension candidates. Maximal degree in co-relation 872. Up to 26 conditions per place. [2020-10-09 15:37:35,321 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/633 dead transitions. [2020-10-09 15:37:35,321 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 633 transitions, 1507 flow [2020-10-09 15:37:35,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:37:35,323 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:37:35,323 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:37:35,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:37:35,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:35,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:37:35,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:35,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:35,325 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:35,325 INFO L185 Difference]: Start difference. First operand has 680 places, 636 transitions, 1512 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:37:35,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 633 transitions, 1507 flow [2020-10-09 15:37:35,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 633 transitions, 1500 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:37:35,331 INFO L241 Difference]: Finished difference. Result has 679 places, 633 transitions, 1492 flow [2020-10-09 15:37:35,331 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1492, PETRI_PLACES=679, PETRI_TRANSITIONS=633} [2020-10-09 15:37:35,331 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 37 predicate places. [2020-10-09 15:37:35,332 INFO L481 AbstractCegarLoop]: Abstraction has has 679 places, 633 transitions, 1492 flow [2020-10-09 15:37:35,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:35,332 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:35,332 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:35,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 905 mathsat -unsat_core_generation=3 [2020-10-09 15:37:35,532 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:35,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:35,533 INFO L82 PathProgramCache]: Analyzing trace with hash 747803257, now seen corresponding path program 1 times [2020-10-09 15:37:35,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:35,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471904880] [2020-10-09 15:37:35,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 906 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 906 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:36,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:36,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:37:36,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:37:36,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471904880] [2020-10-09 15:37:36,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:36,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:36,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482709441] [2020-10-09 15:37:36,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:36,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:36,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:36,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:36,091 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:36,092 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 633 transitions, 1492 flow. Second operand 3 states. [2020-10-09 15:37:36,092 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:36,092 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:36,092 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:36,323 INFO L129 PetriNetUnfolder]: 45/735 cut-off events. [2020-10-09 15:37:36,323 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:36,364 INFO L80 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 735 events. 45/735 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3083 event pairs, 0 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 874. Up to 26 conditions per place. [2020-10-09 15:37:36,370 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 8 selfloop transitions, 1 changer transitions 0/631 dead transitions. [2020-10-09 15:37:36,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 631 transitions, 1505 flow [2020-10-09 15:37:36,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2020-10-09 15:37:36,372 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2020-10-09 15:37:36,372 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1972 transitions. [2020-10-09 15:37:36,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1972 transitions. [2020-10-09 15:37:36,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:36,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1972 transitions. [2020-10-09 15:37:36,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:36,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:36,374 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:36,374 INFO L185 Difference]: Start difference. First operand has 679 places, 633 transitions, 1492 flow. Second operand 3 states and 1972 transitions. [2020-10-09 15:37:36,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 679 places, 631 transitions, 1505 flow [2020-10-09 15:37:36,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 631 transitions, 1504 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:36,380 INFO L241 Difference]: Finished difference. Result has 678 places, 631 transitions, 1488 flow [2020-10-09 15:37:36,380 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1488, PETRI_PLACES=678, PETRI_TRANSITIONS=631} [2020-10-09 15:37:36,380 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 36 predicate places. [2020-10-09 15:37:36,381 INFO L481 AbstractCegarLoop]: Abstraction has has 678 places, 631 transitions, 1488 flow [2020-10-09 15:37:36,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:36,381 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:36,381 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:36,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 906 mathsat -unsat_core_generation=3 [2020-10-09 15:37:36,582 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:36,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:36,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1564956168, now seen corresponding path program 1 times [2020-10-09 15:37:36,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:36,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030260604] [2020-10-09 15:37:36,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 907 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 907 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:37,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:37,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:37:37,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:37,126 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:37:37,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030260604] [2020-10-09 15:37:37,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:37,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:37,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439507260] [2020-10-09 15:37:37,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:37,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:37,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:37,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:37,137 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:37:37,138 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 631 transitions, 1488 flow. Second operand 3 states. [2020-10-09 15:37:37,139 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:37,139 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:37:37,139 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:37,370 INFO L129 PetriNetUnfolder]: 43/740 cut-off events. [2020-10-09 15:37:37,370 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:37,412 INFO L80 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 740 events. 43/740 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3134 event pairs, 0 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 877. Up to 26 conditions per place. [2020-10-09 15:37:37,418 INFO L132 encePairwiseOnDemand]: 689/692 looper letters, 5 selfloop transitions, 2 changer transitions 0/632 dead transitions. [2020-10-09 15:37:37,418 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 632 transitions, 1504 flow [2020-10-09 15:37:37,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:37,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1985 transitions. [2020-10-09 15:37:37,420 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561657032755299 [2020-10-09 15:37:37,420 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1985 transitions. [2020-10-09 15:37:37,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1985 transitions. [2020-10-09 15:37:37,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:37,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1985 transitions. [2020-10-09 15:37:37,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:37,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:37,422 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:37,422 INFO L185 Difference]: Start difference. First operand has 678 places, 631 transitions, 1488 flow. Second operand 3 states and 1985 transitions. [2020-10-09 15:37:37,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 632 transitions, 1504 flow [2020-10-09 15:37:37,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 632 transitions, 1503 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:37,428 INFO L241 Difference]: Finished difference. Result has 681 places, 632 transitions, 1501 flow [2020-10-09 15:37:37,428 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1501, PETRI_PLACES=681, PETRI_TRANSITIONS=632} [2020-10-09 15:37:37,428 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 39 predicate places. [2020-10-09 15:37:37,428 INFO L481 AbstractCegarLoop]: Abstraction has has 681 places, 632 transitions, 1501 flow [2020-10-09 15:37:37,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:37,428 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:37,428 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:37,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 907 mathsat -unsat_core_generation=3 [2020-10-09 15:37:37,629 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:37,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:37,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1564955145, now seen corresponding path program 1 times [2020-10-09 15:37:37,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:37,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893419023] [2020-10-09 15:37:37,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 908 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 908 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:38,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:38,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:38,153 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:37:38,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:37:38,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893419023] [2020-10-09 15:37:38,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:38,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:38,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768129335] [2020-10-09 15:37:38,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:38,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:38,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:38,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:38,175 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:38,176 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 632 transitions, 1501 flow. Second operand 3 states. [2020-10-09 15:37:38,176 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:38,176 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:38,177 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:38,419 INFO L129 PetriNetUnfolder]: 43/741 cut-off events. [2020-10-09 15:37:38,419 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:37:38,462 INFO L80 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 741 events. 43/741 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3145 event pairs, 0 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 885. Up to 26 conditions per place. [2020-10-09 15:37:38,468 INFO L132 encePairwiseOnDemand]: 688/692 looper letters, 9 selfloop transitions, 3 changer transitions 0/633 dead transitions. [2020-10-09 15:37:38,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 633 transitions, 1527 flow [2020-10-09 15:37:38,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1975 transitions. [2020-10-09 15:37:38,469 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9513487475915221 [2020-10-09 15:37:38,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1975 transitions. [2020-10-09 15:37:38,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1975 transitions. [2020-10-09 15:37:38,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:38,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1975 transitions. [2020-10-09 15:37:38,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:38,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:38,471 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:38,471 INFO L185 Difference]: Start difference. First operand has 681 places, 632 transitions, 1501 flow. Second operand 3 states and 1975 transitions. [2020-10-09 15:37:38,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 683 places, 633 transitions, 1527 flow [2020-10-09 15:37:38,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 682 places, 633 transitions, 1525 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:38,478 INFO L241 Difference]: Finished difference. Result has 684 places, 633 transitions, 1517 flow [2020-10-09 15:37:38,478 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1517, PETRI_PLACES=684, PETRI_TRANSITIONS=633} [2020-10-09 15:37:38,478 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 42 predicate places. [2020-10-09 15:37:38,478 INFO L481 AbstractCegarLoop]: Abstraction has has 684 places, 633 transitions, 1517 flow [2020-10-09 15:37:38,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:38,478 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:38,479 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:38,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 908 mathsat -unsat_core_generation=3 [2020-10-09 15:37:38,685 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:38,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:38,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1565908457, now seen corresponding path program 1 times [2020-10-09 15:37:38,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:38,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521614044] [2020-10-09 15:37:38,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 909 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 909 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:39,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:37:39,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:39,209 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:37:39,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:37:39,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521614044] [2020-10-09 15:37:39,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:39,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:39,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799914536] [2020-10-09 15:37:39,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:39,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:39,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:39,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:39,227 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:37:39,228 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 633 transitions, 1517 flow. Second operand 3 states. [2020-10-09 15:37:39,228 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:39,228 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:37:39,229 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:39,464 INFO L129 PetriNetUnfolder]: 42/737 cut-off events. [2020-10-09 15:37:39,464 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:39,506 INFO L80 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 737 events. 42/737 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3119 event pairs, 0 based on Foata normal form. 1/672 useless extension candidates. Maximal degree in co-relation 877. Up to 26 conditions per place. [2020-10-09 15:37:39,512 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/630 dead transitions. [2020-10-09 15:37:39,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 686 places, 630 transitions, 1512 flow [2020-10-09 15:37:39,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:39,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:39,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:37:39,513 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:37:39,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:37:39,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:37:39,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:39,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:37:39,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:39,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:39,515 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:39,515 INFO L185 Difference]: Start difference. First operand has 684 places, 633 transitions, 1517 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:37:39,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 686 places, 630 transitions, 1512 flow [2020-10-09 15:37:39,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 683 places, 630 transitions, 1504 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:37:39,521 INFO L241 Difference]: Finished difference. Result has 683 places, 630 transitions, 1496 flow [2020-10-09 15:37:39,522 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=681, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1496, PETRI_PLACES=683, PETRI_TRANSITIONS=630} [2020-10-09 15:37:39,522 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 41 predicate places. [2020-10-09 15:37:39,522 INFO L481 AbstractCegarLoop]: Abstraction has has 683 places, 630 transitions, 1496 flow [2020-10-09 15:37:39,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:39,522 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:39,522 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:39,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 909 mathsat -unsat_core_generation=3 [2020-10-09 15:37:39,723 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:39,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:39,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1565909480, now seen corresponding path program 1 times [2020-10-09 15:37:39,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:39,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286632052] [2020-10-09 15:37:39,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 910 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 910 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:40,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:40,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:37:40,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:40,252 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:37:40,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286632052] [2020-10-09 15:37:40,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:40,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:40,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331575275] [2020-10-09 15:37:40,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:40,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:40,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:40,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:40,280 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:40,281 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 630 transitions, 1496 flow. Second operand 3 states. [2020-10-09 15:37:40,282 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:40,282 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:40,282 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:40,534 INFO L129 PetriNetUnfolder]: 42/735 cut-off events. [2020-10-09 15:37:40,535 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:40,579 INFO L80 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 735 events. 42/735 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3105 event pairs, 0 based on Foata normal form. 0/668 useless extension candidates. Maximal degree in co-relation 881. Up to 26 conditions per place. [2020-10-09 15:37:40,585 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 8 selfloop transitions, 1 changer transitions 0/628 dead transitions. [2020-10-09 15:37:40,586 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 628 transitions, 1509 flow [2020-10-09 15:37:40,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:40,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2020-10-09 15:37:40,587 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2020-10-09 15:37:40,587 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1972 transitions. [2020-10-09 15:37:40,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1972 transitions. [2020-10-09 15:37:40,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:40,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1972 transitions. [2020-10-09 15:37:40,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:40,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:40,589 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:40,589 INFO L185 Difference]: Start difference. First operand has 683 places, 630 transitions, 1496 flow. Second operand 3 states and 1972 transitions. [2020-10-09 15:37:40,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 683 places, 628 transitions, 1509 flow [2020-10-09 15:37:40,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 682 places, 628 transitions, 1508 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:40,596 INFO L241 Difference]: Finished difference. Result has 682 places, 628 transitions, 1492 flow [2020-10-09 15:37:40,596 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1492, PETRI_PLACES=682, PETRI_TRANSITIONS=628} [2020-10-09 15:37:40,596 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 40 predicate places. [2020-10-09 15:37:40,596 INFO L481 AbstractCegarLoop]: Abstraction has has 682 places, 628 transitions, 1492 flow [2020-10-09 15:37:40,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:40,596 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:40,597 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:40,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 910 mathsat -unsat_core_generation=3 [2020-10-09 15:37:40,797 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:40,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:40,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1558066648, now seen corresponding path program 1 times [2020-10-09 15:37:40,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:40,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360062481] [2020-10-09 15:37:40,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 911 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 911 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:41,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:41,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:37:41,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:37:41,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360062481] [2020-10-09 15:37:41,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:41,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:41,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602021339] [2020-10-09 15:37:41,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:41,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:41,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:41,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:41,385 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:41,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 682 places, 628 transitions, 1492 flow. Second operand 3 states. [2020-10-09 15:37:41,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:41,387 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:41,387 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:41,635 INFO L129 PetriNetUnfolder]: 41/743 cut-off events. [2020-10-09 15:37:41,635 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:41,679 INFO L80 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 743 events. 41/743 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3170 event pairs, 0 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 893. Up to 26 conditions per place. [2020-10-09 15:37:41,685 INFO L132 encePairwiseOnDemand]: 687/692 looper letters, 10 selfloop transitions, 3 changer transitions 0/630 dead transitions. [2020-10-09 15:37:41,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 630 transitions, 1522 flow [2020-10-09 15:37:41,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions. [2020-10-09 15:37:41,687 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523121387283237 [2020-10-09 15:37:41,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions. [2020-10-09 15:37:41,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions. [2020-10-09 15:37:41,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:41,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions. [2020-10-09 15:37:41,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:41,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:41,690 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:41,690 INFO L185 Difference]: Start difference. First operand has 682 places, 628 transitions, 1492 flow. Second operand 3 states and 1977 transitions. [2020-10-09 15:37:41,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 630 transitions, 1522 flow [2020-10-09 15:37:41,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 683 places, 630 transitions, 1521 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:41,696 INFO L241 Difference]: Finished difference. Result has 685 places, 630 transitions, 1515 flow [2020-10-09 15:37:41,696 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1491, PETRI_DIFFERENCE_MINUEND_PLACES=681, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1515, PETRI_PLACES=685, PETRI_TRANSITIONS=630} [2020-10-09 15:37:41,696 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 43 predicate places. [2020-10-09 15:37:41,697 INFO L481 AbstractCegarLoop]: Abstraction has has 685 places, 630 transitions, 1515 flow [2020-10-09 15:37:41,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:41,697 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:41,697 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:41,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 911 mathsat -unsat_core_generation=3 [2020-10-09 15:37:41,898 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:41,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:41,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1558065625, now seen corresponding path program 1 times [2020-10-09 15:37:41,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:41,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266011305] [2020-10-09 15:37:41,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 912 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 912 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:42,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:37:42,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:37:42,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:42,430 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:37:42,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266011305] [2020-10-09 15:37:42,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:42,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:42,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196323959] [2020-10-09 15:37:42,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:42,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:42,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:42,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:42,443 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:37:42,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 630 transitions, 1515 flow. Second operand 3 states. [2020-10-09 15:37:42,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:42,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:37:42,445 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:42,687 INFO L129 PetriNetUnfolder]: 39/744 cut-off events. [2020-10-09 15:37:42,687 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:42,730 INFO L80 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 744 events. 39/744 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3192 event pairs, 0 based on Foata normal form. 1/682 useless extension candidates. Maximal degree in co-relation 891. Up to 26 conditions per place. [2020-10-09 15:37:42,735 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/629 dead transitions. [2020-10-09 15:37:42,735 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 687 places, 629 transitions, 1521 flow [2020-10-09 15:37:42,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:42,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:37:42,737 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:37:42,737 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:37:42,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:37:42,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:42,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:37:42,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:42,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:42,739 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:42,739 INFO L185 Difference]: Start difference. First operand has 685 places, 630 transitions, 1515 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:37:42,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 687 places, 629 transitions, 1521 flow [2020-10-09 15:37:42,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 629 transitions, 1516 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:42,745 INFO L241 Difference]: Finished difference. Result has 687 places, 629 transitions, 1511 flow [2020-10-09 15:37:42,745 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=684, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1511, PETRI_PLACES=687, PETRI_TRANSITIONS=629} [2020-10-09 15:37:42,745 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 45 predicate places. [2020-10-09 15:37:42,745 INFO L481 AbstractCegarLoop]: Abstraction has has 687 places, 629 transitions, 1511 flow [2020-10-09 15:37:42,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:42,746 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:42,746 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:42,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 912 mathsat -unsat_core_generation=3 [2020-10-09 15:37:42,946 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:42,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:42,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1557113336, now seen corresponding path program 1 times [2020-10-09 15:37:42,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:42,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538728164] [2020-10-09 15:37:42,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 913 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 913 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:43,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:43,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:43,467 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:37:43,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:37:43,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538728164] [2020-10-09 15:37:43,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:43,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:43,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50074372] [2020-10-09 15:37:43,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:43,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:43,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:43,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:43,488 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:37:43,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 687 places, 629 transitions, 1511 flow. Second operand 3 states. [2020-10-09 15:37:43,489 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:43,489 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:37:43,490 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:43,724 INFO L129 PetriNetUnfolder]: 39/737 cut-off events. [2020-10-09 15:37:43,725 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:43,767 INFO L80 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 737 events. 39/737 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3135 event pairs, 0 based on Foata normal form. 1/675 useless extension candidates. Maximal degree in co-relation 887. Up to 26 conditions per place. [2020-10-09 15:37:43,772 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 5 selfloop transitions, 1 changer transitions 0/627 dead transitions. [2020-10-09 15:37:43,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 627 transitions, 1514 flow [2020-10-09 15:37:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2020-10-09 15:37:43,774 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9556840077071291 [2020-10-09 15:37:43,774 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2020-10-09 15:37:43,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2020-10-09 15:37:43,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:43,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2020-10-09 15:37:43,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:43,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:43,776 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:43,776 INFO L185 Difference]: Start difference. First operand has 687 places, 629 transitions, 1511 flow. Second operand 3 states and 1984 transitions. [2020-10-09 15:37:43,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 627 transitions, 1514 flow [2020-10-09 15:37:43,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 627 transitions, 1507 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:37:43,782 INFO L241 Difference]: Finished difference. Result has 687 places, 627 transitions, 1500 flow [2020-10-09 15:37:43,782 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=684, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1500, PETRI_PLACES=687, PETRI_TRANSITIONS=627} [2020-10-09 15:37:43,783 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 45 predicate places. [2020-10-09 15:37:43,783 INFO L481 AbstractCegarLoop]: Abstraction has has 687 places, 627 transitions, 1500 flow [2020-10-09 15:37:43,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:43,783 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:43,783 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:43,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 913 mathsat -unsat_core_generation=3 [2020-10-09 15:37:43,984 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:43,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:43,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1557112313, now seen corresponding path program 1 times [2020-10-09 15:37:43,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:43,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578871474] [2020-10-09 15:37:43,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 914 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 914 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:44,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:44,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:37:44,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:37:44,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578871474] [2020-10-09 15:37:44,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:44,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:44,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791090551] [2020-10-09 15:37:44,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:44,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:44,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:44,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:44,546 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:44,547 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 687 places, 627 transitions, 1500 flow. Second operand 3 states. [2020-10-09 15:37:44,547 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:44,547 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:44,548 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:44,786 INFO L129 PetriNetUnfolder]: 39/735 cut-off events. [2020-10-09 15:37:44,786 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:37:44,828 INFO L80 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 735 events. 39/735 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3118 event pairs, 0 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 887. Up to 26 conditions per place. [2020-10-09 15:37:44,833 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 8 selfloop transitions, 1 changer transitions 0/625 dead transitions. [2020-10-09 15:37:44,833 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 687 places, 625 transitions, 1513 flow [2020-10-09 15:37:44,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:44,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:44,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2020-10-09 15:37:44,835 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2020-10-09 15:37:44,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1972 transitions. [2020-10-09 15:37:44,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1972 transitions. [2020-10-09 15:37:44,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:44,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1972 transitions. [2020-10-09 15:37:44,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:44,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:44,837 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:44,837 INFO L185 Difference]: Start difference. First operand has 687 places, 627 transitions, 1500 flow. Second operand 3 states and 1972 transitions. [2020-10-09 15:37:44,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 687 places, 625 transitions, 1513 flow [2020-10-09 15:37:44,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 625 transitions, 1512 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:44,843 INFO L241 Difference]: Finished difference. Result has 686 places, 625 transitions, 1496 flow [2020-10-09 15:37:44,843 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=684, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1496, PETRI_PLACES=686, PETRI_TRANSITIONS=625} [2020-10-09 15:37:44,843 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 44 predicate places. [2020-10-09 15:37:44,843 INFO L481 AbstractCegarLoop]: Abstraction has has 686 places, 625 transitions, 1496 flow [2020-10-09 15:37:44,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:44,843 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:44,843 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:45,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 914 mathsat -unsat_core_generation=3 [2020-10-09 15:37:45,044 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:45,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:45,045 INFO L82 PathProgramCache]: Analyzing trace with hash 856560073, now seen corresponding path program 1 times [2020-10-09 15:37:45,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:45,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064508998] [2020-10-09 15:37:45,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 915 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 915 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:45,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:45,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:37:45,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:37:45,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064508998] [2020-10-09 15:37:45,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:45,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:45,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393733808] [2020-10-09 15:37:45,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:45,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:45,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:45,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:45,629 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:45,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 686 places, 625 transitions, 1496 flow. Second operand 3 states. [2020-10-09 15:37:45,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:45,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:45,630 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:45,874 INFO L129 PetriNetUnfolder]: 38/743 cut-off events. [2020-10-09 15:37:45,875 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:45,918 INFO L80 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 743 events. 38/743 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3192 event pairs, 0 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 899. Up to 26 conditions per place. [2020-10-09 15:37:45,924 INFO L132 encePairwiseOnDemand]: 687/692 looper letters, 10 selfloop transitions, 3 changer transitions 0/627 dead transitions. [2020-10-09 15:37:45,924 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 627 transitions, 1526 flow [2020-10-09 15:37:45,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions. [2020-10-09 15:37:45,926 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523121387283237 [2020-10-09 15:37:45,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions. [2020-10-09 15:37:45,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions. [2020-10-09 15:37:45,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:45,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions. [2020-10-09 15:37:45,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:45,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:45,928 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:45,928 INFO L185 Difference]: Start difference. First operand has 686 places, 625 transitions, 1496 flow. Second operand 3 states and 1977 transitions. [2020-10-09 15:37:45,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 627 transitions, 1526 flow [2020-10-09 15:37:45,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 627 transitions, 1525 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:45,934 INFO L241 Difference]: Finished difference. Result has 689 places, 627 transitions, 1519 flow [2020-10-09 15:37:45,934 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1519, PETRI_PLACES=689, PETRI_TRANSITIONS=627} [2020-10-09 15:37:45,935 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 47 predicate places. [2020-10-09 15:37:45,935 INFO L481 AbstractCegarLoop]: Abstraction has has 689 places, 627 transitions, 1519 flow [2020-10-09 15:37:45,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:45,935 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:45,935 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:46,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 915 mathsat -unsat_core_generation=3 [2020-10-09 15:37:46,136 INFO L429 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:46,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:46,136 INFO L82 PathProgramCache]: Analyzing trace with hash 856559050, now seen corresponding path program 1 times [2020-10-09 15:37:46,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:46,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550015855] [2020-10-09 15:37:46,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 916 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 916 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:46,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:37:46,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:37:46,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:37:46,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550015855] [2020-10-09 15:37:46,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:46,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:46,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612128899] [2020-10-09 15:37:46,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:46,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:46,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:46,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:46,697 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:37:46,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 689 places, 627 transitions, 1519 flow. Second operand 3 states. [2020-10-09 15:37:46,698 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:46,698 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:37:46,698 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:46,947 INFO L129 PetriNetUnfolder]: 36/744 cut-off events. [2020-10-09 15:37:46,947 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:46,992 INFO L80 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 744 events. 36/744 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3209 event pairs, 0 based on Foata normal form. 1/685 useless extension candidates. Maximal degree in co-relation 897. Up to 26 conditions per place. [2020-10-09 15:37:46,998 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/626 dead transitions. [2020-10-09 15:37:46,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 626 transitions, 1525 flow [2020-10-09 15:37:46,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:46,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:37:46,999 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:37:47,000 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:37:47,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:37:47,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:47,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:37:47,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:47,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:47,002 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:47,003 INFO L185 Difference]: Start difference. First operand has 689 places, 627 transitions, 1519 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:37:47,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 626 transitions, 1525 flow [2020-10-09 15:37:47,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 690 places, 626 transitions, 1520 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:47,010 INFO L241 Difference]: Finished difference. Result has 691 places, 626 transitions, 1515 flow [2020-10-09 15:37:47,010 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=688, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1515, PETRI_PLACES=691, PETRI_TRANSITIONS=626} [2020-10-09 15:37:47,010 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 49 predicate places. [2020-10-09 15:37:47,010 INFO L481 AbstractCegarLoop]: Abstraction has has 691 places, 626 transitions, 1515 flow [2020-10-09 15:37:47,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:47,010 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:47,011 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:47,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 916 mathsat -unsat_core_generation=3 [2020-10-09 15:37:47,211 INFO L429 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:47,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:47,212 INFO L82 PathProgramCache]: Analyzing trace with hash 855606761, now seen corresponding path program 1 times [2020-10-09 15:37:47,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:47,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209964826] [2020-10-09 15:37:47,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 917 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 917 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:47,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:47,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:37:47,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:47,747 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:37:47,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209964826] [2020-10-09 15:37:47,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:47,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:47,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11594729] [2020-10-09 15:37:47,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:47,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:47,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:47,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:47,759 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:37:47,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 626 transitions, 1515 flow. Second operand 3 states. [2020-10-09 15:37:47,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:47,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:37:47,761 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:48,009 INFO L129 PetriNetUnfolder]: 36/737 cut-off events. [2020-10-09 15:37:48,009 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:48,052 INFO L80 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 737 events. 36/737 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3151 event pairs, 0 based on Foata normal form. 1/678 useless extension candidates. Maximal degree in co-relation 893. Up to 26 conditions per place. [2020-10-09 15:37:48,058 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 5 selfloop transitions, 1 changer transitions 0/624 dead transitions. [2020-10-09 15:37:48,058 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 624 transitions, 1518 flow [2020-10-09 15:37:48,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:48,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2020-10-09 15:37:48,059 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9556840077071291 [2020-10-09 15:37:48,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2020-10-09 15:37:48,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2020-10-09 15:37:48,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:48,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2020-10-09 15:37:48,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:48,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:48,061 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:48,061 INFO L185 Difference]: Start difference. First operand has 691 places, 626 transitions, 1515 flow. Second operand 3 states and 1984 transitions. [2020-10-09 15:37:48,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 624 transitions, 1518 flow [2020-10-09 15:37:48,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 690 places, 624 transitions, 1511 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:37:48,068 INFO L241 Difference]: Finished difference. Result has 691 places, 624 transitions, 1504 flow [2020-10-09 15:37:48,068 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=688, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1504, PETRI_PLACES=691, PETRI_TRANSITIONS=624} [2020-10-09 15:37:48,068 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 49 predicate places. [2020-10-09 15:37:48,068 INFO L481 AbstractCegarLoop]: Abstraction has has 691 places, 624 transitions, 1504 flow [2020-10-09 15:37:48,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:48,069 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:48,069 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:48,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 917 mathsat -unsat_core_generation=3 [2020-10-09 15:37:48,269 INFO L429 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:48,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:48,270 INFO L82 PathProgramCache]: Analyzing trace with hash 855605738, now seen corresponding path program 1 times [2020-10-09 15:37:48,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:48,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738017829] [2020-10-09 15:37:48,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 918 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 918 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:48,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:48,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:37:48,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:48,802 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:37:48,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738017829] [2020-10-09 15:37:48,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:48,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:48,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708080335] [2020-10-09 15:37:48,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:48,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:48,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:48,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:48,838 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:48,839 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 624 transitions, 1504 flow. Second operand 3 states. [2020-10-09 15:37:48,839 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:48,839 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:48,839 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:49,087 INFO L129 PetriNetUnfolder]: 36/735 cut-off events. [2020-10-09 15:37:49,087 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:37:49,130 INFO L80 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 735 events. 36/735 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3136 event pairs, 0 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 893. Up to 26 conditions per place. [2020-10-09 15:37:49,135 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 8 selfloop transitions, 1 changer transitions 0/622 dead transitions. [2020-10-09 15:37:49,135 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 622 transitions, 1517 flow [2020-10-09 15:37:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2020-10-09 15:37:49,136 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2020-10-09 15:37:49,136 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1972 transitions. [2020-10-09 15:37:49,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1972 transitions. [2020-10-09 15:37:49,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:49,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1972 transitions. [2020-10-09 15:37:49,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:49,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:49,139 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:49,139 INFO L185 Difference]: Start difference. First operand has 691 places, 624 transitions, 1504 flow. Second operand 3 states and 1972 transitions. [2020-10-09 15:37:49,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 622 transitions, 1517 flow [2020-10-09 15:37:49,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 690 places, 622 transitions, 1516 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:49,146 INFO L241 Difference]: Finished difference. Result has 690 places, 622 transitions, 1500 flow [2020-10-09 15:37:49,146 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=688, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1500, PETRI_PLACES=690, PETRI_TRANSITIONS=622} [2020-10-09 15:37:49,146 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 48 predicate places. [2020-10-09 15:37:49,146 INFO L481 AbstractCegarLoop]: Abstraction has has 690 places, 622 transitions, 1500 flow [2020-10-09 15:37:49,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:49,147 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:49,147 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:49,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 918 mathsat -unsat_core_generation=3 [2020-10-09 15:37:49,348 INFO L429 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:49,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:49,348 INFO L82 PathProgramCache]: Analyzing trace with hash 844858172, now seen corresponding path program 1 times [2020-10-09 15:37:49,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:49,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838695060] [2020-10-09 15:37:49,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 919 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 919 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:49,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:37:49,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:37:49,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:37:49,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838695060] [2020-10-09 15:37:49,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:49,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:49,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933628302] [2020-10-09 15:37:49,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:49,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:49,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:49,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:49,911 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:37:49,912 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 622 transitions, 1500 flow. Second operand 3 states. [2020-10-09 15:37:49,912 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:49,913 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:37:49,913 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:50,175 INFO L129 PetriNetUnfolder]: 35/742 cut-off events. [2020-10-09 15:37:50,175 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:50,215 INFO L80 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 742 events. 35/742 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3199 event pairs, 0 based on Foata normal form. 1/683 useless extension candidates. Maximal degree in co-relation 896. Up to 26 conditions per place. [2020-10-09 15:37:50,220 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/622 dead transitions. [2020-10-09 15:37:50,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 692 places, 622 transitions, 1510 flow [2020-10-09 15:37:50,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:37:50,222 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:37:50,222 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:37:50,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:37:50,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:50,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:37:50,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:50,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:50,224 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:50,224 INFO L185 Difference]: Start difference. First operand has 690 places, 622 transitions, 1500 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:37:50,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 692 places, 622 transitions, 1510 flow [2020-10-09 15:37:50,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 622 transitions, 1509 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:50,230 INFO L241 Difference]: Finished difference. Result has 692 places, 622 transitions, 1504 flow [2020-10-09 15:37:50,230 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=689, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1504, PETRI_PLACES=692, PETRI_TRANSITIONS=622} [2020-10-09 15:37:50,230 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 50 predicate places. [2020-10-09 15:37:50,230 INFO L481 AbstractCegarLoop]: Abstraction has has 692 places, 622 transitions, 1504 flow [2020-10-09 15:37:50,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:50,231 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:50,231 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:50,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 919 mathsat -unsat_core_generation=3 [2020-10-09 15:37:50,431 INFO L429 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:50,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:50,432 INFO L82 PathProgramCache]: Analyzing trace with hash 844859195, now seen corresponding path program 1 times [2020-10-09 15:37:50,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:50,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992383314] [2020-10-09 15:37:50,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 920 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 920 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:50,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:50,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:37:50,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:37:50,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992383314] [2020-10-09 15:37:50,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:50,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:50,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127531591] [2020-10-09 15:37:50,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:50,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:50,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:50,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:50,992 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:50,993 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 622 transitions, 1504 flow. Second operand 3 states. [2020-10-09 15:37:50,993 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:50,993 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:50,994 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:51,237 INFO L129 PetriNetUnfolder]: 33/744 cut-off events. [2020-10-09 15:37:51,237 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:37:51,279 INFO L80 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 744 events. 33/744 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3228 event pairs, 0 based on Foata normal form. 0/684 useless extension candidates. Maximal degree in co-relation 909. Up to 26 conditions per place. [2020-10-09 15:37:51,284 INFO L132 encePairwiseOnDemand]: 688/692 looper letters, 9 selfloop transitions, 3 changer transitions 0/623 dead transitions. [2020-10-09 15:37:51,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 623 transitions, 1530 flow [2020-10-09 15:37:51,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:51,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1975 transitions. [2020-10-09 15:37:51,286 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9513487475915221 [2020-10-09 15:37:51,286 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1975 transitions. [2020-10-09 15:37:51,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1975 transitions. [2020-10-09 15:37:51,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:51,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1975 transitions. [2020-10-09 15:37:51,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:51,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:51,288 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:51,288 INFO L185 Difference]: Start difference. First operand has 692 places, 622 transitions, 1504 flow. Second operand 3 states and 1975 transitions. [2020-10-09 15:37:51,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 623 transitions, 1530 flow [2020-10-09 15:37:51,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 623 transitions, 1529 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:51,294 INFO L241 Difference]: Finished difference. Result has 695 places, 623 transitions, 1521 flow [2020-10-09 15:37:51,294 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1503, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1521, PETRI_PLACES=695, PETRI_TRANSITIONS=623} [2020-10-09 15:37:51,294 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 53 predicate places. [2020-10-09 15:37:51,294 INFO L481 AbstractCegarLoop]: Abstraction has has 695 places, 623 transitions, 1521 flow [2020-10-09 15:37:51,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:51,294 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:51,294 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:51,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 920 mathsat -unsat_core_generation=3 [2020-10-09 15:37:51,495 INFO L429 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:51,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:51,496 INFO L82 PathProgramCache]: Analyzing trace with hash 843905883, now seen corresponding path program 1 times [2020-10-09 15:37:51,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:51,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135840180] [2020-10-09 15:37:51,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 921 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 921 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:52,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:52,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:37:52,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:37:52,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135840180] [2020-10-09 15:37:52,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:52,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:52,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162978166] [2020-10-09 15:37:52,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:52,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:52,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:52,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:52,044 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:37:52,045 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 623 transitions, 1521 flow. Second operand 3 states. [2020-10-09 15:37:52,045 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:52,045 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:37:52,045 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:52,281 INFO L129 PetriNetUnfolder]: 33/737 cut-off events. [2020-10-09 15:37:52,281 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:52,321 INFO L80 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 737 events. 33/737 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3172 event pairs, 0 based on Foata normal form. 1/681 useless extension candidates. Maximal degree in co-relation 895. Up to 26 conditions per place. [2020-10-09 15:37:52,326 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 5 selfloop transitions, 1 changer transitions 0/621 dead transitions. [2020-10-09 15:37:52,326 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 621 transitions, 1523 flow [2020-10-09 15:37:52,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:52,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2020-10-09 15:37:52,327 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9556840077071291 [2020-10-09 15:37:52,328 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2020-10-09 15:37:52,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2020-10-09 15:37:52,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:52,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2020-10-09 15:37:52,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:52,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:52,331 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:52,331 INFO L185 Difference]: Start difference. First operand has 695 places, 623 transitions, 1521 flow. Second operand 3 states and 1984 transitions. [2020-10-09 15:37:52,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 621 transitions, 1523 flow [2020-10-09 15:37:52,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 694 places, 621 transitions, 1515 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:37:52,338 INFO L241 Difference]: Finished difference. Result has 695 places, 621 transitions, 1508 flow [2020-10-09 15:37:52,338 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1503, PETRI_DIFFERENCE_MINUEND_PLACES=692, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1508, PETRI_PLACES=695, PETRI_TRANSITIONS=621} [2020-10-09 15:37:52,338 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 53 predicate places. [2020-10-09 15:37:52,338 INFO L481 AbstractCegarLoop]: Abstraction has has 695 places, 621 transitions, 1508 flow [2020-10-09 15:37:52,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:52,338 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:52,338 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:52,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 921 mathsat -unsat_core_generation=3 [2020-10-09 15:37:52,539 INFO L429 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:52,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:52,539 INFO L82 PathProgramCache]: Analyzing trace with hash 843904860, now seen corresponding path program 1 times [2020-10-09 15:37:52,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:52,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002713857] [2020-10-09 15:37:52,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 922 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 922 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:53,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:53,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:37:53,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:37:53,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002713857] [2020-10-09 15:37:53,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:53,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:53,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603714906] [2020-10-09 15:37:53,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:53,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:53,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:53,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:53,102 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:53,103 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 621 transitions, 1508 flow. Second operand 3 states. [2020-10-09 15:37:53,103 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:53,103 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:53,103 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:53,340 INFO L129 PetriNetUnfolder]: 33/735 cut-off events. [2020-10-09 15:37:53,340 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:37:53,380 INFO L80 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 735 events. 33/735 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3154 event pairs, 0 based on Foata normal form. 0/677 useless extension candidates. Maximal degree in co-relation 899. Up to 26 conditions per place. [2020-10-09 15:37:53,385 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 8 selfloop transitions, 1 changer transitions 0/619 dead transitions. [2020-10-09 15:37:53,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 619 transitions, 1521 flow [2020-10-09 15:37:53,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:53,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:53,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2020-10-09 15:37:53,387 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2020-10-09 15:37:53,387 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1972 transitions. [2020-10-09 15:37:53,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1972 transitions. [2020-10-09 15:37:53,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:53,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1972 transitions. [2020-10-09 15:37:53,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:53,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:53,390 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:53,390 INFO L185 Difference]: Start difference. First operand has 695 places, 621 transitions, 1508 flow. Second operand 3 states and 1972 transitions. [2020-10-09 15:37:53,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 619 transitions, 1521 flow [2020-10-09 15:37:53,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 694 places, 619 transitions, 1520 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:53,398 INFO L241 Difference]: Finished difference. Result has 694 places, 619 transitions, 1504 flow [2020-10-09 15:37:53,399 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=692, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=618, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1504, PETRI_PLACES=694, PETRI_TRANSITIONS=619} [2020-10-09 15:37:53,399 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 52 predicate places. [2020-10-09 15:37:53,399 INFO L481 AbstractCegarLoop]: Abstraction has has 694 places, 619 transitions, 1504 flow [2020-10-09 15:37:53,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:53,399 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:53,399 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:53,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 922 mathsat -unsat_core_generation=3 [2020-10-09 15:37:53,600 INFO L429 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:53,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:53,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1635106255, now seen corresponding path program 1 times [2020-10-09 15:37:53,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:53,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866309232] [2020-10-09 15:37:53,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 923 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 923 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:54,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:54,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:37:54,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:37:54,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866309232] [2020-10-09 15:37:54,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:54,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:54,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407129638] [2020-10-09 15:37:54,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:54,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:54,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:54,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:54,157 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:54,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 619 transitions, 1504 flow. Second operand 3 states. [2020-10-09 15:37:54,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:54,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:54,158 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:54,437 INFO L129 PetriNetUnfolder]: 32/743 cut-off events. [2020-10-09 15:37:54,438 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:54,474 INFO L80 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 743 events. 32/743 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3224 event pairs, 0 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 911. Up to 26 conditions per place. [2020-10-09 15:37:54,479 INFO L132 encePairwiseOnDemand]: 687/692 looper letters, 10 selfloop transitions, 3 changer transitions 0/621 dead transitions. [2020-10-09 15:37:54,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 621 transitions, 1534 flow [2020-10-09 15:37:54,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions. [2020-10-09 15:37:54,480 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523121387283237 [2020-10-09 15:37:54,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions. [2020-10-09 15:37:54,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions. [2020-10-09 15:37:54,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:54,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions. [2020-10-09 15:37:54,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:54,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:54,482 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:54,482 INFO L185 Difference]: Start difference. First operand has 694 places, 619 transitions, 1504 flow. Second operand 3 states and 1977 transitions. [2020-10-09 15:37:54,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 621 transitions, 1534 flow [2020-10-09 15:37:54,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 621 transitions, 1533 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:54,488 INFO L241 Difference]: Finished difference. Result has 697 places, 621 transitions, 1527 flow [2020-10-09 15:37:54,488 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1503, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1527, PETRI_PLACES=697, PETRI_TRANSITIONS=621} [2020-10-09 15:37:54,489 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 55 predicate places. [2020-10-09 15:37:54,489 INFO L481 AbstractCegarLoop]: Abstraction has has 697 places, 621 transitions, 1527 flow [2020-10-09 15:37:54,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:54,489 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:54,489 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:54,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 923 mathsat -unsat_core_generation=3 [2020-10-09 15:37:54,690 INFO L429 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:54,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:54,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1635107278, now seen corresponding path program 1 times [2020-10-09 15:37:54,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:54,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888803526] [2020-10-09 15:37:54,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 924 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 924 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:55,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:55,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:37:55,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:37:55,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888803526] [2020-10-09 15:37:55,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:55,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:55,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044348689] [2020-10-09 15:37:55,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:55,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:55,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:55,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:55,234 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:37:55,235 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 621 transitions, 1527 flow. Second operand 3 states. [2020-10-09 15:37:55,235 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:55,235 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:37:55,235 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:55,485 INFO L129 PetriNetUnfolder]: 31/741 cut-off events. [2020-10-09 15:37:55,486 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:55,530 INFO L80 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 741 events. 31/741 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3213 event pairs, 0 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 908. Up to 26 conditions per place. [2020-10-09 15:37:55,534 INFO L132 encePairwiseOnDemand]: 689/692 looper letters, 5 selfloop transitions, 2 changer transitions 0/621 dead transitions. [2020-10-09 15:37:55,534 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 699 places, 621 transitions, 1539 flow [2020-10-09 15:37:55,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1985 transitions. [2020-10-09 15:37:55,536 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561657032755299 [2020-10-09 15:37:55,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1985 transitions. [2020-10-09 15:37:55,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1985 transitions. [2020-10-09 15:37:55,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:55,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1985 transitions. [2020-10-09 15:37:55,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:55,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:55,538 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:55,538 INFO L185 Difference]: Start difference. First operand has 697 places, 621 transitions, 1527 flow. Second operand 3 states and 1985 transitions. [2020-10-09 15:37:55,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 699 places, 621 transitions, 1539 flow [2020-10-09 15:37:55,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 698 places, 621 transitions, 1534 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:55,544 INFO L241 Difference]: Finished difference. Result has 700 places, 621 transitions, 1532 flow [2020-10-09 15:37:55,544 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1518, PETRI_DIFFERENCE_MINUEND_PLACES=696, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=618, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1532, PETRI_PLACES=700, PETRI_TRANSITIONS=621} [2020-10-09 15:37:55,545 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 58 predicate places. [2020-10-09 15:37:55,545 INFO L481 AbstractCegarLoop]: Abstraction has has 700 places, 621 transitions, 1532 flow [2020-10-09 15:37:55,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:55,545 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:55,545 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:55,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 924 mathsat -unsat_core_generation=3 [2020-10-09 15:37:55,746 INFO L429 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:55,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:55,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1636059567, now seen corresponding path program 1 times [2020-10-09 15:37:55,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:55,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17752015] [2020-10-09 15:37:55,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 925 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 925 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:56,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:37:56,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:37:56,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:56,285 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:37:56,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17752015] [2020-10-09 15:37:56,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:56,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:56,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572115439] [2020-10-09 15:37:56,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:56,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:56,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:56,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:56,298 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:37:56,299 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 621 transitions, 1532 flow. Second operand 3 states. [2020-10-09 15:37:56,299 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:56,299 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:37:56,299 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:56,543 INFO L129 PetriNetUnfolder]: 30/737 cut-off events. [2020-10-09 15:37:56,543 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:37:56,586 INFO L80 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 737 events. 30/737 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3187 event pairs, 0 based on Foata normal form. 1/684 useless extension candidates. Maximal degree in co-relation 904. Up to 26 conditions per place. [2020-10-09 15:37:56,590 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/618 dead transitions. [2020-10-09 15:37:56,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 618 transitions, 1527 flow [2020-10-09 15:37:56,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:37:56,592 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:37:56,592 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:37:56,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:37:56,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:56,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:37:56,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:56,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:56,594 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:56,594 INFO L185 Difference]: Start difference. First operand has 700 places, 621 transitions, 1532 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:37:56,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 618 transitions, 1527 flow [2020-10-09 15:37:56,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 618 transitions, 1520 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:37:56,600 INFO L241 Difference]: Finished difference. Result has 699 places, 618 transitions, 1512 flow [2020-10-09 15:37:56,600 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1512, PETRI_PLACES=699, PETRI_TRANSITIONS=618} [2020-10-09 15:37:56,600 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 57 predicate places. [2020-10-09 15:37:56,600 INFO L481 AbstractCegarLoop]: Abstraction has has 699 places, 618 transitions, 1512 flow [2020-10-09 15:37:56,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:56,600 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:56,601 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:56,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 925 mathsat -unsat_core_generation=3 [2020-10-09 15:37:56,801 INFO L429 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:56,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1636060590, now seen corresponding path program 1 times [2020-10-09 15:37:56,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:56,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004875646] [2020-10-09 15:37:56,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 926 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 926 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:57,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:57,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:37:57,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:57,339 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:37:57,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004875646] [2020-10-09 15:37:57,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:57,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:57,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017263880] [2020-10-09 15:37:57,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:57,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:57,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:57,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:57,368 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:57,368 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 699 places, 618 transitions, 1512 flow. Second operand 3 states. [2020-10-09 15:37:57,368 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:57,368 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:57,368 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:57,616 INFO L129 PetriNetUnfolder]: 30/735 cut-off events. [2020-10-09 15:37:57,616 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:57,658 INFO L80 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 735 events. 30/735 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3171 event pairs, 0 based on Foata normal form. 0/680 useless extension candidates. Maximal degree in co-relation 906. Up to 26 conditions per place. [2020-10-09 15:37:57,662 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 8 selfloop transitions, 1 changer transitions 0/616 dead transitions. [2020-10-09 15:37:57,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 699 places, 616 transitions, 1525 flow [2020-10-09 15:37:57,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:57,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2020-10-09 15:37:57,664 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2020-10-09 15:37:57,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1972 transitions. [2020-10-09 15:37:57,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1972 transitions. [2020-10-09 15:37:57,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:57,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1972 transitions. [2020-10-09 15:37:57,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:57,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:57,666 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:57,666 INFO L185 Difference]: Start difference. First operand has 699 places, 618 transitions, 1512 flow. Second operand 3 states and 1972 transitions. [2020-10-09 15:37:57,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 699 places, 616 transitions, 1525 flow [2020-10-09 15:37:57,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 698 places, 616 transitions, 1524 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:57,672 INFO L241 Difference]: Finished difference. Result has 698 places, 616 transitions, 1508 flow [2020-10-09 15:37:57,672 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=696, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1508, PETRI_PLACES=698, PETRI_TRANSITIONS=616} [2020-10-09 15:37:57,672 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 56 predicate places. [2020-10-09 15:37:57,673 INFO L481 AbstractCegarLoop]: Abstraction has has 698 places, 616 transitions, 1508 flow [2020-10-09 15:37:57,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:57,673 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:57,673 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:57,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 926 mathsat -unsat_core_generation=3 [2020-10-09 15:37:57,873 INFO L429 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:57,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:57,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1125506243, now seen corresponding path program 1 times [2020-10-09 15:37:57,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:57,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681134952] [2020-10-09 15:37:57,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 927 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 927 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:58,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:58,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:37:58,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:58,410 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:37:58,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681134952] [2020-10-09 15:37:58,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:58,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:58,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885724133] [2020-10-09 15:37:58,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:58,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:58,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:58,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:58,430 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:37:58,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 698 places, 616 transitions, 1508 flow. Second operand 3 states. [2020-10-09 15:37:58,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:58,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:37:58,431 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:58,744 INFO L129 PetriNetUnfolder]: 29/743 cut-off events. [2020-10-09 15:37:58,744 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:37:58,772 INFO L80 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 743 events. 29/743 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3241 event pairs, 0 based on Foata normal form. 0/688 useless extension candidates. Maximal degree in co-relation 918. Up to 26 conditions per place. [2020-10-09 15:37:58,776 INFO L132 encePairwiseOnDemand]: 687/692 looper letters, 10 selfloop transitions, 3 changer transitions 0/618 dead transitions. [2020-10-09 15:37:58,777 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 618 transitions, 1538 flow [2020-10-09 15:37:58,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions. [2020-10-09 15:37:58,778 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523121387283237 [2020-10-09 15:37:58,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions. [2020-10-09 15:37:58,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions. [2020-10-09 15:37:58,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:58,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions. [2020-10-09 15:37:58,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:58,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:58,780 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:58,780 INFO L185 Difference]: Start difference. First operand has 698 places, 616 transitions, 1508 flow. Second operand 3 states and 1977 transitions. [2020-10-09 15:37:58,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 700 places, 618 transitions, 1538 flow [2020-10-09 15:37:58,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 618 transitions, 1537 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:58,786 INFO L241 Difference]: Finished difference. Result has 701 places, 618 transitions, 1531 flow [2020-10-09 15:37:58,786 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1531, PETRI_PLACES=701, PETRI_TRANSITIONS=618} [2020-10-09 15:37:58,786 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 59 predicate places. [2020-10-09 15:37:58,786 INFO L481 AbstractCegarLoop]: Abstraction has has 701 places, 618 transitions, 1531 flow [2020-10-09 15:37:58,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:58,787 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:58,787 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:37:58,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 927 mathsat -unsat_core_generation=3 [2020-10-09 15:37:58,987 INFO L429 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:37:58,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:37:58,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1125507266, now seen corresponding path program 1 times [2020-10-09 15:37:58,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:37:58,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102655570] [2020-10-09 15:37:58,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 928 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 928 with mathsat -unsat_core_generation=3 [2020-10-09 15:37:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:37:59,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:37:59,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:37:59,524 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:37:59,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:37:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:37:59,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102655570] [2020-10-09 15:37:59,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:37:59,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:37:59,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56198864] [2020-10-09 15:37:59,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:37:59,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:37:59,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:37:59,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:37:59,539 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:37:59,540 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 618 transitions, 1531 flow. Second operand 3 states. [2020-10-09 15:37:59,540 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:37:59,540 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:37:59,540 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:37:59,789 INFO L129 PetriNetUnfolder]: 28/741 cut-off events. [2020-10-09 15:37:59,789 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:37:59,832 INFO L80 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 741 events. 28/741 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3229 event pairs, 0 based on Foata normal form. 0/689 useless extension candidates. Maximal degree in co-relation 915. Up to 26 conditions per place. [2020-10-09 15:37:59,836 INFO L132 encePairwiseOnDemand]: 689/692 looper letters, 5 selfloop transitions, 2 changer transitions 0/618 dead transitions. [2020-10-09 15:37:59,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 618 transitions, 1543 flow [2020-10-09 15:37:59,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:37:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:37:59,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1985 transitions. [2020-10-09 15:37:59,838 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561657032755299 [2020-10-09 15:37:59,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1985 transitions. [2020-10-09 15:37:59,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1985 transitions. [2020-10-09 15:37:59,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:37:59,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1985 transitions. [2020-10-09 15:37:59,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:37:59,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:37:59,840 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:37:59,840 INFO L185 Difference]: Start difference. First operand has 701 places, 618 transitions, 1531 flow. Second operand 3 states and 1985 transitions. [2020-10-09 15:37:59,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 618 transitions, 1543 flow [2020-10-09 15:37:59,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 618 transitions, 1538 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:37:59,846 INFO L241 Difference]: Finished difference. Result has 704 places, 618 transitions, 1536 flow [2020-10-09 15:37:59,847 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1522, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1536, PETRI_PLACES=704, PETRI_TRANSITIONS=618} [2020-10-09 15:37:59,847 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 62 predicate places. [2020-10-09 15:37:59,847 INFO L481 AbstractCegarLoop]: Abstraction has has 704 places, 618 transitions, 1536 flow [2020-10-09 15:37:59,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:37:59,847 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:37:59,847 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:00,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 928 mathsat -unsat_core_generation=3 [2020-10-09 15:38:00,048 INFO L429 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:00,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:00,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1126459555, now seen corresponding path program 1 times [2020-10-09 15:38:00,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:00,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14319836] [2020-10-09 15:38:00,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 929 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 929 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:00,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:38:00,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:00,583 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:38:00,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:00,597 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:38:00,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14319836] [2020-10-09 15:38:00,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:00,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:00,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810995035] [2020-10-09 15:38:00,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:00,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:00,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:00,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:00,619 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:38:00,620 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 618 transitions, 1536 flow. Second operand 3 states. [2020-10-09 15:38:00,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:00,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:38:00,621 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:00,878 INFO L129 PetriNetUnfolder]: 27/737 cut-off events. [2020-10-09 15:38:00,878 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:38:00,925 INFO L80 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 737 events. 27/737 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3206 event pairs, 0 based on Foata normal form. 1/687 useless extension candidates. Maximal degree in co-relation 911. Up to 26 conditions per place. [2020-10-09 15:38:00,929 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/615 dead transitions. [2020-10-09 15:38:00,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 615 transitions, 1531 flow [2020-10-09 15:38:00,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:00,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:00,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:38:00,931 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:38:00,931 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:38:00,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:38:00,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:00,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:38:00,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:00,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:00,933 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:00,933 INFO L185 Difference]: Start difference. First operand has 704 places, 618 transitions, 1536 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:38:00,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 615 transitions, 1531 flow [2020-10-09 15:38:00,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 615 transitions, 1524 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:38:00,940 INFO L241 Difference]: Finished difference. Result has 703 places, 615 transitions, 1516 flow [2020-10-09 15:38:00,940 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1514, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1516, PETRI_PLACES=703, PETRI_TRANSITIONS=615} [2020-10-09 15:38:00,940 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 61 predicate places. [2020-10-09 15:38:00,940 INFO L481 AbstractCegarLoop]: Abstraction has has 703 places, 615 transitions, 1516 flow [2020-10-09 15:38:00,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:00,940 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:00,940 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:01,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 929 mathsat -unsat_core_generation=3 [2020-10-09 15:38:01,141 INFO L429 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:01,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:01,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1126460578, now seen corresponding path program 1 times [2020-10-09 15:38:01,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:01,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069701368] [2020-10-09 15:38:01,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 930 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 930 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:01,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:01,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:01,680 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:38:01,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:01,683 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:38:01,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069701368] [2020-10-09 15:38:01,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:01,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:01,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258853130] [2020-10-09 15:38:01,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:01,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:01,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:01,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:01,718 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:38:01,718 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 615 transitions, 1516 flow. Second operand 3 states. [2020-10-09 15:38:01,718 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:01,718 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:38:01,719 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:01,969 INFO L129 PetriNetUnfolder]: 27/735 cut-off events. [2020-10-09 15:38:01,970 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:38:02,012 INFO L80 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 735 events. 27/735 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3188 event pairs, 0 based on Foata normal form. 0/683 useless extension candidates. Maximal degree in co-relation 913. Up to 26 conditions per place. [2020-10-09 15:38:02,016 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 8 selfloop transitions, 1 changer transitions 0/613 dead transitions. [2020-10-09 15:38:02,016 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 613 transitions, 1529 flow [2020-10-09 15:38:02,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:02,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:02,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2020-10-09 15:38:02,017 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2020-10-09 15:38:02,017 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1972 transitions. [2020-10-09 15:38:02,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1972 transitions. [2020-10-09 15:38:02,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:02,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1972 transitions. [2020-10-09 15:38:02,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:02,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:02,019 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:02,019 INFO L185 Difference]: Start difference. First operand has 703 places, 615 transitions, 1516 flow. Second operand 3 states and 1972 transitions. [2020-10-09 15:38:02,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 613 transitions, 1529 flow [2020-10-09 15:38:02,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 613 transitions, 1528 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:02,026 INFO L241 Difference]: Finished difference. Result has 702 places, 613 transitions, 1512 flow [2020-10-09 15:38:02,026 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1512, PETRI_PLACES=702, PETRI_TRANSITIONS=613} [2020-10-09 15:38:02,026 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 60 predicate places. [2020-10-09 15:38:02,026 INFO L481 AbstractCegarLoop]: Abstraction has has 702 places, 613 transitions, 1512 flow [2020-10-09 15:38:02,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:02,026 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:02,026 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:02,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 930 mathsat -unsat_core_generation=3 [2020-10-09 15:38:02,227 INFO L429 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:02,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:02,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2128317368, now seen corresponding path program 1 times [2020-10-09 15:38:02,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:02,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343819325] [2020-10-09 15:38:02,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 931 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 931 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:02,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:02,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:38:02,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:02,768 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:38:02,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343819325] [2020-10-09 15:38:02,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:02,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:02,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391119481] [2020-10-09 15:38:02,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:02,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:02,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:02,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:02,802 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:38:02,803 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 613 transitions, 1512 flow. Second operand 3 states. [2020-10-09 15:38:02,803 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:02,803 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:38:02,803 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:03,129 INFO L129 PetriNetUnfolder]: 26/743 cut-off events. [2020-10-09 15:38:03,129 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:38:03,151 INFO L80 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 743 events. 26/743 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3258 event pairs, 0 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 925. Up to 26 conditions per place. [2020-10-09 15:38:03,155 INFO L132 encePairwiseOnDemand]: 687/692 looper letters, 10 selfloop transitions, 3 changer transitions 0/615 dead transitions. [2020-10-09 15:38:03,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 615 transitions, 1542 flow [2020-10-09 15:38:03,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:03,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions. [2020-10-09 15:38:03,156 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523121387283237 [2020-10-09 15:38:03,156 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions. [2020-10-09 15:38:03,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions. [2020-10-09 15:38:03,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:03,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions. [2020-10-09 15:38:03,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:03,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:03,158 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:03,158 INFO L185 Difference]: Start difference. First operand has 702 places, 613 transitions, 1512 flow. Second operand 3 states and 1977 transitions. [2020-10-09 15:38:03,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 615 transitions, 1542 flow [2020-10-09 15:38:03,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 615 transitions, 1541 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:03,164 INFO L241 Difference]: Finished difference. Result has 705 places, 615 transitions, 1535 flow [2020-10-09 15:38:03,165 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1535, PETRI_PLACES=705, PETRI_TRANSITIONS=615} [2020-10-09 15:38:03,165 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 63 predicate places. [2020-10-09 15:38:03,165 INFO L481 AbstractCegarLoop]: Abstraction has has 705 places, 615 transitions, 1535 flow [2020-10-09 15:38:03,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:03,165 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:03,165 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:03,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 931 mathsat -unsat_core_generation=3 [2020-10-09 15:38:03,366 INFO L429 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:03,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:03,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2128318391, now seen corresponding path program 1 times [2020-10-09 15:38:03,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:03,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085337807] [2020-10-09 15:38:03,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 932 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 932 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:03,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:03,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:38:03,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:38:03,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085337807] [2020-10-09 15:38:03,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:03,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:03,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221085901] [2020-10-09 15:38:03,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:03,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:03,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:03,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:03,927 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:38:03,928 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 615 transitions, 1535 flow. Second operand 3 states. [2020-10-09 15:38:03,928 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:03,928 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:38:03,928 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:04,181 INFO L129 PetriNetUnfolder]: 25/741 cut-off events. [2020-10-09 15:38:04,182 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:38:04,226 INFO L80 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 741 events. 25/741 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3248 event pairs, 0 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 922. Up to 26 conditions per place. [2020-10-09 15:38:04,231 INFO L132 encePairwiseOnDemand]: 689/692 looper letters, 5 selfloop transitions, 2 changer transitions 0/615 dead transitions. [2020-10-09 15:38:04,231 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 615 transitions, 1547 flow [2020-10-09 15:38:04,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1985 transitions. [2020-10-09 15:38:04,233 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561657032755299 [2020-10-09 15:38:04,233 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1985 transitions. [2020-10-09 15:38:04,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1985 transitions. [2020-10-09 15:38:04,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:04,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1985 transitions. [2020-10-09 15:38:04,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:04,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:04,235 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:04,235 INFO L185 Difference]: Start difference. First operand has 705 places, 615 transitions, 1535 flow. Second operand 3 states and 1985 transitions. [2020-10-09 15:38:04,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 615 transitions, 1547 flow [2020-10-09 15:38:04,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 615 transitions, 1542 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:04,241 INFO L241 Difference]: Finished difference. Result has 708 places, 615 transitions, 1540 flow [2020-10-09 15:38:04,242 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1526, PETRI_DIFFERENCE_MINUEND_PLACES=704, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1540, PETRI_PLACES=708, PETRI_TRANSITIONS=615} [2020-10-09 15:38:04,242 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 66 predicate places. [2020-10-09 15:38:04,242 INFO L481 AbstractCegarLoop]: Abstraction has has 708 places, 615 transitions, 1540 flow [2020-10-09 15:38:04,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:04,242 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:04,242 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:04,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 932 mathsat -unsat_core_generation=3 [2020-10-09 15:38:04,443 INFO L429 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:04,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:04,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2129270680, now seen corresponding path program 1 times [2020-10-09 15:38:04,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:04,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752943449] [2020-10-09 15:38:04,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 933 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 933 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:04,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:38:04,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:04,980 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:38:04,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:38:04,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752943449] [2020-10-09 15:38:04,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:04,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:04,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308956142] [2020-10-09 15:38:04,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:04,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:04,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:04,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:04,999 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:38:05,000 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 615 transitions, 1540 flow. Second operand 3 states. [2020-10-09 15:38:05,000 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:05,000 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:38:05,000 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:05,250 INFO L129 PetriNetUnfolder]: 24/737 cut-off events. [2020-10-09 15:38:05,250 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:38:05,292 INFO L80 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 737 events. 24/737 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3221 event pairs, 0 based on Foata normal form. 1/690 useless extension candidates. Maximal degree in co-relation 918. Up to 26 conditions per place. [2020-10-09 15:38:05,296 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/612 dead transitions. [2020-10-09 15:38:05,296 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 612 transitions, 1535 flow [2020-10-09 15:38:05,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:05,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:38:05,297 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:38:05,298 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:38:05,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:38:05,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:05,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:38:05,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:05,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:05,300 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:05,300 INFO L185 Difference]: Start difference. First operand has 708 places, 615 transitions, 1540 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:38:05,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 612 transitions, 1535 flow [2020-10-09 15:38:05,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 612 transitions, 1528 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:38:05,306 INFO L241 Difference]: Finished difference. Result has 707 places, 612 transitions, 1520 flow [2020-10-09 15:38:05,306 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1518, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1520, PETRI_PLACES=707, PETRI_TRANSITIONS=612} [2020-10-09 15:38:05,306 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 65 predicate places. [2020-10-09 15:38:05,306 INFO L481 AbstractCegarLoop]: Abstraction has has 707 places, 612 transitions, 1520 flow [2020-10-09 15:38:05,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:05,307 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:05,307 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:05,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 933 mathsat -unsat_core_generation=3 [2020-10-09 15:38:05,507 INFO L429 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:05,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:05,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2129271703, now seen corresponding path program 1 times [2020-10-09 15:38:05,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:05,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920632162] [2020-10-09 15:38:05,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 934 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 934 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:06,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:06,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:06,052 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:38:06,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:38:06,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920632162] [2020-10-09 15:38:06,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:06,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:06,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104482643] [2020-10-09 15:38:06,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:06,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:06,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:06,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:06,092 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:38:06,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 612 transitions, 1520 flow. Second operand 3 states. [2020-10-09 15:38:06,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:06,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:38:06,093 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:06,357 INFO L129 PetriNetUnfolder]: 24/735 cut-off events. [2020-10-09 15:38:06,358 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:38:06,404 INFO L80 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 735 events. 24/735 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3205 event pairs, 0 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 920. Up to 26 conditions per place. [2020-10-09 15:38:06,408 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 8 selfloop transitions, 1 changer transitions 0/610 dead transitions. [2020-10-09 15:38:06,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 610 transitions, 1533 flow [2020-10-09 15:38:06,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2020-10-09 15:38:06,409 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2020-10-09 15:38:06,409 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1972 transitions. [2020-10-09 15:38:06,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1972 transitions. [2020-10-09 15:38:06,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:06,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1972 transitions. [2020-10-09 15:38:06,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:06,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:06,411 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:06,412 INFO L185 Difference]: Start difference. First operand has 707 places, 612 transitions, 1520 flow. Second operand 3 states and 1972 transitions. [2020-10-09 15:38:06,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 610 transitions, 1533 flow [2020-10-09 15:38:06,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 610 transitions, 1532 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:06,418 INFO L241 Difference]: Finished difference. Result has 706 places, 610 transitions, 1516 flow [2020-10-09 15:38:06,419 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1514, PETRI_DIFFERENCE_MINUEND_PLACES=704, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1516, PETRI_PLACES=706, PETRI_TRANSITIONS=610} [2020-10-09 15:38:06,419 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 64 predicate places. [2020-10-09 15:38:06,419 INFO L481 AbstractCegarLoop]: Abstraction has has 706 places, 610 transitions, 1516 flow [2020-10-09 15:38:06,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:06,419 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:06,419 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:06,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 934 mathsat -unsat_core_generation=3 [2020-10-09 15:38:06,620 INFO L429 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:06,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:06,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1020071890, now seen corresponding path program 1 times [2020-10-09 15:38:06,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:06,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356623607] [2020-10-09 15:38:06,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 935 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 935 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:07,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:07,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:38:07,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:38:07,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356623607] [2020-10-09 15:38:07,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:07,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:07,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760771007] [2020-10-09 15:38:07,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:07,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:07,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:07,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:07,199 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:38:07,199 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 610 transitions, 1516 flow. Second operand 3 states. [2020-10-09 15:38:07,199 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:07,199 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:38:07,199 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:07,462 INFO L129 PetriNetUnfolder]: 23/743 cut-off events. [2020-10-09 15:38:07,462 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:38:07,507 INFO L80 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 743 events. 23/743 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3276 event pairs, 0 based on Foata normal form. 0/694 useless extension candidates. Maximal degree in co-relation 932. Up to 26 conditions per place. [2020-10-09 15:38:07,510 INFO L132 encePairwiseOnDemand]: 687/692 looper letters, 10 selfloop transitions, 3 changer transitions 0/612 dead transitions. [2020-10-09 15:38:07,510 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 612 transitions, 1546 flow [2020-10-09 15:38:07,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions. [2020-10-09 15:38:07,512 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523121387283237 [2020-10-09 15:38:07,512 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions. [2020-10-09 15:38:07,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions. [2020-10-09 15:38:07,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:07,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions. [2020-10-09 15:38:07,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:07,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:07,514 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:07,514 INFO L185 Difference]: Start difference. First operand has 706 places, 610 transitions, 1516 flow. Second operand 3 states and 1977 transitions. [2020-10-09 15:38:07,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 612 transitions, 1546 flow [2020-10-09 15:38:07,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 612 transitions, 1545 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:07,520 INFO L241 Difference]: Finished difference. Result has 709 places, 612 transitions, 1539 flow [2020-10-09 15:38:07,521 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1539, PETRI_PLACES=709, PETRI_TRANSITIONS=612} [2020-10-09 15:38:07,521 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 67 predicate places. [2020-10-09 15:38:07,521 INFO L481 AbstractCegarLoop]: Abstraction has has 709 places, 612 transitions, 1539 flow [2020-10-09 15:38:07,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:07,521 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:07,521 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:07,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 935 mathsat -unsat_core_generation=3 [2020-10-09 15:38:07,722 INFO L429 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:07,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:07,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1020070867, now seen corresponding path program 1 times [2020-10-09 15:38:07,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:07,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411309245] [2020-10-09 15:38:07,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 936 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 936 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:08,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:08,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:08,302 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:38:08,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:38:08,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411309245] [2020-10-09 15:38:08,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:08,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:08,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098888201] [2020-10-09 15:38:08,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:08,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:08,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:08,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:08,324 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:38:08,325 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 612 transitions, 1539 flow. Second operand 3 states. [2020-10-09 15:38:08,325 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:08,325 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:38:08,325 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:08,585 INFO L129 PetriNetUnfolder]: 22/741 cut-off events. [2020-10-09 15:38:08,585 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:38:08,628 INFO L80 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 741 events. 22/741 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3266 event pairs, 0 based on Foata normal form. 0/695 useless extension candidates. Maximal degree in co-relation 929. Up to 26 conditions per place. [2020-10-09 15:38:08,632 INFO L132 encePairwiseOnDemand]: 689/692 looper letters, 5 selfloop transitions, 2 changer transitions 0/612 dead transitions. [2020-10-09 15:38:08,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 612 transitions, 1551 flow [2020-10-09 15:38:08,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1985 transitions. [2020-10-09 15:38:08,633 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9561657032755299 [2020-10-09 15:38:08,633 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1985 transitions. [2020-10-09 15:38:08,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1985 transitions. [2020-10-09 15:38:08,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:08,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1985 transitions. [2020-10-09 15:38:08,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:08,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:08,635 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:08,635 INFO L185 Difference]: Start difference. First operand has 709 places, 612 transitions, 1539 flow. Second operand 3 states and 1985 transitions. [2020-10-09 15:38:08,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 711 places, 612 transitions, 1551 flow [2020-10-09 15:38:08,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 710 places, 612 transitions, 1546 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:08,642 INFO L241 Difference]: Finished difference. Result has 712 places, 612 transitions, 1544 flow [2020-10-09 15:38:08,642 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1530, PETRI_DIFFERENCE_MINUEND_PLACES=708, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1544, PETRI_PLACES=712, PETRI_TRANSITIONS=612} [2020-10-09 15:38:08,642 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 70 predicate places. [2020-10-09 15:38:08,642 INFO L481 AbstractCegarLoop]: Abstraction has has 712 places, 612 transitions, 1544 flow [2020-10-09 15:38:08,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:08,642 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:08,642 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:08,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 936 mathsat -unsat_core_generation=3 [2020-10-09 15:38:08,843 INFO L429 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:08,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:08,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1019118578, now seen corresponding path program 1 times [2020-10-09 15:38:08,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:08,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804780951] [2020-10-09 15:38:08,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 937 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 937 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:09,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:38:09,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:38:09,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:38:09,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804780951] [2020-10-09 15:38:09,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:09,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:09,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632614330] [2020-10-09 15:38:09,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:09,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:09,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:09,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:09,407 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:38:09,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 612 transitions, 1544 flow. Second operand 3 states. [2020-10-09 15:38:09,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:09,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:38:09,408 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:09,666 INFO L129 PetriNetUnfolder]: 21/737 cut-off events. [2020-10-09 15:38:09,666 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:38:09,709 INFO L80 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 737 events. 21/737 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3241 event pairs, 0 based on Foata normal form. 1/693 useless extension candidates. Maximal degree in co-relation 925. Up to 26 conditions per place. [2020-10-09 15:38:09,713 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/609 dead transitions. [2020-10-09 15:38:09,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 609 transitions, 1539 flow [2020-10-09 15:38:09,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:09,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:38:09,714 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:38:09,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:38:09,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:38:09,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:09,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:38:09,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:09,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:09,716 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:09,716 INFO L185 Difference]: Start difference. First operand has 712 places, 612 transitions, 1544 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:38:09,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 609 transitions, 1539 flow [2020-10-09 15:38:09,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 609 transitions, 1532 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:38:09,723 INFO L241 Difference]: Finished difference. Result has 711 places, 609 transitions, 1524 flow [2020-10-09 15:38:09,724 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1522, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1524, PETRI_PLACES=711, PETRI_TRANSITIONS=609} [2020-10-09 15:38:09,724 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 69 predicate places. [2020-10-09 15:38:09,724 INFO L481 AbstractCegarLoop]: Abstraction has has 711 places, 609 transitions, 1524 flow [2020-10-09 15:38:09,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:09,724 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:09,724 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:09,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 937 mathsat -unsat_core_generation=3 [2020-10-09 15:38:09,925 INFO L429 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:09,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:09,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1019117555, now seen corresponding path program 1 times [2020-10-09 15:38:09,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:09,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242347745] [2020-10-09 15:38:09,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 938 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 938 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:10,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:10,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:38:10,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:38:10,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242347745] [2020-10-09 15:38:10,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:10,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:10,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747515525] [2020-10-09 15:38:10,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:10,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:10,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:10,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:10,496 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:38:10,496 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 711 places, 609 transitions, 1524 flow. Second operand 3 states. [2020-10-09 15:38:10,496 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:10,497 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:38:10,497 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:10,758 INFO L129 PetriNetUnfolder]: 21/735 cut-off events. [2020-10-09 15:38:10,758 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:38:10,804 INFO L80 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 735 events. 21/735 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3223 event pairs, 0 based on Foata normal form. 0/689 useless extension candidates. Maximal degree in co-relation 927. Up to 26 conditions per place. [2020-10-09 15:38:10,808 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 8 selfloop transitions, 1 changer transitions 0/607 dead transitions. [2020-10-09 15:38:10,808 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 607 transitions, 1537 flow [2020-10-09 15:38:10,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2020-10-09 15:38:10,809 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2020-10-09 15:38:10,810 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1972 transitions. [2020-10-09 15:38:10,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1972 transitions. [2020-10-09 15:38:10,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:10,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1972 transitions. [2020-10-09 15:38:10,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:10,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:10,812 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:10,813 INFO L185 Difference]: Start difference. First operand has 711 places, 609 transitions, 1524 flow. Second operand 3 states and 1972 transitions. [2020-10-09 15:38:10,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 711 places, 607 transitions, 1537 flow [2020-10-09 15:38:10,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 710 places, 607 transitions, 1536 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:10,820 INFO L241 Difference]: Finished difference. Result has 710 places, 607 transitions, 1520 flow [2020-10-09 15:38:10,820 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1518, PETRI_DIFFERENCE_MINUEND_PLACES=708, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1520, PETRI_PLACES=710, PETRI_TRANSITIONS=607} [2020-10-09 15:38:10,820 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 68 predicate places. [2020-10-09 15:38:10,821 INFO L481 AbstractCegarLoop]: Abstraction has has 710 places, 607 transitions, 1520 flow [2020-10-09 15:38:10,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:10,821 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:10,821 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:11,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 938 mathsat -unsat_core_generation=3 [2020-10-09 15:38:11,024 INFO L429 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:11,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:11,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1506525820, now seen corresponding path program 1 times [2020-10-09 15:38:11,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:11,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670028261] [2020-10-09 15:38:11,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 939 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 939 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:11,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:11,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:38:11,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:11,572 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:38:11,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670028261] [2020-10-09 15:38:11,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:11,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:11,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511396460] [2020-10-09 15:38:11,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:11,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:11,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:11,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:11,592 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:38:11,594 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 607 transitions, 1520 flow. Second operand 3 states. [2020-10-09 15:38:11,594 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:11,594 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:38:11,594 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:11,865 INFO L129 PetriNetUnfolder]: 20/743 cut-off events. [2020-10-09 15:38:11,865 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:38:11,911 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 743 events. 20/743 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3292 event pairs, 0 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 939. Up to 26 conditions per place. [2020-10-09 15:38:11,914 INFO L132 encePairwiseOnDemand]: 687/692 looper letters, 10 selfloop transitions, 3 changer transitions 0/609 dead transitions. [2020-10-09 15:38:11,914 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 609 transitions, 1550 flow [2020-10-09 15:38:11,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions. [2020-10-09 15:38:11,916 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523121387283237 [2020-10-09 15:38:11,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions. [2020-10-09 15:38:11,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions. [2020-10-09 15:38:11,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:11,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions. [2020-10-09 15:38:11,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:11,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:11,918 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:11,919 INFO L185 Difference]: Start difference. First operand has 710 places, 607 transitions, 1520 flow. Second operand 3 states and 1977 transitions. [2020-10-09 15:38:11,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 609 transitions, 1550 flow [2020-10-09 15:38:11,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 609 transitions, 1549 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:11,925 INFO L241 Difference]: Finished difference. Result has 713 places, 609 transitions, 1543 flow [2020-10-09 15:38:11,926 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1543, PETRI_PLACES=713, PETRI_TRANSITIONS=609} [2020-10-09 15:38:11,926 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 71 predicate places. [2020-10-09 15:38:11,926 INFO L481 AbstractCegarLoop]: Abstraction has has 713 places, 609 transitions, 1543 flow [2020-10-09 15:38:11,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:11,926 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:11,926 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:12,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 939 mathsat -unsat_core_generation=3 [2020-10-09 15:38:12,127 INFO L429 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:12,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:12,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1506526843, now seen corresponding path program 1 times [2020-10-09 15:38:12,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:12,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724388735] [2020-10-09 15:38:12,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 940 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 940 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:12,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:38:12,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:12,707 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:38:12,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:38:12,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724388735] [2020-10-09 15:38:12,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:12,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:12,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498037697] [2020-10-09 15:38:12,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:12,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:12,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:12,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:12,725 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:38:12,726 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 609 transitions, 1543 flow. Second operand 3 states. [2020-10-09 15:38:12,726 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:12,726 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:38:12,727 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:12,988 INFO L129 PetriNetUnfolder]: 18/744 cut-off events. [2020-10-09 15:38:12,989 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:38:13,032 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 744 events. 18/744 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3316 event pairs, 0 based on Foata normal form. 1/703 useless extension candidates. Maximal degree in co-relation 937. Up to 26 conditions per place. [2020-10-09 15:38:13,035 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/608 dead transitions. [2020-10-09 15:38:13,035 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 608 transitions, 1549 flow [2020-10-09 15:38:13,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:13,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:38:13,036 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:38:13,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:38:13,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:38:13,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:13,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:38:13,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:13,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:13,038 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:13,038 INFO L185 Difference]: Start difference. First operand has 713 places, 609 transitions, 1543 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:38:13,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 715 places, 608 transitions, 1549 flow [2020-10-09 15:38:13,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 714 places, 608 transitions, 1544 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:13,046 INFO L241 Difference]: Finished difference. Result has 715 places, 608 transitions, 1539 flow [2020-10-09 15:38:13,046 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1534, PETRI_DIFFERENCE_MINUEND_PLACES=712, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1539, PETRI_PLACES=715, PETRI_TRANSITIONS=608} [2020-10-09 15:38:13,046 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 73 predicate places. [2020-10-09 15:38:13,046 INFO L481 AbstractCegarLoop]: Abstraction has has 715 places, 608 transitions, 1539 flow [2020-10-09 15:38:13,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:13,046 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:13,046 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:13,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 940 mathsat -unsat_core_generation=3 [2020-10-09 15:38:13,247 INFO L429 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:13,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:13,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1507479132, now seen corresponding path program 1 times [2020-10-09 15:38:13,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:13,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739714838] [2020-10-09 15:38:13,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 941 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 941 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:13,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:13,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:38:13,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:38:13,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739714838] [2020-10-09 15:38:13,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:13,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:13,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180601765] [2020-10-09 15:38:13,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:13,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:13,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:13,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:13,803 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:38:13,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 608 transitions, 1539 flow. Second operand 3 states. [2020-10-09 15:38:13,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:13,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:38:13,805 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:14,062 INFO L129 PetriNetUnfolder]: 18/737 cut-off events. [2020-10-09 15:38:14,062 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:38:14,104 INFO L80 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 737 events. 18/737 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3255 event pairs, 0 based on Foata normal form. 1/696 useless extension candidates. Maximal degree in co-relation 933. Up to 26 conditions per place. [2020-10-09 15:38:14,107 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 5 selfloop transitions, 1 changer transitions 0/606 dead transitions. [2020-10-09 15:38:14,107 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 606 transitions, 1542 flow [2020-10-09 15:38:14,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2020-10-09 15:38:14,109 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9556840077071291 [2020-10-09 15:38:14,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2020-10-09 15:38:14,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2020-10-09 15:38:14,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:14,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2020-10-09 15:38:14,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:14,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:14,111 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:14,111 INFO L185 Difference]: Start difference. First operand has 715 places, 608 transitions, 1539 flow. Second operand 3 states and 1984 transitions. [2020-10-09 15:38:14,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 717 places, 606 transitions, 1542 flow [2020-10-09 15:38:14,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 714 places, 606 transitions, 1535 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:38:14,117 INFO L241 Difference]: Finished difference. Result has 715 places, 606 transitions, 1528 flow [2020-10-09 15:38:14,118 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=712, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1528, PETRI_PLACES=715, PETRI_TRANSITIONS=606} [2020-10-09 15:38:14,118 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 73 predicate places. [2020-10-09 15:38:14,118 INFO L481 AbstractCegarLoop]: Abstraction has has 715 places, 606 transitions, 1528 flow [2020-10-09 15:38:14,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:14,118 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:14,118 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:14,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 941 mathsat -unsat_core_generation=3 [2020-10-09 15:38:14,319 INFO L429 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:14,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:14,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1507480155, now seen corresponding path program 1 times [2020-10-09 15:38:14,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:14,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409692435] [2020-10-09 15:38:14,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 942 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 942 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:14,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:14,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:38:14,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:14,859 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:38:14,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409692435] [2020-10-09 15:38:14,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:14,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:14,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527040243] [2020-10-09 15:38:14,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:14,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:14,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:14,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:14,887 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:38:14,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 606 transitions, 1528 flow. Second operand 3 states. [2020-10-09 15:38:14,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:14,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:38:14,888 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:15,145 INFO L129 PetriNetUnfolder]: 18/735 cut-off events. [2020-10-09 15:38:15,145 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:38:15,187 INFO L80 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 735 events. 18/735 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3239 event pairs, 0 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 933. Up to 26 conditions per place. [2020-10-09 15:38:15,190 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 8 selfloop transitions, 1 changer transitions 0/604 dead transitions. [2020-10-09 15:38:15,190 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 604 transitions, 1541 flow [2020-10-09 15:38:15,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:15,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2020-10-09 15:38:15,192 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2020-10-09 15:38:15,192 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1972 transitions. [2020-10-09 15:38:15,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1972 transitions. [2020-10-09 15:38:15,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:15,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1972 transitions. [2020-10-09 15:38:15,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:15,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:15,194 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:15,194 INFO L185 Difference]: Start difference. First operand has 715 places, 606 transitions, 1528 flow. Second operand 3 states and 1972 transitions. [2020-10-09 15:38:15,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 715 places, 604 transitions, 1541 flow [2020-10-09 15:38:15,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 714 places, 604 transitions, 1540 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:15,200 INFO L241 Difference]: Finished difference. Result has 714 places, 604 transitions, 1524 flow [2020-10-09 15:38:15,200 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1522, PETRI_DIFFERENCE_MINUEND_PLACES=712, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1524, PETRI_PLACES=714, PETRI_TRANSITIONS=604} [2020-10-09 15:38:15,200 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 72 predicate places. [2020-10-09 15:38:15,200 INFO L481 AbstractCegarLoop]: Abstraction has has 714 places, 604 transitions, 1524 flow [2020-10-09 15:38:15,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:15,201 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:15,201 INFO L255 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:15,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 942 mathsat -unsat_core_generation=3 [2020-10-09 15:38:15,401 INFO L429 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:15,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:15,402 INFO L82 PathProgramCache]: Analyzing trace with hash 208932220, now seen corresponding path program 1 times [2020-10-09 15:38:15,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:15,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470447543] [2020-10-09 15:38:15,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 943 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 943 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:15,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:15,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:38:15,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:38:15,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470447543] [2020-10-09 15:38:15,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:15,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:15,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347885108] [2020-10-09 15:38:15,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:15,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:15,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:15,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:15,968 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:38:15,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 714 places, 604 transitions, 1524 flow. Second operand 3 states. [2020-10-09 15:38:15,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:15,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:38:15,969 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:16,238 INFO L129 PetriNetUnfolder]: 17/743 cut-off events. [2020-10-09 15:38:16,238 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:38:16,282 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 743 events. 17/743 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3309 event pairs, 0 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 945. Up to 26 conditions per place. [2020-10-09 15:38:16,285 INFO L132 encePairwiseOnDemand]: 687/692 looper letters, 10 selfloop transitions, 3 changer transitions 0/606 dead transitions. [2020-10-09 15:38:16,285 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 716 places, 606 transitions, 1554 flow [2020-10-09 15:38:16,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions. [2020-10-09 15:38:16,287 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523121387283237 [2020-10-09 15:38:16,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions. [2020-10-09 15:38:16,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions. [2020-10-09 15:38:16,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:16,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions. [2020-10-09 15:38:16,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:16,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:16,289 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:16,289 INFO L185 Difference]: Start difference. First operand has 714 places, 604 transitions, 1524 flow. Second operand 3 states and 1977 transitions. [2020-10-09 15:38:16,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 716 places, 606 transitions, 1554 flow [2020-10-09 15:38:16,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 606 transitions, 1553 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:16,295 INFO L241 Difference]: Finished difference. Result has 717 places, 606 transitions, 1547 flow [2020-10-09 15:38:16,296 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1547, PETRI_PLACES=717, PETRI_TRANSITIONS=606} [2020-10-09 15:38:16,296 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 75 predicate places. [2020-10-09 15:38:16,296 INFO L481 AbstractCegarLoop]: Abstraction has has 717 places, 606 transitions, 1547 flow [2020-10-09 15:38:16,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:16,296 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:16,296 INFO L255 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:16,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 943 mathsat -unsat_core_generation=3 [2020-10-09 15:38:16,497 INFO L429 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:16,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:16,497 INFO L82 PathProgramCache]: Analyzing trace with hash 208931197, now seen corresponding path program 1 times [2020-10-09 15:38:16,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:16,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275648869] [2020-10-09 15:38:16,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 944 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 944 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:17,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:38:17,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:38:17,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:38:17,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275648869] [2020-10-09 15:38:17,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:17,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:17,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086936648] [2020-10-09 15:38:17,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:17,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:17,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:17,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:17,078 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:38:17,079 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 606 transitions, 1547 flow. Second operand 3 states. [2020-10-09 15:38:17,079 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:17,079 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:38:17,079 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:17,387 INFO L129 PetriNetUnfolder]: 15/744 cut-off events. [2020-10-09 15:38:17,388 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:38:17,430 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 744 events. 15/744 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3331 event pairs, 0 based on Foata normal form. 1/706 useless extension candidates. Maximal degree in co-relation 943. Up to 26 conditions per place. [2020-10-09 15:38:17,432 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/605 dead transitions. [2020-10-09 15:38:17,432 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 605 transitions, 1553 flow [2020-10-09 15:38:17,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:38:17,434 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:38:17,434 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:38:17,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:38:17,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:17,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:38:17,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:17,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:17,436 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:17,437 INFO L185 Difference]: Start difference. First operand has 717 places, 606 transitions, 1547 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:38:17,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 605 transitions, 1553 flow [2020-10-09 15:38:17,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 718 places, 605 transitions, 1548 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:17,443 INFO L241 Difference]: Finished difference. Result has 719 places, 605 transitions, 1543 flow [2020-10-09 15:38:17,444 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=716, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1543, PETRI_PLACES=719, PETRI_TRANSITIONS=605} [2020-10-09 15:38:17,444 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 77 predicate places. [2020-10-09 15:38:17,444 INFO L481 AbstractCegarLoop]: Abstraction has has 719 places, 605 transitions, 1543 flow [2020-10-09 15:38:17,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:17,444 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:17,444 INFO L255 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:17,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 944 mathsat -unsat_core_generation=3 [2020-10-09 15:38:17,645 INFO L429 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:17,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:17,645 INFO L82 PathProgramCache]: Analyzing trace with hash 207978908, now seen corresponding path program 1 times [2020-10-09 15:38:17,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:17,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664838824] [2020-10-09 15:38:17,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 945 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 945 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:18,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:18,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:38:18,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:18,193 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:38:18,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664838824] [2020-10-09 15:38:18,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:18,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:18,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133411476] [2020-10-09 15:38:18,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:18,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:18,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:18,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:18,211 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:38:18,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 605 transitions, 1543 flow. Second operand 3 states. [2020-10-09 15:38:18,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:18,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:38:18,212 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:18,470 INFO L129 PetriNetUnfolder]: 15/737 cut-off events. [2020-10-09 15:38:18,470 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:38:18,513 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 737 events. 15/737 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3276 event pairs, 0 based on Foata normal form. 1/699 useless extension candidates. Maximal degree in co-relation 939. Up to 26 conditions per place. [2020-10-09 15:38:18,516 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 5 selfloop transitions, 1 changer transitions 0/603 dead transitions. [2020-10-09 15:38:18,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 603 transitions, 1546 flow [2020-10-09 15:38:18,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2020-10-09 15:38:18,517 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9556840077071291 [2020-10-09 15:38:18,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2020-10-09 15:38:18,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2020-10-09 15:38:18,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:18,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2020-10-09 15:38:18,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:18,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:18,519 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:18,520 INFO L185 Difference]: Start difference. First operand has 719 places, 605 transitions, 1543 flow. Second operand 3 states and 1984 transitions. [2020-10-09 15:38:18,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 603 transitions, 1546 flow [2020-10-09 15:38:18,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 718 places, 603 transitions, 1539 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:38:18,526 INFO L241 Difference]: Finished difference. Result has 719 places, 603 transitions, 1532 flow [2020-10-09 15:38:18,526 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1527, PETRI_DIFFERENCE_MINUEND_PLACES=716, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1532, PETRI_PLACES=719, PETRI_TRANSITIONS=603} [2020-10-09 15:38:18,526 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 77 predicate places. [2020-10-09 15:38:18,526 INFO L481 AbstractCegarLoop]: Abstraction has has 719 places, 603 transitions, 1532 flow [2020-10-09 15:38:18,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:18,527 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:18,527 INFO L255 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:18,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 945 mathsat -unsat_core_generation=3 [2020-10-09 15:38:18,727 INFO L429 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:18,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:18,728 INFO L82 PathProgramCache]: Analyzing trace with hash 207977885, now seen corresponding path program 1 times [2020-10-09 15:38:18,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:18,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603882932] [2020-10-09 15:38:18,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 946 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 946 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:19,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:19,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:38:19,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:38:19,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603882932] [2020-10-09 15:38:19,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:19,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:19,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218364022] [2020-10-09 15:38:19,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:19,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:19,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:19,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:19,313 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:38:19,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 603 transitions, 1532 flow. Second operand 3 states. [2020-10-09 15:38:19,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:19,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:38:19,314 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:19,606 INFO L129 PetriNetUnfolder]: 15/735 cut-off events. [2020-10-09 15:38:19,606 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:38:19,649 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 735 events. 15/735 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3261 event pairs, 0 based on Foata normal form. 0/695 useless extension candidates. Maximal degree in co-relation 939. Up to 26 conditions per place. [2020-10-09 15:38:19,652 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 8 selfloop transitions, 1 changer transitions 0/601 dead transitions. [2020-10-09 15:38:19,652 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 601 transitions, 1545 flow [2020-10-09 15:38:19,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2020-10-09 15:38:19,653 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2020-10-09 15:38:19,653 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1972 transitions. [2020-10-09 15:38:19,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1972 transitions. [2020-10-09 15:38:19,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:19,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1972 transitions. [2020-10-09 15:38:19,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:19,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:19,655 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:19,655 INFO L185 Difference]: Start difference. First operand has 719 places, 603 transitions, 1532 flow. Second operand 3 states and 1972 transitions. [2020-10-09 15:38:19,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 601 transitions, 1545 flow [2020-10-09 15:38:19,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 718 places, 601 transitions, 1544 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:19,662 INFO L241 Difference]: Finished difference. Result has 718 places, 601 transitions, 1528 flow [2020-10-09 15:38:19,662 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1526, PETRI_DIFFERENCE_MINUEND_PLACES=716, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1528, PETRI_PLACES=718, PETRI_TRANSITIONS=601} [2020-10-09 15:38:19,662 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 76 predicate places. [2020-10-09 15:38:19,662 INFO L481 AbstractCegarLoop]: Abstraction has has 718 places, 601 transitions, 1528 flow [2020-10-09 15:38:19,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:19,662 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:19,662 INFO L255 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:19,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 946 mathsat -unsat_core_generation=3 [2020-10-09 15:38:19,863 INFO L429 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:19,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:19,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2049186443, now seen corresponding path program 1 times [2020-10-09 15:38:19,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:19,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467654248] [2020-10-09 15:38:19,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 947 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 947 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:20,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:20,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:38:20,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:20,411 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:38:20,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467654248] [2020-10-09 15:38:20,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:20,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:20,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235057172] [2020-10-09 15:38:20,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:20,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:20,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:20,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:20,447 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:38:20,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 601 transitions, 1528 flow. Second operand 3 states. [2020-10-09 15:38:20,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:20,449 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:38:20,449 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:20,718 INFO L129 PetriNetUnfolder]: 14/743 cut-off events. [2020-10-09 15:38:20,718 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-09 15:38:20,761 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 743 events. 14/743 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3331 event pairs, 0 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 951. Up to 26 conditions per place. [2020-10-09 15:38:20,764 INFO L132 encePairwiseOnDemand]: 687/692 looper letters, 10 selfloop transitions, 3 changer transitions 0/603 dead transitions. [2020-10-09 15:38:20,764 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 603 transitions, 1558 flow [2020-10-09 15:38:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:20,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions. [2020-10-09 15:38:20,765 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9523121387283237 [2020-10-09 15:38:20,766 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions. [2020-10-09 15:38:20,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions. [2020-10-09 15:38:20,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:20,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions. [2020-10-09 15:38:20,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:20,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:20,768 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:20,768 INFO L185 Difference]: Start difference. First operand has 718 places, 601 transitions, 1528 flow. Second operand 3 states and 1977 transitions. [2020-10-09 15:38:20,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 603 transitions, 1558 flow [2020-10-09 15:38:20,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 603 transitions, 1557 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:20,776 INFO L241 Difference]: Finished difference. Result has 721 places, 603 transitions, 1551 flow [2020-10-09 15:38:20,776 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1527, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1551, PETRI_PLACES=721, PETRI_TRANSITIONS=603} [2020-10-09 15:38:20,776 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 79 predicate places. [2020-10-09 15:38:20,776 INFO L481 AbstractCegarLoop]: Abstraction has has 721 places, 603 transitions, 1551 flow [2020-10-09 15:38:20,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:20,777 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:20,777 INFO L255 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:20,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 947 mathsat -unsat_core_generation=3 [2020-10-09 15:38:20,990 INFO L429 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:20,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:20,990 INFO L82 PathProgramCache]: Analyzing trace with hash -2049187466, now seen corresponding path program 1 times [2020-10-09 15:38:20,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:20,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092791550] [2020-10-09 15:38:20,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 948 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 948 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:21,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:38:21,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:38:21,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:38:21,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092791550] [2020-10-09 15:38:21,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:21,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:21,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826664937] [2020-10-09 15:38:21,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:21,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:21,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:21,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:21,499 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 692 [2020-10-09 15:38:21,500 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 603 transitions, 1551 flow. Second operand 3 states. [2020-10-09 15:38:21,500 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:21,500 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 692 [2020-10-09 15:38:21,500 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:21,829 INFO L129 PetriNetUnfolder]: 12/744 cut-off events. [2020-10-09 15:38:21,829 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:38:21,856 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 744 events. 12/744 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3349 event pairs, 0 based on Foata normal form. 1/709 useless extension candidates. Maximal degree in co-relation 949. Up to 26 conditions per place. [2020-10-09 15:38:21,858 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 4 selfloop transitions, 1 changer transitions 0/602 dead transitions. [2020-10-09 15:38:21,858 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 602 transitions, 1557 flow [2020-10-09 15:38:21,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2020-10-09 15:38:21,859 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2020-10-09 15:38:21,860 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2020-10-09 15:38:21,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2020-10-09 15:38:21,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:21,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2020-10-09 15:38:21,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:21,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:21,862 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:21,862 INFO L185 Difference]: Start difference. First operand has 721 places, 603 transitions, 1551 flow. Second operand 3 states and 1986 transitions. [2020-10-09 15:38:21,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 723 places, 602 transitions, 1557 flow [2020-10-09 15:38:21,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 722 places, 602 transitions, 1552 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:21,868 INFO L241 Difference]: Finished difference. Result has 723 places, 602 transitions, 1547 flow [2020-10-09 15:38:21,868 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=720, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1547, PETRI_PLACES=723, PETRI_TRANSITIONS=602} [2020-10-09 15:38:21,868 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 81 predicate places. [2020-10-09 15:38:21,868 INFO L481 AbstractCegarLoop]: Abstraction has has 723 places, 602 transitions, 1547 flow [2020-10-09 15:38:21,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:21,868 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:21,869 INFO L255 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:22,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 948 mathsat -unsat_core_generation=3 [2020-10-09 15:38:22,069 INFO L429 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:22,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:22,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2050139755, now seen corresponding path program 1 times [2020-10-09 15:38:22,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:22,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655310074] [2020-10-09 15:38:22,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 949 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 949 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:22,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:22,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:22,613 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:38:22,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:38:22,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655310074] [2020-10-09 15:38:22,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:22,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:22,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651725217] [2020-10-09 15:38:22,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:22,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:22,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:22,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:22,630 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 692 [2020-10-09 15:38:22,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 602 transitions, 1547 flow. Second operand 3 states. [2020-10-09 15:38:22,632 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:22,632 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 692 [2020-10-09 15:38:22,632 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:22,906 INFO L129 PetriNetUnfolder]: 12/737 cut-off events. [2020-10-09 15:38:22,906 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:38:22,953 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 737 events. 12/737 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3291 event pairs, 0 based on Foata normal form. 1/702 useless extension candidates. Maximal degree in co-relation 945. Up to 26 conditions per place. [2020-10-09 15:38:22,956 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 5 selfloop transitions, 1 changer transitions 0/600 dead transitions. [2020-10-09 15:38:22,956 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 600 transitions, 1550 flow [2020-10-09 15:38:22,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2020-10-09 15:38:22,957 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9556840077071291 [2020-10-09 15:38:22,957 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2020-10-09 15:38:22,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2020-10-09 15:38:22,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:22,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2020-10-09 15:38:22,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:22,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:22,959 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:22,959 INFO L185 Difference]: Start difference. First operand has 723 places, 602 transitions, 1547 flow. Second operand 3 states and 1984 transitions. [2020-10-09 15:38:22,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 725 places, 600 transitions, 1550 flow [2020-10-09 15:38:22,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 722 places, 600 transitions, 1543 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:38:22,967 INFO L241 Difference]: Finished difference. Result has 723 places, 600 transitions, 1536 flow [2020-10-09 15:38:22,967 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=720, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1536, PETRI_PLACES=723, PETRI_TRANSITIONS=600} [2020-10-09 15:38:22,967 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 81 predicate places. [2020-10-09 15:38:22,967 INFO L481 AbstractCegarLoop]: Abstraction has has 723 places, 600 transitions, 1536 flow [2020-10-09 15:38:22,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:22,967 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:22,967 INFO L255 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:23,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 949 mathsat -unsat_core_generation=3 [2020-10-09 15:38:23,168 INFO L429 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:23,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:23,169 INFO L82 PathProgramCache]: Analyzing trace with hash -2050140778, now seen corresponding path program 1 times [2020-10-09 15:38:23,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:23,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683304530] [2020-10-09 15:38:23,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 950 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 950 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:23,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:23,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:38:23,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:38:23,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683304530] [2020-10-09 15:38:23,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:23,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:23,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707946366] [2020-10-09 15:38:23,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:23,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:23,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:23,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:23,756 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 692 [2020-10-09 15:38:23,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 600 transitions, 1536 flow. Second operand 3 states. [2020-10-09 15:38:23,758 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:23,758 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 692 [2020-10-09 15:38:23,758 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:24,033 INFO L129 PetriNetUnfolder]: 12/735 cut-off events. [2020-10-09 15:38:24,033 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:38:24,078 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 735 events. 12/735 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3275 event pairs, 0 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 945. Up to 26 conditions per place. [2020-10-09 15:38:24,080 INFO L132 encePairwiseOnDemand]: 690/692 looper letters, 8 selfloop transitions, 1 changer transitions 0/598 dead transitions. [2020-10-09 15:38:24,081 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 598 transitions, 1549 flow [2020-10-09 15:38:24,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:24,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2020-10-09 15:38:24,082 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2020-10-09 15:38:24,082 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1972 transitions. [2020-10-09 15:38:24,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1972 transitions. [2020-10-09 15:38:24,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:24,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1972 transitions. [2020-10-09 15:38:24,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:24,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:24,084 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:24,084 INFO L185 Difference]: Start difference. First operand has 723 places, 600 transitions, 1536 flow. Second operand 3 states and 1972 transitions. [2020-10-09 15:38:24,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 723 places, 598 transitions, 1549 flow [2020-10-09 15:38:24,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 722 places, 598 transitions, 1548 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:24,091 INFO L241 Difference]: Finished difference. Result has 722 places, 598 transitions, 1532 flow [2020-10-09 15:38:24,091 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=692, PETRI_DIFFERENCE_MINUEND_FLOW=1530, PETRI_DIFFERENCE_MINUEND_PLACES=720, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1532, PETRI_PLACES=722, PETRI_TRANSITIONS=598} [2020-10-09 15:38:24,091 INFO L341 CegarLoopForPetriNet]: 642 programPoint places, 80 predicate places. [2020-10-09 15:38:24,091 INFO L481 AbstractCegarLoop]: Abstraction has has 722 places, 598 transitions, 1532 flow [2020-10-09 15:38:24,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:24,091 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:24,091 INFO L255 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:24,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 950 mathsat -unsat_core_generation=3 [2020-10-09 15:38:24,292 INFO L429 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:24,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:24,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1915874916, now seen corresponding path program 1 times [2020-10-09 15:38:24,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:24,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188115598] [2020-10-09 15:38:24,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 951 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 951 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:38:24,840 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:38:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:38:24,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:38:24,944 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:38:24,944 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:38:25,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 951 mathsat -unsat_core_generation=3 [2020-10-09 15:38:25,146 WARN L371 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:38:25,147 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2020-10-09 15:38:25,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,209 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,215 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,215 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,215 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,215 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,215 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,220 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,220 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,220 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,222 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,239 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,239 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,239 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,242 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,242 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,242 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,242 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,242 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,247 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,247 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,247 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,285 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,285 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,290 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:38:25,317 INFO L253 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2020-10-09 15:38:25,317 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:38:25,317 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:38:25,317 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:38:25,317 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:38:25,318 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:38:25,318 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:38:25,318 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:38:25,318 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:38:25,323 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 667 places, 719 transitions, 2218 flow [2020-10-09 15:38:25,599 INFO L129 PetriNetUnfolder]: 131/952 cut-off events. [2020-10-09 15:38:25,599 INFO L130 PetriNetUnfolder]: For 3250/3250 co-relation queries the response was YES. [2020-10-09 15:38:25,664 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1382 conditions, 952 events. 131/952 cut-off events. For 3250/3250 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3975 event pairs, 0 based on Foata normal form. 0/768 useless extension candidates. Maximal degree in co-relation 1311. Up to 54 conditions per place. [2020-10-09 15:38:25,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 667 places, 719 transitions, 2218 flow [2020-10-09 15:38:25,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 667 places, 719 transitions, 2218 flow [2020-10-09 15:38:25,694 INFO L129 PetriNetUnfolder]: 9/95 cut-off events. [2020-10-09 15:38:25,695 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:38:25,695 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:25,695 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:25,695 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:25,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:25,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1326947014, now seen corresponding path program 1 times [2020-10-09 15:38:25,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:25,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007740762] [2020-10-09 15:38:25,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 952 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 952 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:26,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:38:26,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:38:26,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:38:26,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007740762] [2020-10-09 15:38:26,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:26,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:26,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222580384] [2020-10-09 15:38:26,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:26,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:26,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:26,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:26,253 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:38:26,254 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 719 transitions, 2218 flow. Second operand 3 states. [2020-10-09 15:38:26,254 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:26,254 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:38:26,254 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:26,499 INFO L129 PetriNetUnfolder]: 77/771 cut-off events. [2020-10-09 15:38:26,499 INFO L130 PetriNetUnfolder]: For 3251/3251 co-relation queries the response was YES. [2020-10-09 15:38:26,550 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 771 events. 77/771 cut-off events. For 3251/3251 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3073 event pairs, 0 based on Foata normal form. 106/773 useless extension candidates. Maximal degree in co-relation 1139. Up to 27 conditions per place. [2020-10-09 15:38:26,562 INFO L132 encePairwiseOnDemand]: 689/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/687 dead transitions. [2020-10-09 15:38:26,562 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 687 transitions, 2164 flow [2020-10-09 15:38:26,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:26,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2120 transitions. [2020-10-09 15:38:26,564 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9828465461288827 [2020-10-09 15:38:26,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2120 transitions. [2020-10-09 15:38:26,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2120 transitions. [2020-10-09 15:38:26,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:26,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2120 transitions. [2020-10-09 15:38:26,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:26,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:26,566 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:26,566 INFO L185 Difference]: Start difference. First operand has 667 places, 719 transitions, 2218 flow. Second operand 3 states and 2120 transitions. [2020-10-09 15:38:26,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 687 transitions, 2164 flow [2020-10-09 15:38:26,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 687 transitions, 1514 flow, removed 325 selfloop flow, removed 0 redundant places. [2020-10-09 15:38:26,577 INFO L241 Difference]: Finished difference. Result has 665 places, 687 transitions, 1509 flow [2020-10-09 15:38:26,577 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=662, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1509, PETRI_PLACES=665, PETRI_TRANSITIONS=687} [2020-10-09 15:38:26,577 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, -2 predicate places. [2020-10-09 15:38:26,577 INFO L481 AbstractCegarLoop]: Abstraction has has 665 places, 687 transitions, 1509 flow [2020-10-09 15:38:26,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:26,577 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:26,577 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:26,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 952 mathsat -unsat_core_generation=3 [2020-10-09 15:38:26,778 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:26,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:26,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1327899303, now seen corresponding path program 1 times [2020-10-09 15:38:26,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:26,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104884991] [2020-10-09 15:38:26,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 953 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 953 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:27,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:27,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:38:27,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:38:27,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104884991] [2020-10-09 15:38:27,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:27,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:27,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541346740] [2020-10-09 15:38:27,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:27,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:27,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:27,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:27,417 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:38:27,418 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 687 transitions, 1509 flow. Second operand 3 states. [2020-10-09 15:38:27,418 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:27,418 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:38:27,418 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:27,636 INFO L129 PetriNetUnfolder]: 75/768 cut-off events. [2020-10-09 15:38:27,637 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:38:27,679 INFO L80 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 768 events. 75/768 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3064 event pairs, 0 based on Foata normal form. 1/666 useless extension candidates. Maximal degree in co-relation 843. Up to 27 conditions per place. [2020-10-09 15:38:27,690 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 5 selfloop transitions, 1 changer transitions 0/687 dead transitions. [2020-10-09 15:38:27,691 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 687 transitions, 1521 flow [2020-10-09 15:38:27,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2020-10-09 15:38:27,692 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9559573481687529 [2020-10-09 15:38:27,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2020-10-09 15:38:27,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2020-10-09 15:38:27,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:27,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2020-10-09 15:38:27,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:27,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:27,694 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:27,694 INFO L185 Difference]: Start difference. First operand has 665 places, 687 transitions, 1509 flow. Second operand 3 states and 2062 transitions. [2020-10-09 15:38:27,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 687 transitions, 1521 flow [2020-10-09 15:38:27,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 687 transitions, 1520 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:27,700 INFO L241 Difference]: Finished difference. Result has 667 places, 687 transitions, 1513 flow [2020-10-09 15:38:27,700 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1508, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1513, PETRI_PLACES=667, PETRI_TRANSITIONS=687} [2020-10-09 15:38:27,700 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 0 predicate places. [2020-10-09 15:38:27,700 INFO L481 AbstractCegarLoop]: Abstraction has has 667 places, 687 transitions, 1513 flow [2020-10-09 15:38:27,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:27,700 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:27,701 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:27,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 953 mathsat -unsat_core_generation=3 [2020-10-09 15:38:27,901 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:27,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:27,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1327900326, now seen corresponding path program 1 times [2020-10-09 15:38:27,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:27,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051209803] [2020-10-09 15:38:27,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 954 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 954 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:28,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:28,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:28,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:38:28,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:38:28,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051209803] [2020-10-09 15:38:28,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:28,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:28,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708541550] [2020-10-09 15:38:28,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:28,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:28,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:28,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:28,475 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:38:28,477 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 687 transitions, 1513 flow. Second operand 3 states. [2020-10-09 15:38:28,477 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:28,477 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:38:28,477 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:28,691 INFO L129 PetriNetUnfolder]: 75/766 cut-off events. [2020-10-09 15:38:28,691 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:38:28,733 INFO L80 FinitePrefix]: Finished finitePrefix Result has 889 conditions, 766 events. 75/766 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3049 event pairs, 0 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 849. Up to 27 conditions per place. [2020-10-09 15:38:28,744 INFO L132 encePairwiseOnDemand]: 716/719 looper letters, 8 selfloop transitions, 2 changer transitions 0/686 dead transitions. [2020-10-09 15:38:28,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 669 places, 686 transitions, 1531 flow [2020-10-09 15:38:28,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:28,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2051 transitions. [2020-10-09 15:38:28,746 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508576726935558 [2020-10-09 15:38:28,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2051 transitions. [2020-10-09 15:38:28,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2051 transitions. [2020-10-09 15:38:28,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:28,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2051 transitions. [2020-10-09 15:38:28,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:28,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:28,748 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:28,748 INFO L185 Difference]: Start difference. First operand has 667 places, 687 transitions, 1513 flow. Second operand 3 states and 2051 transitions. [2020-10-09 15:38:28,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 669 places, 686 transitions, 1531 flow [2020-10-09 15:38:28,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 686 transitions, 1530 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:28,754 INFO L241 Difference]: Finished difference. Result has 668 places, 686 transitions, 1514 flow [2020-10-09 15:38:28,754 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=666, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1514, PETRI_PLACES=668, PETRI_TRANSITIONS=686} [2020-10-09 15:38:28,754 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 1 predicate places. [2020-10-09 15:38:28,754 INFO L481 AbstractCegarLoop]: Abstraction has has 668 places, 686 transitions, 1514 flow [2020-10-09 15:38:28,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:28,754 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:28,754 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:28,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 954 mathsat -unsat_core_generation=3 [2020-10-09 15:38:28,955 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:28,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:28,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1326945991, now seen corresponding path program 1 times [2020-10-09 15:38:28,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:28,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5916429] [2020-10-09 15:38:28,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 955 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 955 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:29,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:29,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:38:29,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:38:29,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5916429] [2020-10-09 15:38:29,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:29,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:29,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650680862] [2020-10-09 15:38:29,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:29,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:29,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:29,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:29,515 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:38:29,516 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 668 places, 686 transitions, 1514 flow. Second operand 3 states. [2020-10-09 15:38:29,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:29,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:38:29,516 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:29,737 INFO L129 PetriNetUnfolder]: 75/764 cut-off events. [2020-10-09 15:38:29,738 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:38:29,782 INFO L80 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 764 events. 75/764 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3037 event pairs, 0 based on Foata normal form. 1/665 useless extension candidates. Maximal degree in co-relation 844. Up to 27 conditions per place. [2020-10-09 15:38:29,793 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/684 dead transitions. [2020-10-09 15:38:29,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 684 transitions, 1526 flow [2020-10-09 15:38:29,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:29,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:38:29,795 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:38:29,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:38:29,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:38:29,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:29,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:38:29,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:29,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:29,797 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:29,797 INFO L185 Difference]: Start difference. First operand has 668 places, 686 transitions, 1514 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:38:29,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 684 transitions, 1526 flow [2020-10-09 15:38:29,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 684 transitions, 1525 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:29,803 INFO L241 Difference]: Finished difference. Result has 667 places, 684 transitions, 1509 flow [2020-10-09 15:38:29,803 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=665, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1509, PETRI_PLACES=667, PETRI_TRANSITIONS=684} [2020-10-09 15:38:29,804 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 0 predicate places. [2020-10-09 15:38:29,804 INFO L481 AbstractCegarLoop]: Abstraction has has 667 places, 684 transitions, 1509 flow [2020-10-09 15:38:29,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:29,804 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:29,804 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:38:30,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 955 mathsat -unsat_core_generation=3 [2020-10-09 15:38:30,005 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:30,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:30,005 INFO L82 PathProgramCache]: Analyzing trace with hash 283599993, now seen corresponding path program 1 times [2020-10-09 15:38:30,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:30,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905302526] [2020-10-09 15:38:30,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 956 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 956 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:30,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:30,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:38:30,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:38:30,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905302526] [2020-10-09 15:38:30,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:30,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:30,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872597658] [2020-10-09 15:38:30,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:30,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:30,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:30,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:30,573 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:38:30,573 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 684 transitions, 1509 flow. Second operand 3 states. [2020-10-09 15:38:30,574 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:30,574 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:38:30,574 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:30,798 INFO L129 PetriNetUnfolder]: 74/772 cut-off events. [2020-10-09 15:38:30,798 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:38:30,842 INFO L80 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 772 events. 74/772 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3105 event pairs, 0 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 859. Up to 27 conditions per place. [2020-10-09 15:38:30,854 INFO L132 encePairwiseOnDemand]: 714/719 looper letters, 10 selfloop transitions, 3 changer transitions 0/686 dead transitions. [2020-10-09 15:38:30,854 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 669 places, 686 transitions, 1539 flow [2020-10-09 15:38:30,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2055 transitions. [2020-10-09 15:38:30,856 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.952712100139082 [2020-10-09 15:38:30,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2055 transitions. [2020-10-09 15:38:30,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2055 transitions. [2020-10-09 15:38:30,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:30,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2055 transitions. [2020-10-09 15:38:30,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:30,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:30,858 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:30,858 INFO L185 Difference]: Start difference. First operand has 667 places, 684 transitions, 1509 flow. Second operand 3 states and 2055 transitions. [2020-10-09 15:38:30,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 669 places, 686 transitions, 1539 flow [2020-10-09 15:38:30,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 686 transitions, 1538 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:30,864 INFO L241 Difference]: Finished difference. Result has 670 places, 686 transitions, 1532 flow [2020-10-09 15:38:30,864 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1508, PETRI_DIFFERENCE_MINUEND_PLACES=666, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1532, PETRI_PLACES=670, PETRI_TRANSITIONS=686} [2020-10-09 15:38:30,864 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 3 predicate places. [2020-10-09 15:38:30,864 INFO L481 AbstractCegarLoop]: Abstraction has has 670 places, 686 transitions, 1532 flow [2020-10-09 15:38:30,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:30,864 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:30,864 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:38:31,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 956 mathsat -unsat_core_generation=3 [2020-10-09 15:38:31,065 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:31,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:31,065 INFO L82 PathProgramCache]: Analyzing trace with hash 283598970, now seen corresponding path program 1 times [2020-10-09 15:38:31,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:31,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459109900] [2020-10-09 15:38:31,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 957 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 957 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:31,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:38:31,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:38:31,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:31,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:38:31,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459109900] [2020-10-09 15:38:31,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:31,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:31,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412575773] [2020-10-09 15:38:31,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:31,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:31,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:31,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:31,629 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:38:31,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 670 places, 686 transitions, 1532 flow. Second operand 3 states. [2020-10-09 15:38:31,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:31,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:38:31,631 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:31,850 INFO L129 PetriNetUnfolder]: 72/773 cut-off events. [2020-10-09 15:38:31,850 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:38:31,893 INFO L80 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 773 events. 72/773 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3128 event pairs, 0 based on Foata normal form. 1/677 useless extension candidates. Maximal degree in co-relation 857. Up to 27 conditions per place. [2020-10-09 15:38:31,904 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/685 dead transitions. [2020-10-09 15:38:31,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 672 places, 685 transitions, 1538 flow [2020-10-09 15:38:31,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:38:31,906 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:38:31,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:38:31,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:38:31,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:31,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:38:31,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:31,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:31,908 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:31,908 INFO L185 Difference]: Start difference. First operand has 670 places, 686 transitions, 1532 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:38:31,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 672 places, 685 transitions, 1538 flow [2020-10-09 15:38:31,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 671 places, 685 transitions, 1533 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:31,914 INFO L241 Difference]: Finished difference. Result has 672 places, 685 transitions, 1528 flow [2020-10-09 15:38:31,915 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1528, PETRI_PLACES=672, PETRI_TRANSITIONS=685} [2020-10-09 15:38:31,915 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 5 predicate places. [2020-10-09 15:38:31,915 INFO L481 AbstractCegarLoop]: Abstraction has has 672 places, 685 transitions, 1528 flow [2020-10-09 15:38:31,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:31,915 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:31,915 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:38:32,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 957 mathsat -unsat_core_generation=3 [2020-10-09 15:38:32,116 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:32,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:32,116 INFO L82 PathProgramCache]: Analyzing trace with hash 282646681, now seen corresponding path program 1 times [2020-10-09 15:38:32,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:32,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799107060] [2020-10-09 15:38:32,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 958 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 958 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:32,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:32,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:38:32,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:38:32,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799107060] [2020-10-09 15:38:32,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:32,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:32,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846233226] [2020-10-09 15:38:32,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:32,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:32,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:32,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:32,727 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:38:32,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 672 places, 685 transitions, 1528 flow. Second operand 3 states. [2020-10-09 15:38:32,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:32,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:38:32,728 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:32,947 INFO L129 PetriNetUnfolder]: 72/766 cut-off events. [2020-10-09 15:38:32,947 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:38:32,989 INFO L80 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 766 events. 72/766 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3068 event pairs, 0 based on Foata normal form. 1/670 useless extension candidates. Maximal degree in co-relation 853. Up to 27 conditions per place. [2020-10-09 15:38:33,000 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 5 selfloop transitions, 1 changer transitions 0/683 dead transitions. [2020-10-09 15:38:33,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 674 places, 683 transitions, 1531 flow [2020-10-09 15:38:33,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:33,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:33,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2020-10-09 15:38:33,002 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9559573481687529 [2020-10-09 15:38:33,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2020-10-09 15:38:33,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2020-10-09 15:38:33,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:33,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2020-10-09 15:38:33,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:33,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:33,004 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:33,004 INFO L185 Difference]: Start difference. First operand has 672 places, 685 transitions, 1528 flow. Second operand 3 states and 2062 transitions. [2020-10-09 15:38:33,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 674 places, 683 transitions, 1531 flow [2020-10-09 15:38:33,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 671 places, 683 transitions, 1524 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:38:33,010 INFO L241 Difference]: Finished difference. Result has 672 places, 683 transitions, 1517 flow [2020-10-09 15:38:33,010 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1517, PETRI_PLACES=672, PETRI_TRANSITIONS=683} [2020-10-09 15:38:33,010 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 5 predicate places. [2020-10-09 15:38:33,010 INFO L481 AbstractCegarLoop]: Abstraction has has 672 places, 683 transitions, 1517 flow [2020-10-09 15:38:33,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:33,010 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:33,010 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:38:33,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 958 mathsat -unsat_core_generation=3 [2020-10-09 15:38:33,211 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:33,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:33,212 INFO L82 PathProgramCache]: Analyzing trace with hash 282645658, now seen corresponding path program 1 times [2020-10-09 15:38:33,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:33,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114425528] [2020-10-09 15:38:33,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 959 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 959 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:33,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:33,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:33,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:38:33,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:33,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:38:33,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114425528] [2020-10-09 15:38:33,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:33,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:33,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510623190] [2020-10-09 15:38:33,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:33,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:33,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:33,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:33,780 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:38:33,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 672 places, 683 transitions, 1517 flow. Second operand 3 states. [2020-10-09 15:38:33,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:33,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:38:33,781 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:34,005 INFO L129 PetriNetUnfolder]: 72/764 cut-off events. [2020-10-09 15:38:34,006 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:38:34,050 INFO L80 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 764 events. 72/764 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3051 event pairs, 0 based on Foata normal form. 0/666 useless extension candidates. Maximal degree in co-relation 853. Up to 27 conditions per place. [2020-10-09 15:38:34,061 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/681 dead transitions. [2020-10-09 15:38:34,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 672 places, 681 transitions, 1530 flow [2020-10-09 15:38:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:34,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:38:34,063 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:38:34,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:38:34,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:38:34,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:34,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:38:34,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:34,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:34,065 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:34,065 INFO L185 Difference]: Start difference. First operand has 672 places, 683 transitions, 1517 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:38:34,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 672 places, 681 transitions, 1530 flow [2020-10-09 15:38:34,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 671 places, 681 transitions, 1529 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:34,071 INFO L241 Difference]: Finished difference. Result has 671 places, 681 transitions, 1513 flow [2020-10-09 15:38:34,071 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1513, PETRI_PLACES=671, PETRI_TRANSITIONS=681} [2020-10-09 15:38:34,071 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 4 predicate places. [2020-10-09 15:38:34,071 INFO L481 AbstractCegarLoop]: Abstraction has has 671 places, 681 transitions, 1513 flow [2020-10-09 15:38:34,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:34,071 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:34,071 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:38:34,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 959 mathsat -unsat_core_generation=3 [2020-10-09 15:38:34,272 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:34,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:34,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1036091430, now seen corresponding path program 1 times [2020-10-09 15:38:34,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:34,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711155743] [2020-10-09 15:38:34,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 960 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 960 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:34,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:34,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:34,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:38:34,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:38:34,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711155743] [2020-10-09 15:38:34,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:34,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:34,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365781170] [2020-10-09 15:38:34,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:34,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:34,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:34,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:34,827 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:38:34,828 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 681 transitions, 1513 flow. Second operand 3 states. [2020-10-09 15:38:34,828 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:34,828 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:38:34,828 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:35,063 INFO L129 PetriNetUnfolder]: 70/769 cut-off events. [2020-10-09 15:38:35,064 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:38:35,108 INFO L80 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 769 events. 70/769 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3103 event pairs, 0 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 856. Up to 27 conditions per place. [2020-10-09 15:38:35,119 INFO L132 encePairwiseOnDemand]: 716/719 looper letters, 5 selfloop transitions, 2 changer transitions 0/682 dead transitions. [2020-10-09 15:38:35,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 682 transitions, 1529 flow [2020-10-09 15:38:35,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2063 transitions. [2020-10-09 15:38:35,121 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9564209550301345 [2020-10-09 15:38:35,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2063 transitions. [2020-10-09 15:38:35,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2063 transitions. [2020-10-09 15:38:35,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:35,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2063 transitions. [2020-10-09 15:38:35,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:35,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:35,123 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:35,124 INFO L185 Difference]: Start difference. First operand has 671 places, 681 transitions, 1513 flow. Second operand 3 states and 2063 transitions. [2020-10-09 15:38:35,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 682 transitions, 1529 flow [2020-10-09 15:38:35,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 672 places, 682 transitions, 1528 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:35,130 INFO L241 Difference]: Finished difference. Result has 674 places, 682 transitions, 1526 flow [2020-10-09 15:38:35,130 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=670, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1526, PETRI_PLACES=674, PETRI_TRANSITIONS=682} [2020-10-09 15:38:35,130 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 7 predicate places. [2020-10-09 15:38:35,130 INFO L481 AbstractCegarLoop]: Abstraction has has 674 places, 682 transitions, 1526 flow [2020-10-09 15:38:35,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:35,130 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:35,130 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:38:35,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 960 mathsat -unsat_core_generation=3 [2020-10-09 15:38:35,331 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:35,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:35,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1036092453, now seen corresponding path program 1 times [2020-10-09 15:38:35,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:35,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084279753] [2020-10-09 15:38:35,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 961 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 961 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:35,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:35,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:38:35,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:35,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:38:35,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084279753] [2020-10-09 15:38:35,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:35,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:35,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22965902] [2020-10-09 15:38:35,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:35,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:35,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:35,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:35,909 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:38:35,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 674 places, 682 transitions, 1526 flow. Second operand 3 states. [2020-10-09 15:38:35,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:35,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:38:35,911 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:36,144 INFO L129 PetriNetUnfolder]: 70/770 cut-off events. [2020-10-09 15:38:36,144 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:38:36,189 INFO L80 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 770 events. 70/770 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3111 event pairs, 0 based on Foata normal form. 0/673 useless extension candidates. Maximal degree in co-relation 864. Up to 27 conditions per place. [2020-10-09 15:38:36,200 INFO L132 encePairwiseOnDemand]: 715/719 looper letters, 9 selfloop transitions, 3 changer transitions 0/683 dead transitions. [2020-10-09 15:38:36,200 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 683 transitions, 1552 flow [2020-10-09 15:38:36,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:36,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2053 transitions. [2020-10-09 15:38:36,202 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.951784886416319 [2020-10-09 15:38:36,202 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2053 transitions. [2020-10-09 15:38:36,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2053 transitions. [2020-10-09 15:38:36,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:36,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2053 transitions. [2020-10-09 15:38:36,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:36,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:36,204 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:36,204 INFO L185 Difference]: Start difference. First operand has 674 places, 682 transitions, 1526 flow. Second operand 3 states and 2053 transitions. [2020-10-09 15:38:36,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 683 transitions, 1552 flow [2020-10-09 15:38:36,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 683 transitions, 1550 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:36,210 INFO L241 Difference]: Finished difference. Result has 677 places, 683 transitions, 1542 flow [2020-10-09 15:38:36,210 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1524, PETRI_DIFFERENCE_MINUEND_PLACES=673, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1542, PETRI_PLACES=677, PETRI_TRANSITIONS=683} [2020-10-09 15:38:36,210 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 10 predicate places. [2020-10-09 15:38:36,210 INFO L481 AbstractCegarLoop]: Abstraction has has 677 places, 683 transitions, 1542 flow [2020-10-09 15:38:36,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:36,210 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:36,211 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:38:36,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 961 mathsat -unsat_core_generation=3 [2020-10-09 15:38:36,411 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:36,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:36,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1035138118, now seen corresponding path program 1 times [2020-10-09 15:38:36,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:36,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711311934] [2020-10-09 15:38:36,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 962 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 962 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:36,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:36,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:38:36,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:38:36,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711311934] [2020-10-09 15:38:36,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:36,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:36,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836626673] [2020-10-09 15:38:36,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:36,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:36,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:36,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:36,973 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:38:36,974 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 683 transitions, 1542 flow. Second operand 3 states. [2020-10-09 15:38:36,974 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:36,974 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:38:36,974 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:37,199 INFO L129 PetriNetUnfolder]: 69/767 cut-off events. [2020-10-09 15:38:37,200 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2020-10-09 15:38:37,243 INFO L80 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 767 events. 69/767 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3094 event pairs, 0 based on Foata normal form. 2/674 useless extension candidates. Maximal degree in co-relation 863. Up to 27 conditions per place. [2020-10-09 15:38:37,253 INFO L132 encePairwiseOnDemand]: 716/719 looper letters, 9 selfloop transitions, 1 changer transitions 0/681 dead transitions. [2020-10-09 15:38:37,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 681 transitions, 1550 flow [2020-10-09 15:38:37,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2052 transitions. [2020-10-09 15:38:37,255 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9513212795549374 [2020-10-09 15:38:37,255 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2052 transitions. [2020-10-09 15:38:37,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2052 transitions. [2020-10-09 15:38:37,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:37,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2052 transitions. [2020-10-09 15:38:37,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:37,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:37,257 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:37,257 INFO L185 Difference]: Start difference. First operand has 677 places, 683 transitions, 1542 flow. Second operand 3 states and 2052 transitions. [2020-10-09 15:38:37,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 679 places, 681 transitions, 1550 flow [2020-10-09 15:38:37,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 681 transitions, 1549 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:37,263 INFO L241 Difference]: Finished difference. Result has 678 places, 681 transitions, 1531 flow [2020-10-09 15:38:37,263 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1529, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1531, PETRI_PLACES=678, PETRI_TRANSITIONS=681} [2020-10-09 15:38:37,263 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 11 predicate places. [2020-10-09 15:38:37,263 INFO L481 AbstractCegarLoop]: Abstraction has has 678 places, 681 transitions, 1531 flow [2020-10-09 15:38:37,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:37,264 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:37,264 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:38:37,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 962 mathsat -unsat_core_generation=3 [2020-10-09 15:38:37,464 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:37,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:37,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1035139141, now seen corresponding path program 1 times [2020-10-09 15:38:37,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:37,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134004390] [2020-10-09 15:38:37,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 963 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 963 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:38,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:38:38,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:38:38,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:38,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:38:38,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134004390] [2020-10-09 15:38:38,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:38,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:38,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595300277] [2020-10-09 15:38:38,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:38,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:38,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:38,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:38,098 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:38:38,099 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 681 transitions, 1531 flow. Second operand 3 states. [2020-10-09 15:38:38,099 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:38,099 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:38:38,099 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:38,320 INFO L129 PetriNetUnfolder]: 69/764 cut-off events. [2020-10-09 15:38:38,320 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:38:38,361 INFO L80 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 764 events. 69/764 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3069 event pairs, 0 based on Foata normal form. 1/671 useless extension candidates. Maximal degree in co-relation 857. Up to 27 conditions per place. [2020-10-09 15:38:38,371 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/678 dead transitions. [2020-10-09 15:38:38,371 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 678 places, 678 transitions, 1530 flow [2020-10-09 15:38:38,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:38,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:38,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:38:38,373 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:38:38,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:38:38,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:38:38,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:38,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:38:38,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:38,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:38,375 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:38,375 INFO L185 Difference]: Start difference. First operand has 678 places, 681 transitions, 1531 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:38:38,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 678 places, 678 transitions, 1530 flow [2020-10-09 15:38:38,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 678 transitions, 1525 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:38:38,381 INFO L241 Difference]: Finished difference. Result has 675 places, 678 transitions, 1517 flow [2020-10-09 15:38:38,381 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=673, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1517, PETRI_PLACES=675, PETRI_TRANSITIONS=678} [2020-10-09 15:38:38,381 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 8 predicate places. [2020-10-09 15:38:38,381 INFO L481 AbstractCegarLoop]: Abstraction has has 675 places, 678 transitions, 1517 flow [2020-10-09 15:38:38,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:38,381 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:38,381 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:38:38,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 963 mathsat -unsat_core_generation=3 [2020-10-09 15:38:38,582 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:38,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:38,582 INFO L82 PathProgramCache]: Analyzing trace with hash -2034015620, now seen corresponding path program 1 times [2020-10-09 15:38:38,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:38,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708175076] [2020-10-09 15:38:38,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 964 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 964 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:39,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:39,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:38:39,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:38:39,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708175076] [2020-10-09 15:38:39,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:39,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:39,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498918051] [2020-10-09 15:38:39,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:39,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:39,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:39,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:39,159 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:38:39,160 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 678 transitions, 1517 flow. Second operand 3 states. [2020-10-09 15:38:39,160 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:39,160 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:38:39,160 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:39,394 INFO L129 PetriNetUnfolder]: 68/772 cut-off events. [2020-10-09 15:38:39,394 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:38:39,439 INFO L80 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 772 events. 68/772 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3139 event pairs, 0 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 874. Up to 27 conditions per place. [2020-10-09 15:38:39,449 INFO L132 encePairwiseOnDemand]: 714/719 looper letters, 10 selfloop transitions, 3 changer transitions 0/680 dead transitions. [2020-10-09 15:38:39,450 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 677 places, 680 transitions, 1547 flow [2020-10-09 15:38:39,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:39,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2055 transitions. [2020-10-09 15:38:39,451 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.952712100139082 [2020-10-09 15:38:39,451 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2055 transitions. [2020-10-09 15:38:39,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2055 transitions. [2020-10-09 15:38:39,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:39,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2055 transitions. [2020-10-09 15:38:39,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:39,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:39,453 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:39,453 INFO L185 Difference]: Start difference. First operand has 675 places, 678 transitions, 1517 flow. Second operand 3 states and 2055 transitions. [2020-10-09 15:38:39,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 677 places, 680 transitions, 1547 flow [2020-10-09 15:38:39,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 676 places, 680 transitions, 1546 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:39,459 INFO L241 Difference]: Finished difference. Result has 678 places, 680 transitions, 1540 flow [2020-10-09 15:38:39,460 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1516, PETRI_DIFFERENCE_MINUEND_PLACES=674, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1540, PETRI_PLACES=678, PETRI_TRANSITIONS=680} [2020-10-09 15:38:39,460 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 11 predicate places. [2020-10-09 15:38:39,460 INFO L481 AbstractCegarLoop]: Abstraction has has 678 places, 680 transitions, 1540 flow [2020-10-09 15:38:39,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:39,460 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:39,460 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:38:39,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 964 mathsat -unsat_core_generation=3 [2020-10-09 15:38:39,661 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:39,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:39,661 INFO L82 PathProgramCache]: Analyzing trace with hash -2034016643, now seen corresponding path program 1 times [2020-10-09 15:38:39,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:39,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627048483] [2020-10-09 15:38:39,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 965 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 965 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:40,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:38:40,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:40,207 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:38:40,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:38:40,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627048483] [2020-10-09 15:38:40,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:40,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:40,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92584554] [2020-10-09 15:38:40,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:40,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:40,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:40,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:40,231 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:38:40,232 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 680 transitions, 1540 flow. Second operand 3 states. [2020-10-09 15:38:40,232 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:40,232 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:38:40,232 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:40,466 INFO L129 PetriNetUnfolder]: 66/773 cut-off events. [2020-10-09 15:38:40,467 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:38:40,514 INFO L80 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 773 events. 66/773 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3158 event pairs, 0 based on Foata normal form. 1/683 useless extension candidates. Maximal degree in co-relation 870. Up to 27 conditions per place. [2020-10-09 15:38:40,525 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/679 dead transitions. [2020-10-09 15:38:40,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 679 transitions, 1546 flow [2020-10-09 15:38:40,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:38:40,526 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:38:40,527 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:38:40,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:38:40,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:40,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:38:40,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:40,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:40,529 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:40,529 INFO L185 Difference]: Start difference. First operand has 678 places, 680 transitions, 1540 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:38:40,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 679 transitions, 1546 flow [2020-10-09 15:38:40,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 679 transitions, 1541 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:40,536 INFO L241 Difference]: Finished difference. Result has 680 places, 679 transitions, 1536 flow [2020-10-09 15:38:40,536 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1536, PETRI_PLACES=680, PETRI_TRANSITIONS=679} [2020-10-09 15:38:40,536 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 13 predicate places. [2020-10-09 15:38:40,536 INFO L481 AbstractCegarLoop]: Abstraction has has 680 places, 679 transitions, 1536 flow [2020-10-09 15:38:40,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:40,537 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:40,537 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:38:40,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 965 mathsat -unsat_core_generation=3 [2020-10-09 15:38:40,737 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:40,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash -2034968932, now seen corresponding path program 1 times [2020-10-09 15:38:40,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:40,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374768544] [2020-10-09 15:38:40,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 966 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 966 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:41,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:41,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:38:41,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:38:41,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374768544] [2020-10-09 15:38:41,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:41,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:41,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985724882] [2020-10-09 15:38:41,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:41,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:41,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:41,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:41,296 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:38:41,296 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 679 transitions, 1536 flow. Second operand 3 states. [2020-10-09 15:38:41,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:41,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:38:41,296 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:41,526 INFO L129 PetriNetUnfolder]: 66/766 cut-off events. [2020-10-09 15:38:41,526 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:38:41,571 INFO L80 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 766 events. 66/766 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3104 event pairs, 0 based on Foata normal form. 1/676 useless extension candidates. Maximal degree in co-relation 866. Up to 27 conditions per place. [2020-10-09 15:38:41,581 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 5 selfloop transitions, 1 changer transitions 0/677 dead transitions. [2020-10-09 15:38:41,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 677 transitions, 1539 flow [2020-10-09 15:38:41,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2020-10-09 15:38:41,582 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9559573481687529 [2020-10-09 15:38:41,582 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2020-10-09 15:38:41,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2020-10-09 15:38:41,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:41,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2020-10-09 15:38:41,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:41,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:41,584 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:41,585 INFO L185 Difference]: Start difference. First operand has 680 places, 679 transitions, 1536 flow. Second operand 3 states and 2062 transitions. [2020-10-09 15:38:41,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 677 transitions, 1539 flow [2020-10-09 15:38:41,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 677 transitions, 1532 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:38:41,591 INFO L241 Difference]: Finished difference. Result has 680 places, 677 transitions, 1525 flow [2020-10-09 15:38:41,591 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1525, PETRI_PLACES=680, PETRI_TRANSITIONS=677} [2020-10-09 15:38:41,591 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 13 predicate places. [2020-10-09 15:38:41,591 INFO L481 AbstractCegarLoop]: Abstraction has has 680 places, 677 transitions, 1525 flow [2020-10-09 15:38:41,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:41,591 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:41,591 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:38:41,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 966 mathsat -unsat_core_generation=3 [2020-10-09 15:38:41,792 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:41,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:41,793 INFO L82 PathProgramCache]: Analyzing trace with hash -2034969955, now seen corresponding path program 1 times [2020-10-09 15:38:41,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:41,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538896869] [2020-10-09 15:38:41,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 967 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 967 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:42,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:42,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:38:42,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:38:42,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538896869] [2020-10-09 15:38:42,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:42,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:42,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482320973] [2020-10-09 15:38:42,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:42,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:42,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:42,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:42,359 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:38:42,360 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 677 transitions, 1525 flow. Second operand 3 states. [2020-10-09 15:38:42,360 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:42,360 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:38:42,360 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:42,592 INFO L129 PetriNetUnfolder]: 66/764 cut-off events. [2020-10-09 15:38:42,592 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:38:42,636 INFO L80 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 764 events. 66/764 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3086 event pairs, 0 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 866. Up to 27 conditions per place. [2020-10-09 15:38:42,646 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/675 dead transitions. [2020-10-09 15:38:42,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 675 transitions, 1538 flow [2020-10-09 15:38:42,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:38:42,647 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:38:42,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:38:42,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:38:42,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:42,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:38:42,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:42,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:42,650 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:42,651 INFO L185 Difference]: Start difference. First operand has 680 places, 677 transitions, 1525 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:38:42,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 675 transitions, 1538 flow [2020-10-09 15:38:42,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 675 transitions, 1537 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:42,657 INFO L241 Difference]: Finished difference. Result has 679 places, 675 transitions, 1521 flow [2020-10-09 15:38:42,657 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1521, PETRI_PLACES=679, PETRI_TRANSITIONS=675} [2020-10-09 15:38:42,657 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 12 predicate places. [2020-10-09 15:38:42,657 INFO L481 AbstractCegarLoop]: Abstraction has has 679 places, 675 transitions, 1521 flow [2020-10-09 15:38:42,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:42,657 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:42,657 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:42,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 967 mathsat -unsat_core_generation=3 [2020-10-09 15:38:42,858 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:42,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:42,858 INFO L82 PathProgramCache]: Analyzing trace with hash -42885056, now seen corresponding path program 1 times [2020-10-09 15:38:42,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:42,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149363868] [2020-10-09 15:38:42,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 968 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 968 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:43,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:38:43,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:38:43,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:38:43,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149363868] [2020-10-09 15:38:43,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:43,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:43,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963666848] [2020-10-09 15:38:43,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:43,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:43,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:43,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:43,478 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:38:43,479 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 675 transitions, 1521 flow. Second operand 3 states. [2020-10-09 15:38:43,480 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:43,480 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:38:43,480 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:43,713 INFO L129 PetriNetUnfolder]: 65/771 cut-off events. [2020-10-09 15:38:43,714 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:38:43,758 INFO L80 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 771 events. 65/771 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3149 event pairs, 0 based on Foata normal form. 1/681 useless extension candidates. Maximal degree in co-relation 869. Up to 27 conditions per place. [2020-10-09 15:38:43,768 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/675 dead transitions. [2020-10-09 15:38:43,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 681 places, 675 transitions, 1531 flow [2020-10-09 15:38:43,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:43,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:43,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:38:43,769 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:38:43,770 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:38:43,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:38:43,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:43,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:38:43,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:43,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:43,772 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:43,772 INFO L185 Difference]: Start difference. First operand has 679 places, 675 transitions, 1521 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:38:43,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 681 places, 675 transitions, 1531 flow [2020-10-09 15:38:43,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 680 places, 675 transitions, 1530 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:43,778 INFO L241 Difference]: Finished difference. Result has 681 places, 675 transitions, 1525 flow [2020-10-09 15:38:43,778 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1525, PETRI_PLACES=681, PETRI_TRANSITIONS=675} [2020-10-09 15:38:43,778 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 14 predicate places. [2020-10-09 15:38:43,778 INFO L481 AbstractCegarLoop]: Abstraction has has 681 places, 675 transitions, 1525 flow [2020-10-09 15:38:43,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:43,778 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:43,778 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:43,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 968 mathsat -unsat_core_generation=3 [2020-10-09 15:38:43,979 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:43,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:43,980 INFO L82 PathProgramCache]: Analyzing trace with hash -42884033, now seen corresponding path program 1 times [2020-10-09 15:38:43,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:43,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581477563] [2020-10-09 15:38:43,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 969 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 969 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:44,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:44,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:38:44,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:38:44,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581477563] [2020-10-09 15:38:44,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:44,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:44,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952435130] [2020-10-09 15:38:44,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:44,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:44,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:44,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:44,565 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:38:44,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 675 transitions, 1525 flow. Second operand 3 states. [2020-10-09 15:38:44,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:44,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:38:44,567 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:44,814 INFO L129 PetriNetUnfolder]: 63/773 cut-off events. [2020-10-09 15:38:44,814 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:38:44,861 INFO L80 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 773 events. 63/773 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3177 event pairs, 0 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 882. Up to 27 conditions per place. [2020-10-09 15:38:44,871 INFO L132 encePairwiseOnDemand]: 715/719 looper letters, 9 selfloop transitions, 3 changer transitions 0/676 dead transitions. [2020-10-09 15:38:44,871 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 676 transitions, 1551 flow [2020-10-09 15:38:44,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:44,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2053 transitions. [2020-10-09 15:38:44,873 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.951784886416319 [2020-10-09 15:38:44,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2053 transitions. [2020-10-09 15:38:44,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2053 transitions. [2020-10-09 15:38:44,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:44,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2053 transitions. [2020-10-09 15:38:44,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:44,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:44,875 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:44,875 INFO L185 Difference]: Start difference. First operand has 681 places, 675 transitions, 1525 flow. Second operand 3 states and 2053 transitions. [2020-10-09 15:38:44,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 683 places, 676 transitions, 1551 flow [2020-10-09 15:38:44,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 682 places, 676 transitions, 1550 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:44,881 INFO L241 Difference]: Finished difference. Result has 684 places, 676 transitions, 1542 flow [2020-10-09 15:38:44,882 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1524, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1542, PETRI_PLACES=684, PETRI_TRANSITIONS=676} [2020-10-09 15:38:44,882 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 17 predicate places. [2020-10-09 15:38:44,882 INFO L481 AbstractCegarLoop]: Abstraction has has 684 places, 676 transitions, 1542 flow [2020-10-09 15:38:44,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:44,882 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:44,882 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:45,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 969 mathsat -unsat_core_generation=3 [2020-10-09 15:38:45,083 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:45,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:45,083 INFO L82 PathProgramCache]: Analyzing trace with hash -43837345, now seen corresponding path program 1 times [2020-10-09 15:38:45,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:45,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822900151] [2020-10-09 15:38:45,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 970 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 970 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:45,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:45,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:38:45,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:38:45,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822900151] [2020-10-09 15:38:45,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:45,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:45,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439401357] [2020-10-09 15:38:45,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:45,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:45,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:45,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:45,652 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:38:45,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 676 transitions, 1542 flow. Second operand 3 states. [2020-10-09 15:38:45,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:45,653 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:38:45,653 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:45,887 INFO L129 PetriNetUnfolder]: 63/766 cut-off events. [2020-10-09 15:38:45,887 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:38:45,931 INFO L80 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 766 events. 63/766 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3121 event pairs, 0 based on Foata normal form. 1/679 useless extension candidates. Maximal degree in co-relation 868. Up to 27 conditions per place. [2020-10-09 15:38:45,941 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 5 selfloop transitions, 1 changer transitions 0/674 dead transitions. [2020-10-09 15:38:45,941 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 686 places, 674 transitions, 1544 flow [2020-10-09 15:38:45,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:45,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2020-10-09 15:38:45,942 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9559573481687529 [2020-10-09 15:38:45,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2020-10-09 15:38:45,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2020-10-09 15:38:45,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:45,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2020-10-09 15:38:45,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:45,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:45,945 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:45,945 INFO L185 Difference]: Start difference. First operand has 684 places, 676 transitions, 1542 flow. Second operand 3 states and 2062 transitions. [2020-10-09 15:38:45,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 686 places, 674 transitions, 1544 flow [2020-10-09 15:38:45,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 683 places, 674 transitions, 1536 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:38:45,951 INFO L241 Difference]: Finished difference. Result has 684 places, 674 transitions, 1529 flow [2020-10-09 15:38:45,951 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1524, PETRI_DIFFERENCE_MINUEND_PLACES=681, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=684, PETRI_TRANSITIONS=674} [2020-10-09 15:38:45,951 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 17 predicate places. [2020-10-09 15:38:45,952 INFO L481 AbstractCegarLoop]: Abstraction has has 684 places, 674 transitions, 1529 flow [2020-10-09 15:38:45,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:45,952 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:45,952 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:46,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 970 mathsat -unsat_core_generation=3 [2020-10-09 15:38:46,152 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:46,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:46,153 INFO L82 PathProgramCache]: Analyzing trace with hash -43838368, now seen corresponding path program 1 times [2020-10-09 15:38:46,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:46,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402218823] [2020-10-09 15:38:46,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 971 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 971 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:46,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:46,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:38:46,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:38:46,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402218823] [2020-10-09 15:38:46,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:46,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:46,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796439786] [2020-10-09 15:38:46,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:46,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:46,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:46,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:46,722 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:38:46,723 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 674 transitions, 1529 flow. Second operand 3 states. [2020-10-09 15:38:46,723 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:46,723 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:38:46,723 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:46,958 INFO L129 PetriNetUnfolder]: 63/764 cut-off events. [2020-10-09 15:38:46,958 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:38:47,003 INFO L80 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 764 events. 63/764 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3108 event pairs, 0 based on Foata normal form. 0/675 useless extension candidates. Maximal degree in co-relation 872. Up to 27 conditions per place. [2020-10-09 15:38:47,012 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/672 dead transitions. [2020-10-09 15:38:47,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 672 transitions, 1542 flow [2020-10-09 15:38:47,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:38:47,014 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:38:47,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:38:47,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:38:47,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:47,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:38:47,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:47,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:47,016 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:47,016 INFO L185 Difference]: Start difference. First operand has 684 places, 674 transitions, 1529 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:38:47,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 672 transitions, 1542 flow [2020-10-09 15:38:47,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 683 places, 672 transitions, 1541 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:47,022 INFO L241 Difference]: Finished difference. Result has 683 places, 672 transitions, 1525 flow [2020-10-09 15:38:47,022 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=681, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1525, PETRI_PLACES=683, PETRI_TRANSITIONS=672} [2020-10-09 15:38:47,023 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 16 predicate places. [2020-10-09 15:38:47,023 INFO L481 AbstractCegarLoop]: Abstraction has has 683 places, 672 transitions, 1525 flow [2020-10-09 15:38:47,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:47,023 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:47,023 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:47,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 971 mathsat -unsat_core_generation=3 [2020-10-09 15:38:47,224 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:47,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:47,224 INFO L82 PathProgramCache]: Analyzing trace with hash -293799293, now seen corresponding path program 1 times [2020-10-09 15:38:47,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:47,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904974154] [2020-10-09 15:38:47,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 972 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 972 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:47,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:47,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:47,772 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:38:47,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:38:47,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904974154] [2020-10-09 15:38:47,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:47,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:47,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57627727] [2020-10-09 15:38:47,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:47,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:47,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:47,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:47,804 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:38:47,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 672 transitions, 1525 flow. Second operand 3 states. [2020-10-09 15:38:47,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:47,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:38:47,805 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:48,047 INFO L129 PetriNetUnfolder]: 62/772 cut-off events. [2020-10-09 15:38:48,047 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:38:48,092 INFO L80 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 772 events. 62/772 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3173 event pairs, 0 based on Foata normal form. 0/683 useless extension candidates. Maximal degree in co-relation 884. Up to 27 conditions per place. [2020-10-09 15:38:48,102 INFO L132 encePairwiseOnDemand]: 714/719 looper letters, 10 selfloop transitions, 3 changer transitions 0/674 dead transitions. [2020-10-09 15:38:48,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 674 transitions, 1555 flow [2020-10-09 15:38:48,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2055 transitions. [2020-10-09 15:38:48,104 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.952712100139082 [2020-10-09 15:38:48,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2055 transitions. [2020-10-09 15:38:48,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2055 transitions. [2020-10-09 15:38:48,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:48,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2055 transitions. [2020-10-09 15:38:48,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:48,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:48,106 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:48,106 INFO L185 Difference]: Start difference. First operand has 683 places, 672 transitions, 1525 flow. Second operand 3 states and 2055 transitions. [2020-10-09 15:38:48,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 685 places, 674 transitions, 1555 flow [2020-10-09 15:38:48,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 674 transitions, 1554 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:48,112 INFO L241 Difference]: Finished difference. Result has 686 places, 674 transitions, 1548 flow [2020-10-09 15:38:48,112 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1524, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1548, PETRI_PLACES=686, PETRI_TRANSITIONS=674} [2020-10-09 15:38:48,112 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 19 predicate places. [2020-10-09 15:38:48,113 INFO L481 AbstractCegarLoop]: Abstraction has has 686 places, 674 transitions, 1548 flow [2020-10-09 15:38:48,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:48,113 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:48,113 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:48,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 972 mathsat -unsat_core_generation=3 [2020-10-09 15:38:48,313 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:48,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:48,314 INFO L82 PathProgramCache]: Analyzing trace with hash -293800316, now seen corresponding path program 1 times [2020-10-09 15:38:48,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:48,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446988526] [2020-10-09 15:38:48,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 973 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 973 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:48,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:38:48,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:38:48,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:38:48,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446988526] [2020-10-09 15:38:48,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:48,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:48,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848085677] [2020-10-09 15:38:48,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:48,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:48,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:48,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:48,890 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:38:48,892 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 686 places, 674 transitions, 1548 flow. Second operand 3 states. [2020-10-09 15:38:48,892 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:48,892 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:38:48,892 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:49,205 INFO L129 PetriNetUnfolder]: 60/773 cut-off events. [2020-10-09 15:38:49,205 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:38:49,242 INFO L80 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 773 events. 60/773 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3199 event pairs, 0 based on Foata normal form. 1/689 useless extension candidates. Maximal degree in co-relation 882. Up to 27 conditions per place. [2020-10-09 15:38:49,251 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/673 dead transitions. [2020-10-09 15:38:49,251 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 673 transitions, 1554 flow [2020-10-09 15:38:49,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:38:49,252 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:38:49,252 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:38:49,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:38:49,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:49,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:38:49,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:49,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:49,254 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:49,254 INFO L185 Difference]: Start difference. First operand has 686 places, 674 transitions, 1548 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:38:49,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 673 transitions, 1554 flow [2020-10-09 15:38:49,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 673 transitions, 1549 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:49,260 INFO L241 Difference]: Finished difference. Result has 688 places, 673 transitions, 1544 flow [2020-10-09 15:38:49,261 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1539, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1544, PETRI_PLACES=688, PETRI_TRANSITIONS=673} [2020-10-09 15:38:49,261 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 21 predicate places. [2020-10-09 15:38:49,261 INFO L481 AbstractCegarLoop]: Abstraction has has 688 places, 673 transitions, 1544 flow [2020-10-09 15:38:49,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:49,261 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:49,261 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:49,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 973 mathsat -unsat_core_generation=3 [2020-10-09 15:38:49,462 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:49,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:49,462 INFO L82 PathProgramCache]: Analyzing trace with hash -294752605, now seen corresponding path program 1 times [2020-10-09 15:38:49,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:49,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250959285] [2020-10-09 15:38:49,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 974 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 974 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:50,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:50,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:38:50,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:38:50,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250959285] [2020-10-09 15:38:50,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:50,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:50,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511060514] [2020-10-09 15:38:50,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:50,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:50,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:50,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:50,031 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:38:50,032 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 673 transitions, 1544 flow. Second operand 3 states. [2020-10-09 15:38:50,032 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:50,032 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:38:50,032 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:50,270 INFO L129 PetriNetUnfolder]: 60/766 cut-off events. [2020-10-09 15:38:50,270 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:38:50,320 INFO L80 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 766 events. 60/766 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3138 event pairs, 0 based on Foata normal form. 1/682 useless extension candidates. Maximal degree in co-relation 878. Up to 27 conditions per place. [2020-10-09 15:38:50,331 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 5 selfloop transitions, 1 changer transitions 0/671 dead transitions. [2020-10-09 15:38:50,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 690 places, 671 transitions, 1547 flow [2020-10-09 15:38:50,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2020-10-09 15:38:50,332 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9559573481687529 [2020-10-09 15:38:50,332 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2020-10-09 15:38:50,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2020-10-09 15:38:50,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:50,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2020-10-09 15:38:50,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:50,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:50,334 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:50,334 INFO L185 Difference]: Start difference. First operand has 688 places, 673 transitions, 1544 flow. Second operand 3 states and 2062 transitions. [2020-10-09 15:38:50,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 690 places, 671 transitions, 1547 flow [2020-10-09 15:38:50,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 671 transitions, 1540 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:38:50,341 INFO L241 Difference]: Finished difference. Result has 688 places, 671 transitions, 1533 flow [2020-10-09 15:38:50,341 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1533, PETRI_PLACES=688, PETRI_TRANSITIONS=671} [2020-10-09 15:38:50,341 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 21 predicate places. [2020-10-09 15:38:50,341 INFO L481 AbstractCegarLoop]: Abstraction has has 688 places, 671 transitions, 1533 flow [2020-10-09 15:38:50,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:50,341 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:50,341 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:50,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 974 mathsat -unsat_core_generation=3 [2020-10-09 15:38:50,549 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:50,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:50,549 INFO L82 PathProgramCache]: Analyzing trace with hash -294753628, now seen corresponding path program 1 times [2020-10-09 15:38:50,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:50,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365270907] [2020-10-09 15:38:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 975 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 975 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:51,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:51,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:51,101 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:38:51,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:51,102 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:38:51,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365270907] [2020-10-09 15:38:51,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:51,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:51,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333112823] [2020-10-09 15:38:51,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:51,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:51,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:51,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:51,132 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:38:51,133 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 671 transitions, 1533 flow. Second operand 3 states. [2020-10-09 15:38:51,133 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:51,133 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:38:51,133 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:51,381 INFO L129 PetriNetUnfolder]: 60/764 cut-off events. [2020-10-09 15:38:51,381 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:38:51,427 INFO L80 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 764 events. 60/764 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3121 event pairs, 0 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 878. Up to 27 conditions per place. [2020-10-09 15:38:51,437 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/669 dead transitions. [2020-10-09 15:38:51,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 669 transitions, 1546 flow [2020-10-09 15:38:51,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:38:51,438 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:38:51,438 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:38:51,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:38:51,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:51,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:38:51,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:51,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:51,441 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:51,441 INFO L185 Difference]: Start difference. First operand has 688 places, 671 transitions, 1533 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:38:51,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 669 transitions, 1546 flow [2020-10-09 15:38:51,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 669 transitions, 1545 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:51,448 INFO L241 Difference]: Finished difference. Result has 687 places, 669 transitions, 1529 flow [2020-10-09 15:38:51,448 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1527, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=687, PETRI_TRANSITIONS=669} [2020-10-09 15:38:51,449 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 20 predicate places. [2020-10-09 15:38:51,449 INFO L481 AbstractCegarLoop]: Abstraction has has 687 places, 669 transitions, 1529 flow [2020-10-09 15:38:51,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:51,449 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:51,449 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:51,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 975 mathsat -unsat_core_generation=3 [2020-10-09 15:38:51,650 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:51,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:51,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1782774584, now seen corresponding path program 1 times [2020-10-09 15:38:51,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:51,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885391356] [2020-10-09 15:38:51,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 976 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 976 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:52,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:52,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:38:52,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:38:52,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885391356] [2020-10-09 15:38:52,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:52,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:52,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800558251] [2020-10-09 15:38:52,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:52,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:52,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:52,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:52,228 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:38:52,229 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 687 places, 669 transitions, 1529 flow. Second operand 3 states. [2020-10-09 15:38:52,229 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:52,229 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:38:52,229 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:52,478 INFO L129 PetriNetUnfolder]: 59/772 cut-off events. [2020-10-09 15:38:52,478 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:38:52,524 INFO L80 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 772 events. 59/772 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3196 event pairs, 0 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 890. Up to 27 conditions per place. [2020-10-09 15:38:52,533 INFO L132 encePairwiseOnDemand]: 714/719 looper letters, 10 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2020-10-09 15:38:52,533 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 671 transitions, 1559 flow [2020-10-09 15:38:52,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2055 transitions. [2020-10-09 15:38:52,534 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.952712100139082 [2020-10-09 15:38:52,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2055 transitions. [2020-10-09 15:38:52,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2055 transitions. [2020-10-09 15:38:52,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:52,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2055 transitions. [2020-10-09 15:38:52,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:52,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:52,536 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:52,536 INFO L185 Difference]: Start difference. First operand has 687 places, 669 transitions, 1529 flow. Second operand 3 states and 2055 transitions. [2020-10-09 15:38:52,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 671 transitions, 1559 flow [2020-10-09 15:38:52,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 688 places, 671 transitions, 1558 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:52,543 INFO L241 Difference]: Finished difference. Result has 690 places, 671 transitions, 1552 flow [2020-10-09 15:38:52,543 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=686, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1552, PETRI_PLACES=690, PETRI_TRANSITIONS=671} [2020-10-09 15:38:52,543 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 23 predicate places. [2020-10-09 15:38:52,543 INFO L481 AbstractCegarLoop]: Abstraction has has 690 places, 671 transitions, 1552 flow [2020-10-09 15:38:52,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:52,543 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:52,543 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:52,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 976 mathsat -unsat_core_generation=3 [2020-10-09 15:38:52,744 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:52,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:52,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1782775607, now seen corresponding path program 1 times [2020-10-09 15:38:52,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:52,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712413942] [2020-10-09 15:38:52,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 977 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 977 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:53,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:38:53,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:38:53,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:38:53,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712413942] [2020-10-09 15:38:53,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:53,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:53,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036987553] [2020-10-09 15:38:53,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:53,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:53,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:53,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:53,323 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:38:53,324 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 671 transitions, 1552 flow. Second operand 3 states. [2020-10-09 15:38:53,324 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:53,324 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:38:53,325 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:53,566 INFO L129 PetriNetUnfolder]: 57/773 cut-off events. [2020-10-09 15:38:53,566 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:38:53,612 INFO L80 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 773 events. 57/773 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3218 event pairs, 0 based on Foata normal form. 1/692 useless extension candidates. Maximal degree in co-relation 888. Up to 27 conditions per place. [2020-10-09 15:38:53,620 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/670 dead transitions. [2020-10-09 15:38:53,620 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 692 places, 670 transitions, 1558 flow [2020-10-09 15:38:53,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:38:53,622 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:38:53,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:38:53,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:38:53,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:53,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:38:53,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:53,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:53,624 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:53,624 INFO L185 Difference]: Start difference. First operand has 690 places, 671 transitions, 1552 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:38:53,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 692 places, 670 transitions, 1558 flow [2020-10-09 15:38:53,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 670 transitions, 1553 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:53,630 INFO L241 Difference]: Finished difference. Result has 692 places, 670 transitions, 1548 flow [2020-10-09 15:38:53,631 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1543, PETRI_DIFFERENCE_MINUEND_PLACES=689, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1548, PETRI_PLACES=692, PETRI_TRANSITIONS=670} [2020-10-09 15:38:53,631 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 25 predicate places. [2020-10-09 15:38:53,631 INFO L481 AbstractCegarLoop]: Abstraction has has 692 places, 670 transitions, 1548 flow [2020-10-09 15:38:53,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:53,631 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:53,631 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:53,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 977 mathsat -unsat_core_generation=3 [2020-10-09 15:38:53,832 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:53,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:53,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1783727896, now seen corresponding path program 1 times [2020-10-09 15:38:53,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:53,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411860702] [2020-10-09 15:38:53,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 978 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 978 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:54,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:54,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:38:54,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:54,383 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:38:54,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411860702] [2020-10-09 15:38:54,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:54,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:54,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952999941] [2020-10-09 15:38:54,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:54,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:54,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:54,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:54,395 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:38:54,396 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 670 transitions, 1548 flow. Second operand 3 states. [2020-10-09 15:38:54,397 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:54,397 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:38:54,397 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:54,640 INFO L129 PetriNetUnfolder]: 57/766 cut-off events. [2020-10-09 15:38:54,640 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:38:54,685 INFO L80 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 766 events. 57/766 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3157 event pairs, 0 based on Foata normal form. 1/685 useless extension candidates. Maximal degree in co-relation 884. Up to 27 conditions per place. [2020-10-09 15:38:54,786 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 5 selfloop transitions, 1 changer transitions 0/668 dead transitions. [2020-10-09 15:38:54,787 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 668 transitions, 1551 flow [2020-10-09 15:38:54,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2020-10-09 15:38:54,788 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9559573481687529 [2020-10-09 15:38:54,788 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2020-10-09 15:38:54,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2020-10-09 15:38:54,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:54,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2020-10-09 15:38:54,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:54,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:54,790 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:54,790 INFO L185 Difference]: Start difference. First operand has 692 places, 670 transitions, 1548 flow. Second operand 3 states and 2062 transitions. [2020-10-09 15:38:54,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 668 transitions, 1551 flow [2020-10-09 15:38:54,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 668 transitions, 1544 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:38:54,796 INFO L241 Difference]: Finished difference. Result has 692 places, 668 transitions, 1537 flow [2020-10-09 15:38:54,796 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=689, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1537, PETRI_PLACES=692, PETRI_TRANSITIONS=668} [2020-10-09 15:38:54,796 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 25 predicate places. [2020-10-09 15:38:54,797 INFO L481 AbstractCegarLoop]: Abstraction has has 692 places, 668 transitions, 1537 flow [2020-10-09 15:38:54,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:54,797 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:54,797 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:54,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 978 mathsat -unsat_core_generation=3 [2020-10-09 15:38:54,997 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:54,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:54,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1783728919, now seen corresponding path program 1 times [2020-10-09 15:38:54,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:54,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860200756] [2020-10-09 15:38:54,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 979 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 979 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:55,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:55,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:55,546 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:38:55,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:38:55,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860200756] [2020-10-09 15:38:55,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:55,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:55,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752323904] [2020-10-09 15:38:55,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:55,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:55,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:55,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:55,568 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:38:55,569 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 668 transitions, 1537 flow. Second operand 3 states. [2020-10-09 15:38:55,569 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:55,569 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:38:55,569 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:55,815 INFO L129 PetriNetUnfolder]: 57/764 cut-off events. [2020-10-09 15:38:55,815 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:38:55,860 INFO L80 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 764 events. 57/764 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3143 event pairs, 0 based on Foata normal form. 0/681 useless extension candidates. Maximal degree in co-relation 884. Up to 27 conditions per place. [2020-10-09 15:38:55,868 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/666 dead transitions. [2020-10-09 15:38:55,868 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 692 places, 666 transitions, 1550 flow [2020-10-09 15:38:55,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:38:55,870 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:38:55,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:38:55,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:38:55,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:55,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:38:55,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:55,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:55,872 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:55,872 INFO L185 Difference]: Start difference. First operand has 692 places, 668 transitions, 1537 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:38:55,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 692 places, 666 transitions, 1550 flow [2020-10-09 15:38:55,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 666 transitions, 1549 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:55,878 INFO L241 Difference]: Finished difference. Result has 691 places, 666 transitions, 1533 flow [2020-10-09 15:38:55,878 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=689, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1533, PETRI_PLACES=691, PETRI_TRANSITIONS=666} [2020-10-09 15:38:55,879 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 24 predicate places. [2020-10-09 15:38:55,879 INFO L481 AbstractCegarLoop]: Abstraction has has 691 places, 666 transitions, 1533 flow [2020-10-09 15:38:55,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:55,879 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:55,879 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:56,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 979 mathsat -unsat_core_generation=3 [2020-10-09 15:38:56,080 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:56,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:56,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1493395119, now seen corresponding path program 1 times [2020-10-09 15:38:56,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:56,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185285223] [2020-10-09 15:38:56,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 980 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 980 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:56,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:56,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:38:56,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:38:56,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1185285223] [2020-10-09 15:38:56,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:56,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:56,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348927280] [2020-10-09 15:38:56,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:56,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:56,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:56,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:56,672 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:38:56,673 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 666 transitions, 1533 flow. Second operand 3 states. [2020-10-09 15:38:56,673 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:56,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:38:56,674 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:56,924 INFO L129 PetriNetUnfolder]: 56/772 cut-off events. [2020-10-09 15:38:56,924 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:38:56,970 INFO L80 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 772 events. 56/772 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3207 event pairs, 0 based on Foata normal form. 0/689 useless extension candidates. Maximal degree in co-relation 896. Up to 27 conditions per place. [2020-10-09 15:38:56,979 INFO L132 encePairwiseOnDemand]: 714/719 looper letters, 10 selfloop transitions, 3 changer transitions 0/668 dead transitions. [2020-10-09 15:38:56,979 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 668 transitions, 1563 flow [2020-10-09 15:38:56,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2055 transitions. [2020-10-09 15:38:56,980 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.952712100139082 [2020-10-09 15:38:56,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2055 transitions. [2020-10-09 15:38:56,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2055 transitions. [2020-10-09 15:38:56,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:56,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2055 transitions. [2020-10-09 15:38:56,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:56,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:56,982 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:56,982 INFO L185 Difference]: Start difference. First operand has 691 places, 666 transitions, 1533 flow. Second operand 3 states and 2055 transitions. [2020-10-09 15:38:56,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 668 transitions, 1563 flow [2020-10-09 15:38:56,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 668 transitions, 1562 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:56,989 INFO L241 Difference]: Finished difference. Result has 694 places, 668 transitions, 1556 flow [2020-10-09 15:38:56,989 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=690, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1556, PETRI_PLACES=694, PETRI_TRANSITIONS=668} [2020-10-09 15:38:56,989 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 27 predicate places. [2020-10-09 15:38:56,990 INFO L481 AbstractCegarLoop]: Abstraction has has 694 places, 668 transitions, 1556 flow [2020-10-09 15:38:56,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:56,990 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:56,990 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:57,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 980 mathsat -unsat_core_generation=3 [2020-10-09 15:38:57,190 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:57,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:57,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1493396142, now seen corresponding path program 1 times [2020-10-09 15:38:57,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:57,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425606332] [2020-10-09 15:38:57,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 981 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 981 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:57,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:57,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:38:57,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:38:57,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425606332] [2020-10-09 15:38:57,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:57,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:57,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135064778] [2020-10-09 15:38:57,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:57,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:57,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:57,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:57,761 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:38:57,762 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 668 transitions, 1556 flow. Second operand 3 states. [2020-10-09 15:38:57,762 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:57,762 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:38:57,763 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:58,020 INFO L129 PetriNetUnfolder]: 55/770 cut-off events. [2020-10-09 15:38:58,020 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:38:58,068 INFO L80 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 770 events. 55/770 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3196 event pairs, 0 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 893. Up to 27 conditions per place. [2020-10-09 15:38:58,077 INFO L132 encePairwiseOnDemand]: 716/719 looper letters, 5 selfloop transitions, 2 changer transitions 0/668 dead transitions. [2020-10-09 15:38:58,077 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 668 transitions, 1568 flow [2020-10-09 15:38:58,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2063 transitions. [2020-10-09 15:38:58,079 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9564209550301345 [2020-10-09 15:38:58,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2063 transitions. [2020-10-09 15:38:58,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2063 transitions. [2020-10-09 15:38:58,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:58,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2063 transitions. [2020-10-09 15:38:58,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:58,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:58,082 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:58,082 INFO L185 Difference]: Start difference. First operand has 694 places, 668 transitions, 1556 flow. Second operand 3 states and 2063 transitions. [2020-10-09 15:38:58,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 668 transitions, 1568 flow [2020-10-09 15:38:58,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 668 transitions, 1563 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:38:58,089 INFO L241 Difference]: Finished difference. Result has 697 places, 668 transitions, 1561 flow [2020-10-09 15:38:58,089 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1547, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1561, PETRI_PLACES=697, PETRI_TRANSITIONS=668} [2020-10-09 15:38:58,089 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 30 predicate places. [2020-10-09 15:38:58,089 INFO L481 AbstractCegarLoop]: Abstraction has has 697 places, 668 transitions, 1561 flow [2020-10-09 15:38:58,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:58,089 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:58,090 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:58,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 981 mathsat -unsat_core_generation=3 [2020-10-09 15:38:58,290 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:58,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:58,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1494348431, now seen corresponding path program 1 times [2020-10-09 15:38:58,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:58,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806609020] [2020-10-09 15:38:58,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 982 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 982 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:58,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:38:58,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:38:58,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:38:58,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806609020] [2020-10-09 15:38:58,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:58,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:58,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790451347] [2020-10-09 15:38:58,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:58,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:58,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:58,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:58,874 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:38:58,875 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 668 transitions, 1561 flow. Second operand 3 states. [2020-10-09 15:38:58,875 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:58,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:38:58,876 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:38:59,127 INFO L129 PetriNetUnfolder]: 54/766 cut-off events. [2020-10-09 15:38:59,128 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:38:59,174 INFO L80 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 766 events. 54/766 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3172 event pairs, 0 based on Foata normal form. 1/688 useless extension candidates. Maximal degree in co-relation 889. Up to 27 conditions per place. [2020-10-09 15:38:59,182 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/665 dead transitions. [2020-10-09 15:38:59,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 699 places, 665 transitions, 1556 flow [2020-10-09 15:38:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:38:59,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:38:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:38:59,184 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:38:59,184 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:38:59,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:38:59,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:38:59,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:38:59,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:38:59,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:38:59,186 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:38:59,186 INFO L185 Difference]: Start difference. First operand has 697 places, 668 transitions, 1561 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:38:59,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 699 places, 665 transitions, 1556 flow [2020-10-09 15:38:59,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 696 places, 665 transitions, 1549 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:38:59,193 INFO L241 Difference]: Finished difference. Result has 696 places, 665 transitions, 1541 flow [2020-10-09 15:38:59,193 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1539, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1541, PETRI_PLACES=696, PETRI_TRANSITIONS=665} [2020-10-09 15:38:59,193 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 29 predicate places. [2020-10-09 15:38:59,193 INFO L481 AbstractCegarLoop]: Abstraction has has 696 places, 665 transitions, 1541 flow [2020-10-09 15:38:59,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:38:59,194 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:38:59,194 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:38:59,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 982 mathsat -unsat_core_generation=3 [2020-10-09 15:38:59,395 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:38:59,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:38:59,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1494349454, now seen corresponding path program 1 times [2020-10-09 15:38:59,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:38:59,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403177051] [2020-10-09 15:38:59,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 983 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 983 with mathsat -unsat_core_generation=3 [2020-10-09 15:38:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:38:59,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:38:59,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:38:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:38:59,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:38:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:38:59,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403177051] [2020-10-09 15:38:59,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:38:59,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:38:59,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485755822] [2020-10-09 15:38:59,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:38:59,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:38:59,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:38:59,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:38:59,970 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:38:59,971 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 665 transitions, 1541 flow. Second operand 3 states. [2020-10-09 15:38:59,971 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:38:59,972 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:38:59,972 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:00,220 INFO L129 PetriNetUnfolder]: 54/764 cut-off events. [2020-10-09 15:39:00,220 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:00,265 INFO L80 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 764 events. 54/764 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3155 event pairs, 0 based on Foata normal form. 0/684 useless extension candidates. Maximal degree in co-relation 891. Up to 27 conditions per place. [2020-10-09 15:39:00,273 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/663 dead transitions. [2020-10-09 15:39:00,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 663 transitions, 1554 flow [2020-10-09 15:39:00,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:00,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:00,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:39:00,274 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:39:00,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:39:00,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:39:00,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:00,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:39:00,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:00,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:00,278 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:00,278 INFO L185 Difference]: Start difference. First operand has 696 places, 665 transitions, 1541 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:39:00,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 663 transitions, 1554 flow [2020-10-09 15:39:00,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 663 transitions, 1553 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:00,284 INFO L241 Difference]: Finished difference. Result has 695 places, 663 transitions, 1537 flow [2020-10-09 15:39:00,284 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1535, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1537, PETRI_PLACES=695, PETRI_TRANSITIONS=663} [2020-10-09 15:39:00,284 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 28 predicate places. [2020-10-09 15:39:00,284 INFO L481 AbstractCegarLoop]: Abstraction has has 695 places, 663 transitions, 1537 flow [2020-10-09 15:39:00,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:00,285 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:00,285 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:00,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 983 mathsat -unsat_core_generation=3 [2020-10-09 15:39:00,485 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:00,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:00,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1142230666, now seen corresponding path program 1 times [2020-10-09 15:39:00,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:00,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687796241] [2020-10-09 15:39:00,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 984 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 984 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:01,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:01,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:01,126 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:39:01,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:01,129 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:39:01,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687796241] [2020-10-09 15:39:01,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:01,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:01,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429860065] [2020-10-09 15:39:01,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:01,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:01,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:01,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:01,149 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:01,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 663 transitions, 1537 flow. Second operand 3 states. [2020-10-09 15:39:01,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:01,150 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:01,150 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:01,410 INFO L129 PetriNetUnfolder]: 53/772 cut-off events. [2020-10-09 15:39:01,410 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:01,456 INFO L80 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 772 events. 53/772 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3232 event pairs, 0 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 903. Up to 27 conditions per place. [2020-10-09 15:39:01,464 INFO L132 encePairwiseOnDemand]: 714/719 looper letters, 10 selfloop transitions, 3 changer transitions 0/665 dead transitions. [2020-10-09 15:39:01,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 665 transitions, 1567 flow [2020-10-09 15:39:01,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:01,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2055 transitions. [2020-10-09 15:39:01,466 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.952712100139082 [2020-10-09 15:39:01,466 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2055 transitions. [2020-10-09 15:39:01,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2055 transitions. [2020-10-09 15:39:01,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:01,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2055 transitions. [2020-10-09 15:39:01,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:01,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:01,468 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:01,468 INFO L185 Difference]: Start difference. First operand has 695 places, 663 transitions, 1537 flow. Second operand 3 states and 2055 transitions. [2020-10-09 15:39:01,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 665 transitions, 1567 flow [2020-10-09 15:39:01,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 696 places, 665 transitions, 1566 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:01,474 INFO L241 Difference]: Finished difference. Result has 698 places, 665 transitions, 1560 flow [2020-10-09 15:39:01,475 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=660, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1560, PETRI_PLACES=698, PETRI_TRANSITIONS=665} [2020-10-09 15:39:01,475 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 31 predicate places. [2020-10-09 15:39:01,475 INFO L481 AbstractCegarLoop]: Abstraction has has 698 places, 665 transitions, 1560 flow [2020-10-09 15:39:01,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:01,475 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:01,475 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:01,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 984 mathsat -unsat_core_generation=3 [2020-10-09 15:39:01,676 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:01,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:01,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1142229643, now seen corresponding path program 1 times [2020-10-09 15:39:01,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:01,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469041636] [2020-10-09 15:39:01,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 985 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 985 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:02,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:02,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:39:02,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:39:02,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469041636] [2020-10-09 15:39:02,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:02,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:02,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873498185] [2020-10-09 15:39:02,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:02,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:02,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:02,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:02,260 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:39:02,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 698 places, 665 transitions, 1560 flow. Second operand 3 states. [2020-10-09 15:39:02,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:02,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:39:02,261 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:02,586 INFO L129 PetriNetUnfolder]: 52/770 cut-off events. [2020-10-09 15:39:02,587 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:39:02,633 INFO L80 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 770 events. 52/770 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3218 event pairs, 0 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 900. Up to 27 conditions per place. [2020-10-09 15:39:02,641 INFO L132 encePairwiseOnDemand]: 716/719 looper letters, 5 selfloop transitions, 2 changer transitions 0/665 dead transitions. [2020-10-09 15:39:02,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 665 transitions, 1572 flow [2020-10-09 15:39:02,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2063 transitions. [2020-10-09 15:39:02,643 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9564209550301345 [2020-10-09 15:39:02,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2063 transitions. [2020-10-09 15:39:02,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2063 transitions. [2020-10-09 15:39:02,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:02,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2063 transitions. [2020-10-09 15:39:02,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:02,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:02,645 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:02,645 INFO L185 Difference]: Start difference. First operand has 698 places, 665 transitions, 1560 flow. Second operand 3 states and 2063 transitions. [2020-10-09 15:39:02,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 700 places, 665 transitions, 1572 flow [2020-10-09 15:39:02,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 665 transitions, 1567 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:02,651 INFO L241 Difference]: Finished difference. Result has 701 places, 665 transitions, 1565 flow [2020-10-09 15:39:02,652 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1565, PETRI_PLACES=701, PETRI_TRANSITIONS=665} [2020-10-09 15:39:02,652 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 34 predicate places. [2020-10-09 15:39:02,652 INFO L481 AbstractCegarLoop]: Abstraction has has 701 places, 665 transitions, 1565 flow [2020-10-09 15:39:02,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:02,652 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:02,652 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:02,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 985 mathsat -unsat_core_generation=3 [2020-10-09 15:39:02,853 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:02,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:02,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1141277354, now seen corresponding path program 1 times [2020-10-09 15:39:02,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:02,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645282024] [2020-10-09 15:39:02,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 986 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 986 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:03,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:39:03,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:03,408 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:39:03,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:39:03,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645282024] [2020-10-09 15:39:03,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:03,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:03,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121979306] [2020-10-09 15:39:03,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:03,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:03,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:03,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:03,434 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:39:03,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 665 transitions, 1565 flow. Second operand 3 states. [2020-10-09 15:39:03,435 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:03,435 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:39:03,436 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:03,684 INFO L129 PetriNetUnfolder]: 51/766 cut-off events. [2020-10-09 15:39:03,684 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:39:03,729 INFO L80 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 766 events. 51/766 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3193 event pairs, 0 based on Foata normal form. 1/691 useless extension candidates. Maximal degree in co-relation 896. Up to 27 conditions per place. [2020-10-09 15:39:03,737 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/662 dead transitions. [2020-10-09 15:39:03,737 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 662 transitions, 1560 flow [2020-10-09 15:39:03,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:39:03,738 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:39:03,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:39:03,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:39:03,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:03,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:39:03,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:03,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:03,741 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:03,741 INFO L185 Difference]: Start difference. First operand has 701 places, 665 transitions, 1565 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:39:03,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 662 transitions, 1560 flow [2020-10-09 15:39:03,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 662 transitions, 1553 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:39:03,748 INFO L241 Difference]: Finished difference. Result has 700 places, 662 transitions, 1545 flow [2020-10-09 15:39:03,748 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1543, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1545, PETRI_PLACES=700, PETRI_TRANSITIONS=662} [2020-10-09 15:39:03,748 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 33 predicate places. [2020-10-09 15:39:03,748 INFO L481 AbstractCegarLoop]: Abstraction has has 700 places, 662 transitions, 1545 flow [2020-10-09 15:39:03,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:03,748 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:03,748 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:03,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 986 mathsat -unsat_core_generation=3 [2020-10-09 15:39:03,949 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:03,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:03,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1141276331, now seen corresponding path program 1 times [2020-10-09 15:39:03,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:03,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138944578] [2020-10-09 15:39:03,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 987 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 987 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:04,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:04,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:39:04,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:39:04,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138944578] [2020-10-09 15:39:04,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:04,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:04,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649983920] [2020-10-09 15:39:04,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:04,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:04,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:04,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:04,526 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:04,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 662 transitions, 1545 flow. Second operand 3 states. [2020-10-09 15:39:04,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:04,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:04,527 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:04,779 INFO L129 PetriNetUnfolder]: 51/764 cut-off events. [2020-10-09 15:39:04,779 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:04,824 INFO L80 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 764 events. 51/764 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3179 event pairs, 0 based on Foata normal form. 0/687 useless extension candidates. Maximal degree in co-relation 898. Up to 27 conditions per place. [2020-10-09 15:39:04,831 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/660 dead transitions. [2020-10-09 15:39:04,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 660 transitions, 1558 flow [2020-10-09 15:39:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:39:04,833 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:39:04,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:39:04,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:39:04,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:04,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:39:04,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:04,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:04,835 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:04,835 INFO L185 Difference]: Start difference. First operand has 700 places, 662 transitions, 1545 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:39:04,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 700 places, 660 transitions, 1558 flow [2020-10-09 15:39:04,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 660 transitions, 1557 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:04,842 INFO L241 Difference]: Finished difference. Result has 699 places, 660 transitions, 1541 flow [2020-10-09 15:39:04,842 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1539, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1541, PETRI_PLACES=699, PETRI_TRANSITIONS=660} [2020-10-09 15:39:04,842 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 32 predicate places. [2020-10-09 15:39:04,842 INFO L481 AbstractCegarLoop]: Abstraction has has 699 places, 660 transitions, 1541 flow [2020-10-09 15:39:04,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:04,842 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:04,842 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:05,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 987 mathsat -unsat_core_generation=3 [2020-10-09 15:39:05,043 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:05,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:05,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2020913986, now seen corresponding path program 1 times [2020-10-09 15:39:05,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:05,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57553931] [2020-10-09 15:39:05,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 988 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 988 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:05,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:05,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:05,606 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:39:05,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:39:05,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57553931] [2020-10-09 15:39:05,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:05,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:05,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991552067] [2020-10-09 15:39:05,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:05,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:05,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:05,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:05,638 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:05,639 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 699 places, 660 transitions, 1541 flow. Second operand 3 states. [2020-10-09 15:39:05,639 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:05,639 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:05,639 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:05,921 INFO L129 PetriNetUnfolder]: 50/772 cut-off events. [2020-10-09 15:39:05,921 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:05,972 INFO L80 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 772 events. 50/772 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3243 event pairs, 0 based on Foata normal form. 0/695 useless extension candidates. Maximal degree in co-relation 910. Up to 27 conditions per place. [2020-10-09 15:39:05,980 INFO L132 encePairwiseOnDemand]: 714/719 looper letters, 10 selfloop transitions, 3 changer transitions 0/662 dead transitions. [2020-10-09 15:39:05,980 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 701 places, 662 transitions, 1571 flow [2020-10-09 15:39:05,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:05,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2055 transitions. [2020-10-09 15:39:05,981 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.952712100139082 [2020-10-09 15:39:05,981 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2055 transitions. [2020-10-09 15:39:05,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2055 transitions. [2020-10-09 15:39:05,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:05,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2055 transitions. [2020-10-09 15:39:05,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:05,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:05,983 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:05,984 INFO L185 Difference]: Start difference. First operand has 699 places, 660 transitions, 1541 flow. Second operand 3 states and 2055 transitions. [2020-10-09 15:39:05,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 701 places, 662 transitions, 1571 flow [2020-10-09 15:39:05,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 662 transitions, 1570 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:05,991 INFO L241 Difference]: Finished difference. Result has 702 places, 662 transitions, 1564 flow [2020-10-09 15:39:05,991 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1564, PETRI_PLACES=702, PETRI_TRANSITIONS=662} [2020-10-09 15:39:05,991 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 35 predicate places. [2020-10-09 15:39:05,991 INFO L481 AbstractCegarLoop]: Abstraction has has 702 places, 662 transitions, 1564 flow [2020-10-09 15:39:05,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:05,991 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:05,991 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:06,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 988 mathsat -unsat_core_generation=3 [2020-10-09 15:39:06,192 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:06,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:06,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2020912963, now seen corresponding path program 1 times [2020-10-09 15:39:06,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:06,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769900715] [2020-10-09 15:39:06,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 989 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 989 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:06,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:06,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:39:06,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:39:06,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769900715] [2020-10-09 15:39:06,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:06,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:06,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481370437] [2020-10-09 15:39:06,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:06,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:06,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:06,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:06,778 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:39:06,779 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 662 transitions, 1564 flow. Second operand 3 states. [2020-10-09 15:39:06,779 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:06,779 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:39:06,779 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:07,122 INFO L129 PetriNetUnfolder]: 49/770 cut-off events. [2020-10-09 15:39:07,123 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:39:07,158 INFO L80 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 770 events. 49/770 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3235 event pairs, 0 based on Foata normal form. 0/696 useless extension candidates. Maximal degree in co-relation 907. Up to 27 conditions per place. [2020-10-09 15:39:07,165 INFO L132 encePairwiseOnDemand]: 716/719 looper letters, 5 selfloop transitions, 2 changer transitions 0/662 dead transitions. [2020-10-09 15:39:07,165 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 662 transitions, 1576 flow [2020-10-09 15:39:07,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:07,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:07,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2063 transitions. [2020-10-09 15:39:07,166 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9564209550301345 [2020-10-09 15:39:07,166 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2063 transitions. [2020-10-09 15:39:07,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2063 transitions. [2020-10-09 15:39:07,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:07,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2063 transitions. [2020-10-09 15:39:07,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:07,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:07,169 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:07,170 INFO L185 Difference]: Start difference. First operand has 702 places, 662 transitions, 1564 flow. Second operand 3 states and 2063 transitions. [2020-10-09 15:39:07,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 662 transitions, 1576 flow [2020-10-09 15:39:07,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 662 transitions, 1571 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:07,176 INFO L241 Difference]: Finished difference. Result has 705 places, 662 transitions, 1569 flow [2020-10-09 15:39:07,176 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1569, PETRI_PLACES=705, PETRI_TRANSITIONS=662} [2020-10-09 15:39:07,177 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 38 predicate places. [2020-10-09 15:39:07,177 INFO L481 AbstractCegarLoop]: Abstraction has has 705 places, 662 transitions, 1569 flow [2020-10-09 15:39:07,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:07,177 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:07,177 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:07,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 989 mathsat -unsat_core_generation=3 [2020-10-09 15:39:07,378 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:07,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:07,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2019960674, now seen corresponding path program 1 times [2020-10-09 15:39:07,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:07,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333492015] [2020-10-09 15:39:07,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 990 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 990 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:07,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:39:07,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:07,940 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:39:07,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:39:07,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333492015] [2020-10-09 15:39:07,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:07,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:07,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436122629] [2020-10-09 15:39:07,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:07,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:07,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:07,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:07,965 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:39:07,966 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 662 transitions, 1569 flow. Second operand 3 states. [2020-10-09 15:39:07,966 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:07,966 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:39:07,967 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:08,218 INFO L129 PetriNetUnfolder]: 48/766 cut-off events. [2020-10-09 15:39:08,218 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:39:08,264 INFO L80 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 766 events. 48/766 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3208 event pairs, 0 based on Foata normal form. 1/694 useless extension candidates. Maximal degree in co-relation 903. Up to 27 conditions per place. [2020-10-09 15:39:08,271 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/659 dead transitions. [2020-10-09 15:39:08,271 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 659 transitions, 1564 flow [2020-10-09 15:39:08,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:39:08,272 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:39:08,272 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:39:08,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:39:08,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:08,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:39:08,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:08,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:08,274 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:08,274 INFO L185 Difference]: Start difference. First operand has 705 places, 662 transitions, 1569 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:39:08,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 659 transitions, 1564 flow [2020-10-09 15:39:08,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 659 transitions, 1557 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:39:08,281 INFO L241 Difference]: Finished difference. Result has 704 places, 659 transitions, 1549 flow [2020-10-09 15:39:08,281 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1547, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1549, PETRI_PLACES=704, PETRI_TRANSITIONS=659} [2020-10-09 15:39:08,281 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 37 predicate places. [2020-10-09 15:39:08,281 INFO L481 AbstractCegarLoop]: Abstraction has has 704 places, 659 transitions, 1549 flow [2020-10-09 15:39:08,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:08,281 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:08,282 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:08,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 990 mathsat -unsat_core_generation=3 [2020-10-09 15:39:08,482 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:08,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:08,483 INFO L82 PathProgramCache]: Analyzing trace with hash -2019959651, now seen corresponding path program 1 times [2020-10-09 15:39:08,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:08,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117913881] [2020-10-09 15:39:08,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 991 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 991 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:09,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:09,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:39:09,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:09,046 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:39:09,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117913881] [2020-10-09 15:39:09,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:09,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:09,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721473269] [2020-10-09 15:39:09,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:09,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:09,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:09,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:09,075 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:09,076 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 659 transitions, 1549 flow. Second operand 3 states. [2020-10-09 15:39:09,076 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:09,076 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:09,076 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:09,329 INFO L129 PetriNetUnfolder]: 48/764 cut-off events. [2020-10-09 15:39:09,329 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:09,374 INFO L80 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 764 events. 48/764 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3191 event pairs, 0 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 905. Up to 27 conditions per place. [2020-10-09 15:39:09,381 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/657 dead transitions. [2020-10-09 15:39:09,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 657 transitions, 1562 flow [2020-10-09 15:39:09,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:09,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:09,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:39:09,383 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:39:09,383 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:39:09,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:39:09,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:09,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:39:09,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:09,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:09,385 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:09,385 INFO L185 Difference]: Start difference. First operand has 704 places, 659 transitions, 1549 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:39:09,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 657 transitions, 1562 flow [2020-10-09 15:39:09,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 657 transitions, 1561 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:09,391 INFO L241 Difference]: Finished difference. Result has 703 places, 657 transitions, 1545 flow [2020-10-09 15:39:09,391 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1543, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1545, PETRI_PLACES=703, PETRI_TRANSITIONS=657} [2020-10-09 15:39:09,392 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 36 predicate places. [2020-10-09 15:39:09,392 INFO L481 AbstractCegarLoop]: Abstraction has has 703 places, 657 transitions, 1545 flow [2020-10-09 15:39:09,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:09,392 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:09,392 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:09,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 991 mathsat -unsat_core_generation=3 [2020-10-09 15:39:09,593 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:09,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:09,593 INFO L82 PathProgramCache]: Analyzing trace with hash 921376743, now seen corresponding path program 1 times [2020-10-09 15:39:09,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:09,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335733659] [2020-10-09 15:39:09,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 992 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 992 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:10,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:39:10,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:39:10,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:39:10,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335733659] [2020-10-09 15:39:10,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:10,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:10,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906104912] [2020-10-09 15:39:10,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:10,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:10,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:10,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:10,172 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:39:10,174 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 657 transitions, 1545 flow. Second operand 3 states. [2020-10-09 15:39:10,174 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:10,174 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:39:10,174 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:10,429 INFO L129 PetriNetUnfolder]: 47/771 cut-off events. [2020-10-09 15:39:10,429 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:10,475 INFO L80 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 771 events. 47/771 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3257 event pairs, 0 based on Foata normal form. 1/699 useless extension candidates. Maximal degree in co-relation 908. Up to 27 conditions per place. [2020-10-09 15:39:10,482 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/657 dead transitions. [2020-10-09 15:39:10,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 657 transitions, 1555 flow [2020-10-09 15:39:10,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:39:10,484 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:39:10,484 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:39:10,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:39:10,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:10,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:39:10,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:10,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:10,486 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:10,486 INFO L185 Difference]: Start difference. First operand has 703 places, 657 transitions, 1545 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:39:10,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 705 places, 657 transitions, 1555 flow [2020-10-09 15:39:10,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 657 transitions, 1554 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:10,492 INFO L241 Difference]: Finished difference. Result has 705 places, 657 transitions, 1549 flow [2020-10-09 15:39:10,493 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1549, PETRI_PLACES=705, PETRI_TRANSITIONS=657} [2020-10-09 15:39:10,493 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 38 predicate places. [2020-10-09 15:39:10,493 INFO L481 AbstractCegarLoop]: Abstraction has has 705 places, 657 transitions, 1549 flow [2020-10-09 15:39:10,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:10,493 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:10,493 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:10,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 992 mathsat -unsat_core_generation=3 [2020-10-09 15:39:10,694 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:10,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:10,694 INFO L82 PathProgramCache]: Analyzing trace with hash 921377766, now seen corresponding path program 1 times [2020-10-09 15:39:10,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:10,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339131616] [2020-10-09 15:39:10,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 993 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 993 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:11,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:11,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:11,253 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:39:11,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:39:11,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339131616] [2020-10-09 15:39:11,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:11,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:11,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022744848] [2020-10-09 15:39:11,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:11,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:11,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:11,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:11,283 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:11,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 657 transitions, 1549 flow. Second operand 3 states. [2020-10-09 15:39:11,284 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:11,284 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:11,284 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:11,550 INFO L129 PetriNetUnfolder]: 45/773 cut-off events. [2020-10-09 15:39:11,550 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:39:11,596 INFO L80 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 773 events. 45/773 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3286 event pairs, 0 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 921. Up to 27 conditions per place. [2020-10-09 15:39:11,603 INFO L132 encePairwiseOnDemand]: 715/719 looper letters, 9 selfloop transitions, 3 changer transitions 0/658 dead transitions. [2020-10-09 15:39:11,603 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 658 transitions, 1575 flow [2020-10-09 15:39:11,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2053 transitions. [2020-10-09 15:39:11,605 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.951784886416319 [2020-10-09 15:39:11,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2053 transitions. [2020-10-09 15:39:11,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2053 transitions. [2020-10-09 15:39:11,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:11,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2053 transitions. [2020-10-09 15:39:11,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:11,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:11,607 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:11,607 INFO L185 Difference]: Start difference. First operand has 705 places, 657 transitions, 1549 flow. Second operand 3 states and 2053 transitions. [2020-10-09 15:39:11,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 658 transitions, 1575 flow [2020-10-09 15:39:11,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 658 transitions, 1574 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:11,614 INFO L241 Difference]: Finished difference. Result has 708 places, 658 transitions, 1566 flow [2020-10-09 15:39:11,614 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=704, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1566, PETRI_PLACES=708, PETRI_TRANSITIONS=658} [2020-10-09 15:39:11,614 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 41 predicate places. [2020-10-09 15:39:11,614 INFO L481 AbstractCegarLoop]: Abstraction has has 708 places, 658 transitions, 1566 flow [2020-10-09 15:39:11,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:11,614 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:11,614 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:11,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 993 mathsat -unsat_core_generation=3 [2020-10-09 15:39:11,815 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:11,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:11,815 INFO L82 PathProgramCache]: Analyzing trace with hash 920424454, now seen corresponding path program 1 times [2020-10-09 15:39:11,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:11,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061869215] [2020-10-09 15:39:11,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 994 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 994 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:12,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:12,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:39:12,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:39:12,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061869215] [2020-10-09 15:39:12,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:12,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:12,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077492289] [2020-10-09 15:39:12,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:12,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:12,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:12,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:12,392 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:39:12,394 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 658 transitions, 1566 flow. Second operand 3 states. [2020-10-09 15:39:12,394 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:12,394 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:39:12,394 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:12,647 INFO L129 PetriNetUnfolder]: 45/766 cut-off events. [2020-10-09 15:39:12,648 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:39:12,693 INFO L80 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 766 events. 45/766 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3228 event pairs, 0 based on Foata normal form. 1/697 useless extension candidates. Maximal degree in co-relation 907. Up to 27 conditions per place. [2020-10-09 15:39:12,699 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 5 selfloop transitions, 1 changer transitions 0/656 dead transitions. [2020-10-09 15:39:12,700 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 656 transitions, 1568 flow [2020-10-09 15:39:12,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2020-10-09 15:39:12,701 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9559573481687529 [2020-10-09 15:39:12,701 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2020-10-09 15:39:12,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2020-10-09 15:39:12,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:12,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2020-10-09 15:39:12,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:12,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:12,703 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:12,703 INFO L185 Difference]: Start difference. First operand has 708 places, 658 transitions, 1566 flow. Second operand 3 states and 2062 transitions. [2020-10-09 15:39:12,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 656 transitions, 1568 flow [2020-10-09 15:39:12,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 656 transitions, 1560 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:39:12,710 INFO L241 Difference]: Finished difference. Result has 708 places, 656 transitions, 1553 flow [2020-10-09 15:39:12,710 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1553, PETRI_PLACES=708, PETRI_TRANSITIONS=656} [2020-10-09 15:39:12,710 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 41 predicate places. [2020-10-09 15:39:12,710 INFO L481 AbstractCegarLoop]: Abstraction has has 708 places, 656 transitions, 1553 flow [2020-10-09 15:39:12,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:12,710 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:12,710 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:12,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 994 mathsat -unsat_core_generation=3 [2020-10-09 15:39:12,911 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:12,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:12,912 INFO L82 PathProgramCache]: Analyzing trace with hash 920423431, now seen corresponding path program 1 times [2020-10-09 15:39:12,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:12,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328013258] [2020-10-09 15:39:12,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 995 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 995 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:13,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:13,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:39:13,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:39:13,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328013258] [2020-10-09 15:39:13,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:13,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:13,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449364421] [2020-10-09 15:39:13,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:13,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:13,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:13,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:13,581 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:13,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 656 transitions, 1553 flow. Second operand 3 states. [2020-10-09 15:39:13,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:13,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:13,583 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:13,844 INFO L129 PetriNetUnfolder]: 45/764 cut-off events. [2020-10-09 15:39:13,845 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:39:13,890 INFO L80 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 764 events. 45/764 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3214 event pairs, 0 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 911. Up to 27 conditions per place. [2020-10-09 15:39:13,896 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/654 dead transitions. [2020-10-09 15:39:13,896 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 654 transitions, 1566 flow [2020-10-09 15:39:13,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:39:13,898 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:39:13,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:39:13,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:39:13,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:13,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:39:13,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:13,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:13,900 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:13,900 INFO L185 Difference]: Start difference. First operand has 708 places, 656 transitions, 1553 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:39:13,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 654 transitions, 1566 flow [2020-10-09 15:39:13,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 654 transitions, 1565 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:13,906 INFO L241 Difference]: Finished difference. Result has 707 places, 654 transitions, 1549 flow [2020-10-09 15:39:13,907 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1547, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=653, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1549, PETRI_PLACES=707, PETRI_TRANSITIONS=654} [2020-10-09 15:39:13,907 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 40 predicate places. [2020-10-09 15:39:13,907 INFO L481 AbstractCegarLoop]: Abstraction has has 707 places, 654 transitions, 1549 flow [2020-10-09 15:39:13,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:13,907 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:13,907 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:14,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 995 mathsat -unsat_core_generation=3 [2020-10-09 15:39:14,108 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:14,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:14,108 INFO L82 PathProgramCache]: Analyzing trace with hash -977703760, now seen corresponding path program 1 times [2020-10-09 15:39:14,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:14,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977477233] [2020-10-09 15:39:14,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 996 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 996 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:14,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:14,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:39:14,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:39:14,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977477233] [2020-10-09 15:39:14,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:14,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:14,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985415740] [2020-10-09 15:39:14,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:14,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:14,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:14,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:14,717 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:14,718 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 654 transitions, 1549 flow. Second operand 3 states. [2020-10-09 15:39:14,718 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:14,718 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:14,718 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:14,993 INFO L129 PetriNetUnfolder]: 44/772 cut-off events. [2020-10-09 15:39:14,993 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:15,041 INFO L80 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 772 events. 44/772 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3278 event pairs, 0 based on Foata normal form. 0/701 useless extension candidates. Maximal degree in co-relation 923. Up to 27 conditions per place. [2020-10-09 15:39:15,048 INFO L132 encePairwiseOnDemand]: 714/719 looper letters, 10 selfloop transitions, 3 changer transitions 0/656 dead transitions. [2020-10-09 15:39:15,048 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 656 transitions, 1579 flow [2020-10-09 15:39:15,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2055 transitions. [2020-10-09 15:39:15,049 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.952712100139082 [2020-10-09 15:39:15,049 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2055 transitions. [2020-10-09 15:39:15,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2055 transitions. [2020-10-09 15:39:15,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:15,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2055 transitions. [2020-10-09 15:39:15,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:15,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:15,052 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:15,052 INFO L185 Difference]: Start difference. First operand has 707 places, 654 transitions, 1549 flow. Second operand 3 states and 2055 transitions. [2020-10-09 15:39:15,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 656 transitions, 1579 flow [2020-10-09 15:39:15,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 656 transitions, 1578 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:15,059 INFO L241 Difference]: Finished difference. Result has 710 places, 656 transitions, 1572 flow [2020-10-09 15:39:15,059 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1572, PETRI_PLACES=710, PETRI_TRANSITIONS=656} [2020-10-09 15:39:15,060 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 43 predicate places. [2020-10-09 15:39:15,060 INFO L481 AbstractCegarLoop]: Abstraction has has 710 places, 656 transitions, 1572 flow [2020-10-09 15:39:15,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:15,060 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:15,060 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:15,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 996 mathsat -unsat_core_generation=3 [2020-10-09 15:39:15,261 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:15,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:15,261 INFO L82 PathProgramCache]: Analyzing trace with hash -977704783, now seen corresponding path program 1 times [2020-10-09 15:39:15,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:15,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397421378] [2020-10-09 15:39:15,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 997 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 997 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:15,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:39:15,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:39:15,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:39:15,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397421378] [2020-10-09 15:39:15,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:15,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:15,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030902588] [2020-10-09 15:39:15,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:15,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:15,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:15,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:15,857 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:39:15,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 656 transitions, 1572 flow. Second operand 3 states. [2020-10-09 15:39:15,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:15,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:39:15,859 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:16,136 INFO L129 PetriNetUnfolder]: 42/773 cut-off events. [2020-10-09 15:39:16,136 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:39:16,186 INFO L80 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 773 events. 42/773 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3305 event pairs, 0 based on Foata normal form. 1/707 useless extension candidates. Maximal degree in co-relation 921. Up to 27 conditions per place. [2020-10-09 15:39:16,193 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/655 dead transitions. [2020-10-09 15:39:16,193 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 655 transitions, 1578 flow [2020-10-09 15:39:16,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:16,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:39:16,195 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:39:16,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:39:16,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:39:16,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:16,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:39:16,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:16,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:16,197 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:16,197 INFO L185 Difference]: Start difference. First operand has 710 places, 656 transitions, 1572 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:39:16,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 655 transitions, 1578 flow [2020-10-09 15:39:16,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 655 transitions, 1573 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:16,204 INFO L241 Difference]: Finished difference. Result has 712 places, 655 transitions, 1568 flow [2020-10-09 15:39:16,204 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1563, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1568, PETRI_PLACES=712, PETRI_TRANSITIONS=655} [2020-10-09 15:39:16,204 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 45 predicate places. [2020-10-09 15:39:16,204 INFO L481 AbstractCegarLoop]: Abstraction has has 712 places, 655 transitions, 1568 flow [2020-10-09 15:39:16,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:16,204 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:16,205 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:16,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 997 mathsat -unsat_core_generation=3 [2020-10-09 15:39:16,405 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:16,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:16,406 INFO L82 PathProgramCache]: Analyzing trace with hash -978657072, now seen corresponding path program 1 times [2020-10-09 15:39:16,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:16,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35786341] [2020-10-09 15:39:16,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 998 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 998 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:16,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:16,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:39:16,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:39:16,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35786341] [2020-10-09 15:39:16,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:16,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:16,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096325124] [2020-10-09 15:39:16,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:16,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:16,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:16,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:16,986 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:39:16,987 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 655 transitions, 1568 flow. Second operand 3 states. [2020-10-09 15:39:16,987 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:16,987 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:39:16,988 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:17,247 INFO L129 PetriNetUnfolder]: 42/766 cut-off events. [2020-10-09 15:39:17,247 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:39:17,293 INFO L80 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 766 events. 42/766 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3243 event pairs, 0 based on Foata normal form. 1/700 useless extension candidates. Maximal degree in co-relation 917. Up to 27 conditions per place. [2020-10-09 15:39:17,299 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 5 selfloop transitions, 1 changer transitions 0/653 dead transitions. [2020-10-09 15:39:17,299 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 653 transitions, 1571 flow [2020-10-09 15:39:17,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2020-10-09 15:39:17,300 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9559573481687529 [2020-10-09 15:39:17,300 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2020-10-09 15:39:17,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2020-10-09 15:39:17,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:17,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2020-10-09 15:39:17,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:17,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:17,302 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:17,303 INFO L185 Difference]: Start difference. First operand has 712 places, 655 transitions, 1568 flow. Second operand 3 states and 2062 transitions. [2020-10-09 15:39:17,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 653 transitions, 1571 flow [2020-10-09 15:39:17,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 653 transitions, 1564 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:39:17,309 INFO L241 Difference]: Finished difference. Result has 712 places, 653 transitions, 1557 flow [2020-10-09 15:39:17,309 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1557, PETRI_PLACES=712, PETRI_TRANSITIONS=653} [2020-10-09 15:39:17,310 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 45 predicate places. [2020-10-09 15:39:17,310 INFO L481 AbstractCegarLoop]: Abstraction has has 712 places, 653 transitions, 1557 flow [2020-10-09 15:39:17,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:17,310 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:17,310 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:17,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 998 mathsat -unsat_core_generation=3 [2020-10-09 15:39:17,511 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:17,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:17,511 INFO L82 PathProgramCache]: Analyzing trace with hash -978658095, now seen corresponding path program 1 times [2020-10-09 15:39:17,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:17,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511893846] [2020-10-09 15:39:17,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 999 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 999 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:18,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:18,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:39:18,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:39:18,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511893846] [2020-10-09 15:39:18,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:18,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:18,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909169622] [2020-10-09 15:39:18,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:18,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:18,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:18,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:18,097 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:18,098 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 653 transitions, 1557 flow. Second operand 3 states. [2020-10-09 15:39:18,098 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:18,098 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:18,098 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:18,362 INFO L129 PetriNetUnfolder]: 42/764 cut-off events. [2020-10-09 15:39:18,362 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:39:18,408 INFO L80 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 764 events. 42/764 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3226 event pairs, 0 based on Foata normal form. 0/696 useless extension candidates. Maximal degree in co-relation 917. Up to 27 conditions per place. [2020-10-09 15:39:18,414 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/651 dead transitions. [2020-10-09 15:39:18,414 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 651 transitions, 1570 flow [2020-10-09 15:39:18,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:18,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:18,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:39:18,415 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:39:18,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:39:18,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:39:18,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:18,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:39:18,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:18,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:18,417 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:18,417 INFO L185 Difference]: Start difference. First operand has 712 places, 653 transitions, 1557 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:39:18,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 651 transitions, 1570 flow [2020-10-09 15:39:18,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 651 transitions, 1569 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:18,424 INFO L241 Difference]: Finished difference. Result has 711 places, 651 transitions, 1553 flow [2020-10-09 15:39:18,424 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=650, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1553, PETRI_PLACES=711, PETRI_TRANSITIONS=651} [2020-10-09 15:39:18,424 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 44 predicate places. [2020-10-09 15:39:18,424 INFO L481 AbstractCegarLoop]: Abstraction has has 711 places, 651 transitions, 1553 flow [2020-10-09 15:39:18,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:18,425 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:18,425 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:18,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 999 mathsat -unsat_core_generation=3 [2020-10-09 15:39:18,625 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:18,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:18,626 INFO L82 PathProgramCache]: Analyzing trace with hash 919924892, now seen corresponding path program 1 times [2020-10-09 15:39:18,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:18,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612422542] [2020-10-09 15:39:18,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1000 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1000 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:19,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:19,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:39:19,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:39:19,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612422542] [2020-10-09 15:39:19,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:19,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:19,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765106307] [2020-10-09 15:39:19,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:19,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:19,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:19,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:19,212 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:19,214 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 711 places, 651 transitions, 1553 flow. Second operand 3 states. [2020-10-09 15:39:19,214 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:19,214 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:19,214 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:19,581 INFO L129 PetriNetUnfolder]: 41/772 cut-off events. [2020-10-09 15:39:19,582 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:19,607 INFO L80 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 772 events. 41/772 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3302 event pairs, 0 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 929. Up to 27 conditions per place. [2020-10-09 15:39:19,612 INFO L132 encePairwiseOnDemand]: 714/719 looper letters, 10 selfloop transitions, 3 changer transitions 0/653 dead transitions. [2020-10-09 15:39:19,612 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 653 transitions, 1583 flow [2020-10-09 15:39:19,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:19,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2055 transitions. [2020-10-09 15:39:19,614 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.952712100139082 [2020-10-09 15:39:19,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2055 transitions. [2020-10-09 15:39:19,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2055 transitions. [2020-10-09 15:39:19,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:19,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2055 transitions. [2020-10-09 15:39:19,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:19,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:19,616 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:19,616 INFO L185 Difference]: Start difference. First operand has 711 places, 651 transitions, 1553 flow. Second operand 3 states and 2055 transitions. [2020-10-09 15:39:19,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 713 places, 653 transitions, 1583 flow [2020-10-09 15:39:19,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 653 transitions, 1582 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:19,622 INFO L241 Difference]: Finished difference. Result has 714 places, 653 transitions, 1576 flow [2020-10-09 15:39:19,623 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1576, PETRI_PLACES=714, PETRI_TRANSITIONS=653} [2020-10-09 15:39:19,623 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 47 predicate places. [2020-10-09 15:39:19,623 INFO L481 AbstractCegarLoop]: Abstraction has has 714 places, 653 transitions, 1576 flow [2020-10-09 15:39:19,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:19,623 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:19,623 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:19,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1000 mathsat -unsat_core_generation=3 [2020-10-09 15:39:19,824 INFO L429 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:19,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:19,824 INFO L82 PathProgramCache]: Analyzing trace with hash 919925915, now seen corresponding path program 1 times [2020-10-09 15:39:19,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:19,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28839254] [2020-10-09 15:39:19,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1001 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1001 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:20,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:20,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:20,392 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:39:20,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:39:20,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28839254] [2020-10-09 15:39:20,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:20,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:20,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757117125] [2020-10-09 15:39:20,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:20,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:20,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:20,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:20,413 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:39:20,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 714 places, 653 transitions, 1576 flow. Second operand 3 states. [2020-10-09 15:39:20,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:20,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:39:20,415 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:20,678 INFO L129 PetriNetUnfolder]: 40/770 cut-off events. [2020-10-09 15:39:20,678 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:39:20,725 INFO L80 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 770 events. 40/770 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3288 event pairs, 0 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 926. Up to 27 conditions per place. [2020-10-09 15:39:20,731 INFO L132 encePairwiseOnDemand]: 716/719 looper letters, 5 selfloop transitions, 2 changer transitions 0/653 dead transitions. [2020-10-09 15:39:20,731 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 716 places, 653 transitions, 1588 flow [2020-10-09 15:39:20,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:20,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2063 transitions. [2020-10-09 15:39:20,732 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9564209550301345 [2020-10-09 15:39:20,732 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2063 transitions. [2020-10-09 15:39:20,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2063 transitions. [2020-10-09 15:39:20,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:20,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2063 transitions. [2020-10-09 15:39:20,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:20,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:20,734 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:20,734 INFO L185 Difference]: Start difference. First operand has 714 places, 653 transitions, 1576 flow. Second operand 3 states and 2063 transitions. [2020-10-09 15:39:20,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 716 places, 653 transitions, 1588 flow [2020-10-09 15:39:20,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 653 transitions, 1583 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:20,741 INFO L241 Difference]: Finished difference. Result has 717 places, 653 transitions, 1581 flow [2020-10-09 15:39:20,741 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1567, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=650, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1581, PETRI_PLACES=717, PETRI_TRANSITIONS=653} [2020-10-09 15:39:20,741 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 50 predicate places. [2020-10-09 15:39:20,742 INFO L481 AbstractCegarLoop]: Abstraction has has 717 places, 653 transitions, 1581 flow [2020-10-09 15:39:20,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:20,742 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:20,742 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:20,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1001 mathsat -unsat_core_generation=3 [2020-10-09 15:39:20,942 INFO L429 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:20,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:20,943 INFO L82 PathProgramCache]: Analyzing trace with hash 920878204, now seen corresponding path program 1 times [2020-10-09 15:39:20,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:20,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772162098] [2020-10-09 15:39:20,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1002 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1002 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:21,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:39:21,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:21,512 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:39:21,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:21,516 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:39:21,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772162098] [2020-10-09 15:39:21,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:21,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:21,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196073945] [2020-10-09 15:39:21,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:21,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:21,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:21,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:21,538 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:39:21,539 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 653 transitions, 1581 flow. Second operand 3 states. [2020-10-09 15:39:21,539 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:21,540 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:39:21,540 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:21,798 INFO L129 PetriNetUnfolder]: 39/766 cut-off events. [2020-10-09 15:39:21,798 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:39:21,843 INFO L80 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 766 events. 39/766 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3263 event pairs, 0 based on Foata normal form. 1/703 useless extension candidates. Maximal degree in co-relation 922. Up to 27 conditions per place. [2020-10-09 15:39:21,849 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/650 dead transitions. [2020-10-09 15:39:21,849 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 650 transitions, 1576 flow [2020-10-09 15:39:21,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:21,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:39:21,851 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:39:21,851 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:39:21,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:39:21,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:21,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:39:21,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:21,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:21,853 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:21,853 INFO L185 Difference]: Start difference. First operand has 717 places, 653 transitions, 1581 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:39:21,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 650 transitions, 1576 flow [2020-10-09 15:39:21,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 650 transitions, 1569 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:39:21,860 INFO L241 Difference]: Finished difference. Result has 716 places, 650 transitions, 1561 flow [2020-10-09 15:39:21,860 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1559, PETRI_DIFFERENCE_MINUEND_PLACES=714, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1561, PETRI_PLACES=716, PETRI_TRANSITIONS=650} [2020-10-09 15:39:21,860 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 49 predicate places. [2020-10-09 15:39:21,860 INFO L481 AbstractCegarLoop]: Abstraction has has 716 places, 650 transitions, 1561 flow [2020-10-09 15:39:21,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:21,860 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:21,860 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:22,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1002 mathsat -unsat_core_generation=3 [2020-10-09 15:39:22,061 INFO L429 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:22,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:22,062 INFO L82 PathProgramCache]: Analyzing trace with hash 920879227, now seen corresponding path program 1 times [2020-10-09 15:39:22,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:22,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126669212] [2020-10-09 15:39:22,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1003 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1003 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:22,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:22,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:39:22,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:22,626 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:39:22,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126669212] [2020-10-09 15:39:22,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:22,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:22,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159867181] [2020-10-09 15:39:22,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:22,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:22,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:22,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:22,646 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:22,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 650 transitions, 1561 flow. Second operand 3 states. [2020-10-09 15:39:22,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:22,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:22,647 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:22,915 INFO L129 PetriNetUnfolder]: 39/764 cut-off events. [2020-10-09 15:39:22,915 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:22,966 INFO L80 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 764 events. 39/764 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3249 event pairs, 0 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 924. Up to 27 conditions per place. [2020-10-09 15:39:22,972 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/648 dead transitions. [2020-10-09 15:39:22,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 716 places, 648 transitions, 1574 flow [2020-10-09 15:39:22,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:39:22,974 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:39:22,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:39:22,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:39:22,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:22,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:39:22,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:22,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:22,976 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:22,976 INFO L185 Difference]: Start difference. First operand has 716 places, 650 transitions, 1561 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:39:22,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 716 places, 648 transitions, 1574 flow [2020-10-09 15:39:22,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 648 transitions, 1573 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:22,984 INFO L241 Difference]: Finished difference. Result has 715 places, 648 transitions, 1557 flow [2020-10-09 15:39:22,984 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1557, PETRI_PLACES=715, PETRI_TRANSITIONS=648} [2020-10-09 15:39:22,984 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 48 predicate places. [2020-10-09 15:39:22,984 INFO L481 AbstractCegarLoop]: Abstraction has has 715 places, 648 transitions, 1557 flow [2020-10-09 15:39:22,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:22,984 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:22,984 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:23,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1003 mathsat -unsat_core_generation=3 [2020-10-09 15:39:23,185 INFO L429 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:23,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:23,186 INFO L82 PathProgramCache]: Analyzing trace with hash 780936936, now seen corresponding path program 1 times [2020-10-09 15:39:23,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:23,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595711497] [2020-10-09 15:39:23,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1004 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1004 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:23,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:23,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:39:23,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:23,760 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:39:23,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595711497] [2020-10-09 15:39:23,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:23,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:23,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729327312] [2020-10-09 15:39:23,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:23,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:23,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:23,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:23,790 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:23,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 648 transitions, 1557 flow. Second operand 3 states. [2020-10-09 15:39:23,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:23,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:23,792 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:24,068 INFO L129 PetriNetUnfolder]: 38/772 cut-off events. [2020-10-09 15:39:24,068 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:24,117 INFO L80 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 772 events. 38/772 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3315 event pairs, 0 based on Foata normal form. 0/707 useless extension candidates. Maximal degree in co-relation 936. Up to 27 conditions per place. [2020-10-09 15:39:24,123 INFO L132 encePairwiseOnDemand]: 714/719 looper letters, 10 selfloop transitions, 3 changer transitions 0/650 dead transitions. [2020-10-09 15:39:24,123 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 650 transitions, 1587 flow [2020-10-09 15:39:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2055 transitions. [2020-10-09 15:39:24,125 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.952712100139082 [2020-10-09 15:39:24,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2055 transitions. [2020-10-09 15:39:24,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2055 transitions. [2020-10-09 15:39:24,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:24,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2055 transitions. [2020-10-09 15:39:24,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:24,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:24,127 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:24,127 INFO L185 Difference]: Start difference. First operand has 715 places, 648 transitions, 1557 flow. Second operand 3 states and 2055 transitions. [2020-10-09 15:39:24,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 717 places, 650 transitions, 1587 flow [2020-10-09 15:39:24,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 650 transitions, 1586 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:24,134 INFO L241 Difference]: Finished difference. Result has 718 places, 650 transitions, 1580 flow [2020-10-09 15:39:24,134 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=714, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1580, PETRI_PLACES=718, PETRI_TRANSITIONS=650} [2020-10-09 15:39:24,134 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 51 predicate places. [2020-10-09 15:39:24,134 INFO L481 AbstractCegarLoop]: Abstraction has has 718 places, 650 transitions, 1580 flow [2020-10-09 15:39:24,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:24,135 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:24,135 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:24,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1004 mathsat -unsat_core_generation=3 [2020-10-09 15:39:24,335 INFO L429 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:24,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:24,336 INFO L82 PathProgramCache]: Analyzing trace with hash 780937959, now seen corresponding path program 1 times [2020-10-09 15:39:24,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:24,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37984443] [2020-10-09 15:39:24,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1005 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1005 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:24,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:24,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:39:24,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:24,907 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:39:24,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37984443] [2020-10-09 15:39:24,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:24,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:24,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164319433] [2020-10-09 15:39:24,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:24,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:24,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:24,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:24,926 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:39:24,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 650 transitions, 1580 flow. Second operand 3 states. [2020-10-09 15:39:24,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:24,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:39:24,928 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:25,201 INFO L129 PetriNetUnfolder]: 37/770 cut-off events. [2020-10-09 15:39:25,201 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:39:25,249 INFO L80 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 770 events. 37/770 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3305 event pairs, 0 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 933. Up to 27 conditions per place. [2020-10-09 15:39:25,255 INFO L132 encePairwiseOnDemand]: 716/719 looper letters, 5 selfloop transitions, 2 changer transitions 0/650 dead transitions. [2020-10-09 15:39:25,255 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 650 transitions, 1592 flow [2020-10-09 15:39:25,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2063 transitions. [2020-10-09 15:39:25,256 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9564209550301345 [2020-10-09 15:39:25,256 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2063 transitions. [2020-10-09 15:39:25,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2063 transitions. [2020-10-09 15:39:25,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:25,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2063 transitions. [2020-10-09 15:39:25,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:25,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:25,259 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:25,259 INFO L185 Difference]: Start difference. First operand has 718 places, 650 transitions, 1580 flow. Second operand 3 states and 2063 transitions. [2020-10-09 15:39:25,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 650 transitions, 1592 flow [2020-10-09 15:39:25,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 650 transitions, 1587 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:25,266 INFO L241 Difference]: Finished difference. Result has 721 places, 650 transitions, 1585 flow [2020-10-09 15:39:25,266 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1571, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1585, PETRI_PLACES=721, PETRI_TRANSITIONS=650} [2020-10-09 15:39:25,266 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 54 predicate places. [2020-10-09 15:39:25,266 INFO L481 AbstractCegarLoop]: Abstraction has has 721 places, 650 transitions, 1585 flow [2020-10-09 15:39:25,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:25,266 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:25,266 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:25,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1005 mathsat -unsat_core_generation=3 [2020-10-09 15:39:25,467 INFO L429 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:25,467 INFO L82 PathProgramCache]: Analyzing trace with hash 781890248, now seen corresponding path program 1 times [2020-10-09 15:39:25,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:25,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878307264] [2020-10-09 15:39:25,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1006 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1006 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:26,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:39:26,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:39:26,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:39:26,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878307264] [2020-10-09 15:39:26,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:26,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:26,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889020187] [2020-10-09 15:39:26,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:26,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:26,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:26,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:26,081 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:39:26,082 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 650 transitions, 1585 flow. Second operand 3 states. [2020-10-09 15:39:26,082 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:26,083 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:39:26,083 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:26,414 INFO L129 PetriNetUnfolder]: 36/766 cut-off events. [2020-10-09 15:39:26,414 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:39:26,454 INFO L80 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 766 events. 36/766 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3279 event pairs, 0 based on Foata normal form. 1/706 useless extension candidates. Maximal degree in co-relation 929. Up to 27 conditions per place. [2020-10-09 15:39:26,459 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/647 dead transitions. [2020-10-09 15:39:26,459 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 647 transitions, 1580 flow [2020-10-09 15:39:26,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:26,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:39:26,460 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:39:26,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:39:26,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:39:26,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:26,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:39:26,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:26,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:26,462 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:26,462 INFO L185 Difference]: Start difference. First operand has 721 places, 650 transitions, 1585 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:39:26,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 723 places, 647 transitions, 1580 flow [2020-10-09 15:39:26,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 647 transitions, 1573 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:39:26,469 INFO L241 Difference]: Finished difference. Result has 720 places, 647 transitions, 1565 flow [2020-10-09 15:39:26,469 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1563, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=646, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1565, PETRI_PLACES=720, PETRI_TRANSITIONS=647} [2020-10-09 15:39:26,469 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 53 predicate places. [2020-10-09 15:39:26,469 INFO L481 AbstractCegarLoop]: Abstraction has has 720 places, 647 transitions, 1565 flow [2020-10-09 15:39:26,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:26,469 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:26,469 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:26,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1006 mathsat -unsat_core_generation=3 [2020-10-09 15:39:26,670 INFO L429 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:26,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:26,671 INFO L82 PathProgramCache]: Analyzing trace with hash 781891271, now seen corresponding path program 1 times [2020-10-09 15:39:26,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:26,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490485562] [2020-10-09 15:39:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1007 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1007 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:27,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:27,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:39:27,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:27,236 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:39:27,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490485562] [2020-10-09 15:39:27,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:27,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:27,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033463413] [2020-10-09 15:39:27,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:27,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:27,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:27,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:27,266 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:27,267 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 647 transitions, 1565 flow. Second operand 3 states. [2020-10-09 15:39:27,267 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:27,267 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:27,267 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:27,531 INFO L129 PetriNetUnfolder]: 36/764 cut-off events. [2020-10-09 15:39:27,532 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:27,577 INFO L80 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 764 events. 36/764 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3265 event pairs, 0 based on Foata normal form. 0/702 useless extension candidates. Maximal degree in co-relation 931. Up to 27 conditions per place. [2020-10-09 15:39:27,583 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/645 dead transitions. [2020-10-09 15:39:27,583 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 645 transitions, 1578 flow [2020-10-09 15:39:27,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:39:27,584 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:39:27,584 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:39:27,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:39:27,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:27,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:39:27,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:27,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:27,586 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:27,586 INFO L185 Difference]: Start difference. First operand has 720 places, 647 transitions, 1565 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:39:27,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 645 transitions, 1578 flow [2020-10-09 15:39:27,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 645 transitions, 1577 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:27,593 INFO L241 Difference]: Finished difference. Result has 719 places, 645 transitions, 1561 flow [2020-10-09 15:39:27,593 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1559, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1561, PETRI_PLACES=719, PETRI_TRANSITIONS=645} [2020-10-09 15:39:27,593 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 52 predicate places. [2020-10-09 15:39:27,593 INFO L481 AbstractCegarLoop]: Abstraction has has 719 places, 645 transitions, 1561 flow [2020-10-09 15:39:27,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:27,594 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:27,594 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:27,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1007 mathsat -unsat_core_generation=3 [2020-10-09 15:39:27,794 INFO L429 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:27,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:27,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1684004555, now seen corresponding path program 1 times [2020-10-09 15:39:27,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:27,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416811235] [2020-10-09 15:39:27,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1008 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1008 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:28,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:28,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:39:28,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:39:28,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416811235] [2020-10-09 15:39:28,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:28,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:28,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664300775] [2020-10-09 15:39:28,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:28,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:28,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:28,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:28,386 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:28,387 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 645 transitions, 1561 flow. Second operand 3 states. [2020-10-09 15:39:28,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:28,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:28,388 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:28,662 INFO L129 PetriNetUnfolder]: 35/772 cut-off events. [2020-10-09 15:39:28,662 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:28,709 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 772 events. 35/772 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3336 event pairs, 0 based on Foata normal form. 0/710 useless extension candidates. Maximal degree in co-relation 943. Up to 27 conditions per place. [2020-10-09 15:39:28,714 INFO L132 encePairwiseOnDemand]: 714/719 looper letters, 10 selfloop transitions, 3 changer transitions 0/647 dead transitions. [2020-10-09 15:39:28,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 647 transitions, 1591 flow [2020-10-09 15:39:28,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:28,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2055 transitions. [2020-10-09 15:39:28,716 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.952712100139082 [2020-10-09 15:39:28,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2055 transitions. [2020-10-09 15:39:28,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2055 transitions. [2020-10-09 15:39:28,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:28,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2055 transitions. [2020-10-09 15:39:28,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:28,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:28,718 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:28,718 INFO L185 Difference]: Start difference. First operand has 719 places, 645 transitions, 1561 flow. Second operand 3 states and 2055 transitions. [2020-10-09 15:39:28,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 647 transitions, 1591 flow [2020-10-09 15:39:28,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 647 transitions, 1590 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:28,725 INFO L241 Difference]: Finished difference. Result has 722 places, 647 transitions, 1584 flow [2020-10-09 15:39:28,725 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1560, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=642, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1584, PETRI_PLACES=722, PETRI_TRANSITIONS=647} [2020-10-09 15:39:28,725 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 55 predicate places. [2020-10-09 15:39:28,725 INFO L481 AbstractCegarLoop]: Abstraction has has 722 places, 647 transitions, 1584 flow [2020-10-09 15:39:28,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:28,725 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:28,725 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:28,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1008 mathsat -unsat_core_generation=3 [2020-10-09 15:39:28,926 INFO L429 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:28,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:28,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1684003532, now seen corresponding path program 1 times [2020-10-09 15:39:28,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:28,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140937077] [2020-10-09 15:39:28,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1009 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1009 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:29,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:29,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:39:29,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:39:29,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140937077] [2020-10-09 15:39:29,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:29,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:29,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124409641] [2020-10-09 15:39:29,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:29,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:29,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:29,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:29,516 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:39:29,517 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 647 transitions, 1584 flow. Second operand 3 states. [2020-10-09 15:39:29,517 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:29,517 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:39:29,517 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:29,786 INFO L129 PetriNetUnfolder]: 34/770 cut-off events. [2020-10-09 15:39:29,786 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:39:29,833 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 770 events. 34/770 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3323 event pairs, 0 based on Foata normal form. 0/711 useless extension candidates. Maximal degree in co-relation 940. Up to 27 conditions per place. [2020-10-09 15:39:29,838 INFO L132 encePairwiseOnDemand]: 716/719 looper letters, 5 selfloop transitions, 2 changer transitions 0/647 dead transitions. [2020-10-09 15:39:29,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 647 transitions, 1596 flow [2020-10-09 15:39:29,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2063 transitions. [2020-10-09 15:39:29,839 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9564209550301345 [2020-10-09 15:39:29,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2063 transitions. [2020-10-09 15:39:29,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2063 transitions. [2020-10-09 15:39:29,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:29,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2063 transitions. [2020-10-09 15:39:29,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:29,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:29,842 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:29,842 INFO L185 Difference]: Start difference. First operand has 722 places, 647 transitions, 1584 flow. Second operand 3 states and 2063 transitions. [2020-10-09 15:39:29,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 647 transitions, 1596 flow [2020-10-09 15:39:29,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 723 places, 647 transitions, 1591 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:29,848 INFO L241 Difference]: Finished difference. Result has 725 places, 647 transitions, 1589 flow [2020-10-09 15:39:29,849 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1575, PETRI_DIFFERENCE_MINUEND_PLACES=721, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1589, PETRI_PLACES=725, PETRI_TRANSITIONS=647} [2020-10-09 15:39:29,849 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 58 predicate places. [2020-10-09 15:39:29,849 INFO L481 AbstractCegarLoop]: Abstraction has has 725 places, 647 transitions, 1589 flow [2020-10-09 15:39:29,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:29,849 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:29,849 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:30,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1009 mathsat -unsat_core_generation=3 [2020-10-09 15:39:30,050 INFO L429 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:30,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:30,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1683051243, now seen corresponding path program 1 times [2020-10-09 15:39:30,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:30,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166248175] [2020-10-09 15:39:30,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1010 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1010 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:30,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:39:30,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:39:30,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:39:30,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166248175] [2020-10-09 15:39:30,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:30,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:30,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819018938] [2020-10-09 15:39:30,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:30,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:30,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:30,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:30,637 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:39:30,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 725 places, 647 transitions, 1589 flow. Second operand 3 states. [2020-10-09 15:39:30,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:30,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:39:30,637 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:30,903 INFO L129 PetriNetUnfolder]: 33/766 cut-off events. [2020-10-09 15:39:30,904 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:39:30,950 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 766 events. 33/766 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3295 event pairs, 0 based on Foata normal form. 1/709 useless extension candidates. Maximal degree in co-relation 936. Up to 27 conditions per place. [2020-10-09 15:39:30,955 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/644 dead transitions. [2020-10-09 15:39:30,955 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 727 places, 644 transitions, 1584 flow [2020-10-09 15:39:30,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:39:30,956 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:39:30,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:39:30,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:39:30,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:30,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:39:30,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:30,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:30,958 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:30,959 INFO L185 Difference]: Start difference. First operand has 725 places, 647 transitions, 1589 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:39:30,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 727 places, 644 transitions, 1584 flow [2020-10-09 15:39:30,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 724 places, 644 transitions, 1577 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:39:30,965 INFO L241 Difference]: Finished difference. Result has 724 places, 644 transitions, 1569 flow [2020-10-09 15:39:30,965 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1567, PETRI_DIFFERENCE_MINUEND_PLACES=722, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1569, PETRI_PLACES=724, PETRI_TRANSITIONS=644} [2020-10-09 15:39:30,966 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 57 predicate places. [2020-10-09 15:39:30,966 INFO L481 AbstractCegarLoop]: Abstraction has has 724 places, 644 transitions, 1569 flow [2020-10-09 15:39:30,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:30,966 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:30,966 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:31,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1010 mathsat -unsat_core_generation=3 [2020-10-09 15:39:31,167 INFO L429 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:31,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:31,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1683050220, now seen corresponding path program 1 times [2020-10-09 15:39:31,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:31,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214598381] [2020-10-09 15:39:31,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1011 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1011 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:31,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:31,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:39:31,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:39:31,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214598381] [2020-10-09 15:39:31,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:31,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:31,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442069737] [2020-10-09 15:39:31,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:31,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:31,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:31,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:31,772 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:31,773 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 724 places, 644 transitions, 1569 flow. Second operand 3 states. [2020-10-09 15:39:31,773 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:31,773 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:31,773 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:32,051 INFO L129 PetriNetUnfolder]: 33/764 cut-off events. [2020-10-09 15:39:32,052 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:32,101 INFO L80 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 764 events. 33/764 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3284 event pairs, 0 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 938. Up to 27 conditions per place. [2020-10-09 15:39:32,106 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/642 dead transitions. [2020-10-09 15:39:32,106 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 642 transitions, 1582 flow [2020-10-09 15:39:32,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:39:32,107 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:39:32,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:39:32,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:39:32,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:32,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:39:32,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:32,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:32,109 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:32,109 INFO L185 Difference]: Start difference. First operand has 724 places, 644 transitions, 1569 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:39:32,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 642 transitions, 1582 flow [2020-10-09 15:39:32,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 723 places, 642 transitions, 1581 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:32,117 INFO L241 Difference]: Finished difference. Result has 723 places, 642 transitions, 1565 flow [2020-10-09 15:39:32,117 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1563, PETRI_DIFFERENCE_MINUEND_PLACES=721, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=641, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1565, PETRI_PLACES=723, PETRI_TRANSITIONS=642} [2020-10-09 15:39:32,117 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 56 predicate places. [2020-10-09 15:39:32,117 INFO L481 AbstractCegarLoop]: Abstraction has has 723 places, 642 transitions, 1565 flow [2020-10-09 15:39:32,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:32,117 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:32,117 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:32,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1011 mathsat -unsat_core_generation=3 [2020-10-09 15:39:32,318 INFO L429 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:32,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:32,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1941350626, now seen corresponding path program 1 times [2020-10-09 15:39:32,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:32,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788253548] [2020-10-09 15:39:32,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1012 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1012 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:32,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:32,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:39:32,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:39:32,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788253548] [2020-10-09 15:39:32,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:32,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:32,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558916896] [2020-10-09 15:39:32,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:32,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:32,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:32,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:32,980 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:32,981 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 642 transitions, 1565 flow. Second operand 3 states. [2020-10-09 15:39:32,982 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:32,982 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:32,982 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:33,266 INFO L129 PetriNetUnfolder]: 32/772 cut-off events. [2020-10-09 15:39:33,266 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:33,317 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 772 events. 32/772 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3351 event pairs, 0 based on Foata normal form. 0/713 useless extension candidates. Maximal degree in co-relation 950. Up to 27 conditions per place. [2020-10-09 15:39:33,322 INFO L132 encePairwiseOnDemand]: 714/719 looper letters, 10 selfloop transitions, 3 changer transitions 0/644 dead transitions. [2020-10-09 15:39:33,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 644 transitions, 1595 flow [2020-10-09 15:39:33,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:33,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:33,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2055 transitions. [2020-10-09 15:39:33,324 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.952712100139082 [2020-10-09 15:39:33,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2055 transitions. [2020-10-09 15:39:33,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2055 transitions. [2020-10-09 15:39:33,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:33,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2055 transitions. [2020-10-09 15:39:33,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:33,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:33,326 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:33,326 INFO L185 Difference]: Start difference. First operand has 723 places, 642 transitions, 1565 flow. Second operand 3 states and 2055 transitions. [2020-10-09 15:39:33,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 725 places, 644 transitions, 1595 flow [2020-10-09 15:39:33,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 724 places, 644 transitions, 1594 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:33,333 INFO L241 Difference]: Finished difference. Result has 726 places, 644 transitions, 1588 flow [2020-10-09 15:39:33,333 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1564, PETRI_DIFFERENCE_MINUEND_PLACES=722, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1588, PETRI_PLACES=726, PETRI_TRANSITIONS=644} [2020-10-09 15:39:33,333 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 59 predicate places. [2020-10-09 15:39:33,333 INFO L481 AbstractCegarLoop]: Abstraction has has 726 places, 644 transitions, 1588 flow [2020-10-09 15:39:33,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:33,334 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:33,334 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:33,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1012 mathsat -unsat_core_generation=3 [2020-10-09 15:39:33,534 INFO L429 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:33,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:33,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1941349603, now seen corresponding path program 1 times [2020-10-09 15:39:33,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:33,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294268151] [2020-10-09 15:39:33,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1013 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1013 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:34,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:39:34,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:39:34,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:39:34,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294268151] [2020-10-09 15:39:34,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:34,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:34,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295043070] [2020-10-09 15:39:34,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:34,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:34,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:34,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:34,133 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:39:34,134 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 726 places, 644 transitions, 1588 flow. Second operand 3 states. [2020-10-09 15:39:34,134 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:34,134 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:39:34,135 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:34,404 INFO L129 PetriNetUnfolder]: 30/773 cut-off events. [2020-10-09 15:39:34,404 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:39:34,451 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 773 events. 30/773 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3379 event pairs, 0 based on Foata normal form. 1/719 useless extension candidates. Maximal degree in co-relation 948. Up to 27 conditions per place. [2020-10-09 15:39:34,456 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/643 dead transitions. [2020-10-09 15:39:34,456 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 728 places, 643 transitions, 1594 flow [2020-10-09 15:39:34,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:34,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:39:34,457 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:39:34,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:39:34,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:39:34,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:34,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:39:34,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:34,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:34,459 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:34,460 INFO L185 Difference]: Start difference. First operand has 726 places, 644 transitions, 1588 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:39:34,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 728 places, 643 transitions, 1594 flow [2020-10-09 15:39:34,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 727 places, 643 transitions, 1589 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:34,466 INFO L241 Difference]: Finished difference. Result has 728 places, 643 transitions, 1584 flow [2020-10-09 15:39:34,467 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1579, PETRI_DIFFERENCE_MINUEND_PLACES=725, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=642, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1584, PETRI_PLACES=728, PETRI_TRANSITIONS=643} [2020-10-09 15:39:34,467 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 61 predicate places. [2020-10-09 15:39:34,467 INFO L481 AbstractCegarLoop]: Abstraction has has 728 places, 643 transitions, 1584 flow [2020-10-09 15:39:34,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:34,467 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:34,467 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:34,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1013 mathsat -unsat_core_generation=3 [2020-10-09 15:39:34,668 INFO L429 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:34,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:34,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1940397314, now seen corresponding path program 1 times [2020-10-09 15:39:34,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:34,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775292124] [2020-10-09 15:39:34,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1014 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1014 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:35,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:35,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:35,237 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:39:35,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:39:35,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775292124] [2020-10-09 15:39:35,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:35,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:35,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931323393] [2020-10-09 15:39:35,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:35,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:35,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:35,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:35,252 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:39:35,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 728 places, 643 transitions, 1584 flow. Second operand 3 states. [2020-10-09 15:39:35,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:35,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:39:35,253 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:35,525 INFO L129 PetriNetUnfolder]: 30/766 cut-off events. [2020-10-09 15:39:35,526 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:39:35,573 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 766 events. 30/766 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3312 event pairs, 0 based on Foata normal form. 1/712 useless extension candidates. Maximal degree in co-relation 944. Up to 27 conditions per place. [2020-10-09 15:39:35,577 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 5 selfloop transitions, 1 changer transitions 0/641 dead transitions. [2020-10-09 15:39:35,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 730 places, 641 transitions, 1587 flow [2020-10-09 15:39:35,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:35,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2020-10-09 15:39:35,579 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9559573481687529 [2020-10-09 15:39:35,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2020-10-09 15:39:35,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2020-10-09 15:39:35,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:35,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2020-10-09 15:39:35,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:35,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:35,581 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:35,581 INFO L185 Difference]: Start difference. First operand has 728 places, 643 transitions, 1584 flow. Second operand 3 states and 2062 transitions. [2020-10-09 15:39:35,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 730 places, 641 transitions, 1587 flow [2020-10-09 15:39:35,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 727 places, 641 transitions, 1580 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:39:35,588 INFO L241 Difference]: Finished difference. Result has 728 places, 641 transitions, 1573 flow [2020-10-09 15:39:35,588 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1568, PETRI_DIFFERENCE_MINUEND_PLACES=725, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1573, PETRI_PLACES=728, PETRI_TRANSITIONS=641} [2020-10-09 15:39:35,588 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 61 predicate places. [2020-10-09 15:39:35,588 INFO L481 AbstractCegarLoop]: Abstraction has has 728 places, 641 transitions, 1573 flow [2020-10-09 15:39:35,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:35,588 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:35,588 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:35,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1014 mathsat -unsat_core_generation=3 [2020-10-09 15:39:35,789 INFO L429 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:35,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:35,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1940396291, now seen corresponding path program 1 times [2020-10-09 15:39:35,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:35,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847329794] [2020-10-09 15:39:35,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1015 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1015 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:36,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:36,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:39:36,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:39:36,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847329794] [2020-10-09 15:39:36,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:36,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:36,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010715959] [2020-10-09 15:39:36,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:36,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:36,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:36,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:36,385 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:36,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 728 places, 641 transitions, 1573 flow. Second operand 3 states. [2020-10-09 15:39:36,386 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:36,386 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:36,386 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:36,668 INFO L129 PetriNetUnfolder]: 30/764 cut-off events. [2020-10-09 15:39:36,668 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:39:36,717 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 764 events. 30/764 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3297 event pairs, 0 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 944. Up to 27 conditions per place. [2020-10-09 15:39:36,721 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/639 dead transitions. [2020-10-09 15:39:36,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 728 places, 639 transitions, 1586 flow [2020-10-09 15:39:36,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:36,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:36,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:39:36,723 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:39:36,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:39:36,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:39:36,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:36,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:39:36,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:36,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:36,725 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:36,725 INFO L185 Difference]: Start difference. First operand has 728 places, 641 transitions, 1573 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:39:36,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 728 places, 639 transitions, 1586 flow [2020-10-09 15:39:36,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 727 places, 639 transitions, 1585 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:36,733 INFO L241 Difference]: Finished difference. Result has 727 places, 639 transitions, 1569 flow [2020-10-09 15:39:36,733 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1567, PETRI_DIFFERENCE_MINUEND_PLACES=725, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1569, PETRI_PLACES=727, PETRI_TRANSITIONS=639} [2020-10-09 15:39:36,733 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 60 predicate places. [2020-10-09 15:39:36,733 INFO L481 AbstractCegarLoop]: Abstraction has has 727 places, 639 transitions, 1569 flow [2020-10-09 15:39:36,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:36,733 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:36,733 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:36,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1015 mathsat -unsat_core_generation=3 [2020-10-09 15:39:36,934 INFO L429 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:36,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:36,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1993903695, now seen corresponding path program 1 times [2020-10-09 15:39:36,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:36,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418091886] [2020-10-09 15:39:36,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1016 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1016 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:37,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:37,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:39:37,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:39:37,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418091886] [2020-10-09 15:39:37,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:37,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:37,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766473575] [2020-10-09 15:39:37,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:37,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:37,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:37,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:37,529 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:37,530 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 727 places, 639 transitions, 1569 flow. Second operand 3 states. [2020-10-09 15:39:37,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:37,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:37,530 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:37,808 INFO L129 PetriNetUnfolder]: 29/772 cut-off events. [2020-10-09 15:39:37,808 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:37,855 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 772 events. 29/772 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3374 event pairs, 0 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 956. Up to 27 conditions per place. [2020-10-09 15:39:37,859 INFO L132 encePairwiseOnDemand]: 714/719 looper letters, 10 selfloop transitions, 3 changer transitions 0/641 dead transitions. [2020-10-09 15:39:37,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 729 places, 641 transitions, 1599 flow [2020-10-09 15:39:37,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:37,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:37,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2055 transitions. [2020-10-09 15:39:37,861 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.952712100139082 [2020-10-09 15:39:37,861 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2055 transitions. [2020-10-09 15:39:37,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2055 transitions. [2020-10-09 15:39:37,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:37,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2055 transitions. [2020-10-09 15:39:37,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:37,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:37,863 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:37,864 INFO L185 Difference]: Start difference. First operand has 727 places, 639 transitions, 1569 flow. Second operand 3 states and 2055 transitions. [2020-10-09 15:39:37,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 729 places, 641 transitions, 1599 flow [2020-10-09 15:39:37,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 728 places, 641 transitions, 1598 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:37,870 INFO L241 Difference]: Finished difference. Result has 730 places, 641 transitions, 1592 flow [2020-10-09 15:39:37,871 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1568, PETRI_DIFFERENCE_MINUEND_PLACES=726, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1592, PETRI_PLACES=730, PETRI_TRANSITIONS=641} [2020-10-09 15:39:37,871 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 63 predicate places. [2020-10-09 15:39:37,871 INFO L481 AbstractCegarLoop]: Abstraction has has 730 places, 641 transitions, 1592 flow [2020-10-09 15:39:37,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:37,871 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:37,871 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:38,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1016 mathsat -unsat_core_generation=3 [2020-10-09 15:39:38,072 INFO L429 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:38,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:38,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1993904718, now seen corresponding path program 1 times [2020-10-09 15:39:38,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:38,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736809724] [2020-10-09 15:39:38,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1017 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1017 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:38,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:39:38,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:39:38,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:39:38,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736809724] [2020-10-09 15:39:38,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:38,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:38,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134624289] [2020-10-09 15:39:38,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:38,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:38,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:38,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:38,673 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:39:38,673 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 730 places, 641 transitions, 1592 flow. Second operand 3 states. [2020-10-09 15:39:38,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:38,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:39:38,674 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:38,944 INFO L129 PetriNetUnfolder]: 27/773 cut-off events. [2020-10-09 15:39:38,944 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:39:38,990 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 773 events. 27/773 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3396 event pairs, 0 based on Foata normal form. 1/722 useless extension candidates. Maximal degree in co-relation 954. Up to 27 conditions per place. [2020-10-09 15:39:38,995 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/640 dead transitions. [2020-10-09 15:39:38,995 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 732 places, 640 transitions, 1598 flow [2020-10-09 15:39:38,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:38,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:39:38,996 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:39:38,996 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:39:38,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:39:38,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:38,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:39:38,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:38,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:38,998 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:38,998 INFO L185 Difference]: Start difference. First operand has 730 places, 641 transitions, 1592 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:39:38,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 732 places, 640 transitions, 1598 flow [2020-10-09 15:39:39,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 731 places, 640 transitions, 1593 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:39,005 INFO L241 Difference]: Finished difference. Result has 732 places, 640 transitions, 1588 flow [2020-10-09 15:39:39,006 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1583, PETRI_DIFFERENCE_MINUEND_PLACES=729, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1588, PETRI_PLACES=732, PETRI_TRANSITIONS=640} [2020-10-09 15:39:39,006 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 65 predicate places. [2020-10-09 15:39:39,006 INFO L481 AbstractCegarLoop]: Abstraction has has 732 places, 640 transitions, 1588 flow [2020-10-09 15:39:39,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:39,006 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:39,006 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:39,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1017 mathsat -unsat_core_generation=3 [2020-10-09 15:39:39,207 INFO L429 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:39,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:39,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1994857007, now seen corresponding path program 1 times [2020-10-09 15:39:39,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:39,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271902568] [2020-10-09 15:39:39,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1018 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1018 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:39,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:39,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:39:39,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:39:39,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271902568] [2020-10-09 15:39:39,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:39,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:39,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773241888] [2020-10-09 15:39:39,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:39,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:39,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:39,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:39,883 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:39:39,884 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 732 places, 640 transitions, 1588 flow. Second operand 3 states. [2020-10-09 15:39:39,884 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:39,884 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:39:39,884 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:40,150 INFO L129 PetriNetUnfolder]: 27/766 cut-off events. [2020-10-09 15:39:40,150 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:39:40,196 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 766 events. 27/766 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3335 event pairs, 0 based on Foata normal form. 1/715 useless extension candidates. Maximal degree in co-relation 950. Up to 27 conditions per place. [2020-10-09 15:39:40,200 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 5 selfloop transitions, 1 changer transitions 0/638 dead transitions. [2020-10-09 15:39:40,200 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 734 places, 638 transitions, 1591 flow [2020-10-09 15:39:40,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:40,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2020-10-09 15:39:40,201 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9559573481687529 [2020-10-09 15:39:40,202 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2020-10-09 15:39:40,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2020-10-09 15:39:40,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:40,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2020-10-09 15:39:40,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:40,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:40,204 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:40,204 INFO L185 Difference]: Start difference. First operand has 732 places, 640 transitions, 1588 flow. Second operand 3 states and 2062 transitions. [2020-10-09 15:39:40,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 734 places, 638 transitions, 1591 flow [2020-10-09 15:39:40,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 731 places, 638 transitions, 1584 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:39:40,211 INFO L241 Difference]: Finished difference. Result has 732 places, 638 transitions, 1577 flow [2020-10-09 15:39:40,211 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1572, PETRI_DIFFERENCE_MINUEND_PLACES=729, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=637, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1577, PETRI_PLACES=732, PETRI_TRANSITIONS=638} [2020-10-09 15:39:40,211 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 65 predicate places. [2020-10-09 15:39:40,211 INFO L481 AbstractCegarLoop]: Abstraction has has 732 places, 638 transitions, 1577 flow [2020-10-09 15:39:40,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:40,212 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:40,212 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:40,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1018 mathsat -unsat_core_generation=3 [2020-10-09 15:39:40,412 INFO L429 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:40,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:40,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1994858030, now seen corresponding path program 1 times [2020-10-09 15:39:40,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:40,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828119406] [2020-10-09 15:39:40,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1019 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1019 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:40,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:40,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:39:40,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:40,987 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:39:40,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828119406] [2020-10-09 15:39:40,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:40,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:40,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236242699] [2020-10-09 15:39:40,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:40,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:40,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:40,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:41,007 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:41,008 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 732 places, 638 transitions, 1577 flow. Second operand 3 states. [2020-10-09 15:39:41,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:41,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:41,008 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:41,279 INFO L129 PetriNetUnfolder]: 27/764 cut-off events. [2020-10-09 15:39:41,279 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:39:41,326 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 764 events. 27/764 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3321 event pairs, 0 based on Foata normal form. 0/711 useless extension candidates. Maximal degree in co-relation 950. Up to 27 conditions per place. [2020-10-09 15:39:41,330 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/636 dead transitions. [2020-10-09 15:39:41,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 732 places, 636 transitions, 1590 flow [2020-10-09 15:39:41,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:39:41,331 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:39:41,332 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:39:41,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:39:41,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:41,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:39:41,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:41,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:41,334 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:41,334 INFO L185 Difference]: Start difference. First operand has 732 places, 638 transitions, 1577 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:39:41,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 732 places, 636 transitions, 1590 flow [2020-10-09 15:39:41,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 731 places, 636 transitions, 1589 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:41,340 INFO L241 Difference]: Finished difference. Result has 731 places, 636 transitions, 1573 flow [2020-10-09 15:39:41,340 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1571, PETRI_DIFFERENCE_MINUEND_PLACES=729, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1573, PETRI_PLACES=731, PETRI_TRANSITIONS=636} [2020-10-09 15:39:41,341 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 64 predicate places. [2020-10-09 15:39:41,341 INFO L481 AbstractCegarLoop]: Abstraction has has 731 places, 636 transitions, 1573 flow [2020-10-09 15:39:41,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:41,341 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:41,341 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:41,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1019 mathsat -unsat_core_generation=3 [2020-10-09 15:39:41,542 INFO L429 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:41,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:41,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1175705346, now seen corresponding path program 1 times [2020-10-09 15:39:41,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:41,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017214447] [2020-10-09 15:39:41,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1020 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1020 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:42,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:39:42,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:39:42,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:39:42,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017214447] [2020-10-09 15:39:42,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:42,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:42,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847299417] [2020-10-09 15:39:42,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:42,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:42,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:42,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:42,142 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:39:42,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 731 places, 636 transitions, 1573 flow. Second operand 3 states. [2020-10-09 15:39:42,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:42,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:39:42,144 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:42,411 INFO L129 PetriNetUnfolder]: 26/771 cut-off events. [2020-10-09 15:39:42,411 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:42,458 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 771 events. 26/771 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3380 event pairs, 0 based on Foata normal form. 1/720 useless extension candidates. Maximal degree in co-relation 953. Up to 27 conditions per place. [2020-10-09 15:39:42,461 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/636 dead transitions. [2020-10-09 15:39:42,461 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 733 places, 636 transitions, 1583 flow [2020-10-09 15:39:42,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:39:42,463 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:39:42,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:39:42,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:39:42,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:42,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:39:42,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:42,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:42,465 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:42,465 INFO L185 Difference]: Start difference. First operand has 731 places, 636 transitions, 1573 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:39:42,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 733 places, 636 transitions, 1583 flow [2020-10-09 15:39:42,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 732 places, 636 transitions, 1582 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:42,472 INFO L241 Difference]: Finished difference. Result has 733 places, 636 transitions, 1577 flow [2020-10-09 15:39:42,472 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1572, PETRI_DIFFERENCE_MINUEND_PLACES=730, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1577, PETRI_PLACES=733, PETRI_TRANSITIONS=636} [2020-10-09 15:39:42,472 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 66 predicate places. [2020-10-09 15:39:42,472 INFO L481 AbstractCegarLoop]: Abstraction has has 733 places, 636 transitions, 1577 flow [2020-10-09 15:39:42,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:42,472 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:42,472 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:42,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1020 mathsat -unsat_core_generation=3 [2020-10-09 15:39:42,673 INFO L429 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:42,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:42,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1175706369, now seen corresponding path program 1 times [2020-10-09 15:39:42,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:42,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499393425] [2020-10-09 15:39:42,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1021 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1021 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:43,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:43,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:39:43,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:39:43,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499393425] [2020-10-09 15:39:43,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:43,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:43,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081466971] [2020-10-09 15:39:43,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:43,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:43,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:43,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:43,283 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:43,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 733 places, 636 transitions, 1577 flow. Second operand 3 states. [2020-10-09 15:39:43,284 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:43,284 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:43,284 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:43,565 INFO L129 PetriNetUnfolder]: 24/773 cut-off events. [2020-10-09 15:39:43,566 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:39:43,614 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 773 events. 24/773 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3412 event pairs, 0 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 966. Up to 27 conditions per place. [2020-10-09 15:39:43,617 INFO L132 encePairwiseOnDemand]: 715/719 looper letters, 9 selfloop transitions, 3 changer transitions 0/637 dead transitions. [2020-10-09 15:39:43,618 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 735 places, 637 transitions, 1603 flow [2020-10-09 15:39:43,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2053 transitions. [2020-10-09 15:39:43,619 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.951784886416319 [2020-10-09 15:39:43,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2053 transitions. [2020-10-09 15:39:43,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2053 transitions. [2020-10-09 15:39:43,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:43,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2053 transitions. [2020-10-09 15:39:43,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:43,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:43,621 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:43,621 INFO L185 Difference]: Start difference. First operand has 733 places, 636 transitions, 1577 flow. Second operand 3 states and 2053 transitions. [2020-10-09 15:39:43,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 735 places, 637 transitions, 1603 flow [2020-10-09 15:39:43,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 734 places, 637 transitions, 1602 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:43,628 INFO L241 Difference]: Finished difference. Result has 736 places, 637 transitions, 1594 flow [2020-10-09 15:39:43,628 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=732, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1594, PETRI_PLACES=736, PETRI_TRANSITIONS=637} [2020-10-09 15:39:43,628 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 69 predicate places. [2020-10-09 15:39:43,629 INFO L481 AbstractCegarLoop]: Abstraction has has 736 places, 637 transitions, 1594 flow [2020-10-09 15:39:43,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:43,629 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:43,629 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:43,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1021 mathsat -unsat_core_generation=3 [2020-10-09 15:39:43,829 INFO L429 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:43,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:43,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1174753057, now seen corresponding path program 1 times [2020-10-09 15:39:43,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:43,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412527940] [2020-10-09 15:39:43,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1022 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1022 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:44,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:44,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:39:44,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:39:44,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412527940] [2020-10-09 15:39:44,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:44,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:44,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789964412] [2020-10-09 15:39:44,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:44,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:44,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:44,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:44,424 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:39:44,425 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 736 places, 637 transitions, 1594 flow. Second operand 3 states. [2020-10-09 15:39:44,425 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:44,425 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:39:44,425 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:44,698 INFO L129 PetriNetUnfolder]: 24/766 cut-off events. [2020-10-09 15:39:44,698 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:39:44,743 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 766 events. 24/766 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3352 event pairs, 0 based on Foata normal form. 1/718 useless extension candidates. Maximal degree in co-relation 952. Up to 27 conditions per place. [2020-10-09 15:39:44,746 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 5 selfloop transitions, 1 changer transitions 0/635 dead transitions. [2020-10-09 15:39:44,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 738 places, 635 transitions, 1596 flow [2020-10-09 15:39:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2020-10-09 15:39:44,748 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9559573481687529 [2020-10-09 15:39:44,748 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2020-10-09 15:39:44,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2020-10-09 15:39:44,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:44,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2020-10-09 15:39:44,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:44,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:44,750 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:44,750 INFO L185 Difference]: Start difference. First operand has 736 places, 637 transitions, 1594 flow. Second operand 3 states and 2062 transitions. [2020-10-09 15:39:44,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 738 places, 635 transitions, 1596 flow [2020-10-09 15:39:44,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 735 places, 635 transitions, 1588 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:39:44,757 INFO L241 Difference]: Finished difference. Result has 736 places, 635 transitions, 1581 flow [2020-10-09 15:39:44,757 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=733, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1581, PETRI_PLACES=736, PETRI_TRANSITIONS=635} [2020-10-09 15:39:44,757 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 69 predicate places. [2020-10-09 15:39:44,758 INFO L481 AbstractCegarLoop]: Abstraction has has 736 places, 635 transitions, 1581 flow [2020-10-09 15:39:44,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:44,758 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:44,758 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:44,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1022 mathsat -unsat_core_generation=3 [2020-10-09 15:39:44,958 INFO L429 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:44,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:44,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1174752034, now seen corresponding path program 1 times [2020-10-09 15:39:44,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:44,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626554718] [2020-10-09 15:39:44,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1023 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1023 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:45,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:45,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:39:45,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:39:45,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626554718] [2020-10-09 15:39:45,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:45,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:45,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150206971] [2020-10-09 15:39:45,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:45,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:45,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:45,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:45,567 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:45,568 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 736 places, 635 transitions, 1581 flow. Second operand 3 states. [2020-10-09 15:39:45,568 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:45,569 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:45,569 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:45,848 INFO L129 PetriNetUnfolder]: 24/764 cut-off events. [2020-10-09 15:39:45,849 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:39:45,896 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 764 events. 24/764 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3338 event pairs, 0 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 956. Up to 27 conditions per place. [2020-10-09 15:39:45,899 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/633 dead transitions. [2020-10-09 15:39:45,900 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 736 places, 633 transitions, 1594 flow [2020-10-09 15:39:45,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:45,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:39:45,901 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:39:45,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:39:45,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:39:45,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:45,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:39:45,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:45,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:45,903 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:45,903 INFO L185 Difference]: Start difference. First operand has 736 places, 635 transitions, 1581 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:39:45,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 736 places, 633 transitions, 1594 flow [2020-10-09 15:39:45,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 735 places, 633 transitions, 1593 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:45,910 INFO L241 Difference]: Finished difference. Result has 735 places, 633 transitions, 1577 flow [2020-10-09 15:39:45,910 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1575, PETRI_DIFFERENCE_MINUEND_PLACES=733, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1577, PETRI_PLACES=735, PETRI_TRANSITIONS=633} [2020-10-09 15:39:45,910 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 68 predicate places. [2020-10-09 15:39:45,910 INFO L481 AbstractCegarLoop]: Abstraction has has 735 places, 633 transitions, 1577 flow [2020-10-09 15:39:45,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:45,910 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:45,911 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:46,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1023 mathsat -unsat_core_generation=3 [2020-10-09 15:39:46,111 INFO L429 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:46,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:46,112 INFO L82 PathProgramCache]: Analyzing trace with hash 27792498, now seen corresponding path program 1 times [2020-10-09 15:39:46,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:46,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414804541] [2020-10-09 15:39:46,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1024 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1024 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:46,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:46,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:39:46,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:46,733 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:39:46,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414804541] [2020-10-09 15:39:46,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:46,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:46,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526130010] [2020-10-09 15:39:46,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:46,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:46,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:46,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:46,744 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:39:46,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 735 places, 633 transitions, 1577 flow. Second operand 3 states. [2020-10-09 15:39:46,746 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:46,746 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:39:46,746 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:47,028 INFO L129 PetriNetUnfolder]: 22/769 cut-off events. [2020-10-09 15:39:47,028 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:47,076 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1027 conditions, 769 events. 22/769 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3388 event pairs, 0 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 959. Up to 27 conditions per place. [2020-10-09 15:39:47,080 INFO L132 encePairwiseOnDemand]: 716/719 looper letters, 5 selfloop transitions, 2 changer transitions 0/634 dead transitions. [2020-10-09 15:39:47,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 737 places, 634 transitions, 1593 flow [2020-10-09 15:39:47,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2063 transitions. [2020-10-09 15:39:47,081 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9564209550301345 [2020-10-09 15:39:47,082 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2063 transitions. [2020-10-09 15:39:47,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2063 transitions. [2020-10-09 15:39:47,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:47,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2063 transitions. [2020-10-09 15:39:47,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:47,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:47,084 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:47,084 INFO L185 Difference]: Start difference. First operand has 735 places, 633 transitions, 1577 flow. Second operand 3 states and 2063 transitions. [2020-10-09 15:39:47,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 737 places, 634 transitions, 1593 flow [2020-10-09 15:39:47,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 736 places, 634 transitions, 1592 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:47,091 INFO L241 Difference]: Finished difference. Result has 738 places, 634 transitions, 1590 flow [2020-10-09 15:39:47,091 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=734, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1590, PETRI_PLACES=738, PETRI_TRANSITIONS=634} [2020-10-09 15:39:47,091 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 71 predicate places. [2020-10-09 15:39:47,091 INFO L481 AbstractCegarLoop]: Abstraction has has 738 places, 634 transitions, 1590 flow [2020-10-09 15:39:47,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:47,091 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:47,091 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:47,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1024 mathsat -unsat_core_generation=3 [2020-10-09 15:39:47,292 INFO L429 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:47,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:47,292 INFO L82 PathProgramCache]: Analyzing trace with hash 27791475, now seen corresponding path program 1 times [2020-10-09 15:39:47,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:47,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720329158] [2020-10-09 15:39:47,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1025 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1025 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:47,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:47,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:39:47,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:39:47,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720329158] [2020-10-09 15:39:47,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:47,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:47,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326393309] [2020-10-09 15:39:47,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:47,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:47,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:47,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:47,908 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:47,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 738 places, 634 transitions, 1590 flow. Second operand 3 states. [2020-10-09 15:39:47,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:47,909 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:47,909 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:48,194 INFO L129 PetriNetUnfolder]: 22/770 cut-off events. [2020-10-09 15:39:48,194 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:39:48,240 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 770 events. 22/770 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3399 event pairs, 0 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 967. Up to 27 conditions per place. [2020-10-09 15:39:48,243 INFO L132 encePairwiseOnDemand]: 715/719 looper letters, 9 selfloop transitions, 3 changer transitions 0/635 dead transitions. [2020-10-09 15:39:48,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 740 places, 635 transitions, 1616 flow [2020-10-09 15:39:48,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2053 transitions. [2020-10-09 15:39:48,245 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.951784886416319 [2020-10-09 15:39:48,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2053 transitions. [2020-10-09 15:39:48,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2053 transitions. [2020-10-09 15:39:48,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:48,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2053 transitions. [2020-10-09 15:39:48,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:48,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:48,247 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:48,247 INFO L185 Difference]: Start difference. First operand has 738 places, 634 transitions, 1590 flow. Second operand 3 states and 2053 transitions. [2020-10-09 15:39:48,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 740 places, 635 transitions, 1616 flow [2020-10-09 15:39:48,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 739 places, 635 transitions, 1614 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:48,254 INFO L241 Difference]: Finished difference. Result has 741 places, 635 transitions, 1606 flow [2020-10-09 15:39:48,254 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1588, PETRI_DIFFERENCE_MINUEND_PLACES=737, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1606, PETRI_PLACES=741, PETRI_TRANSITIONS=635} [2020-10-09 15:39:48,254 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 74 predicate places. [2020-10-09 15:39:48,254 INFO L481 AbstractCegarLoop]: Abstraction has has 741 places, 635 transitions, 1606 flow [2020-10-09 15:39:48,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:48,254 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:48,254 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:48,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1025 mathsat -unsat_core_generation=3 [2020-10-09 15:39:48,455 INFO L429 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:48,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:48,455 INFO L82 PathProgramCache]: Analyzing trace with hash 28745810, now seen corresponding path program 1 times [2020-10-09 15:39:48,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:48,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466005414] [2020-10-09 15:39:48,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1026 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1026 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:49,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:49,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:39:49,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:39:49,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466005414] [2020-10-09 15:39:49,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:49,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:49,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567616219] [2020-10-09 15:39:49,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:49,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:49,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:49,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:49,059 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:49,060 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 741 places, 635 transitions, 1606 flow. Second operand 3 states. [2020-10-09 15:39:49,060 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:49,060 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:49,060 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:49,346 INFO L129 PetriNetUnfolder]: 21/767 cut-off events. [2020-10-09 15:39:49,346 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2020-10-09 15:39:49,392 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 767 events. 21/767 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3379 event pairs, 0 based on Foata normal form. 2/722 useless extension candidates. Maximal degree in co-relation 966. Up to 27 conditions per place. [2020-10-09 15:39:49,395 INFO L132 encePairwiseOnDemand]: 716/719 looper letters, 9 selfloop transitions, 1 changer transitions 0/633 dead transitions. [2020-10-09 15:39:49,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 743 places, 633 transitions, 1614 flow [2020-10-09 15:39:49,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2052 transitions. [2020-10-09 15:39:49,397 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9513212795549374 [2020-10-09 15:39:49,397 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2052 transitions. [2020-10-09 15:39:49,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2052 transitions. [2020-10-09 15:39:49,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:49,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2052 transitions. [2020-10-09 15:39:49,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:49,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:49,399 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:49,399 INFO L185 Difference]: Start difference. First operand has 741 places, 635 transitions, 1606 flow. Second operand 3 states and 2052 transitions. [2020-10-09 15:39:49,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 743 places, 633 transitions, 1614 flow [2020-10-09 15:39:49,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 742 places, 633 transitions, 1613 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:49,405 INFO L241 Difference]: Finished difference. Result has 742 places, 633 transitions, 1595 flow [2020-10-09 15:39:49,406 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=740, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1595, PETRI_PLACES=742, PETRI_TRANSITIONS=633} [2020-10-09 15:39:49,406 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 75 predicate places. [2020-10-09 15:39:49,406 INFO L481 AbstractCegarLoop]: Abstraction has has 742 places, 633 transitions, 1595 flow [2020-10-09 15:39:49,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:49,406 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:49,406 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:49,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1026 mathsat -unsat_core_generation=3 [2020-10-09 15:39:49,607 INFO L429 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:49,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:49,607 INFO L82 PathProgramCache]: Analyzing trace with hash 28744787, now seen corresponding path program 1 times [2020-10-09 15:39:49,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:49,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550576426] [2020-10-09 15:39:49,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1027 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1027 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:50,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:39:50,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:39:50,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:39:50,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550576426] [2020-10-09 15:39:50,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:50,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:50,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218620894] [2020-10-09 15:39:50,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:50,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:50,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:50,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:50,206 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:39:50,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 742 places, 633 transitions, 1595 flow. Second operand 3 states. [2020-10-09 15:39:50,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:50,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:39:50,207 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:50,481 INFO L129 PetriNetUnfolder]: 21/764 cut-off events. [2020-10-09 15:39:50,481 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:39:50,527 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 764 events. 21/764 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3356 event pairs, 0 based on Foata normal form. 1/719 useless extension candidates. Maximal degree in co-relation 960. Up to 27 conditions per place. [2020-10-09 15:39:50,530 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/630 dead transitions. [2020-10-09 15:39:50,530 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 742 places, 630 transitions, 1594 flow [2020-10-09 15:39:50,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:39:50,531 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:39:50,531 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:39:50,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:39:50,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:50,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:39:50,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:50,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:50,534 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:50,534 INFO L185 Difference]: Start difference. First operand has 742 places, 633 transitions, 1595 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:39:50,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 742 places, 630 transitions, 1594 flow [2020-10-09 15:39:50,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 739 places, 630 transitions, 1589 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:39:50,541 INFO L241 Difference]: Finished difference. Result has 739 places, 630 transitions, 1581 flow [2020-10-09 15:39:50,541 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1579, PETRI_DIFFERENCE_MINUEND_PLACES=737, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1581, PETRI_PLACES=739, PETRI_TRANSITIONS=630} [2020-10-09 15:39:50,541 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 72 predicate places. [2020-10-09 15:39:50,541 INFO L481 AbstractCegarLoop]: Abstraction has has 739 places, 630 transitions, 1581 flow [2020-10-09 15:39:50,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:50,541 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:50,541 INFO L255 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:50,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1027 mathsat -unsat_core_generation=3 [2020-10-09 15:39:50,742 INFO L429 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:50,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:50,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1459772123, now seen corresponding path program 1 times [2020-10-09 15:39:50,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:50,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715650610] [2020-10-09 15:39:50,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1028 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1028 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:51,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:39:51,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:39:51,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:39:51,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715650610] [2020-10-09 15:39:51,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:51,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:51,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244539393] [2020-10-09 15:39:51,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:51,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:51,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:51,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:51,353 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:39:51,354 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 739 places, 630 transitions, 1581 flow. Second operand 3 states. [2020-10-09 15:39:51,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:51,355 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:39:51,355 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:51,627 INFO L129 PetriNetUnfolder]: 20/771 cut-off events. [2020-10-09 15:39:51,627 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:51,673 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 771 events. 20/771 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3413 event pairs, 0 based on Foata normal form. 1/725 useless extension candidates. Maximal degree in co-relation 968. Up to 27 conditions per place. [2020-10-09 15:39:51,676 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/630 dead transitions. [2020-10-09 15:39:51,676 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 741 places, 630 transitions, 1591 flow [2020-10-09 15:39:51,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:39:51,678 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:39:51,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:39:51,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:39:51,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:51,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:39:51,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:51,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:51,680 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:51,680 INFO L185 Difference]: Start difference. First operand has 739 places, 630 transitions, 1581 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:39:51,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 741 places, 630 transitions, 1591 flow [2020-10-09 15:39:51,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 740 places, 630 transitions, 1590 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:51,687 INFO L241 Difference]: Finished difference. Result has 741 places, 630 transitions, 1585 flow [2020-10-09 15:39:51,687 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=738, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1585, PETRI_PLACES=741, PETRI_TRANSITIONS=630} [2020-10-09 15:39:51,687 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 74 predicate places. [2020-10-09 15:39:51,687 INFO L481 AbstractCegarLoop]: Abstraction has has 741 places, 630 transitions, 1585 flow [2020-10-09 15:39:51,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:51,687 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:51,687 INFO L255 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:51,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1028 mathsat -unsat_core_generation=3 [2020-10-09 15:39:51,888 INFO L429 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:51,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:51,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1459771100, now seen corresponding path program 1 times [2020-10-09 15:39:51,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:51,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49749256] [2020-10-09 15:39:51,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1029 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1029 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:52,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:52,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:39:52,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:39:52,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49749256] [2020-10-09 15:39:52,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:52,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:52,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825770403] [2020-10-09 15:39:52,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:52,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:52,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:52,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:52,506 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:52,507 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 741 places, 630 transitions, 1585 flow. Second operand 3 states. [2020-10-09 15:39:52,507 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:52,507 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:52,508 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:52,816 INFO L129 PetriNetUnfolder]: 18/773 cut-off events. [2020-10-09 15:39:52,816 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:39:52,864 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 773 events. 18/773 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3450 event pairs, 0 based on Foata normal form. 0/727 useless extension candidates. Maximal degree in co-relation 979. Up to 27 conditions per place. [2020-10-09 15:39:52,867 INFO L132 encePairwiseOnDemand]: 715/719 looper letters, 9 selfloop transitions, 3 changer transitions 0/631 dead transitions. [2020-10-09 15:39:52,867 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 743 places, 631 transitions, 1611 flow [2020-10-09 15:39:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2053 transitions. [2020-10-09 15:39:52,868 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.951784886416319 [2020-10-09 15:39:52,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2053 transitions. [2020-10-09 15:39:52,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2053 transitions. [2020-10-09 15:39:52,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:52,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2053 transitions. [2020-10-09 15:39:52,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:52,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:52,870 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:52,870 INFO L185 Difference]: Start difference. First operand has 741 places, 630 transitions, 1585 flow. Second operand 3 states and 2053 transitions. [2020-10-09 15:39:52,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 743 places, 631 transitions, 1611 flow [2020-10-09 15:39:52,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 742 places, 631 transitions, 1610 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:52,878 INFO L241 Difference]: Finished difference. Result has 744 places, 631 transitions, 1602 flow [2020-10-09 15:39:52,878 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=740, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1602, PETRI_PLACES=744, PETRI_TRANSITIONS=631} [2020-10-09 15:39:52,878 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 77 predicate places. [2020-10-09 15:39:52,878 INFO L481 AbstractCegarLoop]: Abstraction has has 744 places, 631 transitions, 1602 flow [2020-10-09 15:39:52,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:52,878 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:52,879 INFO L255 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:53,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1029 mathsat -unsat_core_generation=3 [2020-10-09 15:39:53,079 INFO L429 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:53,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:53,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1460724412, now seen corresponding path program 1 times [2020-10-09 15:39:53,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:53,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188118763] [2020-10-09 15:39:53,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1030 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1030 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:53,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:53,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:53,703 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:39:53,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:39:53,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188118763] [2020-10-09 15:39:53,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:53,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:53,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969223067] [2020-10-09 15:39:53,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:53,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:53,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:53,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:53,720 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:39:53,721 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 744 places, 631 transitions, 1602 flow. Second operand 3 states. [2020-10-09 15:39:53,721 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:53,721 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:39:53,721 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:54,001 INFO L129 PetriNetUnfolder]: 18/766 cut-off events. [2020-10-09 15:39:54,002 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:39:54,047 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 766 events. 18/766 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3386 event pairs, 0 based on Foata normal form. 1/724 useless extension candidates. Maximal degree in co-relation 965. Up to 27 conditions per place. [2020-10-09 15:39:54,050 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 5 selfloop transitions, 1 changer transitions 0/629 dead transitions. [2020-10-09 15:39:54,050 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 746 places, 629 transitions, 1604 flow [2020-10-09 15:39:54,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:54,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2020-10-09 15:39:54,051 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9559573481687529 [2020-10-09 15:39:54,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2020-10-09 15:39:54,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2020-10-09 15:39:54,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:54,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2020-10-09 15:39:54,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:54,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:54,053 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:54,053 INFO L185 Difference]: Start difference. First operand has 744 places, 631 transitions, 1602 flow. Second operand 3 states and 2062 transitions. [2020-10-09 15:39:54,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 746 places, 629 transitions, 1604 flow [2020-10-09 15:39:54,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 743 places, 629 transitions, 1596 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:39:54,060 INFO L241 Difference]: Finished difference. Result has 744 places, 629 transitions, 1589 flow [2020-10-09 15:39:54,060 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=741, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1589, PETRI_PLACES=744, PETRI_TRANSITIONS=629} [2020-10-09 15:39:54,060 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 77 predicate places. [2020-10-09 15:39:54,060 INFO L481 AbstractCegarLoop]: Abstraction has has 744 places, 629 transitions, 1589 flow [2020-10-09 15:39:54,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:54,061 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:54,061 INFO L255 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:54,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1030 mathsat -unsat_core_generation=3 [2020-10-09 15:39:54,261 INFO L429 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:54,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:54,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1460725435, now seen corresponding path program 1 times [2020-10-09 15:39:54,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:54,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301961328] [2020-10-09 15:39:54,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1031 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1031 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:54,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:54,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:39:54,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:39:54,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301961328] [2020-10-09 15:39:54,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:54,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:54,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701786254] [2020-10-09 15:39:54,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:54,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:54,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:54,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:54,866 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:54,867 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 744 places, 629 transitions, 1589 flow. Second operand 3 states. [2020-10-09 15:39:54,867 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:54,867 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:54,867 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:55,145 INFO L129 PetriNetUnfolder]: 18/764 cut-off events. [2020-10-09 15:39:55,145 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:39:55,188 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 764 events. 18/764 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3372 event pairs, 0 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 969. Up to 27 conditions per place. [2020-10-09 15:39:55,191 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/627 dead transitions. [2020-10-09 15:39:55,191 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 744 places, 627 transitions, 1602 flow [2020-10-09 15:39:55,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:55,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:39:55,193 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:39:55,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:39:55,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:39:55,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:55,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:39:55,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:55,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:55,195 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:55,195 INFO L185 Difference]: Start difference. First operand has 744 places, 629 transitions, 1589 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:39:55,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 744 places, 627 transitions, 1602 flow [2020-10-09 15:39:55,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 743 places, 627 transitions, 1601 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:55,201 INFO L241 Difference]: Finished difference. Result has 743 places, 627 transitions, 1585 flow [2020-10-09 15:39:55,201 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1583, PETRI_DIFFERENCE_MINUEND_PLACES=741, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1585, PETRI_PLACES=743, PETRI_TRANSITIONS=627} [2020-10-09 15:39:55,202 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 76 predicate places. [2020-10-09 15:39:55,202 INFO L481 AbstractCegarLoop]: Abstraction has has 743 places, 627 transitions, 1585 flow [2020-10-09 15:39:55,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:55,202 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:55,202 INFO L255 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:55,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1031 mathsat -unsat_core_generation=3 [2020-10-09 15:39:55,403 INFO L429 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:55,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:55,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1186645783, now seen corresponding path program 1 times [2020-10-09 15:39:55,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:55,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663173934] [2020-10-09 15:39:55,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1032 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1032 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:55,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:55,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:55,979 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:39:55,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:39:55,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663173934] [2020-10-09 15:39:55,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:55,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:55,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209090149] [2020-10-09 15:39:55,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:55,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:55,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:55,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:55,995 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:39:55,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 743 places, 627 transitions, 1585 flow. Second operand 3 states. [2020-10-09 15:39:55,996 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:55,996 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:39:55,997 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:56,284 INFO L129 PetriNetUnfolder]: 16/769 cut-off events. [2020-10-09 15:39:56,284 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:39:56,331 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 769 events. 16/769 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3423 event pairs, 0 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 972. Up to 27 conditions per place. [2020-10-09 15:39:56,334 INFO L132 encePairwiseOnDemand]: 716/719 looper letters, 5 selfloop transitions, 2 changer transitions 0/628 dead transitions. [2020-10-09 15:39:56,334 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 745 places, 628 transitions, 1601 flow [2020-10-09 15:39:56,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:56,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2063 transitions. [2020-10-09 15:39:56,336 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9564209550301345 [2020-10-09 15:39:56,336 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2063 transitions. [2020-10-09 15:39:56,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2063 transitions. [2020-10-09 15:39:56,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:56,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2063 transitions. [2020-10-09 15:39:56,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:56,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:56,339 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:56,339 INFO L185 Difference]: Start difference. First operand has 743 places, 627 transitions, 1585 flow. Second operand 3 states and 2063 transitions. [2020-10-09 15:39:56,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 745 places, 628 transitions, 1601 flow [2020-10-09 15:39:56,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 744 places, 628 transitions, 1600 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:56,346 INFO L241 Difference]: Finished difference. Result has 746 places, 628 transitions, 1598 flow [2020-10-09 15:39:56,346 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=742, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1598, PETRI_PLACES=746, PETRI_TRANSITIONS=628} [2020-10-09 15:39:56,346 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 79 predicate places. [2020-10-09 15:39:56,346 INFO L481 AbstractCegarLoop]: Abstraction has has 746 places, 628 transitions, 1598 flow [2020-10-09 15:39:56,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:56,346 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:56,346 INFO L255 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:56,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1032 mathsat -unsat_core_generation=3 [2020-10-09 15:39:56,547 INFO L429 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:56,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1186644760, now seen corresponding path program 1 times [2020-10-09 15:39:56,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:56,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066482264] [2020-10-09 15:39:56,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1033 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1033 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:57,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:57,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:39:57,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:39:57,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066482264] [2020-10-09 15:39:57,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:57,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:57,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657065959] [2020-10-09 15:39:57,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:57,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:57,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:57,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:57,170 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:57,171 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 746 places, 628 transitions, 1598 flow. Second operand 3 states. [2020-10-09 15:39:57,171 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:57,172 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:57,172 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:57,460 INFO L129 PetriNetUnfolder]: 16/770 cut-off events. [2020-10-09 15:39:57,461 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:39:57,508 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 770 events. 16/770 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3434 event pairs, 0 based on Foata normal form. 0/727 useless extension candidates. Maximal degree in co-relation 980. Up to 27 conditions per place. [2020-10-09 15:39:57,510 INFO L132 encePairwiseOnDemand]: 715/719 looper letters, 9 selfloop transitions, 3 changer transitions 0/629 dead transitions. [2020-10-09 15:39:57,511 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 748 places, 629 transitions, 1624 flow [2020-10-09 15:39:57,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:57,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:57,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2053 transitions. [2020-10-09 15:39:57,512 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.951784886416319 [2020-10-09 15:39:57,512 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2053 transitions. [2020-10-09 15:39:57,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2053 transitions. [2020-10-09 15:39:57,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:57,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2053 transitions. [2020-10-09 15:39:57,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:57,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:57,514 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:57,514 INFO L185 Difference]: Start difference. First operand has 746 places, 628 transitions, 1598 flow. Second operand 3 states and 2053 transitions. [2020-10-09 15:39:57,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 748 places, 629 transitions, 1624 flow [2020-10-09 15:39:57,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 747 places, 629 transitions, 1622 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:57,521 INFO L241 Difference]: Finished difference. Result has 749 places, 629 transitions, 1614 flow [2020-10-09 15:39:57,522 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=745, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1614, PETRI_PLACES=749, PETRI_TRANSITIONS=629} [2020-10-09 15:39:57,522 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 82 predicate places. [2020-10-09 15:39:57,522 INFO L481 AbstractCegarLoop]: Abstraction has has 749 places, 629 transitions, 1614 flow [2020-10-09 15:39:57,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:57,522 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:57,522 INFO L255 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:57,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1033 mathsat -unsat_core_generation=3 [2020-10-09 15:39:57,723 INFO L429 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:57,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:57,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1187599095, now seen corresponding path program 1 times [2020-10-09 15:39:57,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:57,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302690662] [2020-10-09 15:39:57,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1034 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1034 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:58,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:39:58,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:58,304 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:39:58,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:58,309 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:39:58,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302690662] [2020-10-09 15:39:58,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:58,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:58,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206315702] [2020-10-09 15:39:58,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:58,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:58,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:58,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:58,345 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:39:58,346 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 749 places, 629 transitions, 1614 flow. Second operand 3 states. [2020-10-09 15:39:58,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:58,346 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:39:58,346 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:58,634 INFO L129 PetriNetUnfolder]: 15/767 cut-off events. [2020-10-09 15:39:58,635 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2020-10-09 15:39:58,681 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 767 events. 15/767 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3413 event pairs, 0 based on Foata normal form. 2/728 useless extension candidates. Maximal degree in co-relation 979. Up to 27 conditions per place. [2020-10-09 15:39:58,683 INFO L132 encePairwiseOnDemand]: 716/719 looper letters, 9 selfloop transitions, 1 changer transitions 0/627 dead transitions. [2020-10-09 15:39:58,684 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 751 places, 627 transitions, 1622 flow [2020-10-09 15:39:58,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:58,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2052 transitions. [2020-10-09 15:39:58,685 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9513212795549374 [2020-10-09 15:39:58,685 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2052 transitions. [2020-10-09 15:39:58,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2052 transitions. [2020-10-09 15:39:58,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:58,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2052 transitions. [2020-10-09 15:39:58,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:58,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:58,687 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:58,687 INFO L185 Difference]: Start difference. First operand has 749 places, 629 transitions, 1614 flow. Second operand 3 states and 2052 transitions. [2020-10-09 15:39:58,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 751 places, 627 transitions, 1622 flow [2020-10-09 15:39:58,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 750 places, 627 transitions, 1621 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:39:58,694 INFO L241 Difference]: Finished difference. Result has 750 places, 627 transitions, 1603 flow [2020-10-09 15:39:58,694 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=748, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1603, PETRI_PLACES=750, PETRI_TRANSITIONS=627} [2020-10-09 15:39:58,694 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 83 predicate places. [2020-10-09 15:39:58,695 INFO L481 AbstractCegarLoop]: Abstraction has has 750 places, 627 transitions, 1603 flow [2020-10-09 15:39:58,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:58,695 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:58,695 INFO L255 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:39:58,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1034 mathsat -unsat_core_generation=3 [2020-10-09 15:39:58,895 INFO L429 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:39:58,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:39:58,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1187598072, now seen corresponding path program 1 times [2020-10-09 15:39:58,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:39:58,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906518255] [2020-10-09 15:39:58,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1035 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1035 with mathsat -unsat_core_generation=3 [2020-10-09 15:39:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:39:59,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:39:59,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:39:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:39:59,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:39:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:39:59,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906518255] [2020-10-09 15:39:59,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:39:59,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:39:59,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115859919] [2020-10-09 15:39:59,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:39:59,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:39:59,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:39:59,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:39:59,498 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:39:59,499 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 750 places, 627 transitions, 1603 flow. Second operand 3 states. [2020-10-09 15:39:59,499 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:39:59,499 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:39:59,499 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:39:59,784 INFO L129 PetriNetUnfolder]: 15/764 cut-off events. [2020-10-09 15:39:59,784 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:39:59,834 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 764 events. 15/764 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3391 event pairs, 0 based on Foata normal form. 1/725 useless extension candidates. Maximal degree in co-relation 973. Up to 27 conditions per place. [2020-10-09 15:39:59,837 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/624 dead transitions. [2020-10-09 15:39:59,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 750 places, 624 transitions, 1602 flow [2020-10-09 15:39:59,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:39:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:39:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:39:59,839 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:39:59,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:39:59,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:39:59,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:39:59,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:39:59,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:39:59,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:39:59,842 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:39:59,842 INFO L185 Difference]: Start difference. First operand has 750 places, 627 transitions, 1603 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:39:59,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 750 places, 624 transitions, 1602 flow [2020-10-09 15:39:59,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 747 places, 624 transitions, 1597 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:39:59,850 INFO L241 Difference]: Finished difference. Result has 747 places, 624 transitions, 1589 flow [2020-10-09 15:39:59,850 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1587, PETRI_DIFFERENCE_MINUEND_PLACES=745, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1589, PETRI_PLACES=747, PETRI_TRANSITIONS=624} [2020-10-09 15:39:59,850 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 80 predicate places. [2020-10-09 15:39:59,850 INFO L481 AbstractCegarLoop]: Abstraction has has 747 places, 624 transitions, 1589 flow [2020-10-09 15:39:59,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:39:59,851 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:39:59,851 INFO L255 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:00,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1035 mathsat -unsat_core_generation=3 [2020-10-09 15:40:00,052 INFO L429 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:00,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:00,052 INFO L82 PathProgramCache]: Analyzing trace with hash 803132267, now seen corresponding path program 1 times [2020-10-09 15:40:00,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:00,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022336041] [2020-10-09 15:40:00,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1036 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1036 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:00,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:00,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-10-09 15:40:00,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-10-09 15:40:00,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022336041] [2020-10-09 15:40:00,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:00,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:00,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577960711] [2020-10-09 15:40:00,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:00,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:00,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:00,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:00,692 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 719 [2020-10-09 15:40:00,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 747 places, 624 transitions, 1589 flow. Second operand 3 states. [2020-10-09 15:40:00,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:00,693 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 719 [2020-10-09 15:40:00,693 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:00,976 INFO L129 PetriNetUnfolder]: 13/769 cut-off events. [2020-10-09 15:40:00,976 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:40:01,024 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1051 conditions, 769 events. 13/769 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3440 event pairs, 0 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 981. Up to 27 conditions per place. [2020-10-09 15:40:01,026 INFO L132 encePairwiseOnDemand]: 716/719 looper letters, 5 selfloop transitions, 2 changer transitions 0/625 dead transitions. [2020-10-09 15:40:01,026 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 749 places, 625 transitions, 1605 flow [2020-10-09 15:40:01,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2063 transitions. [2020-10-09 15:40:01,027 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9564209550301345 [2020-10-09 15:40:01,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2063 transitions. [2020-10-09 15:40:01,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2063 transitions. [2020-10-09 15:40:01,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:01,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2063 transitions. [2020-10-09 15:40:01,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:01,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:01,030 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:01,030 INFO L185 Difference]: Start difference. First operand has 747 places, 624 transitions, 1589 flow. Second operand 3 states and 2063 transitions. [2020-10-09 15:40:01,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 749 places, 625 transitions, 1605 flow [2020-10-09 15:40:01,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 748 places, 625 transitions, 1604 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:01,036 INFO L241 Difference]: Finished difference. Result has 750 places, 625 transitions, 1602 flow [2020-10-09 15:40:01,037 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1588, PETRI_DIFFERENCE_MINUEND_PLACES=746, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1602, PETRI_PLACES=750, PETRI_TRANSITIONS=625} [2020-10-09 15:40:01,037 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 83 predicate places. [2020-10-09 15:40:01,037 INFO L481 AbstractCegarLoop]: Abstraction has has 750 places, 625 transitions, 1602 flow [2020-10-09 15:40:01,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:01,037 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:01,037 INFO L255 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:01,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1036 mathsat -unsat_core_generation=3 [2020-10-09 15:40:01,238 INFO L429 AbstractCegarLoop]: === Iteration 86 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:01,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:01,238 INFO L82 PathProgramCache]: Analyzing trace with hash 803131244, now seen corresponding path program 1 times [2020-10-09 15:40:01,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:01,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895311837] [2020-10-09 15:40:01,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1037 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1037 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:01,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:01,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-10-09 15:40:01,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:01,826 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-10-09 15:40:01,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895311837] [2020-10-09 15:40:01,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:01,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:01,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877821838] [2020-10-09 15:40:01,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:01,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:01,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:01,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:01,855 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:40:01,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 750 places, 625 transitions, 1602 flow. Second operand 3 states. [2020-10-09 15:40:01,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:01,857 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:40:01,857 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:02,158 INFO L129 PetriNetUnfolder]: 13/770 cut-off events. [2020-10-09 15:40:02,158 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:40:02,209 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 770 events. 13/770 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3451 event pairs, 0 based on Foata normal form. 0/730 useless extension candidates. Maximal degree in co-relation 987. Up to 27 conditions per place. [2020-10-09 15:40:02,212 INFO L132 encePairwiseOnDemand]: 715/719 looper letters, 9 selfloop transitions, 3 changer transitions 0/626 dead transitions. [2020-10-09 15:40:02,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 752 places, 626 transitions, 1628 flow [2020-10-09 15:40:02,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:02,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2053 transitions. [2020-10-09 15:40:02,214 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.951784886416319 [2020-10-09 15:40:02,214 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2053 transitions. [2020-10-09 15:40:02,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2053 transitions. [2020-10-09 15:40:02,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:02,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2053 transitions. [2020-10-09 15:40:02,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:02,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:02,216 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:02,216 INFO L185 Difference]: Start difference. First operand has 750 places, 625 transitions, 1602 flow. Second operand 3 states and 2053 transitions. [2020-10-09 15:40:02,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 752 places, 626 transitions, 1628 flow [2020-10-09 15:40:02,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 751 places, 626 transitions, 1626 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:02,224 INFO L241 Difference]: Finished difference. Result has 753 places, 626 transitions, 1618 flow [2020-10-09 15:40:02,225 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1600, PETRI_DIFFERENCE_MINUEND_PLACES=749, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1618, PETRI_PLACES=753, PETRI_TRANSITIONS=626} [2020-10-09 15:40:02,225 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 86 predicate places. [2020-10-09 15:40:02,225 INFO L481 AbstractCegarLoop]: Abstraction has has 753 places, 626 transitions, 1618 flow [2020-10-09 15:40:02,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:02,225 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:02,225 INFO L255 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:02,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1037 mathsat -unsat_core_generation=3 [2020-10-09 15:40:02,426 INFO L429 AbstractCegarLoop]: === Iteration 87 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:02,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:02,426 INFO L82 PathProgramCache]: Analyzing trace with hash 804084556, now seen corresponding path program 1 times [2020-10-09 15:40:02,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:02,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708212764] [2020-10-09 15:40:02,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1038 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1038 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:03,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:40:03,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:03,014 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-10-09 15:40:03,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:03,021 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-10-09 15:40:03,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708212764] [2020-10-09 15:40:03,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:03,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:03,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996721835] [2020-10-09 15:40:03,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:03,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:03,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:03,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:03,043 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 719 [2020-10-09 15:40:03,044 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 753 places, 626 transitions, 1618 flow. Second operand 3 states. [2020-10-09 15:40:03,044 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:03,044 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 719 [2020-10-09 15:40:03,044 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:03,331 INFO L129 PetriNetUnfolder]: 12/766 cut-off events. [2020-10-09 15:40:03,331 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:40:03,380 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 766 events. 12/766 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3423 event pairs, 0 based on Foata normal form. 1/730 useless extension candidates. Maximal degree in co-relation 979. Up to 27 conditions per place. [2020-10-09 15:40:03,382 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 4 selfloop transitions, 1 changer transitions 0/623 dead transitions. [2020-10-09 15:40:03,382 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 755 places, 623 transitions, 1613 flow [2020-10-09 15:40:03,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:03,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2020-10-09 15:40:03,383 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9568845618915159 [2020-10-09 15:40:03,383 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2020-10-09 15:40:03,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2020-10-09 15:40:03,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:03,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2020-10-09 15:40:03,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:03,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:03,385 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:03,386 INFO L185 Difference]: Start difference. First operand has 753 places, 626 transitions, 1618 flow. Second operand 3 states and 2064 transitions. [2020-10-09 15:40:03,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 755 places, 623 transitions, 1613 flow [2020-10-09 15:40:03,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 752 places, 623 transitions, 1605 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:40:03,393 INFO L241 Difference]: Finished difference. Result has 752 places, 623 transitions, 1597 flow [2020-10-09 15:40:03,393 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1595, PETRI_DIFFERENCE_MINUEND_PLACES=750, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1597, PETRI_PLACES=752, PETRI_TRANSITIONS=623} [2020-10-09 15:40:03,393 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 85 predicate places. [2020-10-09 15:40:03,393 INFO L481 AbstractCegarLoop]: Abstraction has has 752 places, 623 transitions, 1597 flow [2020-10-09 15:40:03,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:03,394 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:03,394 INFO L255 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:03,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1038 mathsat -unsat_core_generation=3 [2020-10-09 15:40:03,594 INFO L429 AbstractCegarLoop]: === Iteration 88 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:03,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:03,595 INFO L82 PathProgramCache]: Analyzing trace with hash 804085579, now seen corresponding path program 1 times [2020-10-09 15:40:03,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:03,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580181427] [2020-10-09 15:40:03,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1039 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1039 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:04,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:04,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-10-09 15:40:04,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-10-09 15:40:04,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580181427] [2020-10-09 15:40:04,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:04,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:04,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058704240] [2020-10-09 15:40:04,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:04,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:04,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:04,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:04,216 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 680 out of 719 [2020-10-09 15:40:04,217 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 752 places, 623 transitions, 1597 flow. Second operand 3 states. [2020-10-09 15:40:04,217 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:04,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 680 of 719 [2020-10-09 15:40:04,218 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:04,503 INFO L129 PetriNetUnfolder]: 12/764 cut-off events. [2020-10-09 15:40:04,504 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-09 15:40:04,555 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 764 events. 12/764 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3405 event pairs, 0 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 983. Up to 27 conditions per place. [2020-10-09 15:40:04,558 INFO L132 encePairwiseOnDemand]: 717/719 looper letters, 8 selfloop transitions, 1 changer transitions 0/621 dead transitions. [2020-10-09 15:40:04,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 752 places, 621 transitions, 1610 flow [2020-10-09 15:40:04,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:04,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2050 transitions. [2020-10-09 15:40:04,559 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9503940658321743 [2020-10-09 15:40:04,560 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2050 transitions. [2020-10-09 15:40:04,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2050 transitions. [2020-10-09 15:40:04,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:04,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2050 transitions. [2020-10-09 15:40:04,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:04,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:04,562 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:04,562 INFO L185 Difference]: Start difference. First operand has 752 places, 623 transitions, 1597 flow. Second operand 3 states and 2050 transitions. [2020-10-09 15:40:04,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 752 places, 621 transitions, 1610 flow [2020-10-09 15:40:04,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 751 places, 621 transitions, 1609 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:04,569 INFO L241 Difference]: Finished difference. Result has 751 places, 621 transitions, 1593 flow [2020-10-09 15:40:04,569 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=719, PETRI_DIFFERENCE_MINUEND_FLOW=1591, PETRI_DIFFERENCE_MINUEND_PLACES=749, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1593, PETRI_PLACES=751, PETRI_TRANSITIONS=621} [2020-10-09 15:40:04,569 INFO L341 CegarLoopForPetriNet]: 667 programPoint places, 84 predicate places. [2020-10-09 15:40:04,569 INFO L481 AbstractCegarLoop]: Abstraction has has 751 places, 621 transitions, 1593 flow [2020-10-09 15:40:04,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:04,570 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:04,570 INFO L255 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:04,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1039 mathsat -unsat_core_generation=3 [2020-10-09 15:40:04,770 INFO L429 AbstractCegarLoop]: === Iteration 89 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:04,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:04,771 INFO L82 PathProgramCache]: Analyzing trace with hash 663509944, now seen corresponding path program 1 times [2020-10-09 15:40:04,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:04,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365618560] [2020-10-09 15:40:04,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1040 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1040 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:40:05,353 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:40:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:40:05,399 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:40:05,463 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:40:05,463 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:40:05,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1040 mathsat -unsat_core_generation=3 [2020-10-09 15:40:05,665 WARN L371 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:40:05,665 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2020-10-09 15:40:05,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,727 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,727 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,727 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,727 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,727 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,727 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,732 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,732 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,732 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,732 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,732 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,836 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,836 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,836 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,836 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,837 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,837 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,837 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,838 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:40:05,840 INFO L253 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2020-10-09 15:40:05,840 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:40:05,840 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:40:05,840 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:40:05,840 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:40:05,840 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:40:05,840 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:40:05,841 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:40:05,841 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:40:05,845 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 692 places, 746 transitions, 2329 flow [2020-10-09 15:40:06,142 INFO L129 PetriNetUnfolder]: 136/988 cut-off events. [2020-10-09 15:40:06,142 INFO L130 PetriNetUnfolder]: For 3627/3627 co-relation queries the response was YES. [2020-10-09 15:40:06,211 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 988 events. 136/988 cut-off events. For 3627/3627 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4169 event pairs, 0 based on Foata normal form. 0/797 useless extension candidates. Maximal degree in co-relation 1376. Up to 56 conditions per place. [2020-10-09 15:40:06,211 INFO L82 GeneralOperation]: Start removeDead. Operand has 692 places, 746 transitions, 2329 flow [2020-10-09 15:40:06,238 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 692 places, 746 transitions, 2329 flow [2020-10-09 15:40:06,243 INFO L129 PetriNetUnfolder]: 9/95 cut-off events. [2020-10-09 15:40:06,243 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:40:06,243 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:06,243 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:06,243 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:06,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:06,243 INFO L82 PathProgramCache]: Analyzing trace with hash 725360020, now seen corresponding path program 1 times [2020-10-09 15:40:06,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:06,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502636054] [2020-10-09 15:40:06,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1041 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1041 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:06,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:40:06,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:40:06,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:40:06,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502636054] [2020-10-09 15:40:06,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:06,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:06,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450313686] [2020-10-09 15:40:06,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:06,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:06,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:06,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:06,848 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:40:06,849 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 746 transitions, 2329 flow. Second operand 3 states. [2020-10-09 15:40:06,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:06,849 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:40:06,849 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:07,139 INFO L129 PetriNetUnfolder]: 80/800 cut-off events. [2020-10-09 15:40:07,139 INFO L130 PetriNetUnfolder]: For 3628/3628 co-relation queries the response was YES. [2020-10-09 15:40:07,197 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 800 events. 80/800 cut-off events. For 3628/3628 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3211 event pairs, 0 based on Foata normal form. 110/802 useless extension candidates. Maximal degree in co-relation 1197. Up to 28 conditions per place. [2020-10-09 15:40:07,304 INFO L132 encePairwiseOnDemand]: 715/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/713 dead transitions. [2020-10-09 15:40:07,305 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 713 transitions, 2273 flow [2020-10-09 15:40:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2200 transitions. [2020-10-09 15:40:07,306 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9830205540661304 [2020-10-09 15:40:07,306 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2200 transitions. [2020-10-09 15:40:07,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2200 transitions. [2020-10-09 15:40:07,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:07,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2200 transitions. [2020-10-09 15:40:07,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:07,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:07,309 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:07,309 INFO L185 Difference]: Start difference. First operand has 692 places, 746 transitions, 2329 flow. Second operand 3 states and 2200 transitions. [2020-10-09 15:40:07,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 713 transitions, 2273 flow [2020-10-09 15:40:07,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 713 transitions, 1571 flow, removed 351 selfloop flow, removed 0 redundant places. [2020-10-09 15:40:07,318 INFO L241 Difference]: Finished difference. Result has 690 places, 713 transitions, 1566 flow [2020-10-09 15:40:07,318 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=712, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1566, PETRI_PLACES=690, PETRI_TRANSITIONS=713} [2020-10-09 15:40:07,318 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, -2 predicate places. [2020-10-09 15:40:07,318 INFO L481 AbstractCegarLoop]: Abstraction has has 690 places, 713 transitions, 1566 flow [2020-10-09 15:40:07,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:07,318 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:07,318 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:07,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1041 mathsat -unsat_core_generation=3 [2020-10-09 15:40:07,519 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:07,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:07,520 INFO L82 PathProgramCache]: Analyzing trace with hash 725361043, now seen corresponding path program 1 times [2020-10-09 15:40:07,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:07,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524158728] [2020-10-09 15:40:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1042 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1042 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:08,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:08,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:08,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:40:08,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:08,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:40:08,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524158728] [2020-10-09 15:40:08,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:08,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:08,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791609842] [2020-10-09 15:40:08,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:08,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:08,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:08,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:08,137 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:08,138 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 713 transitions, 1566 flow. Second operand 3 states. [2020-10-09 15:40:08,138 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:08,138 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:08,138 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:08,382 INFO L129 PetriNetUnfolder]: 78/802 cut-off events. [2020-10-09 15:40:08,382 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:40:08,430 INFO L80 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 802 events. 78/802 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3237 event pairs, 0 based on Foata normal form. 0/695 useless extension candidates. Maximal degree in co-relation 889. Up to 28 conditions per place. [2020-10-09 15:40:08,443 INFO L132 encePairwiseOnDemand]: 742/746 looper letters, 9 selfloop transitions, 3 changer transitions 0/714 dead transitions. [2020-10-09 15:40:08,443 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 692 places, 714 transitions, 1592 flow [2020-10-09 15:40:08,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:08,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2131 transitions. [2020-10-09 15:40:08,445 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9521894548704201 [2020-10-09 15:40:08,445 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2131 transitions. [2020-10-09 15:40:08,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2131 transitions. [2020-10-09 15:40:08,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:08,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2131 transitions. [2020-10-09 15:40:08,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:08,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:08,447 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:08,447 INFO L185 Difference]: Start difference. First operand has 690 places, 713 transitions, 1566 flow. Second operand 3 states and 2131 transitions. [2020-10-09 15:40:08,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 692 places, 714 transitions, 1592 flow [2020-10-09 15:40:08,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 714 transitions, 1591 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:08,453 INFO L241 Difference]: Finished difference. Result has 693 places, 714 transitions, 1583 flow [2020-10-09 15:40:08,454 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1565, PETRI_DIFFERENCE_MINUEND_PLACES=689, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=710, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1583, PETRI_PLACES=693, PETRI_TRANSITIONS=714} [2020-10-09 15:40:08,454 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 1 predicate places. [2020-10-09 15:40:08,454 INFO L481 AbstractCegarLoop]: Abstraction has has 693 places, 714 transitions, 1583 flow [2020-10-09 15:40:08,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:08,454 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:08,454 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:08,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1042 mathsat -unsat_core_generation=3 [2020-10-09 15:40:08,655 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:08,655 INFO L82 PathProgramCache]: Analyzing trace with hash 724407731, now seen corresponding path program 1 times [2020-10-09 15:40:08,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:08,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872848479] [2020-10-09 15:40:08,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1043 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1043 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:09,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:09,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:09,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:40:09,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:09,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:40:09,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872848479] [2020-10-09 15:40:09,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:09,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:09,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41618031] [2020-10-09 15:40:09,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:09,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:09,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:09,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:09,248 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:40:09,249 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 693 places, 714 transitions, 1583 flow. Second operand 3 states. [2020-10-09 15:40:09,249 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:09,250 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:40:09,250 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:09,489 INFO L129 PetriNetUnfolder]: 78/795 cut-off events. [2020-10-09 15:40:09,489 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:40:09,535 INFO L80 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 795 events. 78/795 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3187 event pairs, 0 based on Foata normal form. 1/692 useless extension candidates. Maximal degree in co-relation 872. Up to 28 conditions per place. [2020-10-09 15:40:09,548 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 5 selfloop transitions, 1 changer transitions 0/712 dead transitions. [2020-10-09 15:40:09,548 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 712 transitions, 1585 flow [2020-10-09 15:40:09,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2020-10-09 15:40:09,550 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9562109025915997 [2020-10-09 15:40:09,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2020-10-09 15:40:09,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2020-10-09 15:40:09,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:09,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2020-10-09 15:40:09,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:09,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:09,552 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:09,552 INFO L185 Difference]: Start difference. First operand has 693 places, 714 transitions, 1583 flow. Second operand 3 states and 2140 transitions. [2020-10-09 15:40:09,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 712 transitions, 1585 flow [2020-10-09 15:40:09,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 712 transitions, 1577 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:40:09,559 INFO L241 Difference]: Finished difference. Result has 693 places, 712 transitions, 1570 flow [2020-10-09 15:40:09,559 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1565, PETRI_DIFFERENCE_MINUEND_PLACES=690, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1570, PETRI_PLACES=693, PETRI_TRANSITIONS=712} [2020-10-09 15:40:09,559 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 1 predicate places. [2020-10-09 15:40:09,559 INFO L481 AbstractCegarLoop]: Abstraction has has 693 places, 712 transitions, 1570 flow [2020-10-09 15:40:09,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:09,559 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:09,559 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:09,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1043 mathsat -unsat_core_generation=3 [2020-10-09 15:40:09,760 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:09,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:09,760 INFO L82 PathProgramCache]: Analyzing trace with hash 724406708, now seen corresponding path program 1 times [2020-10-09 15:40:09,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:09,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137560075] [2020-10-09 15:40:09,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1044 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1044 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:10,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:10,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:40:10,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:40:10,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137560075] [2020-10-09 15:40:10,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:10,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:10,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924338098] [2020-10-09 15:40:10,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:10,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:10,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:10,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:10,375 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:10,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 693 places, 712 transitions, 1570 flow. Second operand 3 states. [2020-10-09 15:40:10,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:10,376 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:10,377 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:10,633 INFO L129 PetriNetUnfolder]: 78/793 cut-off events. [2020-10-09 15:40:10,633 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:40:10,685 INFO L80 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 793 events. 78/793 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3173 event pairs, 0 based on Foata normal form. 0/688 useless extension candidates. Maximal degree in co-relation 879. Up to 28 conditions per place. [2020-10-09 15:40:10,698 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 8 selfloop transitions, 1 changer transitions 0/710 dead transitions. [2020-10-09 15:40:10,699 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 710 transitions, 1583 flow [2020-10-09 15:40:10,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:10,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2128 transitions. [2020-10-09 15:40:10,700 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508489722966935 [2020-10-09 15:40:10,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2128 transitions. [2020-10-09 15:40:10,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2128 transitions. [2020-10-09 15:40:10,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:10,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2128 transitions. [2020-10-09 15:40:10,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:10,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:10,702 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:10,702 INFO L185 Difference]: Start difference. First operand has 693 places, 712 transitions, 1570 flow. Second operand 3 states and 2128 transitions. [2020-10-09 15:40:10,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 710 transitions, 1583 flow [2020-10-09 15:40:10,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 710 transitions, 1582 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:10,709 INFO L241 Difference]: Finished difference. Result has 692 places, 710 transitions, 1566 flow [2020-10-09 15:40:10,710 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1564, PETRI_DIFFERENCE_MINUEND_PLACES=690, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1566, PETRI_PLACES=692, PETRI_TRANSITIONS=710} [2020-10-09 15:40:10,710 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 0 predicate places. [2020-10-09 15:40:10,710 INFO L481 AbstractCegarLoop]: Abstraction has has 692 places, 710 transitions, 1566 flow [2020-10-09 15:40:10,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:10,710 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:10,710 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:40:10,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1044 mathsat -unsat_core_generation=3 [2020-10-09 15:40:10,911 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:10,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:10,911 INFO L82 PathProgramCache]: Analyzing trace with hash -299836786, now seen corresponding path program 1 times [2020-10-09 15:40:10,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:10,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74609246] [2020-10-09 15:40:10,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1045 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1045 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:11,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:11,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:40:11,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:40:11,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74609246] [2020-10-09 15:40:11,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:11,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:11,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845957292] [2020-10-09 15:40:11,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:11,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:11,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:11,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:11,527 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:11,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 710 transitions, 1566 flow. Second operand 3 states. [2020-10-09 15:40:11,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:11,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:11,528 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:11,787 INFO L129 PetriNetUnfolder]: 77/801 cut-off events. [2020-10-09 15:40:11,787 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:40:11,840 INFO L80 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 801 events. 77/801 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3243 event pairs, 0 based on Foata normal form. 0/696 useless extension candidates. Maximal degree in co-relation 891. Up to 28 conditions per place. [2020-10-09 15:40:11,854 INFO L132 encePairwiseOnDemand]: 741/746 looper letters, 10 selfloop transitions, 3 changer transitions 0/712 dead transitions. [2020-10-09 15:40:11,854 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 712 transitions, 1596 flow [2020-10-09 15:40:11,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2133 transitions. [2020-10-09 15:40:11,855 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.953083109919571 [2020-10-09 15:40:11,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2133 transitions. [2020-10-09 15:40:11,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2133 transitions. [2020-10-09 15:40:11,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:11,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2133 transitions. [2020-10-09 15:40:11,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:11,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:11,858 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:11,858 INFO L185 Difference]: Start difference. First operand has 692 places, 710 transitions, 1566 flow. Second operand 3 states and 2133 transitions. [2020-10-09 15:40:11,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 712 transitions, 1596 flow [2020-10-09 15:40:11,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 712 transitions, 1595 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:11,864 INFO L241 Difference]: Finished difference. Result has 695 places, 712 transitions, 1589 flow [2020-10-09 15:40:11,865 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1565, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=707, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1589, PETRI_PLACES=695, PETRI_TRANSITIONS=712} [2020-10-09 15:40:11,865 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 3 predicate places. [2020-10-09 15:40:11,865 INFO L481 AbstractCegarLoop]: Abstraction has has 695 places, 712 transitions, 1589 flow [2020-10-09 15:40:11,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:11,865 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:11,865 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:40:12,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1045 mathsat -unsat_core_generation=3 [2020-10-09 15:40:12,066 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:12,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:12,066 INFO L82 PathProgramCache]: Analyzing trace with hash -299835763, now seen corresponding path program 1 times [2020-10-09 15:40:12,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:12,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848798249] [2020-10-09 15:40:12,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1046 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1046 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:12,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:12,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:40:12,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:40:12,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848798249] [2020-10-09 15:40:12,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:12,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:12,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640395811] [2020-10-09 15:40:12,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:12,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:12,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:12,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:12,667 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:40:12,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 712 transitions, 1589 flow. Second operand 3 states. [2020-10-09 15:40:12,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:12,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:40:12,669 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:12,914 INFO L129 PetriNetUnfolder]: 76/799 cut-off events. [2020-10-09 15:40:12,914 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:40:12,962 INFO L80 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 799 events. 76/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3230 event pairs, 0 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 888. Up to 28 conditions per place. [2020-10-09 15:40:12,974 INFO L132 encePairwiseOnDemand]: 743/746 looper letters, 5 selfloop transitions, 2 changer transitions 0/712 dead transitions. [2020-10-09 15:40:12,975 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 712 transitions, 1601 flow [2020-10-09 15:40:12,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:12,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2141 transitions. [2020-10-09 15:40:12,976 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566577301161752 [2020-10-09 15:40:12,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2141 transitions. [2020-10-09 15:40:12,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2141 transitions. [2020-10-09 15:40:12,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:12,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2141 transitions. [2020-10-09 15:40:12,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:12,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:12,978 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:12,978 INFO L185 Difference]: Start difference. First operand has 695 places, 712 transitions, 1589 flow. Second operand 3 states and 2141 transitions. [2020-10-09 15:40:12,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 712 transitions, 1601 flow [2020-10-09 15:40:12,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 696 places, 712 transitions, 1596 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:12,985 INFO L241 Difference]: Finished difference. Result has 698 places, 712 transitions, 1594 flow [2020-10-09 15:40:12,985 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1594, PETRI_PLACES=698, PETRI_TRANSITIONS=712} [2020-10-09 15:40:12,985 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 6 predicate places. [2020-10-09 15:40:12,985 INFO L481 AbstractCegarLoop]: Abstraction has has 698 places, 712 transitions, 1594 flow [2020-10-09 15:40:12,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:12,985 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:12,985 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:40:13,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1046 mathsat -unsat_core_generation=3 [2020-10-09 15:40:13,186 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:13,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:13,187 INFO L82 PathProgramCache]: Analyzing trace with hash -298883474, now seen corresponding path program 1 times [2020-10-09 15:40:13,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:13,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055998662] [2020-10-09 15:40:13,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1047 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1047 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:13,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:40:13,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:40:13,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:40:13,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055998662] [2020-10-09 15:40:13,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:13,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:13,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530966227] [2020-10-09 15:40:13,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:13,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:13,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:13,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:13,796 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:40:13,797 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 698 places, 712 transitions, 1594 flow. Second operand 3 states. [2020-10-09 15:40:13,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:13,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:40:13,797 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:14,039 INFO L129 PetriNetUnfolder]: 75/795 cut-off events. [2020-10-09 15:40:14,039 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-10-09 15:40:14,087 INFO L80 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 795 events. 75/795 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3207 event pairs, 0 based on Foata normal form. 1/695 useless extension candidates. Maximal degree in co-relation 884. Up to 28 conditions per place. [2020-10-09 15:40:14,099 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/709 dead transitions. [2020-10-09 15:40:14,099 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 709 transitions, 1589 flow [2020-10-09 15:40:14,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:14,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:14,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:40:14,101 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:40:14,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:40:14,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:40:14,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:14,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:40:14,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:14,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:14,103 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:14,103 INFO L185 Difference]: Start difference. First operand has 698 places, 712 transitions, 1594 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:40:14,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 700 places, 709 transitions, 1589 flow [2020-10-09 15:40:14,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 709 transitions, 1582 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:40:14,109 INFO L241 Difference]: Finished difference. Result has 697 places, 709 transitions, 1574 flow [2020-10-09 15:40:14,110 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1572, PETRI_DIFFERENCE_MINUEND_PLACES=695, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1574, PETRI_PLACES=697, PETRI_TRANSITIONS=709} [2020-10-09 15:40:14,110 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 5 predicate places. [2020-10-09 15:40:14,110 INFO L481 AbstractCegarLoop]: Abstraction has has 697 places, 709 transitions, 1574 flow [2020-10-09 15:40:14,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:14,110 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:14,110 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:40:14,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1047 mathsat -unsat_core_generation=3 [2020-10-09 15:40:14,311 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:14,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:14,311 INFO L82 PathProgramCache]: Analyzing trace with hash -298882451, now seen corresponding path program 1 times [2020-10-09 15:40:14,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:14,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949924314] [2020-10-09 15:40:14,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1048 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1048 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:14,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:14,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:40:14,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:40:14,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949924314] [2020-10-09 15:40:14,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:14,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:14,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209108067] [2020-10-09 15:40:14,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:14,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:14,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:14,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:14,919 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:14,920 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 709 transitions, 1574 flow. Second operand 3 states. [2020-10-09 15:40:14,920 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:14,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:14,921 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:15,208 INFO L129 PetriNetUnfolder]: 75/793 cut-off events. [2020-10-09 15:40:15,208 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:40:15,245 INFO L80 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 793 events. 75/793 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3191 event pairs, 0 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 886. Up to 28 conditions per place. [2020-10-09 15:40:15,256 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 8 selfloop transitions, 1 changer transitions 0/707 dead transitions. [2020-10-09 15:40:15,256 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 707 transitions, 1587 flow [2020-10-09 15:40:15,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:15,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2128 transitions. [2020-10-09 15:40:15,257 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508489722966935 [2020-10-09 15:40:15,257 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2128 transitions. [2020-10-09 15:40:15,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2128 transitions. [2020-10-09 15:40:15,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:15,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2128 transitions. [2020-10-09 15:40:15,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:15,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:15,260 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:15,260 INFO L185 Difference]: Start difference. First operand has 697 places, 709 transitions, 1574 flow. Second operand 3 states and 2128 transitions. [2020-10-09 15:40:15,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 707 transitions, 1587 flow [2020-10-09 15:40:15,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 696 places, 707 transitions, 1586 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:15,266 INFO L241 Difference]: Finished difference. Result has 696 places, 707 transitions, 1570 flow [2020-10-09 15:40:15,266 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1568, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1570, PETRI_PLACES=696, PETRI_TRANSITIONS=707} [2020-10-09 15:40:15,266 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 4 predicate places. [2020-10-09 15:40:15,266 INFO L481 AbstractCegarLoop]: Abstraction has has 696 places, 707 transitions, 1570 flow [2020-10-09 15:40:15,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:15,266 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:15,266 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:40:15,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1048 mathsat -unsat_core_generation=3 [2020-10-09 15:40:15,467 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:15,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:15,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1327443016, now seen corresponding path program 1 times [2020-10-09 15:40:15,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:15,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045906768] [2020-10-09 15:40:15,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1049 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1049 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:16,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:16,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:40:16,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:40:16,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045906768] [2020-10-09 15:40:16,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:16,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:16,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981587421] [2020-10-09 15:40:16,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:16,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:16,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:16,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:16,084 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:16,085 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 707 transitions, 1570 flow. Second operand 3 states. [2020-10-09 15:40:16,085 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:16,085 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:16,086 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:16,334 INFO L129 PetriNetUnfolder]: 74/801 cut-off events. [2020-10-09 15:40:16,334 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:40:16,383 INFO L80 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 801 events. 74/801 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3262 event pairs, 0 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 898. Up to 28 conditions per place. [2020-10-09 15:40:16,395 INFO L132 encePairwiseOnDemand]: 741/746 looper letters, 10 selfloop transitions, 3 changer transitions 0/709 dead transitions. [2020-10-09 15:40:16,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 698 places, 709 transitions, 1600 flow [2020-10-09 15:40:16,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2133 transitions. [2020-10-09 15:40:16,397 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.953083109919571 [2020-10-09 15:40:16,397 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2133 transitions. [2020-10-09 15:40:16,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2133 transitions. [2020-10-09 15:40:16,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:16,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2133 transitions. [2020-10-09 15:40:16,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:16,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:16,399 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:16,399 INFO L185 Difference]: Start difference. First operand has 696 places, 707 transitions, 1570 flow. Second operand 3 states and 2133 transitions. [2020-10-09 15:40:16,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 698 places, 709 transitions, 1600 flow [2020-10-09 15:40:16,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 709 transitions, 1599 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:16,405 INFO L241 Difference]: Finished difference. Result has 699 places, 709 transitions, 1593 flow [2020-10-09 15:40:16,406 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1569, PETRI_DIFFERENCE_MINUEND_PLACES=695, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=704, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1593, PETRI_PLACES=699, PETRI_TRANSITIONS=709} [2020-10-09 15:40:16,406 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 7 predicate places. [2020-10-09 15:40:16,406 INFO L481 AbstractCegarLoop]: Abstraction has has 699 places, 709 transitions, 1593 flow [2020-10-09 15:40:16,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:16,406 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:16,406 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:40:16,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1049 mathsat -unsat_core_generation=3 [2020-10-09 15:40:16,607 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:16,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:16,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1327441993, now seen corresponding path program 1 times [2020-10-09 15:40:16,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:16,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830068321] [2020-10-09 15:40:16,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1050 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1050 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:17,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:40:17,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:40:17,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:40:17,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830068321] [2020-10-09 15:40:17,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:17,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:17,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275063326] [2020-10-09 15:40:17,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:17,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:17,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:17,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:17,207 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:40:17,208 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 699 places, 709 transitions, 1593 flow. Second operand 3 states. [2020-10-09 15:40:17,208 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:17,208 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:40:17,208 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:17,461 INFO L129 PetriNetUnfolder]: 72/802 cut-off events. [2020-10-09 15:40:17,462 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:40:17,510 INFO L80 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 802 events. 72/802 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3282 event pairs, 0 based on Foata normal form. 1/705 useless extension candidates. Maximal degree in co-relation 896. Up to 28 conditions per place. [2020-10-09 15:40:17,522 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/708 dead transitions. [2020-10-09 15:40:17,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 701 places, 708 transitions, 1599 flow [2020-10-09 15:40:17,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:40:17,524 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:40:17,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:40:17,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:40:17,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:17,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:40:17,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:17,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:17,526 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:17,526 INFO L185 Difference]: Start difference. First operand has 699 places, 709 transitions, 1593 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:40:17,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 701 places, 708 transitions, 1599 flow [2020-10-09 15:40:17,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 708 transitions, 1594 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:17,532 INFO L241 Difference]: Finished difference. Result has 701 places, 708 transitions, 1589 flow [2020-10-09 15:40:17,533 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=707, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1589, PETRI_PLACES=701, PETRI_TRANSITIONS=708} [2020-10-09 15:40:17,533 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 9 predicate places. [2020-10-09 15:40:17,533 INFO L481 AbstractCegarLoop]: Abstraction has has 701 places, 708 transitions, 1589 flow [2020-10-09 15:40:17,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:17,533 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:17,533 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:40:17,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1050 mathsat -unsat_core_generation=3 [2020-10-09 15:40:17,734 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:17,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:17,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1326489704, now seen corresponding path program 1 times [2020-10-09 15:40:17,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:17,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40207783] [2020-10-09 15:40:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1051 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1051 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:18,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:18,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:40:18,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:40:18,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40207783] [2020-10-09 15:40:18,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:18,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:18,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019255378] [2020-10-09 15:40:18,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:18,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:18,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:18,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:18,333 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:40:18,334 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 708 transitions, 1589 flow. Second operand 3 states. [2020-10-09 15:40:18,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:18,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:40:18,334 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:18,590 INFO L129 PetriNetUnfolder]: 72/795 cut-off events. [2020-10-09 15:40:18,590 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:40:18,640 INFO L80 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 795 events. 72/795 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3225 event pairs, 0 based on Foata normal form. 1/698 useless extension candidates. Maximal degree in co-relation 892. Up to 28 conditions per place. [2020-10-09 15:40:18,652 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 5 selfloop transitions, 1 changer transitions 0/706 dead transitions. [2020-10-09 15:40:18,652 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 706 transitions, 1592 flow [2020-10-09 15:40:18,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2020-10-09 15:40:18,654 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9562109025915997 [2020-10-09 15:40:18,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2020-10-09 15:40:18,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2020-10-09 15:40:18,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:18,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2020-10-09 15:40:18,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:18,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:18,656 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:18,656 INFO L185 Difference]: Start difference. First operand has 701 places, 708 transitions, 1589 flow. Second operand 3 states and 2140 transitions. [2020-10-09 15:40:18,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 706 transitions, 1592 flow [2020-10-09 15:40:18,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 706 transitions, 1585 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:40:18,663 INFO L241 Difference]: Finished difference. Result has 701 places, 706 transitions, 1578 flow [2020-10-09 15:40:18,664 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1578, PETRI_PLACES=701, PETRI_TRANSITIONS=706} [2020-10-09 15:40:18,664 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 9 predicate places. [2020-10-09 15:40:18,664 INFO L481 AbstractCegarLoop]: Abstraction has has 701 places, 706 transitions, 1578 flow [2020-10-09 15:40:18,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:18,664 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:18,664 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:40:18,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1051 mathsat -unsat_core_generation=3 [2020-10-09 15:40:18,865 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:18,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:18,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1326488681, now seen corresponding path program 1 times [2020-10-09 15:40:18,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:18,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6997435] [2020-10-09 15:40:18,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1052 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1052 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:19,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:19,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:40:19,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:40:19,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6997435] [2020-10-09 15:40:19,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:19,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:19,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122550082] [2020-10-09 15:40:19,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:19,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:19,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:19,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:19,488 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:19,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 706 transitions, 1578 flow. Second operand 3 states. [2020-10-09 15:40:19,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:19,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:19,490 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:19,741 INFO L129 PetriNetUnfolder]: 72/793 cut-off events. [2020-10-09 15:40:19,741 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:40:19,789 INFO L80 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 793 events. 72/793 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3209 event pairs, 0 based on Foata normal form. 0/694 useless extension candidates. Maximal degree in co-relation 892. Up to 28 conditions per place. [2020-10-09 15:40:19,800 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 8 selfloop transitions, 1 changer transitions 0/704 dead transitions. [2020-10-09 15:40:19,800 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 701 places, 704 transitions, 1591 flow [2020-10-09 15:40:19,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:19,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2128 transitions. [2020-10-09 15:40:19,802 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508489722966935 [2020-10-09 15:40:19,802 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2128 transitions. [2020-10-09 15:40:19,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2128 transitions. [2020-10-09 15:40:19,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:19,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2128 transitions. [2020-10-09 15:40:19,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:19,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:19,804 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:19,804 INFO L185 Difference]: Start difference. First operand has 701 places, 706 transitions, 1578 flow. Second operand 3 states and 2128 transitions. [2020-10-09 15:40:19,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 701 places, 704 transitions, 1591 flow [2020-10-09 15:40:19,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 704 transitions, 1590 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:19,811 INFO L241 Difference]: Finished difference. Result has 700 places, 704 transitions, 1574 flow [2020-10-09 15:40:19,811 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1572, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1574, PETRI_PLACES=700, PETRI_TRANSITIONS=704} [2020-10-09 15:40:19,811 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 8 predicate places. [2020-10-09 15:40:19,811 INFO L481 AbstractCegarLoop]: Abstraction has has 700 places, 704 transitions, 1574 flow [2020-10-09 15:40:19,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:19,811 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:19,811 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:40:20,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1052 mathsat -unsat_core_generation=3 [2020-10-09 15:40:20,012 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:20,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash -434283835, now seen corresponding path program 1 times [2020-10-09 15:40:20,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:20,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926716996] [2020-10-09 15:40:20,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1053 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1053 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:20,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:20,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:40:20,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:40:20,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926716996] [2020-10-09 15:40:20,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:20,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:20,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689246546] [2020-10-09 15:40:20,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:20,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:20,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:20,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:20,621 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:20,622 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 704 transitions, 1574 flow. Second operand 3 states. [2020-10-09 15:40:20,622 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:20,623 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:20,623 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:20,871 INFO L129 PetriNetUnfolder]: 71/801 cut-off events. [2020-10-09 15:40:20,871 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:40:20,920 INFO L80 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 801 events. 71/801 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3279 event pairs, 0 based on Foata normal form. 0/702 useless extension candidates. Maximal degree in co-relation 904. Up to 28 conditions per place. [2020-10-09 15:40:20,931 INFO L132 encePairwiseOnDemand]: 741/746 looper letters, 10 selfloop transitions, 3 changer transitions 0/706 dead transitions. [2020-10-09 15:40:20,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 706 transitions, 1604 flow [2020-10-09 15:40:20,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2133 transitions. [2020-10-09 15:40:20,933 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.953083109919571 [2020-10-09 15:40:20,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2133 transitions. [2020-10-09 15:40:20,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2133 transitions. [2020-10-09 15:40:20,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:20,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2133 transitions. [2020-10-09 15:40:20,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:20,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:20,936 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:20,936 INFO L185 Difference]: Start difference. First operand has 700 places, 704 transitions, 1574 flow. Second operand 3 states and 2133 transitions. [2020-10-09 15:40:20,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 706 transitions, 1604 flow [2020-10-09 15:40:20,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 706 transitions, 1603 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:20,945 INFO L241 Difference]: Finished difference. Result has 703 places, 706 transitions, 1597 flow [2020-10-09 15:40:20,946 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1597, PETRI_PLACES=703, PETRI_TRANSITIONS=706} [2020-10-09 15:40:20,946 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 11 predicate places. [2020-10-09 15:40:20,946 INFO L481 AbstractCegarLoop]: Abstraction has has 703 places, 706 transitions, 1597 flow [2020-10-09 15:40:20,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:20,946 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:20,946 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:40:21,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1053 mathsat -unsat_core_generation=3 [2020-10-09 15:40:21,147 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:21,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:21,147 INFO L82 PathProgramCache]: Analyzing trace with hash -434282812, now seen corresponding path program 1 times [2020-10-09 15:40:21,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:21,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536396967] [2020-10-09 15:40:21,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1054 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1054 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:21,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:21,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:40:21,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:40:21,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536396967] [2020-10-09 15:40:21,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:21,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:21,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459118023] [2020-10-09 15:40:21,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:21,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:21,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:21,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:21,754 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:40:21,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 706 transitions, 1597 flow. Second operand 3 states. [2020-10-09 15:40:21,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:21,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:40:21,755 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:22,010 INFO L129 PetriNetUnfolder]: 70/799 cut-off events. [2020-10-09 15:40:22,010 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:40:22,061 INFO L80 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 799 events. 70/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3268 event pairs, 0 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 901. Up to 28 conditions per place. [2020-10-09 15:40:22,073 INFO L132 encePairwiseOnDemand]: 743/746 looper letters, 5 selfloop transitions, 2 changer transitions 0/706 dead transitions. [2020-10-09 15:40:22,073 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 706 transitions, 1609 flow [2020-10-09 15:40:22,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:22,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2141 transitions. [2020-10-09 15:40:22,075 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566577301161752 [2020-10-09 15:40:22,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2141 transitions. [2020-10-09 15:40:22,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2141 transitions. [2020-10-09 15:40:22,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:22,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2141 transitions. [2020-10-09 15:40:22,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:22,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:22,077 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:22,077 INFO L185 Difference]: Start difference. First operand has 703 places, 706 transitions, 1597 flow. Second operand 3 states and 2141 transitions. [2020-10-09 15:40:22,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 705 places, 706 transitions, 1609 flow [2020-10-09 15:40:22,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 706 transitions, 1604 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:22,083 INFO L241 Difference]: Finished difference. Result has 706 places, 706 transitions, 1602 flow [2020-10-09 15:40:22,084 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1588, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1602, PETRI_PLACES=706, PETRI_TRANSITIONS=706} [2020-10-09 15:40:22,084 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 14 predicate places. [2020-10-09 15:40:22,084 INFO L481 AbstractCegarLoop]: Abstraction has has 706 places, 706 transitions, 1602 flow [2020-10-09 15:40:22,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:22,084 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:22,084 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:40:22,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1054 mathsat -unsat_core_generation=3 [2020-10-09 15:40:22,285 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:22,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:22,285 INFO L82 PathProgramCache]: Analyzing trace with hash -433330523, now seen corresponding path program 1 times [2020-10-09 15:40:22,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:22,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171648581] [2020-10-09 15:40:22,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1055 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1055 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:22,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:40:22,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:40:22,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:40:22,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171648581] [2020-10-09 15:40:22,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:22,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:22,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899678031] [2020-10-09 15:40:22,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:22,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:22,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:22,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:22,890 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:40:22,891 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 706 transitions, 1602 flow. Second operand 3 states. [2020-10-09 15:40:22,891 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:22,891 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:40:22,892 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:23,225 INFO L129 PetriNetUnfolder]: 69/795 cut-off events. [2020-10-09 15:40:23,225 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-10-09 15:40:23,261 INFO L80 FinitePrefix]: Finished finitePrefix Result has 946 conditions, 795 events. 69/795 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3244 event pairs, 0 based on Foata normal form. 1/701 useless extension candidates. Maximal degree in co-relation 897. Up to 28 conditions per place. [2020-10-09 15:40:23,270 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/703 dead transitions. [2020-10-09 15:40:23,271 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 703 transitions, 1597 flow [2020-10-09 15:40:23,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:23,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:23,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:40:23,272 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:40:23,272 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:40:23,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:40:23,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:23,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:40:23,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:23,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:23,274 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:23,274 INFO L185 Difference]: Start difference. First operand has 706 places, 706 transitions, 1602 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:40:23,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 703 transitions, 1597 flow [2020-10-09 15:40:23,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 705 places, 703 transitions, 1590 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:40:23,280 INFO L241 Difference]: Finished difference. Result has 705 places, 703 transitions, 1582 flow [2020-10-09 15:40:23,280 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=703, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1582, PETRI_PLACES=705, PETRI_TRANSITIONS=703} [2020-10-09 15:40:23,280 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 13 predicate places. [2020-10-09 15:40:23,281 INFO L481 AbstractCegarLoop]: Abstraction has has 705 places, 703 transitions, 1582 flow [2020-10-09 15:40:23,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:23,281 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:23,281 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:40:23,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1055 mathsat -unsat_core_generation=3 [2020-10-09 15:40:23,481 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:23,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:23,482 INFO L82 PathProgramCache]: Analyzing trace with hash -433329500, now seen corresponding path program 1 times [2020-10-09 15:40:23,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:23,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176725240] [2020-10-09 15:40:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1056 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1056 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:24,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:24,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:40:24,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:24,009 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:40:24,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176725240] [2020-10-09 15:40:24,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:24,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:24,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436366290] [2020-10-09 15:40:24,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:24,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:24,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:24,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:24,045 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:24,046 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 703 transitions, 1582 flow. Second operand 3 states. [2020-10-09 15:40:24,046 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:24,046 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:24,047 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:24,298 INFO L129 PetriNetUnfolder]: 69/793 cut-off events. [2020-10-09 15:40:24,298 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:40:24,347 INFO L80 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 793 events. 69/793 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3226 event pairs, 0 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 899. Up to 28 conditions per place. [2020-10-09 15:40:24,358 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 8 selfloop transitions, 1 changer transitions 0/701 dead transitions. [2020-10-09 15:40:24,358 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 701 transitions, 1595 flow [2020-10-09 15:40:24,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:24,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:24,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2128 transitions. [2020-10-09 15:40:24,360 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508489722966935 [2020-10-09 15:40:24,360 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2128 transitions. [2020-10-09 15:40:24,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2128 transitions. [2020-10-09 15:40:24,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:24,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2128 transitions. [2020-10-09 15:40:24,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:24,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:24,362 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:24,362 INFO L185 Difference]: Start difference. First operand has 705 places, 703 transitions, 1582 flow. Second operand 3 states and 2128 transitions. [2020-10-09 15:40:24,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 705 places, 701 transitions, 1595 flow [2020-10-09 15:40:24,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 701 transitions, 1594 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:24,368 INFO L241 Difference]: Finished difference. Result has 704 places, 701 transitions, 1578 flow [2020-10-09 15:40:24,368 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1578, PETRI_PLACES=704, PETRI_TRANSITIONS=701} [2020-10-09 15:40:24,368 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 12 predicate places. [2020-10-09 15:40:24,369 INFO L481 AbstractCegarLoop]: Abstraction has has 704 places, 701 transitions, 1578 flow [2020-10-09 15:40:24,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:24,369 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:24,369 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:24,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1056 mathsat -unsat_core_generation=3 [2020-10-09 15:40:24,569 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:24,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:24,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1407577311, now seen corresponding path program 1 times [2020-10-09 15:40:24,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:24,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836258779] [2020-10-09 15:40:24,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1057 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1057 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:25,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:25,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:40:25,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:40:25,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836258779] [2020-10-09 15:40:25,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:25,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:25,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517519615] [2020-10-09 15:40:25,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:25,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:25,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:25,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:25,178 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:40:25,179 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 701 transitions, 1578 flow. Second operand 3 states. [2020-10-09 15:40:25,179 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:25,180 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:40:25,180 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:25,434 INFO L129 PetriNetUnfolder]: 67/798 cut-off events. [2020-10-09 15:40:25,434 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:40:25,483 INFO L80 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 798 events. 67/798 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3276 event pairs, 0 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 902. Up to 28 conditions per place. [2020-10-09 15:40:25,493 INFO L132 encePairwiseOnDemand]: 743/746 looper letters, 5 selfloop transitions, 2 changer transitions 0/702 dead transitions. [2020-10-09 15:40:25,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 702 transitions, 1594 flow [2020-10-09 15:40:25,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:25,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2141 transitions. [2020-10-09 15:40:25,495 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566577301161752 [2020-10-09 15:40:25,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2141 transitions. [2020-10-09 15:40:25,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2141 transitions. [2020-10-09 15:40:25,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:25,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2141 transitions. [2020-10-09 15:40:25,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:25,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:25,497 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:25,497 INFO L185 Difference]: Start difference. First operand has 704 places, 701 transitions, 1578 flow. Second operand 3 states and 2141 transitions. [2020-10-09 15:40:25,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 702 transitions, 1594 flow [2020-10-09 15:40:25,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 705 places, 702 transitions, 1593 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:25,504 INFO L241 Difference]: Finished difference. Result has 707 places, 702 transitions, 1591 flow [2020-10-09 15:40:25,504 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1577, PETRI_DIFFERENCE_MINUEND_PLACES=703, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1591, PETRI_PLACES=707, PETRI_TRANSITIONS=702} [2020-10-09 15:40:25,504 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 15 predicate places. [2020-10-09 15:40:25,504 INFO L481 AbstractCegarLoop]: Abstraction has has 707 places, 702 transitions, 1591 flow [2020-10-09 15:40:25,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:25,504 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:25,504 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:25,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1057 mathsat -unsat_core_generation=3 [2020-10-09 15:40:25,705 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:25,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:25,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1407578334, now seen corresponding path program 1 times [2020-10-09 15:40:25,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:25,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646541861] [2020-10-09 15:40:25,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1058 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1058 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:26,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:26,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:40:26,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:40:26,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646541861] [2020-10-09 15:40:26,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:26,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:26,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429694420] [2020-10-09 15:40:26,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:26,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:26,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:26,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:26,328 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:26,329 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 702 transitions, 1591 flow. Second operand 3 states. [2020-10-09 15:40:26,329 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:26,329 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:26,329 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:26,581 INFO L129 PetriNetUnfolder]: 67/799 cut-off events. [2020-10-09 15:40:26,581 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:40:26,629 INFO L80 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 799 events. 67/799 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3285 event pairs, 0 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 910. Up to 28 conditions per place. [2020-10-09 15:40:26,640 INFO L132 encePairwiseOnDemand]: 742/746 looper letters, 9 selfloop transitions, 3 changer transitions 0/703 dead transitions. [2020-10-09 15:40:26,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 703 transitions, 1617 flow [2020-10-09 15:40:26,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2131 transitions. [2020-10-09 15:40:26,642 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9521894548704201 [2020-10-09 15:40:26,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2131 transitions. [2020-10-09 15:40:26,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2131 transitions. [2020-10-09 15:40:26,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:26,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2131 transitions. [2020-10-09 15:40:26,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:26,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:26,644 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:26,644 INFO L185 Difference]: Start difference. First operand has 707 places, 702 transitions, 1591 flow. Second operand 3 states and 2131 transitions. [2020-10-09 15:40:26,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 703 transitions, 1617 flow [2020-10-09 15:40:26,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 703 transitions, 1615 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:26,651 INFO L241 Difference]: Finished difference. Result has 710 places, 703 transitions, 1607 flow [2020-10-09 15:40:26,651 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1607, PETRI_PLACES=710, PETRI_TRANSITIONS=703} [2020-10-09 15:40:26,651 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 18 predicate places. [2020-10-09 15:40:26,651 INFO L481 AbstractCegarLoop]: Abstraction has has 710 places, 703 transitions, 1607 flow [2020-10-09 15:40:26,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:26,651 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:26,651 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:26,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1058 mathsat -unsat_core_generation=3 [2020-10-09 15:40:26,852 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:26,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:26,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1406623999, now seen corresponding path program 1 times [2020-10-09 15:40:26,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:26,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541006797] [2020-10-09 15:40:26,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1059 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1059 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:27,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:27,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:40:27,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:40:27,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541006797] [2020-10-09 15:40:27,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:27,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:27,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722610853] [2020-10-09 15:40:27,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:27,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:27,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:27,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:27,468 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:27,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 703 transitions, 1607 flow. Second operand 3 states. [2020-10-09 15:40:27,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:27,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:27,469 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:27,721 INFO L129 PetriNetUnfolder]: 66/796 cut-off events. [2020-10-09 15:40:27,721 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-10-09 15:40:27,769 INFO L80 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 796 events. 66/796 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3268 event pairs, 0 based on Foata normal form. 2/705 useless extension candidates. Maximal degree in co-relation 909. Up to 28 conditions per place. [2020-10-09 15:40:27,779 INFO L132 encePairwiseOnDemand]: 743/746 looper letters, 9 selfloop transitions, 1 changer transitions 0/701 dead transitions. [2020-10-09 15:40:27,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 701 transitions, 1615 flow [2020-10-09 15:40:27,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:27,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2130 transitions. [2020-10-09 15:40:27,781 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9517426273458445 [2020-10-09 15:40:27,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2130 transitions. [2020-10-09 15:40:27,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2130 transitions. [2020-10-09 15:40:27,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:27,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2130 transitions. [2020-10-09 15:40:27,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:27,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:27,783 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:27,784 INFO L185 Difference]: Start difference. First operand has 710 places, 703 transitions, 1607 flow. Second operand 3 states and 2130 transitions. [2020-10-09 15:40:27,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 701 transitions, 1615 flow [2020-10-09 15:40:27,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 701 transitions, 1614 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:27,790 INFO L241 Difference]: Finished difference. Result has 711 places, 701 transitions, 1596 flow [2020-10-09 15:40:27,790 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1594, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1596, PETRI_PLACES=711, PETRI_TRANSITIONS=701} [2020-10-09 15:40:27,790 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 19 predicate places. [2020-10-09 15:40:27,790 INFO L481 AbstractCegarLoop]: Abstraction has has 711 places, 701 transitions, 1596 flow [2020-10-09 15:40:27,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:27,791 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:27,791 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:27,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1059 mathsat -unsat_core_generation=3 [2020-10-09 15:40:27,992 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:27,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1406625022, now seen corresponding path program 1 times [2020-10-09 15:40:27,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:27,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279122046] [2020-10-09 15:40:27,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1060 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1060 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:28,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:40:28,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:40:28,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:40:28,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279122046] [2020-10-09 15:40:28,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:28,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:28,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670515852] [2020-10-09 15:40:28,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:28,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:28,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:28,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:28,598 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:40:28,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 711 places, 701 transitions, 1596 flow. Second operand 3 states. [2020-10-09 15:40:28,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:28,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:40:28,600 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:28,854 INFO L129 PetriNetUnfolder]: 66/793 cut-off events. [2020-10-09 15:40:28,854 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:40:28,903 INFO L80 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 793 events. 66/793 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3244 event pairs, 0 based on Foata normal form. 1/702 useless extension candidates. Maximal degree in co-relation 903. Up to 28 conditions per place. [2020-10-09 15:40:28,914 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/698 dead transitions. [2020-10-09 15:40:28,914 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 698 transitions, 1595 flow [2020-10-09 15:40:28,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:28,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:40:28,916 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:40:28,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:40:28,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:40:28,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:28,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:40:28,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:28,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:28,918 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:28,918 INFO L185 Difference]: Start difference. First operand has 711 places, 701 transitions, 1596 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:40:28,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 711 places, 698 transitions, 1595 flow [2020-10-09 15:40:28,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 698 transitions, 1590 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:40:28,924 INFO L241 Difference]: Finished difference. Result has 708 places, 698 transitions, 1582 flow [2020-10-09 15:40:28,925 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=698, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1582, PETRI_PLACES=708, PETRI_TRANSITIONS=698} [2020-10-09 15:40:28,925 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 16 predicate places. [2020-10-09 15:40:28,925 INFO L481 AbstractCegarLoop]: Abstraction has has 708 places, 698 transitions, 1582 flow [2020-10-09 15:40:28,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:28,925 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:28,925 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:29,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1060 mathsat -unsat_core_generation=3 [2020-10-09 15:40:29,126 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:29,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:29,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1663431904, now seen corresponding path program 1 times [2020-10-09 15:40:29,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:29,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22862113] [2020-10-09 15:40:29,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1061 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1061 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:29,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:40:29,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:29,718 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:40:29,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:29,721 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:40:29,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22862113] [2020-10-09 15:40:29,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:29,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:29,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918423117] [2020-10-09 15:40:29,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:29,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:29,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:29,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:29,742 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:40:29,743 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 698 transitions, 1582 flow. Second operand 3 states. [2020-10-09 15:40:29,743 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:29,743 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:40:29,743 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:29,998 INFO L129 PetriNetUnfolder]: 65/800 cut-off events. [2020-10-09 15:40:29,998 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:40:30,047 INFO L80 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 800 events. 65/800 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3303 event pairs, 0 based on Foata normal form. 1/708 useless extension candidates. Maximal degree in co-relation 911. Up to 28 conditions per place. [2020-10-09 15:40:30,057 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/698 dead transitions. [2020-10-09 15:40:30,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 698 transitions, 1592 flow [2020-10-09 15:40:30,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:30,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:40:30,059 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:40:30,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:40:30,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:40:30,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:30,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:40:30,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:30,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:30,061 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:30,061 INFO L185 Difference]: Start difference. First operand has 708 places, 698 transitions, 1582 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:40:30,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 698 transitions, 1592 flow [2020-10-09 15:40:30,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 698 transitions, 1591 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:30,068 INFO L241 Difference]: Finished difference. Result has 710 places, 698 transitions, 1586 flow [2020-10-09 15:40:30,068 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1581, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=698, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1586, PETRI_PLACES=710, PETRI_TRANSITIONS=698} [2020-10-09 15:40:30,068 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 18 predicate places. [2020-10-09 15:40:30,068 INFO L481 AbstractCegarLoop]: Abstraction has has 710 places, 698 transitions, 1586 flow [2020-10-09 15:40:30,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:30,068 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:30,068 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:30,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1061 mathsat -unsat_core_generation=3 [2020-10-09 15:40:30,278 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:30,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:30,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1663432927, now seen corresponding path program 1 times [2020-10-09 15:40:30,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:30,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182597767] [2020-10-09 15:40:30,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1062 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1062 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:30,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:30,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:40:30,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:40:30,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182597767] [2020-10-09 15:40:30,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:30,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:30,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587276277] [2020-10-09 15:40:30,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:30,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:30,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:30,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:30,903 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:30,904 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 698 transitions, 1586 flow. Second operand 3 states. [2020-10-09 15:40:30,904 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:30,904 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:30,904 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:31,211 INFO L129 PetriNetUnfolder]: 63/802 cut-off events. [2020-10-09 15:40:31,211 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:40:31,251 INFO L80 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 802 events. 63/802 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3336 event pairs, 0 based on Foata normal form. 0/710 useless extension candidates. Maximal degree in co-relation 922. Up to 28 conditions per place. [2020-10-09 15:40:31,260 INFO L132 encePairwiseOnDemand]: 742/746 looper letters, 9 selfloop transitions, 3 changer transitions 0/699 dead transitions. [2020-10-09 15:40:31,260 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 699 transitions, 1612 flow [2020-10-09 15:40:31,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:31,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2131 transitions. [2020-10-09 15:40:31,262 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9521894548704201 [2020-10-09 15:40:31,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2131 transitions. [2020-10-09 15:40:31,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2131 transitions. [2020-10-09 15:40:31,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:31,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2131 transitions. [2020-10-09 15:40:31,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:31,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:31,264 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:31,264 INFO L185 Difference]: Start difference. First operand has 710 places, 698 transitions, 1586 flow. Second operand 3 states and 2131 transitions. [2020-10-09 15:40:31,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 699 transitions, 1612 flow [2020-10-09 15:40:31,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 699 transitions, 1611 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:31,270 INFO L241 Difference]: Finished difference. Result has 713 places, 699 transitions, 1603 flow [2020-10-09 15:40:31,271 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1585, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=698, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=695, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1603, PETRI_PLACES=713, PETRI_TRANSITIONS=699} [2020-10-09 15:40:31,271 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 21 predicate places. [2020-10-09 15:40:31,271 INFO L481 AbstractCegarLoop]: Abstraction has has 713 places, 699 transitions, 1603 flow [2020-10-09 15:40:31,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:31,271 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:31,271 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:31,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1062 mathsat -unsat_core_generation=3 [2020-10-09 15:40:31,472 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:31,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:31,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1662479615, now seen corresponding path program 1 times [2020-10-09 15:40:31,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:31,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210784289] [2020-10-09 15:40:31,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1063 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1063 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:32,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:32,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:40:32,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:40:32,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210784289] [2020-10-09 15:40:32,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:32,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:32,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155793163] [2020-10-09 15:40:32,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:32,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:32,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:32,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:32,086 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:40:32,087 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 699 transitions, 1603 flow. Second operand 3 states. [2020-10-09 15:40:32,088 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:32,088 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:40:32,088 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:32,346 INFO L129 PetriNetUnfolder]: 63/795 cut-off events. [2020-10-09 15:40:32,347 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:40:32,396 INFO L80 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 795 events. 63/795 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3280 event pairs, 0 based on Foata normal form. 1/707 useless extension candidates. Maximal degree in co-relation 908. Up to 28 conditions per place. [2020-10-09 15:40:32,406 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 5 selfloop transitions, 1 changer transitions 0/697 dead transitions. [2020-10-09 15:40:32,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 697 transitions, 1605 flow [2020-10-09 15:40:32,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:32,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:32,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2020-10-09 15:40:32,408 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9562109025915997 [2020-10-09 15:40:32,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2020-10-09 15:40:32,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2020-10-09 15:40:32,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:32,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2020-10-09 15:40:32,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:32,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:32,410 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:32,410 INFO L185 Difference]: Start difference. First operand has 713 places, 699 transitions, 1603 flow. Second operand 3 states and 2140 transitions. [2020-10-09 15:40:32,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 715 places, 697 transitions, 1605 flow [2020-10-09 15:40:32,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 697 transitions, 1597 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:40:32,416 INFO L241 Difference]: Finished difference. Result has 713 places, 697 transitions, 1590 flow [2020-10-09 15:40:32,417 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1585, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1590, PETRI_PLACES=713, PETRI_TRANSITIONS=697} [2020-10-09 15:40:32,417 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 21 predicate places. [2020-10-09 15:40:32,417 INFO L481 AbstractCegarLoop]: Abstraction has has 713 places, 697 transitions, 1590 flow [2020-10-09 15:40:32,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:32,417 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:32,417 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:32,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1063 mathsat -unsat_core_generation=3 [2020-10-09 15:40:32,618 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:32,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:32,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1662478592, now seen corresponding path program 1 times [2020-10-09 15:40:32,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:32,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705025861] [2020-10-09 15:40:32,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1064 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1064 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:33,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:33,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:40:33,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:40:33,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705025861] [2020-10-09 15:40:33,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:33,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:33,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043831955] [2020-10-09 15:40:33,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:33,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:33,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:33,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:33,238 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:33,239 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 697 transitions, 1590 flow. Second operand 3 states. [2020-10-09 15:40:33,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:33,240 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:33,240 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:33,497 INFO L129 PetriNetUnfolder]: 63/793 cut-off events. [2020-10-09 15:40:33,497 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:40:33,546 INFO L80 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 793 events. 63/793 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3262 event pairs, 0 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 912. Up to 28 conditions per place. [2020-10-09 15:40:33,556 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 8 selfloop transitions, 1 changer transitions 0/695 dead transitions. [2020-10-09 15:40:33,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 695 transitions, 1603 flow [2020-10-09 15:40:33,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:33,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2128 transitions. [2020-10-09 15:40:33,557 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508489722966935 [2020-10-09 15:40:33,557 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2128 transitions. [2020-10-09 15:40:33,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2128 transitions. [2020-10-09 15:40:33,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:33,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2128 transitions. [2020-10-09 15:40:33,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:33,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:33,559 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:33,560 INFO L185 Difference]: Start difference. First operand has 713 places, 697 transitions, 1590 flow. Second operand 3 states and 2128 transitions. [2020-10-09 15:40:33,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 713 places, 695 transitions, 1603 flow [2020-10-09 15:40:33,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 695 transitions, 1602 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:33,566 INFO L241 Difference]: Finished difference. Result has 712 places, 695 transitions, 1586 flow [2020-10-09 15:40:33,566 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=694, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1586, PETRI_PLACES=712, PETRI_TRANSITIONS=695} [2020-10-09 15:40:33,566 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 20 predicate places. [2020-10-09 15:40:33,567 INFO L481 AbstractCegarLoop]: Abstraction has has 712 places, 695 transitions, 1586 flow [2020-10-09 15:40:33,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:33,567 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:33,567 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:33,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1064 mathsat -unsat_core_generation=3 [2020-10-09 15:40:33,768 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:33,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:33,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1308437950, now seen corresponding path program 1 times [2020-10-09 15:40:33,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:33,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360535786] [2020-10-09 15:40:33,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1065 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1065 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:34,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:34,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:40:34,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:40:34,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360535786] [2020-10-09 15:40:34,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:34,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:34,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191503947] [2020-10-09 15:40:34,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:34,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:34,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:34,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:34,389 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:34,390 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 695 transitions, 1586 flow. Second operand 3 states. [2020-10-09 15:40:34,390 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:34,390 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:34,390 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:34,657 INFO L129 PetriNetUnfolder]: 62/801 cut-off events. [2020-10-09 15:40:34,657 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:40:34,708 INFO L80 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 801 events. 62/801 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3332 event pairs, 0 based on Foata normal form. 0/711 useless extension candidates. Maximal degree in co-relation 924. Up to 28 conditions per place. [2020-10-09 15:40:34,718 INFO L132 encePairwiseOnDemand]: 741/746 looper letters, 10 selfloop transitions, 3 changer transitions 0/697 dead transitions. [2020-10-09 15:40:34,718 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 697 transitions, 1616 flow [2020-10-09 15:40:34,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2133 transitions. [2020-10-09 15:40:34,720 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.953083109919571 [2020-10-09 15:40:34,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2133 transitions. [2020-10-09 15:40:34,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2133 transitions. [2020-10-09 15:40:34,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:34,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2133 transitions. [2020-10-09 15:40:34,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:34,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:34,722 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:34,722 INFO L185 Difference]: Start difference. First operand has 712 places, 695 transitions, 1586 flow. Second operand 3 states and 2133 transitions. [2020-10-09 15:40:34,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 697 transitions, 1616 flow [2020-10-09 15:40:34,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 697 transitions, 1615 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:34,729 INFO L241 Difference]: Finished difference. Result has 715 places, 697 transitions, 1609 flow [2020-10-09 15:40:34,729 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1585, PETRI_DIFFERENCE_MINUEND_PLACES=711, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1609, PETRI_PLACES=715, PETRI_TRANSITIONS=697} [2020-10-09 15:40:34,729 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 23 predicate places. [2020-10-09 15:40:34,729 INFO L481 AbstractCegarLoop]: Abstraction has has 715 places, 697 transitions, 1609 flow [2020-10-09 15:40:34,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:34,729 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:34,729 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:34,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1065 mathsat -unsat_core_generation=3 [2020-10-09 15:40:34,930 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:34,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:34,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1308436927, now seen corresponding path program 1 times [2020-10-09 15:40:34,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:34,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210518920] [2020-10-09 15:40:34,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1066 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1066 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:35,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:40:35,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:40:35,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:40:35,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210518920] [2020-10-09 15:40:35,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:35,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:35,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947766460] [2020-10-09 15:40:35,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:35,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:35,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:35,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:35,544 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:40:35,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 697 transitions, 1609 flow. Second operand 3 states. [2020-10-09 15:40:35,546 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:35,546 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:40:35,546 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:35,811 INFO L129 PetriNetUnfolder]: 60/802 cut-off events. [2020-10-09 15:40:35,811 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:40:35,862 INFO L80 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 802 events. 60/802 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3352 event pairs, 0 based on Foata normal form. 1/717 useless extension candidates. Maximal degree in co-relation 922. Up to 28 conditions per place. [2020-10-09 15:40:35,872 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/696 dead transitions. [2020-10-09 15:40:35,872 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 696 transitions, 1615 flow [2020-10-09 15:40:35,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:40:35,874 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:40:35,874 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:40:35,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:40:35,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:35,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:40:35,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:35,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:35,876 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:35,876 INFO L185 Difference]: Start difference. First operand has 715 places, 697 transitions, 1609 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:40:35,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 717 places, 696 transitions, 1615 flow [2020-10-09 15:40:35,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 696 transitions, 1610 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:35,882 INFO L241 Difference]: Finished difference. Result has 717 places, 696 transitions, 1605 flow [2020-10-09 15:40:35,883 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1600, PETRI_DIFFERENCE_MINUEND_PLACES=714, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=695, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1605, PETRI_PLACES=717, PETRI_TRANSITIONS=696} [2020-10-09 15:40:35,883 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 25 predicate places. [2020-10-09 15:40:35,883 INFO L481 AbstractCegarLoop]: Abstraction has has 717 places, 696 transitions, 1605 flow [2020-10-09 15:40:35,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:35,883 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:35,883 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:36,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1066 mathsat -unsat_core_generation=3 [2020-10-09 15:40:36,084 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:36,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:36,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1307484638, now seen corresponding path program 1 times [2020-10-09 15:40:36,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:36,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623000909] [2020-10-09 15:40:36,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1067 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1067 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:36,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:36,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:36,672 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:40:36,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:36,674 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:40:36,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623000909] [2020-10-09 15:40:36,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:36,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:36,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497930391] [2020-10-09 15:40:36,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:36,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:36,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:36,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:36,686 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:40:36,687 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 696 transitions, 1605 flow. Second operand 3 states. [2020-10-09 15:40:36,687 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:36,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:40:36,687 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:36,935 INFO L129 PetriNetUnfolder]: 60/795 cut-off events. [2020-10-09 15:40:36,935 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:40:36,982 INFO L80 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 795 events. 60/795 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3295 event pairs, 0 based on Foata normal form. 1/710 useless extension candidates. Maximal degree in co-relation 918. Up to 28 conditions per place. [2020-10-09 15:40:36,991 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 5 selfloop transitions, 1 changer transitions 0/694 dead transitions. [2020-10-09 15:40:36,991 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 694 transitions, 1608 flow [2020-10-09 15:40:36,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2020-10-09 15:40:36,993 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9562109025915997 [2020-10-09 15:40:36,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2020-10-09 15:40:36,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2020-10-09 15:40:36,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:36,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2020-10-09 15:40:36,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:36,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:36,995 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:36,995 INFO L185 Difference]: Start difference. First operand has 717 places, 696 transitions, 1605 flow. Second operand 3 states and 2140 transitions. [2020-10-09 15:40:36,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 694 transitions, 1608 flow [2020-10-09 15:40:36,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 694 transitions, 1601 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:40:37,001 INFO L241 Difference]: Finished difference. Result has 717 places, 694 transitions, 1594 flow [2020-10-09 15:40:37,001 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=714, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=693, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1594, PETRI_PLACES=717, PETRI_TRANSITIONS=694} [2020-10-09 15:40:37,001 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 25 predicate places. [2020-10-09 15:40:37,001 INFO L481 AbstractCegarLoop]: Abstraction has has 717 places, 694 transitions, 1594 flow [2020-10-09 15:40:37,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:37,002 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:37,002 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:37,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1067 mathsat -unsat_core_generation=3 [2020-10-09 15:40:37,202 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:37,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:37,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1307483615, now seen corresponding path program 1 times [2020-10-09 15:40:37,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:37,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189380753] [2020-10-09 15:40:37,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1068 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1068 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:37,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:37,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:40:37,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:40:37,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189380753] [2020-10-09 15:40:37,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:37,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:37,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814009871] [2020-10-09 15:40:37,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:37,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:37,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:37,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:37,832 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:37,833 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 694 transitions, 1594 flow. Second operand 3 states. [2020-10-09 15:40:37,833 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:37,834 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:37,834 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:38,101 INFO L129 PetriNetUnfolder]: 60/793 cut-off events. [2020-10-09 15:40:38,102 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:40:38,150 INFO L80 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 793 events. 60/793 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3279 event pairs, 0 based on Foata normal form. 0/706 useless extension candidates. Maximal degree in co-relation 918. Up to 28 conditions per place. [2020-10-09 15:40:38,159 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 8 selfloop transitions, 1 changer transitions 0/692 dead transitions. [2020-10-09 15:40:38,159 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 692 transitions, 1607 flow [2020-10-09 15:40:38,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2128 transitions. [2020-10-09 15:40:38,161 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508489722966935 [2020-10-09 15:40:38,161 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2128 transitions. [2020-10-09 15:40:38,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2128 transitions. [2020-10-09 15:40:38,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:38,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2128 transitions. [2020-10-09 15:40:38,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:38,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:38,163 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:38,163 INFO L185 Difference]: Start difference. First operand has 717 places, 694 transitions, 1594 flow. Second operand 3 states and 2128 transitions. [2020-10-09 15:40:38,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 717 places, 692 transitions, 1607 flow [2020-10-09 15:40:38,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 692 transitions, 1606 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:38,170 INFO L241 Difference]: Finished difference. Result has 716 places, 692 transitions, 1590 flow [2020-10-09 15:40:38,170 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1588, PETRI_DIFFERENCE_MINUEND_PLACES=714, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=691, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1590, PETRI_PLACES=716, PETRI_TRANSITIONS=692} [2020-10-09 15:40:38,170 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 24 predicate places. [2020-10-09 15:40:38,170 INFO L481 AbstractCegarLoop]: Abstraction has has 716 places, 692 transitions, 1590 flow [2020-10-09 15:40:38,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:38,170 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:38,170 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:38,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1068 mathsat -unsat_core_generation=3 [2020-10-09 15:40:38,371 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:38,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:38,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1806266562, now seen corresponding path program 1 times [2020-10-09 15:40:38,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:38,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524421506] [2020-10-09 15:40:38,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1069 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1069 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:38,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:38,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:40:38,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:40:38,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524421506] [2020-10-09 15:40:38,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:38,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:38,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221744551] [2020-10-09 15:40:38,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:38,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:38,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:38,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:38,976 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:40:38,977 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 692 transitions, 1590 flow. Second operand 3 states. [2020-10-09 15:40:38,977 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:38,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:40:38,978 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:39,334 INFO L129 PetriNetUnfolder]: 58/798 cut-off events. [2020-10-09 15:40:39,335 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:40:39,363 INFO L80 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 798 events. 58/798 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3329 event pairs, 0 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 921. Up to 28 conditions per place. [2020-10-09 15:40:39,371 INFO L132 encePairwiseOnDemand]: 743/746 looper letters, 5 selfloop transitions, 2 changer transitions 0/693 dead transitions. [2020-10-09 15:40:39,371 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 718 places, 693 transitions, 1606 flow [2020-10-09 15:40:39,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:39,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2141 transitions. [2020-10-09 15:40:39,372 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566577301161752 [2020-10-09 15:40:39,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2141 transitions. [2020-10-09 15:40:39,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2141 transitions. [2020-10-09 15:40:39,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:39,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2141 transitions. [2020-10-09 15:40:39,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:39,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:39,375 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:39,375 INFO L185 Difference]: Start difference. First operand has 716 places, 692 transitions, 1590 flow. Second operand 3 states and 2141 transitions. [2020-10-09 15:40:39,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 718 places, 693 transitions, 1606 flow [2020-10-09 15:40:39,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 717 places, 693 transitions, 1605 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:39,381 INFO L241 Difference]: Finished difference. Result has 719 places, 693 transitions, 1603 flow [2020-10-09 15:40:39,381 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=715, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=690, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1603, PETRI_PLACES=719, PETRI_TRANSITIONS=693} [2020-10-09 15:40:39,382 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 27 predicate places. [2020-10-09 15:40:39,382 INFO L481 AbstractCegarLoop]: Abstraction has has 719 places, 693 transitions, 1603 flow [2020-10-09 15:40:39,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:39,382 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:39,382 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:39,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1069 mathsat -unsat_core_generation=3 [2020-10-09 15:40:39,583 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:39,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:39,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1806267585, now seen corresponding path program 1 times [2020-10-09 15:40:39,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:39,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273458385] [2020-10-09 15:40:39,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1070 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1070 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:40,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:40,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:40:40,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:40,177 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:40:40,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273458385] [2020-10-09 15:40:40,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:40,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:40,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683679567] [2020-10-09 15:40:40,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:40,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:40,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:40,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:40,205 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:40,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 693 transitions, 1603 flow. Second operand 3 states. [2020-10-09 15:40:40,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:40,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:40,206 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:40,476 INFO L129 PetriNetUnfolder]: 58/799 cut-off events. [2020-10-09 15:40:40,476 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:40:40,526 INFO L80 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 799 events. 58/799 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3336 event pairs, 0 based on Foata normal form. 0/713 useless extension candidates. Maximal degree in co-relation 929. Up to 28 conditions per place. [2020-10-09 15:40:40,536 INFO L132 encePairwiseOnDemand]: 742/746 looper letters, 9 selfloop transitions, 3 changer transitions 0/694 dead transitions. [2020-10-09 15:40:40,536 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 694 transitions, 1629 flow [2020-10-09 15:40:40,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:40,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:40,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2131 transitions. [2020-10-09 15:40:40,537 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9521894548704201 [2020-10-09 15:40:40,537 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2131 transitions. [2020-10-09 15:40:40,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2131 transitions. [2020-10-09 15:40:40,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:40,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2131 transitions. [2020-10-09 15:40:40,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:40,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:40,540 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:40,540 INFO L185 Difference]: Start difference. First operand has 719 places, 693 transitions, 1603 flow. Second operand 3 states and 2131 transitions. [2020-10-09 15:40:40,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 694 transitions, 1629 flow [2020-10-09 15:40:40,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 694 transitions, 1627 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:40,547 INFO L241 Difference]: Finished difference. Result has 722 places, 694 transitions, 1619 flow [2020-10-09 15:40:40,547 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=690, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1619, PETRI_PLACES=722, PETRI_TRANSITIONS=694} [2020-10-09 15:40:40,547 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 30 predicate places. [2020-10-09 15:40:40,547 INFO L481 AbstractCegarLoop]: Abstraction has has 722 places, 694 transitions, 1619 flow [2020-10-09 15:40:40,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:40,547 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:40,547 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:40,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1070 mathsat -unsat_core_generation=3 [2020-10-09 15:40:40,748 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:40,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:40,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1805314273, now seen corresponding path program 1 times [2020-10-09 15:40:40,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:40,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071551571] [2020-10-09 15:40:40,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1071 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1071 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:41,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:40:41,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:41,341 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:40:41,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:40:41,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071551571] [2020-10-09 15:40:41,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:41,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:41,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84622857] [2020-10-09 15:40:41,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:41,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:41,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:41,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:41,365 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:40:41,366 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 694 transitions, 1619 flow. Second operand 3 states. [2020-10-09 15:40:41,366 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:41,367 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:40:41,367 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:41,626 INFO L129 PetriNetUnfolder]: 57/795 cut-off events. [2020-10-09 15:40:41,627 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:40:41,675 INFO L80 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 795 events. 57/795 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3313 event pairs, 0 based on Foata normal form. 1/713 useless extension candidates. Maximal degree in co-relation 921. Up to 28 conditions per place. [2020-10-09 15:40:41,684 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/691 dead transitions. [2020-10-09 15:40:41,684 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 691 transitions, 1614 flow [2020-10-09 15:40:41,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:41,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:41,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:40:41,685 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:40:41,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:40:41,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:40:41,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:41,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:40:41,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:41,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:41,688 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:41,688 INFO L185 Difference]: Start difference. First operand has 722 places, 694 transitions, 1619 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:40:41,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 691 transitions, 1614 flow [2020-10-09 15:40:41,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 721 places, 691 transitions, 1606 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:40:41,694 INFO L241 Difference]: Finished difference. Result has 721 places, 691 transitions, 1598 flow [2020-10-09 15:40:41,695 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=719, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=690, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1598, PETRI_PLACES=721, PETRI_TRANSITIONS=691} [2020-10-09 15:40:41,695 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 29 predicate places. [2020-10-09 15:40:41,695 INFO L481 AbstractCegarLoop]: Abstraction has has 721 places, 691 transitions, 1598 flow [2020-10-09 15:40:41,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:41,695 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:41,695 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:41,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1071 mathsat -unsat_core_generation=3 [2020-10-09 15:40:41,896 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:41,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:41,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1805313250, now seen corresponding path program 1 times [2020-10-09 15:40:41,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:41,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667436477] [2020-10-09 15:40:41,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1072 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1072 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:42,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:42,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:40:42,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:40:42,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667436477] [2020-10-09 15:40:42,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:42,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:42,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451104609] [2020-10-09 15:40:42,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:42,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:42,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:42,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:42,524 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:42,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 691 transitions, 1598 flow. Second operand 3 states. [2020-10-09 15:40:42,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:42,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:42,525 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:42,787 INFO L129 PetriNetUnfolder]: 57/793 cut-off events. [2020-10-09 15:40:42,788 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:40:42,836 INFO L80 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 793 events. 57/793 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3295 event pairs, 0 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 925. Up to 28 conditions per place. [2020-10-09 15:40:42,845 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 8 selfloop transitions, 1 changer transitions 0/689 dead transitions. [2020-10-09 15:40:42,845 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 689 transitions, 1611 flow [2020-10-09 15:40:42,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:42,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2128 transitions. [2020-10-09 15:40:42,846 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508489722966935 [2020-10-09 15:40:42,846 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2128 transitions. [2020-10-09 15:40:42,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2128 transitions. [2020-10-09 15:40:42,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:42,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2128 transitions. [2020-10-09 15:40:42,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:42,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:42,848 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:42,848 INFO L185 Difference]: Start difference. First operand has 721 places, 691 transitions, 1598 flow. Second operand 3 states and 2128 transitions. [2020-10-09 15:40:42,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 689 transitions, 1611 flow [2020-10-09 15:40:42,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 689 transitions, 1610 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:42,855 INFO L241 Difference]: Finished difference. Result has 720 places, 689 transitions, 1594 flow [2020-10-09 15:40:42,855 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1592, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1594, PETRI_PLACES=720, PETRI_TRANSITIONS=689} [2020-10-09 15:40:42,855 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 28 predicate places. [2020-10-09 15:40:42,856 INFO L481 AbstractCegarLoop]: Abstraction has has 720 places, 689 transitions, 1594 flow [2020-10-09 15:40:42,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:42,856 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:42,856 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:43,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1072 mathsat -unsat_core_generation=3 [2020-10-09 15:40:43,057 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:43,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:43,057 INFO L82 PathProgramCache]: Analyzing trace with hash -52005248, now seen corresponding path program 1 times [2020-10-09 15:40:43,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:43,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259579843] [2020-10-09 15:40:43,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1073 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1073 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:43,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:40:43,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:40:43,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:40:43,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259579843] [2020-10-09 15:40:43,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:43,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:43,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313907408] [2020-10-09 15:40:43,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:43,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:43,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:43,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:43,681 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:40:43,682 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 689 transitions, 1594 flow. Second operand 3 states. [2020-10-09 15:40:43,682 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:43,682 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:40:43,683 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:43,962 INFO L129 PetriNetUnfolder]: 56/800 cut-off events. [2020-10-09 15:40:43,962 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:40:44,015 INFO L80 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 800 events. 56/800 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3356 event pairs, 0 based on Foata normal form. 1/718 useless extension candidates. Maximal degree in co-relation 928. Up to 28 conditions per place. [2020-10-09 15:40:44,023 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/689 dead transitions. [2020-10-09 15:40:44,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 722 places, 689 transitions, 1604 flow [2020-10-09 15:40:44,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:40:44,025 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:40:44,025 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:40:44,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:40:44,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:44,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:40:44,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:44,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:44,027 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:44,027 INFO L185 Difference]: Start difference. First operand has 720 places, 689 transitions, 1594 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:40:44,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 722 places, 689 transitions, 1604 flow [2020-10-09 15:40:44,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 721 places, 689 transitions, 1603 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:44,034 INFO L241 Difference]: Finished difference. Result has 722 places, 689 transitions, 1598 flow [2020-10-09 15:40:44,034 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=719, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1598, PETRI_PLACES=722, PETRI_TRANSITIONS=689} [2020-10-09 15:40:44,034 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 30 predicate places. [2020-10-09 15:40:44,035 INFO L481 AbstractCegarLoop]: Abstraction has has 722 places, 689 transitions, 1598 flow [2020-10-09 15:40:44,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:44,035 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:44,035 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:44,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1073 mathsat -unsat_core_generation=3 [2020-10-09 15:40:44,242 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:44,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:44,242 INFO L82 PathProgramCache]: Analyzing trace with hash -52004225, now seen corresponding path program 1 times [2020-10-09 15:40:44,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:44,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780432802] [2020-10-09 15:40:44,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1074 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1074 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:44,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:44,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:40:44,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:40:44,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780432802] [2020-10-09 15:40:44,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:44,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:44,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827573077] [2020-10-09 15:40:44,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:44,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:44,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:44,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:44,869 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:44,870 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 689 transitions, 1598 flow. Second operand 3 states. [2020-10-09 15:40:44,870 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:44,870 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:44,870 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:45,138 INFO L129 PetriNetUnfolder]: 54/802 cut-off events. [2020-10-09 15:40:45,138 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:40:45,187 INFO L80 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 802 events. 54/802 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3384 event pairs, 0 based on Foata normal form. 0/719 useless extension candidates. Maximal degree in co-relation 941. Up to 28 conditions per place. [2020-10-09 15:40:45,196 INFO L132 encePairwiseOnDemand]: 742/746 looper letters, 9 selfloop transitions, 3 changer transitions 0/690 dead transitions. [2020-10-09 15:40:45,196 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 690 transitions, 1624 flow [2020-10-09 15:40:45,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2131 transitions. [2020-10-09 15:40:45,198 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9521894548704201 [2020-10-09 15:40:45,198 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2131 transitions. [2020-10-09 15:40:45,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2131 transitions. [2020-10-09 15:40:45,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:45,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2131 transitions. [2020-10-09 15:40:45,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:45,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:45,200 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:45,201 INFO L185 Difference]: Start difference. First operand has 722 places, 689 transitions, 1598 flow. Second operand 3 states and 2131 transitions. [2020-10-09 15:40:45,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 690 transitions, 1624 flow [2020-10-09 15:40:45,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 723 places, 690 transitions, 1623 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:45,207 INFO L241 Difference]: Finished difference. Result has 725 places, 690 transitions, 1615 flow [2020-10-09 15:40:45,208 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=721, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1615, PETRI_PLACES=725, PETRI_TRANSITIONS=690} [2020-10-09 15:40:45,208 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 33 predicate places. [2020-10-09 15:40:45,208 INFO L481 AbstractCegarLoop]: Abstraction has has 725 places, 690 transitions, 1615 flow [2020-10-09 15:40:45,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:45,208 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:45,208 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:45,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1074 mathsat -unsat_core_generation=3 [2020-10-09 15:40:45,409 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:45,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:45,409 INFO L82 PathProgramCache]: Analyzing trace with hash -52957537, now seen corresponding path program 1 times [2020-10-09 15:40:45,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:45,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569990730] [2020-10-09 15:40:45,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1075 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1075 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:45,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:46,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:46,003 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:40:46,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:46,006 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:40:46,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569990730] [2020-10-09 15:40:46,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:46,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:46,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400075346] [2020-10-09 15:40:46,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:46,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:46,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:46,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:46,018 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:40:46,019 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 725 places, 690 transitions, 1615 flow. Second operand 3 states. [2020-10-09 15:40:46,019 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:46,019 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:40:46,019 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:46,285 INFO L129 PetriNetUnfolder]: 54/795 cut-off events. [2020-10-09 15:40:46,285 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:40:46,334 INFO L80 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 795 events. 54/795 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3329 event pairs, 0 based on Foata normal form. 1/716 useless extension candidates. Maximal degree in co-relation 927. Up to 28 conditions per place. [2020-10-09 15:40:46,342 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 5 selfloop transitions, 1 changer transitions 0/688 dead transitions. [2020-10-09 15:40:46,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 727 places, 688 transitions, 1617 flow [2020-10-09 15:40:46,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2020-10-09 15:40:46,344 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9562109025915997 [2020-10-09 15:40:46,344 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2020-10-09 15:40:46,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2020-10-09 15:40:46,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:46,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2020-10-09 15:40:46,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:46,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:46,346 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:46,346 INFO L185 Difference]: Start difference. First operand has 725 places, 690 transitions, 1615 flow. Second operand 3 states and 2140 transitions. [2020-10-09 15:40:46,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 727 places, 688 transitions, 1617 flow [2020-10-09 15:40:46,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 724 places, 688 transitions, 1609 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:40:46,353 INFO L241 Difference]: Finished difference. Result has 725 places, 688 transitions, 1602 flow [2020-10-09 15:40:46,353 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=722, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1602, PETRI_PLACES=725, PETRI_TRANSITIONS=688} [2020-10-09 15:40:46,353 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 33 predicate places. [2020-10-09 15:40:46,353 INFO L481 AbstractCegarLoop]: Abstraction has has 725 places, 688 transitions, 1602 flow [2020-10-09 15:40:46,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:46,353 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:46,354 INFO L255 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:46,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1075 mathsat -unsat_core_generation=3 [2020-10-09 15:40:46,554 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:46,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:46,555 INFO L82 PathProgramCache]: Analyzing trace with hash -52958560, now seen corresponding path program 1 times [2020-10-09 15:40:46,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:46,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775231374] [2020-10-09 15:40:46,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1076 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1076 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:47,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:47,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:40:47,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-09 15:40:47,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775231374] [2020-10-09 15:40:47,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:47,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:47,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808258871] [2020-10-09 15:40:47,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:47,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:47,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:47,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:47,186 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:47,187 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 725 places, 688 transitions, 1602 flow. Second operand 3 states. [2020-10-09 15:40:47,187 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:47,187 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:47,187 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:47,521 INFO L129 PetriNetUnfolder]: 54/793 cut-off events. [2020-10-09 15:40:47,521 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:40:47,547 INFO L80 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 793 events. 54/793 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3312 event pairs, 0 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 931. Up to 28 conditions per place. [2020-10-09 15:40:47,554 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 8 selfloop transitions, 1 changer transitions 0/686 dead transitions. [2020-10-09 15:40:47,554 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 686 transitions, 1615 flow [2020-10-09 15:40:47,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:47,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:47,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2128 transitions. [2020-10-09 15:40:47,555 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508489722966935 [2020-10-09 15:40:47,555 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2128 transitions. [2020-10-09 15:40:47,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2128 transitions. [2020-10-09 15:40:47,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:47,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2128 transitions. [2020-10-09 15:40:47,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:47,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:47,558 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:47,558 INFO L185 Difference]: Start difference. First operand has 725 places, 688 transitions, 1602 flow. Second operand 3 states and 2128 transitions. [2020-10-09 15:40:47,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 725 places, 686 transitions, 1615 flow [2020-10-09 15:40:47,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 724 places, 686 transitions, 1614 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:47,564 INFO L241 Difference]: Finished difference. Result has 724 places, 686 transitions, 1598 flow [2020-10-09 15:40:47,564 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=722, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1598, PETRI_PLACES=724, PETRI_TRANSITIONS=686} [2020-10-09 15:40:47,564 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 32 predicate places. [2020-10-09 15:40:47,564 INFO L481 AbstractCegarLoop]: Abstraction has has 724 places, 686 transitions, 1598 flow [2020-10-09 15:40:47,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:47,564 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:47,564 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:47,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1076 mathsat -unsat_core_generation=3 [2020-10-09 15:40:47,765 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:47,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:47,766 INFO L82 PathProgramCache]: Analyzing trace with hash 61834625, now seen corresponding path program 1 times [2020-10-09 15:40:47,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:47,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471349790] [2020-10-09 15:40:47,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1077 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1077 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:48,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:48,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:40:48,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:40:48,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471349790] [2020-10-09 15:40:48,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:48,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:48,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809518403] [2020-10-09 15:40:48,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:48,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:48,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:48,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:48,380 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:40:48,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 724 places, 686 transitions, 1598 flow. Second operand 3 states. [2020-10-09 15:40:48,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:48,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:40:48,381 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:48,650 INFO L129 PetriNetUnfolder]: 52/798 cut-off events. [2020-10-09 15:40:48,650 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:40:48,700 INFO L80 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 798 events. 52/798 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3365 event pairs, 0 based on Foata normal form. 0/718 useless extension candidates. Maximal degree in co-relation 934. Up to 28 conditions per place. [2020-10-09 15:40:48,708 INFO L132 encePairwiseOnDemand]: 743/746 looper letters, 5 selfloop transitions, 2 changer transitions 0/687 dead transitions. [2020-10-09 15:40:48,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 726 places, 687 transitions, 1614 flow [2020-10-09 15:40:48,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2141 transitions. [2020-10-09 15:40:48,710 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566577301161752 [2020-10-09 15:40:48,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2141 transitions. [2020-10-09 15:40:48,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2141 transitions. [2020-10-09 15:40:48,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:48,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2141 transitions. [2020-10-09 15:40:48,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:48,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:48,712 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:48,712 INFO L185 Difference]: Start difference. First operand has 724 places, 686 transitions, 1598 flow. Second operand 3 states and 2141 transitions. [2020-10-09 15:40:48,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 726 places, 687 transitions, 1614 flow [2020-10-09 15:40:48,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 725 places, 687 transitions, 1613 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:48,719 INFO L241 Difference]: Finished difference. Result has 727 places, 687 transitions, 1611 flow [2020-10-09 15:40:48,719 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=723, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1611, PETRI_PLACES=727, PETRI_TRANSITIONS=687} [2020-10-09 15:40:48,719 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 35 predicate places. [2020-10-09 15:40:48,719 INFO L481 AbstractCegarLoop]: Abstraction has has 727 places, 687 transitions, 1611 flow [2020-10-09 15:40:48,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:48,719 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:48,719 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:48,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1077 mathsat -unsat_core_generation=3 [2020-10-09 15:40:48,920 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:48,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:48,920 INFO L82 PathProgramCache]: Analyzing trace with hash 61833602, now seen corresponding path program 1 times [2020-10-09 15:40:48,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:48,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043162887] [2020-10-09 15:40:48,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1078 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1078 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:49,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:49,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:40:49,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:40:49,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043162887] [2020-10-09 15:40:49,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:49,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:49,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749801486] [2020-10-09 15:40:49,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:49,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:49,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:49,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:49,550 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:49,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 727 places, 687 transitions, 1611 flow. Second operand 3 states. [2020-10-09 15:40:49,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:49,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:49,552 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:49,824 INFO L129 PetriNetUnfolder]: 52/799 cut-off events. [2020-10-09 15:40:49,824 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:40:49,874 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 799 events. 52/799 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3372 event pairs, 0 based on Foata normal form. 0/719 useless extension candidates. Maximal degree in co-relation 942. Up to 28 conditions per place. [2020-10-09 15:40:49,882 INFO L132 encePairwiseOnDemand]: 742/746 looper letters, 9 selfloop transitions, 3 changer transitions 0/688 dead transitions. [2020-10-09 15:40:49,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 729 places, 688 transitions, 1637 flow [2020-10-09 15:40:49,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:49,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2131 transitions. [2020-10-09 15:40:49,883 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9521894548704201 [2020-10-09 15:40:49,884 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2131 transitions. [2020-10-09 15:40:49,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2131 transitions. [2020-10-09 15:40:49,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:49,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2131 transitions. [2020-10-09 15:40:49,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:49,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:49,886 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:49,886 INFO L185 Difference]: Start difference. First operand has 727 places, 687 transitions, 1611 flow. Second operand 3 states and 2131 transitions. [2020-10-09 15:40:49,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 729 places, 688 transitions, 1637 flow [2020-10-09 15:40:49,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 728 places, 688 transitions, 1635 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:49,893 INFO L241 Difference]: Finished difference. Result has 730 places, 688 transitions, 1627 flow [2020-10-09 15:40:49,893 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1609, PETRI_DIFFERENCE_MINUEND_PLACES=726, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1627, PETRI_PLACES=730, PETRI_TRANSITIONS=688} [2020-10-09 15:40:49,893 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 38 predicate places. [2020-10-09 15:40:49,893 INFO L481 AbstractCegarLoop]: Abstraction has has 730 places, 688 transitions, 1627 flow [2020-10-09 15:40:49,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:49,893 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:49,893 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:50,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1078 mathsat -unsat_core_generation=3 [2020-10-09 15:40:50,094 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:50,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:50,094 INFO L82 PathProgramCache]: Analyzing trace with hash 62787937, now seen corresponding path program 1 times [2020-10-09 15:40:50,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:50,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238921528] [2020-10-09 15:40:50,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1079 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1079 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:50,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:50,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:50,693 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:40:50,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:40:50,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238921528] [2020-10-09 15:40:50,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:50,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:50,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890301184] [2020-10-09 15:40:50,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:50,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:50,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:50,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:50,727 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:50,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 730 places, 688 transitions, 1627 flow. Second operand 3 states. [2020-10-09 15:40:50,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:50,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:50,728 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:51,015 INFO L129 PetriNetUnfolder]: 51/796 cut-off events. [2020-10-09 15:40:51,015 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-10-09 15:40:51,067 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 796 events. 51/796 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3355 event pairs, 0 based on Foata normal form. 2/720 useless extension candidates. Maximal degree in co-relation 941. Up to 28 conditions per place. [2020-10-09 15:40:51,075 INFO L132 encePairwiseOnDemand]: 743/746 looper letters, 9 selfloop transitions, 1 changer transitions 0/686 dead transitions. [2020-10-09 15:40:51,076 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 732 places, 686 transitions, 1635 flow [2020-10-09 15:40:51,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:51,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2130 transitions. [2020-10-09 15:40:51,077 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9517426273458445 [2020-10-09 15:40:51,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2130 transitions. [2020-10-09 15:40:51,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2130 transitions. [2020-10-09 15:40:51,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:51,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2130 transitions. [2020-10-09 15:40:51,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:51,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:51,079 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:51,079 INFO L185 Difference]: Start difference. First operand has 730 places, 688 transitions, 1627 flow. Second operand 3 states and 2130 transitions. [2020-10-09 15:40:51,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 732 places, 686 transitions, 1635 flow [2020-10-09 15:40:51,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 731 places, 686 transitions, 1634 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:51,086 INFO L241 Difference]: Finished difference. Result has 731 places, 686 transitions, 1616 flow [2020-10-09 15:40:51,087 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1614, PETRI_DIFFERENCE_MINUEND_PLACES=729, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1616, PETRI_PLACES=731, PETRI_TRANSITIONS=686} [2020-10-09 15:40:51,087 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 39 predicate places. [2020-10-09 15:40:51,087 INFO L481 AbstractCegarLoop]: Abstraction has has 731 places, 686 transitions, 1616 flow [2020-10-09 15:40:51,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:51,087 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:51,087 INFO L255 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:51,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1079 mathsat -unsat_core_generation=3 [2020-10-09 15:40:51,288 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:51,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:51,288 INFO L82 PathProgramCache]: Analyzing trace with hash 62786914, now seen corresponding path program 1 times [2020-10-09 15:40:51,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:51,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944940037] [2020-10-09 15:40:51,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1080 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1080 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:51,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:40:51,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:40:51,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-09 15:40:51,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944940037] [2020-10-09 15:40:51,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:51,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:51,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251158668] [2020-10-09 15:40:51,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:51,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:51,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:51,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:51,901 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:40:51,902 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 731 places, 686 transitions, 1616 flow. Second operand 3 states. [2020-10-09 15:40:51,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:51,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:40:51,902 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:52,167 INFO L129 PetriNetUnfolder]: 51/793 cut-off events. [2020-10-09 15:40:52,168 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:40:52,217 INFO L80 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 793 events. 51/793 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3334 event pairs, 0 based on Foata normal form. 1/717 useless extension candidates. Maximal degree in co-relation 935. Up to 28 conditions per place. [2020-10-09 15:40:52,224 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/683 dead transitions. [2020-10-09 15:40:52,224 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 683 transitions, 1615 flow [2020-10-09 15:40:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:40:52,226 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:40:52,226 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:40:52,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:40:52,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:52,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:40:52,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:52,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:52,228 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:52,228 INFO L185 Difference]: Start difference. First operand has 731 places, 686 transitions, 1616 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:40:52,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 731 places, 683 transitions, 1615 flow [2020-10-09 15:40:52,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 728 places, 683 transitions, 1610 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:40:52,235 INFO L241 Difference]: Finished difference. Result has 728 places, 683 transitions, 1602 flow [2020-10-09 15:40:52,235 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1600, PETRI_DIFFERENCE_MINUEND_PLACES=726, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1602, PETRI_PLACES=728, PETRI_TRANSITIONS=683} [2020-10-09 15:40:52,235 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 36 predicate places. [2020-10-09 15:40:52,235 INFO L481 AbstractCegarLoop]: Abstraction has has 728 places, 683 transitions, 1602 flow [2020-10-09 15:40:52,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:52,236 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:52,236 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:52,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1080 mathsat -unsat_core_generation=3 [2020-10-09 15:40:52,436 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:52,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:52,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1991727973, now seen corresponding path program 1 times [2020-10-09 15:40:52,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:52,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183022951] [2020-10-09 15:40:52,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1081 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1081 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:53,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:53,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:40:53,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:53,036 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:40:53,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183022951] [2020-10-09 15:40:53,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:53,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:53,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955432811] [2020-10-09 15:40:53,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:53,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:53,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:53,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:53,064 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:53,065 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 728 places, 683 transitions, 1602 flow. Second operand 3 states. [2020-10-09 15:40:53,065 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:53,065 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:53,065 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:53,342 INFO L129 PetriNetUnfolder]: 50/801 cut-off events. [2020-10-09 15:40:53,343 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:40:53,392 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 801 events. 50/801 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3401 event pairs, 0 based on Foata normal form. 0/722 useless extension candidates. Maximal degree in co-relation 952. Up to 28 conditions per place. [2020-10-09 15:40:53,400 INFO L132 encePairwiseOnDemand]: 741/746 looper letters, 10 selfloop transitions, 3 changer transitions 0/685 dead transitions. [2020-10-09 15:40:53,400 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 730 places, 685 transitions, 1632 flow [2020-10-09 15:40:53,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2133 transitions. [2020-10-09 15:40:53,401 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.953083109919571 [2020-10-09 15:40:53,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2133 transitions. [2020-10-09 15:40:53,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2133 transitions. [2020-10-09 15:40:53,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:53,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2133 transitions. [2020-10-09 15:40:53,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:53,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:53,404 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:53,404 INFO L185 Difference]: Start difference. First operand has 728 places, 683 transitions, 1602 flow. Second operand 3 states and 2133 transitions. [2020-10-09 15:40:53,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 730 places, 685 transitions, 1632 flow [2020-10-09 15:40:53,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 729 places, 685 transitions, 1631 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:53,410 INFO L241 Difference]: Finished difference. Result has 731 places, 685 transitions, 1625 flow [2020-10-09 15:40:53,411 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=727, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1625, PETRI_PLACES=731, PETRI_TRANSITIONS=685} [2020-10-09 15:40:53,411 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 39 predicate places. [2020-10-09 15:40:53,411 INFO L481 AbstractCegarLoop]: Abstraction has has 731 places, 685 transitions, 1625 flow [2020-10-09 15:40:53,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:53,411 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:53,411 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:53,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1081 mathsat -unsat_core_generation=3 [2020-10-09 15:40:53,612 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:53,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:53,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1991728996, now seen corresponding path program 1 times [2020-10-09 15:40:53,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:53,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956568630] [2020-10-09 15:40:53,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1082 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1082 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:54,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:54,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:40:54,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:40:54,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956568630] [2020-10-09 15:40:54,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:54,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:54,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811358548] [2020-10-09 15:40:54,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:54,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:54,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:54,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:54,227 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:40:54,228 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 731 places, 685 transitions, 1625 flow. Second operand 3 states. [2020-10-09 15:40:54,228 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:54,228 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:40:54,229 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:54,501 INFO L129 PetriNetUnfolder]: 49/799 cut-off events. [2020-10-09 15:40:54,502 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:40:54,552 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 799 events. 49/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3391 event pairs, 0 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 947. Up to 28 conditions per place. [2020-10-09 15:40:54,559 INFO L132 encePairwiseOnDemand]: 743/746 looper letters, 5 selfloop transitions, 2 changer transitions 0/685 dead transitions. [2020-10-09 15:40:54,560 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 733 places, 685 transitions, 1637 flow [2020-10-09 15:40:54,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2141 transitions. [2020-10-09 15:40:54,561 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566577301161752 [2020-10-09 15:40:54,561 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2141 transitions. [2020-10-09 15:40:54,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2141 transitions. [2020-10-09 15:40:54,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:54,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2141 transitions. [2020-10-09 15:40:54,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:54,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:54,563 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:54,563 INFO L185 Difference]: Start difference. First operand has 731 places, 685 transitions, 1625 flow. Second operand 3 states and 2141 transitions. [2020-10-09 15:40:54,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 733 places, 685 transitions, 1637 flow [2020-10-09 15:40:54,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 732 places, 685 transitions, 1632 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:54,570 INFO L241 Difference]: Finished difference. Result has 734 places, 685 transitions, 1630 flow [2020-10-09 15:40:54,570 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1616, PETRI_DIFFERENCE_MINUEND_PLACES=730, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1630, PETRI_PLACES=734, PETRI_TRANSITIONS=685} [2020-10-09 15:40:54,571 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 42 predicate places. [2020-10-09 15:40:54,571 INFO L481 AbstractCegarLoop]: Abstraction has has 734 places, 685 transitions, 1630 flow [2020-10-09 15:40:54,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:54,571 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:54,571 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:54,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1082 mathsat -unsat_core_generation=3 [2020-10-09 15:40:54,772 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:54,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1992681285, now seen corresponding path program 1 times [2020-10-09 15:40:54,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:54,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290577074] [2020-10-09 15:40:54,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1083 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1083 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:55,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:40:55,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:40:55,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:55,374 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:40:55,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290577074] [2020-10-09 15:40:55,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:55,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:55,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167591672] [2020-10-09 15:40:55,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:55,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:55,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:55,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:55,386 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:40:55,387 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 734 places, 685 transitions, 1630 flow. Second operand 3 states. [2020-10-09 15:40:55,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:55,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:40:55,388 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:55,665 INFO L129 PetriNetUnfolder]: 48/795 cut-off events. [2020-10-09 15:40:55,665 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-10-09 15:40:55,717 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 795 events. 48/795 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3361 event pairs, 0 based on Foata normal form. 1/722 useless extension candidates. Maximal degree in co-relation 943. Up to 28 conditions per place. [2020-10-09 15:40:55,724 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/682 dead transitions. [2020-10-09 15:40:55,725 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 736 places, 682 transitions, 1625 flow [2020-10-09 15:40:55,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:55,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:55,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:40:55,726 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:40:55,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:40:55,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:40:55,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:55,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:40:55,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:55,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:55,728 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:55,728 INFO L185 Difference]: Start difference. First operand has 734 places, 685 transitions, 1630 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:40:55,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 736 places, 682 transitions, 1625 flow [2020-10-09 15:40:55,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 733 places, 682 transitions, 1618 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:40:55,735 INFO L241 Difference]: Finished difference. Result has 733 places, 682 transitions, 1610 flow [2020-10-09 15:40:55,735 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1608, PETRI_DIFFERENCE_MINUEND_PLACES=731, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1610, PETRI_PLACES=733, PETRI_TRANSITIONS=682} [2020-10-09 15:40:55,735 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 41 predicate places. [2020-10-09 15:40:55,735 INFO L481 AbstractCegarLoop]: Abstraction has has 733 places, 682 transitions, 1610 flow [2020-10-09 15:40:55,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:55,736 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:55,736 INFO L255 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:55,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1083 mathsat -unsat_core_generation=3 [2020-10-09 15:40:55,936 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:55,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:55,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1992682308, now seen corresponding path program 1 times [2020-10-09 15:40:55,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:55,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34931832] [2020-10-09 15:40:55,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1084 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1084 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:56,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:56,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:40:56,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-09 15:40:56,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34931832] [2020-10-09 15:40:56,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:56,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:56,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971534704] [2020-10-09 15:40:56,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:56,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:56,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:56,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:56,621 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:56,622 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 733 places, 682 transitions, 1610 flow. Second operand 3 states. [2020-10-09 15:40:56,622 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:56,622 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:56,622 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:56,891 INFO L129 PetriNetUnfolder]: 48/793 cut-off events. [2020-10-09 15:40:56,891 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:40:56,940 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 793 events. 48/793 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3351 event pairs, 0 based on Foata normal form. 0/718 useless extension candidates. Maximal degree in co-relation 945. Up to 28 conditions per place. [2020-10-09 15:40:56,947 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 8 selfloop transitions, 1 changer transitions 0/680 dead transitions. [2020-10-09 15:40:56,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 733 places, 680 transitions, 1623 flow [2020-10-09 15:40:56,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:56,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:56,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2128 transitions. [2020-10-09 15:40:56,949 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508489722966935 [2020-10-09 15:40:56,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2128 transitions. [2020-10-09 15:40:56,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2128 transitions. [2020-10-09 15:40:56,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:56,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2128 transitions. [2020-10-09 15:40:56,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:56,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:56,951 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:56,951 INFO L185 Difference]: Start difference. First operand has 733 places, 682 transitions, 1610 flow. Second operand 3 states and 2128 transitions. [2020-10-09 15:40:56,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 733 places, 680 transitions, 1623 flow [2020-10-09 15:40:56,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 732 places, 680 transitions, 1622 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:56,957 INFO L241 Difference]: Finished difference. Result has 732 places, 680 transitions, 1606 flow [2020-10-09 15:40:56,958 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=730, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1606, PETRI_PLACES=732, PETRI_TRANSITIONS=680} [2020-10-09 15:40:56,958 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 40 predicate places. [2020-10-09 15:40:56,958 INFO L481 AbstractCegarLoop]: Abstraction has has 732 places, 680 transitions, 1606 flow [2020-10-09 15:40:56,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:56,958 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:56,958 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:57,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1084 mathsat -unsat_core_generation=3 [2020-10-09 15:40:57,159 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:57,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:57,159 INFO L82 PathProgramCache]: Analyzing trace with hash 627069864, now seen corresponding path program 1 times [2020-10-09 15:40:57,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:57,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741683233] [2020-10-09 15:40:57,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1085 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1085 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:57,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:40:57,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:40:57,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:57,766 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:40:57,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741683233] [2020-10-09 15:40:57,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:57,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:57,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048986936] [2020-10-09 15:40:57,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:57,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:57,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:57,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:57,787 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:40:57,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 732 places, 680 transitions, 1606 flow. Second operand 3 states. [2020-10-09 15:40:57,789 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:57,789 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:40:57,789 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:58,090 INFO L129 PetriNetUnfolder]: 47/801 cut-off events. [2020-10-09 15:40:58,091 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:40:58,146 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 801 events. 47/801 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3418 event pairs, 0 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 957. Up to 28 conditions per place. [2020-10-09 15:40:58,154 INFO L132 encePairwiseOnDemand]: 741/746 looper letters, 10 selfloop transitions, 3 changer transitions 0/682 dead transitions. [2020-10-09 15:40:58,154 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 734 places, 682 transitions, 1636 flow [2020-10-09 15:40:58,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:58,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2133 transitions. [2020-10-09 15:40:58,155 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.953083109919571 [2020-10-09 15:40:58,155 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2133 transitions. [2020-10-09 15:40:58,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2133 transitions. [2020-10-09 15:40:58,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:58,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2133 transitions. [2020-10-09 15:40:58,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:58,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:58,158 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:58,158 INFO L185 Difference]: Start difference. First operand has 732 places, 680 transitions, 1606 flow. Second operand 3 states and 2133 transitions. [2020-10-09 15:40:58,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 734 places, 682 transitions, 1636 flow [2020-10-09 15:40:58,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 733 places, 682 transitions, 1635 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:58,165 INFO L241 Difference]: Finished difference. Result has 735 places, 682 transitions, 1629 flow [2020-10-09 15:40:58,166 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=731, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1629, PETRI_PLACES=735, PETRI_TRANSITIONS=682} [2020-10-09 15:40:58,166 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 43 predicate places. [2020-10-09 15:40:58,166 INFO L481 AbstractCegarLoop]: Abstraction has has 735 places, 682 transitions, 1629 flow [2020-10-09 15:40:58,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:58,166 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:58,166 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:58,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1085 mathsat -unsat_core_generation=3 [2020-10-09 15:40:58,367 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:58,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:58,367 INFO L82 PathProgramCache]: Analyzing trace with hash 627068841, now seen corresponding path program 1 times [2020-10-09 15:40:58,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:58,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104565909] [2020-10-09 15:40:58,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1086 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1086 with mathsat -unsat_core_generation=3 [2020-10-09 15:40:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:40:58,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:40:58,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:40:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:40:58,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:40:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:40:58,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104565909] [2020-10-09 15:40:58,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:40:58,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:40:58,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891385020] [2020-10-09 15:40:58,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:40:58,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:40:58,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:40:58,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:40:58,999 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:40:59,000 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 735 places, 682 transitions, 1629 flow. Second operand 3 states. [2020-10-09 15:40:59,000 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:40:59,001 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:40:59,001 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:40:59,279 INFO L129 PetriNetUnfolder]: 45/802 cut-off events. [2020-10-09 15:40:59,279 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:40:59,330 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 802 events. 45/802 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3441 event pairs, 0 based on Foata normal form. 1/732 useless extension candidates. Maximal degree in co-relation 955. Up to 28 conditions per place. [2020-10-09 15:40:59,336 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/681 dead transitions. [2020-10-09 15:40:59,337 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 737 places, 681 transitions, 1635 flow [2020-10-09 15:40:59,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:40:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:40:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:40:59,338 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:40:59,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:40:59,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:40:59,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:40:59,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:40:59,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:40:59,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:40:59,340 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:40:59,340 INFO L185 Difference]: Start difference. First operand has 735 places, 682 transitions, 1629 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:40:59,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 737 places, 681 transitions, 1635 flow [2020-10-09 15:40:59,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 736 places, 681 transitions, 1630 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:40:59,347 INFO L241 Difference]: Finished difference. Result has 737 places, 681 transitions, 1625 flow [2020-10-09 15:40:59,348 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=734, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1625, PETRI_PLACES=737, PETRI_TRANSITIONS=681} [2020-10-09 15:40:59,348 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 45 predicate places. [2020-10-09 15:40:59,348 INFO L481 AbstractCegarLoop]: Abstraction has has 737 places, 681 transitions, 1625 flow [2020-10-09 15:40:59,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:40:59,348 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:40:59,348 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:40:59,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1086 mathsat -unsat_core_generation=3 [2020-10-09 15:40:59,549 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:40:59,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:40:59,549 INFO L82 PathProgramCache]: Analyzing trace with hash 626116552, now seen corresponding path program 1 times [2020-10-09 15:40:59,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:40:59,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567111694] [2020-10-09 15:40:59,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1087 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1087 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:00,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:00,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:41:00,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:41:00,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567111694] [2020-10-09 15:41:00,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:00,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:00,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412421920] [2020-10-09 15:41:00,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:00,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:00,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:00,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:00,171 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:41:00,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 737 places, 681 transitions, 1625 flow. Second operand 3 states. [2020-10-09 15:41:00,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:00,172 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:41:00,172 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:00,454 INFO L129 PetriNetUnfolder]: 45/795 cut-off events. [2020-10-09 15:41:00,454 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:41:00,505 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 795 events. 45/795 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3379 event pairs, 0 based on Foata normal form. 1/725 useless extension candidates. Maximal degree in co-relation 951. Up to 28 conditions per place. [2020-10-09 15:41:00,513 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 5 selfloop transitions, 1 changer transitions 0/679 dead transitions. [2020-10-09 15:41:00,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 739 places, 679 transitions, 1628 flow [2020-10-09 15:41:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2020-10-09 15:41:00,514 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9562109025915997 [2020-10-09 15:41:00,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2020-10-09 15:41:00,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2020-10-09 15:41:00,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:00,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2020-10-09 15:41:00,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:00,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:00,516 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:00,517 INFO L185 Difference]: Start difference. First operand has 737 places, 681 transitions, 1625 flow. Second operand 3 states and 2140 transitions. [2020-10-09 15:41:00,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 739 places, 679 transitions, 1628 flow [2020-10-09 15:41:00,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 736 places, 679 transitions, 1621 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:41:00,523 INFO L241 Difference]: Finished difference. Result has 737 places, 679 transitions, 1614 flow [2020-10-09 15:41:00,524 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1609, PETRI_DIFFERENCE_MINUEND_PLACES=734, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1614, PETRI_PLACES=737, PETRI_TRANSITIONS=679} [2020-10-09 15:41:00,524 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 45 predicate places. [2020-10-09 15:41:00,524 INFO L481 AbstractCegarLoop]: Abstraction has has 737 places, 679 transitions, 1614 flow [2020-10-09 15:41:00,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:00,524 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:00,524 INFO L255 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:00,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1087 mathsat -unsat_core_generation=3 [2020-10-09 15:41:00,725 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:00,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:00,725 INFO L82 PathProgramCache]: Analyzing trace with hash 626115529, now seen corresponding path program 1 times [2020-10-09 15:41:00,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:00,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214390497] [2020-10-09 15:41:00,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1088 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1088 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:01,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:01,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:41:01,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-09 15:41:01,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214390497] [2020-10-09 15:41:01,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:01,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:01,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359597689] [2020-10-09 15:41:01,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:01,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:01,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:01,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:01,366 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:01,367 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 737 places, 679 transitions, 1614 flow. Second operand 3 states. [2020-10-09 15:41:01,368 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:01,368 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:01,368 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:01,647 INFO L129 PetriNetUnfolder]: 45/793 cut-off events. [2020-10-09 15:41:01,647 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:41:01,699 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 793 events. 45/793 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3364 event pairs, 0 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 951. Up to 28 conditions per place. [2020-10-09 15:41:01,706 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 8 selfloop transitions, 1 changer transitions 0/677 dead transitions. [2020-10-09 15:41:01,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 737 places, 677 transitions, 1627 flow [2020-10-09 15:41:01,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:01,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2128 transitions. [2020-10-09 15:41:01,707 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508489722966935 [2020-10-09 15:41:01,708 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2128 transitions. [2020-10-09 15:41:01,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2128 transitions. [2020-10-09 15:41:01,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:01,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2128 transitions. [2020-10-09 15:41:01,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:01,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:01,710 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:01,710 INFO L185 Difference]: Start difference. First operand has 737 places, 679 transitions, 1614 flow. Second operand 3 states and 2128 transitions. [2020-10-09 15:41:01,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 737 places, 677 transitions, 1627 flow [2020-10-09 15:41:01,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 736 places, 677 transitions, 1626 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:01,717 INFO L241 Difference]: Finished difference. Result has 736 places, 677 transitions, 1610 flow [2020-10-09 15:41:01,717 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1608, PETRI_DIFFERENCE_MINUEND_PLACES=734, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1610, PETRI_PLACES=736, PETRI_TRANSITIONS=677} [2020-10-09 15:41:01,717 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 44 predicate places. [2020-10-09 15:41:01,717 INFO L481 AbstractCegarLoop]: Abstraction has has 736 places, 677 transitions, 1610 flow [2020-10-09 15:41:01,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:01,717 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:01,717 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:01,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1088 mathsat -unsat_core_generation=3 [2020-10-09 15:41:01,918 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:01,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:01,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1235813421, now seen corresponding path program 1 times [2020-10-09 15:41:01,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:01,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268110244] [2020-10-09 15:41:01,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1089 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1089 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:02,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:02,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:41:02,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:41:02,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268110244] [2020-10-09 15:41:02,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:02,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:02,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265918231] [2020-10-09 15:41:02,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:02,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:02,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:02,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:02,547 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:41:02,548 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 736 places, 677 transitions, 1610 flow. Second operand 3 states. [2020-10-09 15:41:02,548 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:02,548 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:41:02,548 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:02,834 INFO L129 PetriNetUnfolder]: 43/798 cut-off events. [2020-10-09 15:41:02,834 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:41:02,886 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 798 events. 43/798 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3417 event pairs, 0 based on Foata normal form. 0/727 useless extension candidates. Maximal degree in co-relation 954. Up to 28 conditions per place. [2020-10-09 15:41:02,893 INFO L132 encePairwiseOnDemand]: 743/746 looper letters, 5 selfloop transitions, 2 changer transitions 0/678 dead transitions. [2020-10-09 15:41:02,893 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 738 places, 678 transitions, 1626 flow [2020-10-09 15:41:02,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2141 transitions. [2020-10-09 15:41:02,895 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566577301161752 [2020-10-09 15:41:02,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2141 transitions. [2020-10-09 15:41:02,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2141 transitions. [2020-10-09 15:41:02,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:02,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2141 transitions. [2020-10-09 15:41:02,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:02,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:02,897 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:02,897 INFO L185 Difference]: Start difference. First operand has 736 places, 677 transitions, 1610 flow. Second operand 3 states and 2141 transitions. [2020-10-09 15:41:02,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 738 places, 678 transitions, 1626 flow [2020-10-09 15:41:02,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 737 places, 678 transitions, 1625 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:02,904 INFO L241 Difference]: Finished difference. Result has 739 places, 678 transitions, 1623 flow [2020-10-09 15:41:02,904 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1609, PETRI_DIFFERENCE_MINUEND_PLACES=735, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1623, PETRI_PLACES=739, PETRI_TRANSITIONS=678} [2020-10-09 15:41:02,904 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 47 predicate places. [2020-10-09 15:41:02,904 INFO L481 AbstractCegarLoop]: Abstraction has has 739 places, 678 transitions, 1623 flow [2020-10-09 15:41:02,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:02,904 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:02,905 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:03,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1089 mathsat -unsat_core_generation=3 [2020-10-09 15:41:03,105 INFO L429 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:03,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:03,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1235812398, now seen corresponding path program 1 times [2020-10-09 15:41:03,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:03,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954187716] [2020-10-09 15:41:03,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1090 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1090 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:03,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:03,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:41:03,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:41:03,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954187716] [2020-10-09 15:41:03,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:03,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:03,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151078203] [2020-10-09 15:41:03,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:03,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:03,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:03,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:03,748 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:03,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 739 places, 678 transitions, 1623 flow. Second operand 3 states. [2020-10-09 15:41:03,750 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:03,750 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:03,750 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:04,040 INFO L129 PetriNetUnfolder]: 43/799 cut-off events. [2020-10-09 15:41:04,040 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:41:04,093 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 799 events. 43/799 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3425 event pairs, 0 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 962. Up to 28 conditions per place. [2020-10-09 15:41:04,099 INFO L132 encePairwiseOnDemand]: 742/746 looper letters, 9 selfloop transitions, 3 changer transitions 0/679 dead transitions. [2020-10-09 15:41:04,099 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 741 places, 679 transitions, 1649 flow [2020-10-09 15:41:04,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:04,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2131 transitions. [2020-10-09 15:41:04,101 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9521894548704201 [2020-10-09 15:41:04,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2131 transitions. [2020-10-09 15:41:04,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2131 transitions. [2020-10-09 15:41:04,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:04,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2131 transitions. [2020-10-09 15:41:04,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:04,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:04,103 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:04,103 INFO L185 Difference]: Start difference. First operand has 739 places, 678 transitions, 1623 flow. Second operand 3 states and 2131 transitions. [2020-10-09 15:41:04,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 741 places, 679 transitions, 1649 flow [2020-10-09 15:41:04,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 740 places, 679 transitions, 1647 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:04,110 INFO L241 Difference]: Finished difference. Result has 742 places, 679 transitions, 1639 flow [2020-10-09 15:41:04,110 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1621, PETRI_DIFFERENCE_MINUEND_PLACES=738, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1639, PETRI_PLACES=742, PETRI_TRANSITIONS=679} [2020-10-09 15:41:04,110 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 50 predicate places. [2020-10-09 15:41:04,110 INFO L481 AbstractCegarLoop]: Abstraction has has 742 places, 679 transitions, 1639 flow [2020-10-09 15:41:04,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:04,111 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:04,111 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:04,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1090 mathsat -unsat_core_generation=3 [2020-10-09 15:41:04,311 INFO L429 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:04,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:04,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1236766733, now seen corresponding path program 1 times [2020-10-09 15:41:04,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:04,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819219494] [2020-10-09 15:41:04,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1091 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1091 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:04,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:04,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:41:04,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:41:04,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819219494] [2020-10-09 15:41:04,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:04,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:04,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762116424] [2020-10-09 15:41:04,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:04,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:04,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:04,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:04,993 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:04,994 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 742 places, 679 transitions, 1639 flow. Second operand 3 states. [2020-10-09 15:41:04,994 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:04,994 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:04,994 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:05,280 INFO L129 PetriNetUnfolder]: 42/796 cut-off events. [2020-10-09 15:41:05,280 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-10-09 15:41:05,332 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 796 events. 42/796 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3409 event pairs, 0 based on Foata normal form. 2/729 useless extension candidates. Maximal degree in co-relation 961. Up to 28 conditions per place. [2020-10-09 15:41:05,338 INFO L132 encePairwiseOnDemand]: 743/746 looper letters, 9 selfloop transitions, 1 changer transitions 0/677 dead transitions. [2020-10-09 15:41:05,338 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 744 places, 677 transitions, 1647 flow [2020-10-09 15:41:05,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:05,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2130 transitions. [2020-10-09 15:41:05,340 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9517426273458445 [2020-10-09 15:41:05,340 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2130 transitions. [2020-10-09 15:41:05,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2130 transitions. [2020-10-09 15:41:05,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:05,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2130 transitions. [2020-10-09 15:41:05,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:05,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:05,342 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:05,342 INFO L185 Difference]: Start difference. First operand has 742 places, 679 transitions, 1639 flow. Second operand 3 states and 2130 transitions. [2020-10-09 15:41:05,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 744 places, 677 transitions, 1647 flow [2020-10-09 15:41:05,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 743 places, 677 transitions, 1646 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:05,349 INFO L241 Difference]: Finished difference. Result has 743 places, 677 transitions, 1628 flow [2020-10-09 15:41:05,349 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1626, PETRI_DIFFERENCE_MINUEND_PLACES=741, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1628, PETRI_PLACES=743, PETRI_TRANSITIONS=677} [2020-10-09 15:41:05,349 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 51 predicate places. [2020-10-09 15:41:05,349 INFO L481 AbstractCegarLoop]: Abstraction has has 743 places, 677 transitions, 1628 flow [2020-10-09 15:41:05,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:05,349 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:05,349 INFO L255 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:05,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1091 mathsat -unsat_core_generation=3 [2020-10-09 15:41:05,550 INFO L429 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:05,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:05,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1236765710, now seen corresponding path program 1 times [2020-10-09 15:41:05,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:05,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269061164] [2020-10-09 15:41:05,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1092 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1092 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:06,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:41:06,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:41:06,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-09 15:41:06,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269061164] [2020-10-09 15:41:06,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:06,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:06,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308606664] [2020-10-09 15:41:06,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:06,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:06,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:06,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:06,179 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:41:06,181 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 743 places, 677 transitions, 1628 flow. Second operand 3 states. [2020-10-09 15:41:06,181 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:06,181 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:41:06,181 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:06,464 INFO L129 PetriNetUnfolder]: 42/793 cut-off events. [2020-10-09 15:41:06,464 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:41:06,517 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 793 events. 42/793 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3383 event pairs, 0 based on Foata normal form. 1/726 useless extension candidates. Maximal degree in co-relation 955. Up to 28 conditions per place. [2020-10-09 15:41:06,523 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/674 dead transitions. [2020-10-09 15:41:06,524 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 743 places, 674 transitions, 1627 flow [2020-10-09 15:41:06,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:41:06,525 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:41:06,525 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:41:06,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:41:06,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:06,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:41:06,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:06,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:06,528 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:06,528 INFO L185 Difference]: Start difference. First operand has 743 places, 677 transitions, 1628 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:41:06,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 743 places, 674 transitions, 1627 flow [2020-10-09 15:41:06,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 740 places, 674 transitions, 1622 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:41:06,535 INFO L241 Difference]: Finished difference. Result has 740 places, 674 transitions, 1614 flow [2020-10-09 15:41:06,536 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1612, PETRI_DIFFERENCE_MINUEND_PLACES=738, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1614, PETRI_PLACES=740, PETRI_TRANSITIONS=674} [2020-10-09 15:41:06,536 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 48 predicate places. [2020-10-09 15:41:06,536 INFO L481 AbstractCegarLoop]: Abstraction has has 740 places, 674 transitions, 1614 flow [2020-10-09 15:41:06,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:06,536 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:06,536 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:06,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1092 mathsat -unsat_core_generation=3 [2020-10-09 15:41:06,737 INFO L429 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:06,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:06,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1156603411, now seen corresponding path program 1 times [2020-10-09 15:41:06,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:06,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659491464] [2020-10-09 15:41:06,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1093 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1093 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:07,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:07,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:41:07,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:07,350 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:41:07,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659491464] [2020-10-09 15:41:07,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:07,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:07,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308462696] [2020-10-09 15:41:07,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:07,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:07,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:07,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:07,369 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:41:07,370 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 740 places, 674 transitions, 1614 flow. Second operand 3 states. [2020-10-09 15:41:07,370 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:07,370 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:41:07,370 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:07,652 INFO L129 PetriNetUnfolder]: 40/798 cut-off events. [2020-10-09 15:41:07,652 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:41:07,702 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 798 events. 40/798 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3436 event pairs, 0 based on Foata normal form. 0/729 useless extension candidates. Maximal degree in co-relation 963. Up to 28 conditions per place. [2020-10-09 15:41:07,708 INFO L132 encePairwiseOnDemand]: 743/746 looper letters, 5 selfloop transitions, 2 changer transitions 0/675 dead transitions. [2020-10-09 15:41:07,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 742 places, 675 transitions, 1630 flow [2020-10-09 15:41:07,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2141 transitions. [2020-10-09 15:41:07,710 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566577301161752 [2020-10-09 15:41:07,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2141 transitions. [2020-10-09 15:41:07,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2141 transitions. [2020-10-09 15:41:07,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:07,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2141 transitions. [2020-10-09 15:41:07,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:07,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:07,713 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:07,713 INFO L185 Difference]: Start difference. First operand has 740 places, 674 transitions, 1614 flow. Second operand 3 states and 2141 transitions. [2020-10-09 15:41:07,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 742 places, 675 transitions, 1630 flow [2020-10-09 15:41:07,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 741 places, 675 transitions, 1629 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:07,720 INFO L241 Difference]: Finished difference. Result has 743 places, 675 transitions, 1627 flow [2020-10-09 15:41:07,720 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=739, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1627, PETRI_PLACES=743, PETRI_TRANSITIONS=675} [2020-10-09 15:41:07,720 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 51 predicate places. [2020-10-09 15:41:07,721 INFO L481 AbstractCegarLoop]: Abstraction has has 743 places, 675 transitions, 1627 flow [2020-10-09 15:41:07,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:07,721 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:07,721 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:07,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1093 mathsat -unsat_core_generation=3 [2020-10-09 15:41:07,921 INFO L429 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:07,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:07,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1156602388, now seen corresponding path program 1 times [2020-10-09 15:41:07,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:07,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596609675] [2020-10-09 15:41:07,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1094 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1094 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:08,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:08,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:41:08,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:41:08,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596609675] [2020-10-09 15:41:08,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:08,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:08,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448759261] [2020-10-09 15:41:08,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:08,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:08,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:08,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:08,559 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:08,560 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 743 places, 675 transitions, 1627 flow. Second operand 3 states. [2020-10-09 15:41:08,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:08,561 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:08,561 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:08,848 INFO L129 PetriNetUnfolder]: 40/799 cut-off events. [2020-10-09 15:41:08,848 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:41:08,899 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 799 events. 40/799 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3442 event pairs, 0 based on Foata normal form. 0/731 useless extension candidates. Maximal degree in co-relation 969. Up to 28 conditions per place. [2020-10-09 15:41:08,905 INFO L132 encePairwiseOnDemand]: 742/746 looper letters, 9 selfloop transitions, 3 changer transitions 0/676 dead transitions. [2020-10-09 15:41:08,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 745 places, 676 transitions, 1653 flow [2020-10-09 15:41:08,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2131 transitions. [2020-10-09 15:41:08,907 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9521894548704201 [2020-10-09 15:41:08,907 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2131 transitions. [2020-10-09 15:41:08,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2131 transitions. [2020-10-09 15:41:08,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:08,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2131 transitions. [2020-10-09 15:41:08,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:08,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:08,909 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:08,909 INFO L185 Difference]: Start difference. First operand has 743 places, 675 transitions, 1627 flow. Second operand 3 states and 2131 transitions. [2020-10-09 15:41:08,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 745 places, 676 transitions, 1653 flow [2020-10-09 15:41:08,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 744 places, 676 transitions, 1651 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:08,916 INFO L241 Difference]: Finished difference. Result has 746 places, 676 transitions, 1643 flow [2020-10-09 15:41:08,916 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1625, PETRI_DIFFERENCE_MINUEND_PLACES=742, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=746, PETRI_TRANSITIONS=676} [2020-10-09 15:41:08,916 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 54 predicate places. [2020-10-09 15:41:08,916 INFO L481 AbstractCegarLoop]: Abstraction has has 746 places, 676 transitions, 1643 flow [2020-10-09 15:41:08,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:08,916 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:08,916 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:09,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1094 mathsat -unsat_core_generation=3 [2020-10-09 15:41:09,117 INFO L429 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:09,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:09,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1157556723, now seen corresponding path program 1 times [2020-10-09 15:41:09,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:09,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631170908] [2020-10-09 15:41:09,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1095 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1095 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:09,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:09,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:41:09,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:09,726 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:41:09,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631170908] [2020-10-09 15:41:09,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:09,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:09,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731163149] [2020-10-09 15:41:09,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:09,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:09,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:09,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:09,755 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:09,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 746 places, 676 transitions, 1643 flow. Second operand 3 states. [2020-10-09 15:41:09,757 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:09,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:09,757 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:10,046 INFO L129 PetriNetUnfolder]: 39/796 cut-off events. [2020-10-09 15:41:10,047 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-10-09 15:41:10,100 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 796 events. 39/796 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3428 event pairs, 0 based on Foata normal form. 2/732 useless extension candidates. Maximal degree in co-relation 968. Up to 28 conditions per place. [2020-10-09 15:41:10,105 INFO L132 encePairwiseOnDemand]: 743/746 looper letters, 9 selfloop transitions, 1 changer transitions 0/674 dead transitions. [2020-10-09 15:41:10,106 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 748 places, 674 transitions, 1651 flow [2020-10-09 15:41:10,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2130 transitions. [2020-10-09 15:41:10,107 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9517426273458445 [2020-10-09 15:41:10,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2130 transitions. [2020-10-09 15:41:10,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2130 transitions. [2020-10-09 15:41:10,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:10,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2130 transitions. [2020-10-09 15:41:10,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:10,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:10,109 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:10,109 INFO L185 Difference]: Start difference. First operand has 746 places, 676 transitions, 1643 flow. Second operand 3 states and 2130 transitions. [2020-10-09 15:41:10,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 748 places, 674 transitions, 1651 flow [2020-10-09 15:41:10,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 747 places, 674 transitions, 1650 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:10,117 INFO L241 Difference]: Finished difference. Result has 747 places, 674 transitions, 1632 flow [2020-10-09 15:41:10,117 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=745, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1632, PETRI_PLACES=747, PETRI_TRANSITIONS=674} [2020-10-09 15:41:10,117 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 55 predicate places. [2020-10-09 15:41:10,117 INFO L481 AbstractCegarLoop]: Abstraction has has 747 places, 674 transitions, 1632 flow [2020-10-09 15:41:10,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:10,117 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:10,117 INFO L255 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:10,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1095 mathsat -unsat_core_generation=3 [2020-10-09 15:41:10,318 INFO L429 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:10,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:10,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1157555700, now seen corresponding path program 1 times [2020-10-09 15:41:10,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:10,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876238220] [2020-10-09 15:41:10,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1096 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1096 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:10,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:41:10,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:41:10,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-09 15:41:10,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876238220] [2020-10-09 15:41:10,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:10,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:10,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555839719] [2020-10-09 15:41:10,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:10,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:10,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:10,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:10,943 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:41:10,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 747 places, 674 transitions, 1632 flow. Second operand 3 states. [2020-10-09 15:41:10,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:10,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:41:10,944 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:11,227 INFO L129 PetriNetUnfolder]: 39/793 cut-off events. [2020-10-09 15:41:11,227 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:41:11,277 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 793 events. 39/793 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3402 event pairs, 0 based on Foata normal form. 1/729 useless extension candidates. Maximal degree in co-relation 962. Up to 28 conditions per place. [2020-10-09 15:41:11,283 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/671 dead transitions. [2020-10-09 15:41:11,283 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 747 places, 671 transitions, 1631 flow [2020-10-09 15:41:11,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:11,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:41:11,285 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:41:11,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:41:11,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:41:11,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:11,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:41:11,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:11,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:11,287 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:11,287 INFO L185 Difference]: Start difference. First operand has 747 places, 674 transitions, 1632 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:41:11,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 747 places, 671 transitions, 1631 flow [2020-10-09 15:41:11,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 744 places, 671 transitions, 1626 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:41:11,294 INFO L241 Difference]: Finished difference. Result has 744 places, 671 transitions, 1618 flow [2020-10-09 15:41:11,294 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1616, PETRI_DIFFERENCE_MINUEND_PLACES=742, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1618, PETRI_PLACES=744, PETRI_TRANSITIONS=671} [2020-10-09 15:41:11,294 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 52 predicate places. [2020-10-09 15:41:11,294 INFO L481 AbstractCegarLoop]: Abstraction has has 744 places, 671 transitions, 1618 flow [2020-10-09 15:41:11,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:11,295 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:11,295 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:11,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1096 mathsat -unsat_core_generation=3 [2020-10-09 15:41:11,495 INFO L429 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:11,496 INFO L82 PathProgramCache]: Analyzing trace with hash -755253542, now seen corresponding path program 1 times [2020-10-09 15:41:11,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:11,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580218220] [2020-10-09 15:41:11,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1097 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1097 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:12,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:12,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:41:12,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:12,109 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:41:12,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580218220] [2020-10-09 15:41:12,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:12,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:12,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394351899] [2020-10-09 15:41:12,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:12,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:12,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:12,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:12,137 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:12,138 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 744 places, 671 transitions, 1618 flow. Second operand 3 states. [2020-10-09 15:41:12,138 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:12,138 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:12,138 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:12,428 INFO L129 PetriNetUnfolder]: 38/801 cut-off events. [2020-10-09 15:41:12,428 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:41:12,478 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 801 events. 38/801 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3473 event pairs, 0 based on Foata normal form. 0/734 useless extension candidates. Maximal degree in co-relation 979. Up to 28 conditions per place. [2020-10-09 15:41:12,484 INFO L132 encePairwiseOnDemand]: 741/746 looper letters, 10 selfloop transitions, 3 changer transitions 0/673 dead transitions. [2020-10-09 15:41:12,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 746 places, 673 transitions, 1648 flow [2020-10-09 15:41:12,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2133 transitions. [2020-10-09 15:41:12,486 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.953083109919571 [2020-10-09 15:41:12,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2133 transitions. [2020-10-09 15:41:12,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2133 transitions. [2020-10-09 15:41:12,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:12,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2133 transitions. [2020-10-09 15:41:12,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:12,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:12,489 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:12,489 INFO L185 Difference]: Start difference. First operand has 744 places, 671 transitions, 1618 flow. Second operand 3 states and 2133 transitions. [2020-10-09 15:41:12,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 746 places, 673 transitions, 1648 flow [2020-10-09 15:41:12,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 745 places, 673 transitions, 1647 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:12,496 INFO L241 Difference]: Finished difference. Result has 747 places, 673 transitions, 1641 flow [2020-10-09 15:41:12,496 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1617, PETRI_DIFFERENCE_MINUEND_PLACES=743, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1641, PETRI_PLACES=747, PETRI_TRANSITIONS=673} [2020-10-09 15:41:12,496 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 55 predicate places. [2020-10-09 15:41:12,496 INFO L481 AbstractCegarLoop]: Abstraction has has 747 places, 673 transitions, 1641 flow [2020-10-09 15:41:12,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:12,496 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:12,497 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:12,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1097 mathsat -unsat_core_generation=3 [2020-10-09 15:41:12,697 INFO L429 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:12,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:12,698 INFO L82 PathProgramCache]: Analyzing trace with hash -755254565, now seen corresponding path program 1 times [2020-10-09 15:41:12,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:12,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307446143] [2020-10-09 15:41:12,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1098 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1098 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:13,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:41:13,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:41:13,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:41:13,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307446143] [2020-10-09 15:41:13,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:13,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:13,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104441979] [2020-10-09 15:41:13,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:13,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:13,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:13,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:13,402 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:41:13,403 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 747 places, 673 transitions, 1641 flow. Second operand 3 states. [2020-10-09 15:41:13,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:13,404 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:41:13,404 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:13,695 INFO L129 PetriNetUnfolder]: 36/802 cut-off events. [2020-10-09 15:41:13,695 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:41:13,747 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 802 events. 36/802 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3492 event pairs, 0 based on Foata normal form. 1/741 useless extension candidates. Maximal degree in co-relation 975. Up to 28 conditions per place. [2020-10-09 15:41:13,753 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/672 dead transitions. [2020-10-09 15:41:13,753 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 749 places, 672 transitions, 1647 flow [2020-10-09 15:41:13,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:41:13,754 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:41:13,754 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:41:13,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:41:13,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:13,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:41:13,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:13,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:13,756 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:13,757 INFO L185 Difference]: Start difference. First operand has 747 places, 673 transitions, 1641 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:41:13,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 749 places, 672 transitions, 1647 flow [2020-10-09 15:41:13,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 748 places, 672 transitions, 1642 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:13,763 INFO L241 Difference]: Finished difference. Result has 749 places, 672 transitions, 1637 flow [2020-10-09 15:41:13,764 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1632, PETRI_DIFFERENCE_MINUEND_PLACES=746, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1637, PETRI_PLACES=749, PETRI_TRANSITIONS=672} [2020-10-09 15:41:13,764 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 57 predicate places. [2020-10-09 15:41:13,764 INFO L481 AbstractCegarLoop]: Abstraction has has 749 places, 672 transitions, 1637 flow [2020-10-09 15:41:13,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:13,764 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:13,764 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:13,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1098 mathsat -unsat_core_generation=3 [2020-10-09 15:41:13,965 INFO L429 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:13,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:13,965 INFO L82 PathProgramCache]: Analyzing trace with hash -756206854, now seen corresponding path program 1 times [2020-10-09 15:41:13,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:13,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804329932] [2020-10-09 15:41:13,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1099 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1099 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:14,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:14,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:41:14,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:41:14,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804329932] [2020-10-09 15:41:14,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:14,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:14,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81223463] [2020-10-09 15:41:14,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:14,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:14,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:14,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:14,597 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:41:14,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 749 places, 672 transitions, 1637 flow. Second operand 3 states. [2020-10-09 15:41:14,599 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:14,599 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:41:14,599 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:14,890 INFO L129 PetriNetUnfolder]: 36/795 cut-off events. [2020-10-09 15:41:14,890 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:41:14,942 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 795 events. 36/795 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3436 event pairs, 0 based on Foata normal form. 1/734 useless extension candidates. Maximal degree in co-relation 971. Up to 28 conditions per place. [2020-10-09 15:41:14,948 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 5 selfloop transitions, 1 changer transitions 0/670 dead transitions. [2020-10-09 15:41:14,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 751 places, 670 transitions, 1640 flow [2020-10-09 15:41:14,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:14,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:14,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2020-10-09 15:41:14,949 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9562109025915997 [2020-10-09 15:41:14,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2020-10-09 15:41:14,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2020-10-09 15:41:14,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:14,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2020-10-09 15:41:14,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:14,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:14,951 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:14,952 INFO L185 Difference]: Start difference. First operand has 749 places, 672 transitions, 1637 flow. Second operand 3 states and 2140 transitions. [2020-10-09 15:41:14,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 751 places, 670 transitions, 1640 flow [2020-10-09 15:41:14,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 748 places, 670 transitions, 1633 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:41:14,959 INFO L241 Difference]: Finished difference. Result has 749 places, 670 transitions, 1626 flow [2020-10-09 15:41:14,959 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1621, PETRI_DIFFERENCE_MINUEND_PLACES=746, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1626, PETRI_PLACES=749, PETRI_TRANSITIONS=670} [2020-10-09 15:41:14,959 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 57 predicate places. [2020-10-09 15:41:14,960 INFO L481 AbstractCegarLoop]: Abstraction has has 749 places, 670 transitions, 1626 flow [2020-10-09 15:41:14,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:14,960 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:14,960 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:15,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1099 mathsat -unsat_core_generation=3 [2020-10-09 15:41:15,160 INFO L429 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:15,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:15,161 INFO L82 PathProgramCache]: Analyzing trace with hash -756207877, now seen corresponding path program 1 times [2020-10-09 15:41:15,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:15,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121553315] [2020-10-09 15:41:15,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1100 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1100 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:15,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:15,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:41:15,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:15,778 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-09 15:41:15,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121553315] [2020-10-09 15:41:15,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:15,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:15,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102814190] [2020-10-09 15:41:15,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:15,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:15,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:15,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:15,814 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:15,816 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 749 places, 670 transitions, 1626 flow. Second operand 3 states. [2020-10-09 15:41:15,816 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:15,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:15,816 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:16,104 INFO L129 PetriNetUnfolder]: 36/793 cut-off events. [2020-10-09 15:41:16,104 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:41:16,154 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 793 events. 36/793 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3420 event pairs, 0 based on Foata normal form. 0/730 useless extension candidates. Maximal degree in co-relation 971. Up to 28 conditions per place. [2020-10-09 15:41:16,159 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 8 selfloop transitions, 1 changer transitions 0/668 dead transitions. [2020-10-09 15:41:16,160 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 749 places, 668 transitions, 1639 flow [2020-10-09 15:41:16,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:16,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2128 transitions. [2020-10-09 15:41:16,161 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508489722966935 [2020-10-09 15:41:16,161 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2128 transitions. [2020-10-09 15:41:16,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2128 transitions. [2020-10-09 15:41:16,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:16,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2128 transitions. [2020-10-09 15:41:16,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:16,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:16,163 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:16,163 INFO L185 Difference]: Start difference. First operand has 749 places, 670 transitions, 1626 flow. Second operand 3 states and 2128 transitions. [2020-10-09 15:41:16,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 749 places, 668 transitions, 1639 flow [2020-10-09 15:41:16,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 748 places, 668 transitions, 1638 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:16,170 INFO L241 Difference]: Finished difference. Result has 748 places, 668 transitions, 1622 flow [2020-10-09 15:41:16,171 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=746, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1622, PETRI_PLACES=748, PETRI_TRANSITIONS=668} [2020-10-09 15:41:16,171 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 56 predicate places. [2020-10-09 15:41:16,171 INFO L481 AbstractCegarLoop]: Abstraction has has 748 places, 668 transitions, 1622 flow [2020-10-09 15:41:16,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:16,171 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:16,171 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:16,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1100 mathsat -unsat_core_generation=3 [2020-10-09 15:41:16,372 INFO L429 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:16,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1764585571, now seen corresponding path program 1 times [2020-10-09 15:41:16,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:16,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828889419] [2020-10-09 15:41:16,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1101 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1101 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:16,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:16,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:41:16,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:41:16,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828889419] [2020-10-09 15:41:16,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:16,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:16,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333998534] [2020-10-09 15:41:16,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:16,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:16,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:16,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:17,007 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:17,008 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 748 places, 668 transitions, 1622 flow. Second operand 3 states. [2020-10-09 15:41:17,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:17,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:17,008 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:17,301 INFO L129 PetriNetUnfolder]: 35/801 cut-off events. [2020-10-09 15:41:17,301 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:41:17,352 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 801 events. 35/801 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3489 event pairs, 0 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 983. Up to 28 conditions per place. [2020-10-09 15:41:17,358 INFO L132 encePairwiseOnDemand]: 741/746 looper letters, 10 selfloop transitions, 3 changer transitions 0/670 dead transitions. [2020-10-09 15:41:17,358 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 750 places, 670 transitions, 1652 flow [2020-10-09 15:41:17,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:17,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:17,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2133 transitions. [2020-10-09 15:41:17,359 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.953083109919571 [2020-10-09 15:41:17,359 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2133 transitions. [2020-10-09 15:41:17,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2133 transitions. [2020-10-09 15:41:17,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:17,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2133 transitions. [2020-10-09 15:41:17,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:17,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:17,361 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:17,362 INFO L185 Difference]: Start difference. First operand has 748 places, 668 transitions, 1622 flow. Second operand 3 states and 2133 transitions. [2020-10-09 15:41:17,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 750 places, 670 transitions, 1652 flow [2020-10-09 15:41:17,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 749 places, 670 transitions, 1651 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:17,369 INFO L241 Difference]: Finished difference. Result has 751 places, 670 transitions, 1645 flow [2020-10-09 15:41:17,369 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1621, PETRI_DIFFERENCE_MINUEND_PLACES=747, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1645, PETRI_PLACES=751, PETRI_TRANSITIONS=670} [2020-10-09 15:41:17,369 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 59 predicate places. [2020-10-09 15:41:17,369 INFO L481 AbstractCegarLoop]: Abstraction has has 751 places, 670 transitions, 1645 flow [2020-10-09 15:41:17,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:17,369 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:17,369 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:17,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1101 mathsat -unsat_core_generation=3 [2020-10-09 15:41:17,570 INFO L429 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:17,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:17,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1764586594, now seen corresponding path program 1 times [2020-10-09 15:41:17,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:17,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694701472] [2020-10-09 15:41:17,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1102 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1102 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:18,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:18,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:18,180 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:41:18,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:41:18,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694701472] [2020-10-09 15:41:18,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:18,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:18,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816558381] [2020-10-09 15:41:18,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:18,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:18,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:18,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:18,199 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:41:18,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 751 places, 670 transitions, 1645 flow. Second operand 3 states. [2020-10-09 15:41:18,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:18,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:41:18,200 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:18,486 INFO L129 PetriNetUnfolder]: 34/799 cut-off events. [2020-10-09 15:41:18,486 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:41:18,536 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 799 events. 34/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3476 event pairs, 0 based on Foata normal form. 0/739 useless extension candidates. Maximal degree in co-relation 980. Up to 28 conditions per place. [2020-10-09 15:41:18,542 INFO L132 encePairwiseOnDemand]: 743/746 looper letters, 5 selfloop transitions, 2 changer transitions 0/670 dead transitions. [2020-10-09 15:41:18,542 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 753 places, 670 transitions, 1657 flow [2020-10-09 15:41:18,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2141 transitions. [2020-10-09 15:41:18,543 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566577301161752 [2020-10-09 15:41:18,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2141 transitions. [2020-10-09 15:41:18,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2141 transitions. [2020-10-09 15:41:18,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:18,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2141 transitions. [2020-10-09 15:41:18,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:18,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:18,545 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:18,545 INFO L185 Difference]: Start difference. First operand has 751 places, 670 transitions, 1645 flow. Second operand 3 states and 2141 transitions. [2020-10-09 15:41:18,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 753 places, 670 transitions, 1657 flow [2020-10-09 15:41:18,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 752 places, 670 transitions, 1652 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:18,553 INFO L241 Difference]: Finished difference. Result has 754 places, 670 transitions, 1650 flow [2020-10-09 15:41:18,553 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1636, PETRI_DIFFERENCE_MINUEND_PLACES=750, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1650, PETRI_PLACES=754, PETRI_TRANSITIONS=670} [2020-10-09 15:41:18,553 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 62 predicate places. [2020-10-09 15:41:18,553 INFO L481 AbstractCegarLoop]: Abstraction has has 754 places, 670 transitions, 1650 flow [2020-10-09 15:41:18,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:18,553 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:18,553 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:18,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1102 mathsat -unsat_core_generation=3 [2020-10-09 15:41:18,754 INFO L429 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:18,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:18,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1765538883, now seen corresponding path program 1 times [2020-10-09 15:41:18,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:18,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642562482] [2020-10-09 15:41:18,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1103 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1103 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:19,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:41:19,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:41:19,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:19,373 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:41:19,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642562482] [2020-10-09 15:41:19,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:19,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:19,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611746656] [2020-10-09 15:41:19,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:19,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:19,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:19,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:19,395 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:41:19,396 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 754 places, 670 transitions, 1650 flow. Second operand 3 states. [2020-10-09 15:41:19,396 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:19,396 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:41:19,396 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:19,681 INFO L129 PetriNetUnfolder]: 33/795 cut-off events. [2020-10-09 15:41:19,681 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-10-09 15:41:19,732 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 795 events. 33/795 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3454 event pairs, 0 based on Foata normal form. 1/737 useless extension candidates. Maximal degree in co-relation 976. Up to 28 conditions per place. [2020-10-09 15:41:19,737 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/667 dead transitions. [2020-10-09 15:41:19,737 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 756 places, 667 transitions, 1645 flow [2020-10-09 15:41:19,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:19,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:41:19,738 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:41:19,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:41:19,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:41:19,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:19,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:41:19,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:19,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:19,742 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:19,742 INFO L185 Difference]: Start difference. First operand has 754 places, 670 transitions, 1650 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:41:19,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 756 places, 667 transitions, 1645 flow [2020-10-09 15:41:19,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 753 places, 667 transitions, 1638 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:41:19,752 INFO L241 Difference]: Finished difference. Result has 753 places, 667 transitions, 1630 flow [2020-10-09 15:41:19,753 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=751, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1630, PETRI_PLACES=753, PETRI_TRANSITIONS=667} [2020-10-09 15:41:19,753 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 61 predicate places. [2020-10-09 15:41:19,753 INFO L481 AbstractCegarLoop]: Abstraction has has 753 places, 667 transitions, 1630 flow [2020-10-09 15:41:19,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:19,753 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:19,753 INFO L255 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:19,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1103 mathsat -unsat_core_generation=3 [2020-10-09 15:41:19,967 INFO L429 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:19,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:19,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1765539906, now seen corresponding path program 1 times [2020-10-09 15:41:19,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:19,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108818227] [2020-10-09 15:41:19,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1104 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1104 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:20,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:20,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:41:20,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-09 15:41:20,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108818227] [2020-10-09 15:41:20,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:20,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:20,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959809899] [2020-10-09 15:41:20,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:20,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:20,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:20,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:20,615 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:20,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 753 places, 667 transitions, 1630 flow. Second operand 3 states. [2020-10-09 15:41:20,617 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:20,617 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:20,617 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:20,898 INFO L129 PetriNetUnfolder]: 33/793 cut-off events. [2020-10-09 15:41:20,899 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:41:20,948 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 793 events. 33/793 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3436 event pairs, 0 based on Foata normal form. 0/733 useless extension candidates. Maximal degree in co-relation 978. Up to 28 conditions per place. [2020-10-09 15:41:20,953 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 8 selfloop transitions, 1 changer transitions 0/665 dead transitions. [2020-10-09 15:41:20,953 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 753 places, 665 transitions, 1643 flow [2020-10-09 15:41:20,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:20,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2128 transitions. [2020-10-09 15:41:20,955 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508489722966935 [2020-10-09 15:41:20,955 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2128 transitions. [2020-10-09 15:41:20,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2128 transitions. [2020-10-09 15:41:20,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:20,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2128 transitions. [2020-10-09 15:41:20,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:20,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:20,957 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:20,957 INFO L185 Difference]: Start difference. First operand has 753 places, 667 transitions, 1630 flow. Second operand 3 states and 2128 transitions. [2020-10-09 15:41:20,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 753 places, 665 transitions, 1643 flow [2020-10-09 15:41:20,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 752 places, 665 transitions, 1642 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:20,964 INFO L241 Difference]: Finished difference. Result has 752 places, 665 transitions, 1626 flow [2020-10-09 15:41:20,964 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=750, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1626, PETRI_PLACES=752, PETRI_TRANSITIONS=665} [2020-10-09 15:41:20,965 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 60 predicate places. [2020-10-09 15:41:20,965 INFO L481 AbstractCegarLoop]: Abstraction has has 752 places, 665 transitions, 1626 flow [2020-10-09 15:41:20,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:20,965 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:20,965 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:21,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1104 mathsat -unsat_core_generation=3 [2020-10-09 15:41:21,166 INFO L429 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:21,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:21,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2771541, now seen corresponding path program 1 times [2020-10-09 15:41:21,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:21,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153890183] [2020-10-09 15:41:21,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1105 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1105 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:21,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:21,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:41:21,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:41:21,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153890183] [2020-10-09 15:41:21,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:21,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:21,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015521245] [2020-10-09 15:41:21,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:21,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:21,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:21,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:21,817 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:21,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 752 places, 665 transitions, 1626 flow. Second operand 3 states. [2020-10-09 15:41:21,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:21,818 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:21,818 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:22,140 INFO L129 PetriNetUnfolder]: 32/801 cut-off events. [2020-10-09 15:41:22,140 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:41:22,186 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1053 conditions, 801 events. 32/801 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3506 event pairs, 0 based on Foata normal form. 0/741 useless extension candidates. Maximal degree in co-relation 990. Up to 28 conditions per place. [2020-10-09 15:41:22,191 INFO L132 encePairwiseOnDemand]: 741/746 looper letters, 10 selfloop transitions, 3 changer transitions 0/667 dead transitions. [2020-10-09 15:41:22,191 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 754 places, 667 transitions, 1656 flow [2020-10-09 15:41:22,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:22,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2133 transitions. [2020-10-09 15:41:22,193 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.953083109919571 [2020-10-09 15:41:22,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2133 transitions. [2020-10-09 15:41:22,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2133 transitions. [2020-10-09 15:41:22,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:22,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2133 transitions. [2020-10-09 15:41:22,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:22,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:22,195 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:22,195 INFO L185 Difference]: Start difference. First operand has 752 places, 665 transitions, 1626 flow. Second operand 3 states and 2133 transitions. [2020-10-09 15:41:22,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 754 places, 667 transitions, 1656 flow [2020-10-09 15:41:22,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 753 places, 667 transitions, 1655 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:22,202 INFO L241 Difference]: Finished difference. Result has 755 places, 667 transitions, 1649 flow [2020-10-09 15:41:22,202 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1625, PETRI_DIFFERENCE_MINUEND_PLACES=751, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1649, PETRI_PLACES=755, PETRI_TRANSITIONS=667} [2020-10-09 15:41:22,202 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 63 predicate places. [2020-10-09 15:41:22,202 INFO L481 AbstractCegarLoop]: Abstraction has has 755 places, 667 transitions, 1649 flow [2020-10-09 15:41:22,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:22,202 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:22,202 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:22,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1105 mathsat -unsat_core_generation=3 [2020-10-09 15:41:22,403 INFO L429 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:22,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:22,404 INFO L82 PathProgramCache]: Analyzing trace with hash -2772564, now seen corresponding path program 1 times [2020-10-09 15:41:22,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:22,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31038310] [2020-10-09 15:41:22,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1106 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1106 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:23,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:41:23,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:41:23,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:41:23,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31038310] [2020-10-09 15:41:23,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:23,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:23,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798939762] [2020-10-09 15:41:23,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:23,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:23,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:23,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:23,051 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:41:23,052 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 755 places, 667 transitions, 1649 flow. Second operand 3 states. [2020-10-09 15:41:23,052 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:23,052 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:41:23,052 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:23,363 INFO L129 PetriNetUnfolder]: 30/802 cut-off events. [2020-10-09 15:41:23,363 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:41:23,418 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 802 events. 30/802 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3524 event pairs, 0 based on Foata normal form. 1/747 useless extension candidates. Maximal degree in co-relation 988. Up to 28 conditions per place. [2020-10-09 15:41:23,423 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/666 dead transitions. [2020-10-09 15:41:23,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 666 transitions, 1655 flow [2020-10-09 15:41:23,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:23,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:41:23,425 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:41:23,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:41:23,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:41:23,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:23,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:41:23,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:23,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:23,427 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:23,427 INFO L185 Difference]: Start difference. First operand has 755 places, 667 transitions, 1649 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:41:23,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 757 places, 666 transitions, 1655 flow [2020-10-09 15:41:23,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 756 places, 666 transitions, 1650 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:23,434 INFO L241 Difference]: Finished difference. Result has 757 places, 666 transitions, 1645 flow [2020-10-09 15:41:23,435 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=754, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1645, PETRI_PLACES=757, PETRI_TRANSITIONS=666} [2020-10-09 15:41:23,435 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 65 predicate places. [2020-10-09 15:41:23,435 INFO L481 AbstractCegarLoop]: Abstraction has has 757 places, 666 transitions, 1645 flow [2020-10-09 15:41:23,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:23,435 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:23,435 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:23,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1106 mathsat -unsat_core_generation=3 [2020-10-09 15:41:23,636 INFO L429 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:23,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:23,636 INFO L82 PathProgramCache]: Analyzing trace with hash -3724853, now seen corresponding path program 1 times [2020-10-09 15:41:23,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:23,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582486950] [2020-10-09 15:41:23,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1107 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1107 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:24,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:24,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:24,256 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:41:24,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:41:24,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582486950] [2020-10-09 15:41:24,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:24,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:24,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541176224] [2020-10-09 15:41:24,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:24,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:24,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:24,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:24,272 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:41:24,273 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 757 places, 666 transitions, 1645 flow. Second operand 3 states. [2020-10-09 15:41:24,273 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:24,273 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:41:24,273 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:24,569 INFO L129 PetriNetUnfolder]: 30/795 cut-off events. [2020-10-09 15:41:24,570 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:41:24,622 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 795 events. 30/795 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3469 event pairs, 0 based on Foata normal form. 1/740 useless extension candidates. Maximal degree in co-relation 984. Up to 28 conditions per place. [2020-10-09 15:41:24,626 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 5 selfloop transitions, 1 changer transitions 0/664 dead transitions. [2020-10-09 15:41:24,626 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 759 places, 664 transitions, 1648 flow [2020-10-09 15:41:24,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2020-10-09 15:41:24,628 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9562109025915997 [2020-10-09 15:41:24,628 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2020-10-09 15:41:24,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2020-10-09 15:41:24,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:24,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2020-10-09 15:41:24,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:24,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:24,630 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:24,630 INFO L185 Difference]: Start difference. First operand has 757 places, 666 transitions, 1645 flow. Second operand 3 states and 2140 transitions. [2020-10-09 15:41:24,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 759 places, 664 transitions, 1648 flow [2020-10-09 15:41:24,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 756 places, 664 transitions, 1641 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:41:24,638 INFO L241 Difference]: Finished difference. Result has 757 places, 664 transitions, 1634 flow [2020-10-09 15:41:24,638 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=754, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1634, PETRI_PLACES=757, PETRI_TRANSITIONS=664} [2020-10-09 15:41:24,638 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 65 predicate places. [2020-10-09 15:41:24,638 INFO L481 AbstractCegarLoop]: Abstraction has has 757 places, 664 transitions, 1634 flow [2020-10-09 15:41:24,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:24,638 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:24,638 INFO L255 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:24,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1107 mathsat -unsat_core_generation=3 [2020-10-09 15:41:24,839 INFO L429 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:24,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:24,840 INFO L82 PathProgramCache]: Analyzing trace with hash -3725876, now seen corresponding path program 1 times [2020-10-09 15:41:24,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:24,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108766371] [2020-10-09 15:41:24,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1108 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1108 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:25,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:25,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:41:25,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:25,455 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-09 15:41:25,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108766371] [2020-10-09 15:41:25,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:25,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:25,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699927650] [2020-10-09 15:41:25,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:25,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:25,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:25,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:25,492 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:25,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 757 places, 664 transitions, 1634 flow. Second operand 3 states. [2020-10-09 15:41:25,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:25,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:25,493 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:25,780 INFO L129 PetriNetUnfolder]: 30/793 cut-off events. [2020-10-09 15:41:25,780 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:41:25,830 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 793 events. 30/793 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3453 event pairs, 0 based on Foata normal form. 0/736 useless extension candidates. Maximal degree in co-relation 984. Up to 28 conditions per place. [2020-10-09 15:41:25,835 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 8 selfloop transitions, 1 changer transitions 0/662 dead transitions. [2020-10-09 15:41:25,835 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 662 transitions, 1647 flow [2020-10-09 15:41:25,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:25,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2128 transitions. [2020-10-09 15:41:25,836 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508489722966935 [2020-10-09 15:41:25,836 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2128 transitions. [2020-10-09 15:41:25,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2128 transitions. [2020-10-09 15:41:25,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:25,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2128 transitions. [2020-10-09 15:41:25,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:25,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:25,839 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:25,839 INFO L185 Difference]: Start difference. First operand has 757 places, 664 transitions, 1634 flow. Second operand 3 states and 2128 transitions. [2020-10-09 15:41:25,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 757 places, 662 transitions, 1647 flow [2020-10-09 15:41:25,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 756 places, 662 transitions, 1646 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:25,846 INFO L241 Difference]: Finished difference. Result has 756 places, 662 transitions, 1630 flow [2020-10-09 15:41:25,846 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=754, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1630, PETRI_PLACES=756, PETRI_TRANSITIONS=662} [2020-10-09 15:41:25,846 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 64 predicate places. [2020-10-09 15:41:25,846 INFO L481 AbstractCegarLoop]: Abstraction has has 756 places, 662 transitions, 1630 flow [2020-10-09 15:41:25,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:25,846 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:25,846 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:26,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1108 mathsat -unsat_core_generation=3 [2020-10-09 15:41:26,047 INFO L429 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:26,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:26,047 INFO L82 PathProgramCache]: Analyzing trace with hash 971223221, now seen corresponding path program 1 times [2020-10-09 15:41:26,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:26,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264149734] [2020-10-09 15:41:26,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1109 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1109 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:26,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:26,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:41:26,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:26,663 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:41:26,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264149734] [2020-10-09 15:41:26,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:26,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:26,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599123624] [2020-10-09 15:41:26,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:26,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:26,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:26,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:26,682 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:41:26,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 756 places, 662 transitions, 1630 flow. Second operand 3 states. [2020-10-09 15:41:26,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:26,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:41:26,684 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:26,973 INFO L129 PetriNetUnfolder]: 28/798 cut-off events. [2020-10-09 15:41:26,973 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:41:27,024 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 798 events. 28/798 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3506 event pairs, 0 based on Foata normal form. 0/742 useless extension candidates. Maximal degree in co-relation 987. Up to 28 conditions per place. [2020-10-09 15:41:27,028 INFO L132 encePairwiseOnDemand]: 743/746 looper letters, 5 selfloop transitions, 2 changer transitions 0/663 dead transitions. [2020-10-09 15:41:27,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 758 places, 663 transitions, 1646 flow [2020-10-09 15:41:27,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2141 transitions. [2020-10-09 15:41:27,030 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566577301161752 [2020-10-09 15:41:27,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2141 transitions. [2020-10-09 15:41:27,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2141 transitions. [2020-10-09 15:41:27,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:27,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2141 transitions. [2020-10-09 15:41:27,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:27,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:27,032 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:27,032 INFO L185 Difference]: Start difference. First operand has 756 places, 662 transitions, 1630 flow. Second operand 3 states and 2141 transitions. [2020-10-09 15:41:27,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 758 places, 663 transitions, 1646 flow [2020-10-09 15:41:27,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 757 places, 663 transitions, 1645 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:27,039 INFO L241 Difference]: Finished difference. Result has 759 places, 663 transitions, 1643 flow [2020-10-09 15:41:27,040 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=755, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=660, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=759, PETRI_TRANSITIONS=663} [2020-10-09 15:41:27,040 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 67 predicate places. [2020-10-09 15:41:27,040 INFO L481 AbstractCegarLoop]: Abstraction has has 759 places, 663 transitions, 1643 flow [2020-10-09 15:41:27,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:27,040 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:27,040 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:27,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1109 mathsat -unsat_core_generation=3 [2020-10-09 15:41:27,241 INFO L429 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:27,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:27,241 INFO L82 PathProgramCache]: Analyzing trace with hash 971222198, now seen corresponding path program 1 times [2020-10-09 15:41:27,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:27,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020212321] [2020-10-09 15:41:27,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1110 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1110 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:27,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:27,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:41:27,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:41:27,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020212321] [2020-10-09 15:41:27,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:27,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:27,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844099664] [2020-10-09 15:41:27,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:27,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:27,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:27,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:27,891 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:27,892 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 759 places, 663 transitions, 1643 flow. Second operand 3 states. [2020-10-09 15:41:27,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:27,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:27,893 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:28,187 INFO L129 PetriNetUnfolder]: 28/799 cut-off events. [2020-10-09 15:41:28,188 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:41:28,239 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 799 events. 28/799 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3511 event pairs, 0 based on Foata normal form. 0/743 useless extension candidates. Maximal degree in co-relation 995. Up to 28 conditions per place. [2020-10-09 15:41:28,243 INFO L132 encePairwiseOnDemand]: 742/746 looper letters, 9 selfloop transitions, 3 changer transitions 0/664 dead transitions. [2020-10-09 15:41:28,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 761 places, 664 transitions, 1669 flow [2020-10-09 15:41:28,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2131 transitions. [2020-10-09 15:41:28,245 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9521894548704201 [2020-10-09 15:41:28,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2131 transitions. [2020-10-09 15:41:28,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2131 transitions. [2020-10-09 15:41:28,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:28,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2131 transitions. [2020-10-09 15:41:28,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:28,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:28,247 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:28,247 INFO L185 Difference]: Start difference. First operand has 759 places, 663 transitions, 1643 flow. Second operand 3 states and 2131 transitions. [2020-10-09 15:41:28,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 761 places, 664 transitions, 1669 flow [2020-10-09 15:41:28,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 760 places, 664 transitions, 1667 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:28,254 INFO L241 Difference]: Finished difference. Result has 762 places, 664 transitions, 1659 flow [2020-10-09 15:41:28,254 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=758, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=660, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1659, PETRI_PLACES=762, PETRI_TRANSITIONS=664} [2020-10-09 15:41:28,254 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 70 predicate places. [2020-10-09 15:41:28,254 INFO L481 AbstractCegarLoop]: Abstraction has has 762 places, 664 transitions, 1659 flow [2020-10-09 15:41:28,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:28,255 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:28,255 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:28,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1110 mathsat -unsat_core_generation=3 [2020-10-09 15:41:28,455 INFO L429 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:28,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:28,456 INFO L82 PathProgramCache]: Analyzing trace with hash 972176533, now seen corresponding path program 1 times [2020-10-09 15:41:28,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:28,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622545179] [2020-10-09 15:41:28,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1111 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1111 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:29,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:29,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:41:29,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:41:29,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622545179] [2020-10-09 15:41:29,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:29,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:29,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809492665] [2020-10-09 15:41:29,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:29,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:29,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:29,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:29,104 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:29,105 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 762 places, 664 transitions, 1659 flow. Second operand 3 states. [2020-10-09 15:41:29,105 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:29,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:29,106 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:29,401 INFO L129 PetriNetUnfolder]: 27/796 cut-off events. [2020-10-09 15:41:29,401 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-10-09 15:41:29,452 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 796 events. 27/796 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3495 event pairs, 0 based on Foata normal form. 2/744 useless extension candidates. Maximal degree in co-relation 994. Up to 28 conditions per place. [2020-10-09 15:41:29,457 INFO L132 encePairwiseOnDemand]: 743/746 looper letters, 9 selfloop transitions, 1 changer transitions 0/662 dead transitions. [2020-10-09 15:41:29,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 764 places, 662 transitions, 1667 flow [2020-10-09 15:41:29,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2130 transitions. [2020-10-09 15:41:29,458 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9517426273458445 [2020-10-09 15:41:29,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2130 transitions. [2020-10-09 15:41:29,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2130 transitions. [2020-10-09 15:41:29,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:29,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2130 transitions. [2020-10-09 15:41:29,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:29,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:29,460 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:29,460 INFO L185 Difference]: Start difference. First operand has 762 places, 664 transitions, 1659 flow. Second operand 3 states and 2130 transitions. [2020-10-09 15:41:29,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 764 places, 662 transitions, 1667 flow [2020-10-09 15:41:29,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 763 places, 662 transitions, 1666 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:29,468 INFO L241 Difference]: Finished difference. Result has 763 places, 662 transitions, 1648 flow [2020-10-09 15:41:29,468 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=761, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1648, PETRI_PLACES=763, PETRI_TRANSITIONS=662} [2020-10-09 15:41:29,468 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 71 predicate places. [2020-10-09 15:41:29,468 INFO L481 AbstractCegarLoop]: Abstraction has has 763 places, 662 transitions, 1648 flow [2020-10-09 15:41:29,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:29,468 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:29,468 INFO L255 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:29,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1111 mathsat -unsat_core_generation=3 [2020-10-09 15:41:29,669 INFO L429 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:29,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:29,670 INFO L82 PathProgramCache]: Analyzing trace with hash 972175510, now seen corresponding path program 1 times [2020-10-09 15:41:29,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:29,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761101920] [2020-10-09 15:41:29,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1112 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1112 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:30,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:41:30,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:41:30,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-09 15:41:30,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761101920] [2020-10-09 15:41:30,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:30,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:30,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026141718] [2020-10-09 15:41:30,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:30,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:30,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:30,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:30,306 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:41:30,307 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 763 places, 662 transitions, 1648 flow. Second operand 3 states. [2020-10-09 15:41:30,307 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:30,307 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:41:30,307 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:30,688 INFO L129 PetriNetUnfolder]: 27/793 cut-off events. [2020-10-09 15:41:30,688 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:41:30,718 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 793 events. 27/793 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3471 event pairs, 0 based on Foata normal form. 1/741 useless extension candidates. Maximal degree in co-relation 988. Up to 28 conditions per place. [2020-10-09 15:41:30,722 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/659 dead transitions. [2020-10-09 15:41:30,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 763 places, 659 transitions, 1647 flow [2020-10-09 15:41:30,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:30,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:41:30,723 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:41:30,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:41:30,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:41:30,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:30,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:41:30,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:30,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:30,726 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:30,726 INFO L185 Difference]: Start difference. First operand has 763 places, 662 transitions, 1648 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:41:30,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 763 places, 659 transitions, 1647 flow [2020-10-09 15:41:30,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 760 places, 659 transitions, 1642 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:41:30,732 INFO L241 Difference]: Finished difference. Result has 760 places, 659 transitions, 1634 flow [2020-10-09 15:41:30,732 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1632, PETRI_DIFFERENCE_MINUEND_PLACES=758, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1634, PETRI_PLACES=760, PETRI_TRANSITIONS=659} [2020-10-09 15:41:30,732 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 68 predicate places. [2020-10-09 15:41:30,733 INFO L481 AbstractCegarLoop]: Abstraction has has 760 places, 659 transitions, 1634 flow [2020-10-09 15:41:30,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:30,733 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:30,733 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:30,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1112 mathsat -unsat_core_generation=3 [2020-10-09 15:41:30,934 INFO L429 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:30,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:30,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2060976256, now seen corresponding path program 1 times [2020-10-09 15:41:30,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:30,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363691371] [2020-10-09 15:41:30,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1113 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1113 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:31,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:31,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:41:31,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:41:31,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363691371] [2020-10-09 15:41:31,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:31,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:31,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949747071] [2020-10-09 15:41:31,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:31,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:31,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:31,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:31,584 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:31,586 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 760 places, 659 transitions, 1634 flow. Second operand 3 states. [2020-10-09 15:41:31,586 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:31,586 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:31,586 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:31,905 INFO L129 PetriNetUnfolder]: 26/801 cut-off events. [2020-10-09 15:41:31,906 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:41:31,961 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 801 events. 26/801 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3542 event pairs, 0 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 1005. Up to 28 conditions per place. [2020-10-09 15:41:31,966 INFO L132 encePairwiseOnDemand]: 741/746 looper letters, 10 selfloop transitions, 3 changer transitions 0/661 dead transitions. [2020-10-09 15:41:31,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 762 places, 661 transitions, 1664 flow [2020-10-09 15:41:31,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2133 transitions. [2020-10-09 15:41:31,967 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.953083109919571 [2020-10-09 15:41:31,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2133 transitions. [2020-10-09 15:41:31,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2133 transitions. [2020-10-09 15:41:31,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:31,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2133 transitions. [2020-10-09 15:41:31,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:31,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:31,970 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:31,970 INFO L185 Difference]: Start difference. First operand has 760 places, 659 transitions, 1634 flow. Second operand 3 states and 2133 transitions. [2020-10-09 15:41:31,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 762 places, 661 transitions, 1664 flow [2020-10-09 15:41:31,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 761 places, 661 transitions, 1663 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:31,977 INFO L241 Difference]: Finished difference. Result has 763 places, 661 transitions, 1657 flow [2020-10-09 15:41:31,977 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=759, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1657, PETRI_PLACES=763, PETRI_TRANSITIONS=661} [2020-10-09 15:41:31,978 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 71 predicate places. [2020-10-09 15:41:31,978 INFO L481 AbstractCegarLoop]: Abstraction has has 763 places, 661 transitions, 1657 flow [2020-10-09 15:41:31,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:31,978 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:31,978 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:32,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1113 mathsat -unsat_core_generation=3 [2020-10-09 15:41:32,179 INFO L429 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:32,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:32,179 INFO L82 PathProgramCache]: Analyzing trace with hash 2060975233, now seen corresponding path program 1 times [2020-10-09 15:41:32,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:32,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798110019] [2020-10-09 15:41:32,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1114 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1114 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:32,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:41:32,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:41:32,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:41:32,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798110019] [2020-10-09 15:41:32,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:32,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:32,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475010833] [2020-10-09 15:41:32,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:32,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:32,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:32,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:32,821 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:41:32,822 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 763 places, 661 transitions, 1657 flow. Second operand 3 states. [2020-10-09 15:41:32,823 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:32,823 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:41:32,823 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:33,130 INFO L129 PetriNetUnfolder]: 24/802 cut-off events. [2020-10-09 15:41:33,130 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:41:33,188 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 802 events. 24/802 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3562 event pairs, 0 based on Foata normal form. 1/753 useless extension candidates. Maximal degree in co-relation 1001. Up to 28 conditions per place. [2020-10-09 15:41:33,192 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/660 dead transitions. [2020-10-09 15:41:33,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 765 places, 660 transitions, 1663 flow [2020-10-09 15:41:33,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:33,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:41:33,193 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:41:33,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:41:33,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:41:33,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:33,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:41:33,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:33,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:33,196 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:33,196 INFO L185 Difference]: Start difference. First operand has 763 places, 661 transitions, 1657 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:41:33,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 765 places, 660 transitions, 1663 flow [2020-10-09 15:41:33,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 764 places, 660 transitions, 1658 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:33,203 INFO L241 Difference]: Finished difference. Result has 765 places, 660 transitions, 1653 flow [2020-10-09 15:41:33,204 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1648, PETRI_DIFFERENCE_MINUEND_PLACES=762, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1653, PETRI_PLACES=765, PETRI_TRANSITIONS=660} [2020-10-09 15:41:33,204 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 73 predicate places. [2020-10-09 15:41:33,204 INFO L481 AbstractCegarLoop]: Abstraction has has 765 places, 660 transitions, 1653 flow [2020-10-09 15:41:33,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:33,204 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:33,204 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:33,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1114 mathsat -unsat_core_generation=3 [2020-10-09 15:41:33,405 INFO L429 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:33,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:33,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2060022944, now seen corresponding path program 1 times [2020-10-09 15:41:33,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:33,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047053940] [2020-10-09 15:41:33,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1115 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1115 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:34,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:34,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:41:34,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:41:34,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047053940] [2020-10-09 15:41:34,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:34,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:34,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764273897] [2020-10-09 15:41:34,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:34,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:34,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:34,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:34,040 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:41:34,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 765 places, 660 transitions, 1653 flow. Second operand 3 states. [2020-10-09 15:41:34,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:34,042 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:41:34,042 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:34,342 INFO L129 PetriNetUnfolder]: 24/795 cut-off events. [2020-10-09 15:41:34,342 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:41:34,393 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 795 events. 24/795 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3505 event pairs, 0 based on Foata normal form. 1/746 useless extension candidates. Maximal degree in co-relation 997. Up to 28 conditions per place. [2020-10-09 15:41:34,396 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 5 selfloop transitions, 1 changer transitions 0/658 dead transitions. [2020-10-09 15:41:34,396 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 767 places, 658 transitions, 1656 flow [2020-10-09 15:41:34,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:34,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2020-10-09 15:41:34,398 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9562109025915997 [2020-10-09 15:41:34,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2020-10-09 15:41:34,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2020-10-09 15:41:34,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:34,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2020-10-09 15:41:34,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:34,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:34,400 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:34,400 INFO L185 Difference]: Start difference. First operand has 765 places, 660 transitions, 1653 flow. Second operand 3 states and 2140 transitions. [2020-10-09 15:41:34,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 767 places, 658 transitions, 1656 flow [2020-10-09 15:41:34,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 764 places, 658 transitions, 1649 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:41:34,407 INFO L241 Difference]: Finished difference. Result has 765 places, 658 transitions, 1642 flow [2020-10-09 15:41:34,407 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=762, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1642, PETRI_PLACES=765, PETRI_TRANSITIONS=658} [2020-10-09 15:41:34,408 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 73 predicate places. [2020-10-09 15:41:34,408 INFO L481 AbstractCegarLoop]: Abstraction has has 765 places, 658 transitions, 1642 flow [2020-10-09 15:41:34,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:34,408 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:34,408 INFO L255 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:34,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1115 mathsat -unsat_core_generation=3 [2020-10-09 15:41:34,609 INFO L429 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:34,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:34,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2060021921, now seen corresponding path program 1 times [2020-10-09 15:41:34,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:34,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215847130] [2020-10-09 15:41:34,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1116 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1116 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:35,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:35,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:41:35,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:35,232 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-09 15:41:35,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215847130] [2020-10-09 15:41:35,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:35,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:35,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063848393] [2020-10-09 15:41:35,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:35,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:35,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:35,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:35,269 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:35,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 765 places, 658 transitions, 1642 flow. Second operand 3 states. [2020-10-09 15:41:35,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:35,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:35,270 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:35,564 INFO L129 PetriNetUnfolder]: 24/793 cut-off events. [2020-10-09 15:41:35,564 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:41:35,614 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 793 events. 24/793 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3489 event pairs, 0 based on Foata normal form. 0/742 useless extension candidates. Maximal degree in co-relation 997. Up to 28 conditions per place. [2020-10-09 15:41:35,618 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 8 selfloop transitions, 1 changer transitions 0/656 dead transitions. [2020-10-09 15:41:35,618 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 765 places, 656 transitions, 1655 flow [2020-10-09 15:41:35,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2128 transitions. [2020-10-09 15:41:35,620 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508489722966935 [2020-10-09 15:41:35,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2128 transitions. [2020-10-09 15:41:35,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2128 transitions. [2020-10-09 15:41:35,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:35,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2128 transitions. [2020-10-09 15:41:35,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:35,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:35,622 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:35,622 INFO L185 Difference]: Start difference. First operand has 765 places, 658 transitions, 1642 flow. Second operand 3 states and 2128 transitions. [2020-10-09 15:41:35,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 765 places, 656 transitions, 1655 flow [2020-10-09 15:41:35,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 764 places, 656 transitions, 1654 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:35,629 INFO L241 Difference]: Finished difference. Result has 764 places, 656 transitions, 1638 flow [2020-10-09 15:41:35,629 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1636, PETRI_DIFFERENCE_MINUEND_PLACES=762, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1638, PETRI_PLACES=764, PETRI_TRANSITIONS=656} [2020-10-09 15:41:35,629 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 72 predicate places. [2020-10-09 15:41:35,629 INFO L481 AbstractCegarLoop]: Abstraction has has 764 places, 656 transitions, 1638 flow [2020-10-09 15:41:35,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:35,629 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:35,630 INFO L255 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:35,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1116 mathsat -unsat_core_generation=3 [2020-10-09 15:41:35,830 INFO L429 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:35,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:35,831 INFO L82 PathProgramCache]: Analyzing trace with hash -278422771, now seen corresponding path program 1 times [2020-10-09 15:41:35,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:35,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297218647] [2020-10-09 15:41:35,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1117 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1117 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:36,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:36,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:41:36,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:36,454 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:41:36,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297218647] [2020-10-09 15:41:36,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:36,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:36,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217073102] [2020-10-09 15:41:36,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:36,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:36,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:36,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:36,475 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:36,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 764 places, 656 transitions, 1638 flow. Second operand 3 states. [2020-10-09 15:41:36,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:36,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:36,476 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:36,782 INFO L129 PetriNetUnfolder]: 23/801 cut-off events. [2020-10-09 15:41:36,782 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:41:36,833 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1077 conditions, 801 events. 23/801 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3560 event pairs, 0 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 1009. Up to 28 conditions per place. [2020-10-09 15:41:36,837 INFO L132 encePairwiseOnDemand]: 741/746 looper letters, 10 selfloop transitions, 3 changer transitions 0/658 dead transitions. [2020-10-09 15:41:36,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 766 places, 658 transitions, 1668 flow [2020-10-09 15:41:36,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2133 transitions. [2020-10-09 15:41:36,838 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.953083109919571 [2020-10-09 15:41:36,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2133 transitions. [2020-10-09 15:41:36,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2133 transitions. [2020-10-09 15:41:36,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:36,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2133 transitions. [2020-10-09 15:41:36,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:36,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:36,841 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:36,841 INFO L185 Difference]: Start difference. First operand has 764 places, 656 transitions, 1638 flow. Second operand 3 states and 2133 transitions. [2020-10-09 15:41:36,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 766 places, 658 transitions, 1668 flow [2020-10-09 15:41:36,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 765 places, 658 transitions, 1667 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:36,848 INFO L241 Difference]: Finished difference. Result has 767 places, 658 transitions, 1661 flow [2020-10-09 15:41:36,848 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=763, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=653, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1661, PETRI_PLACES=767, PETRI_TRANSITIONS=658} [2020-10-09 15:41:36,848 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 75 predicate places. [2020-10-09 15:41:36,848 INFO L481 AbstractCegarLoop]: Abstraction has has 767 places, 658 transitions, 1661 flow [2020-10-09 15:41:36,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:36,849 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:36,849 INFO L255 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:37,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1117 mathsat -unsat_core_generation=3 [2020-10-09 15:41:37,049 INFO L429 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:37,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:37,050 INFO L82 PathProgramCache]: Analyzing trace with hash -278421748, now seen corresponding path program 1 times [2020-10-09 15:41:37,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:37,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310137199] [2020-10-09 15:41:37,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1118 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1118 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:37,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:37,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:41:37,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:41:37,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310137199] [2020-10-09 15:41:37,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:37,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:37,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555314348] [2020-10-09 15:41:37,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:37,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:37,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:37,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:37,690 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:41:37,691 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 767 places, 658 transitions, 1661 flow. Second operand 3 states. [2020-10-09 15:41:37,691 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:37,692 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:41:37,692 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:37,990 INFO L129 PetriNetUnfolder]: 22/799 cut-off events. [2020-10-09 15:41:37,990 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:41:38,042 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 799 events. 22/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3547 event pairs, 0 based on Foata normal form. 0/751 useless extension candidates. Maximal degree in co-relation 1006. Up to 28 conditions per place. [2020-10-09 15:41:38,045 INFO L132 encePairwiseOnDemand]: 743/746 looper letters, 5 selfloop transitions, 2 changer transitions 0/658 dead transitions. [2020-10-09 15:41:38,045 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 769 places, 658 transitions, 1673 flow [2020-10-09 15:41:38,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2141 transitions. [2020-10-09 15:41:38,047 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9566577301161752 [2020-10-09 15:41:38,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2141 transitions. [2020-10-09 15:41:38,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2141 transitions. [2020-10-09 15:41:38,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:38,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2141 transitions. [2020-10-09 15:41:38,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:38,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:38,049 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:38,049 INFO L185 Difference]: Start difference. First operand has 767 places, 658 transitions, 1661 flow. Second operand 3 states and 2141 transitions. [2020-10-09 15:41:38,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 769 places, 658 transitions, 1673 flow [2020-10-09 15:41:38,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 768 places, 658 transitions, 1668 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:38,056 INFO L241 Difference]: Finished difference. Result has 770 places, 658 transitions, 1666 flow [2020-10-09 15:41:38,057 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1652, PETRI_DIFFERENCE_MINUEND_PLACES=766, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1666, PETRI_PLACES=770, PETRI_TRANSITIONS=658} [2020-10-09 15:41:38,057 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 78 predicate places. [2020-10-09 15:41:38,057 INFO L481 AbstractCegarLoop]: Abstraction has has 770 places, 658 transitions, 1666 flow [2020-10-09 15:41:38,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:38,057 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:38,057 INFO L255 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:38,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1118 mathsat -unsat_core_generation=3 [2020-10-09 15:41:38,258 INFO L429 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:38,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:38,258 INFO L82 PathProgramCache]: Analyzing trace with hash -277469459, now seen corresponding path program 1 times [2020-10-09 15:41:38,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:38,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235745655] [2020-10-09 15:41:38,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1119 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1119 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:38,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:41:38,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:41:38,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:41:38,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235745655] [2020-10-09 15:41:38,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:38,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:38,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318461778] [2020-10-09 15:41:38,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:38,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:38,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:38,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:38,906 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:41:38,907 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 770 places, 658 transitions, 1666 flow. Second operand 3 states. [2020-10-09 15:41:38,908 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:38,908 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:41:38,908 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:39,199 INFO L129 PetriNetUnfolder]: 21/795 cut-off events. [2020-10-09 15:41:39,199 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-10-09 15:41:39,250 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 795 events. 21/795 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3525 event pairs, 0 based on Foata normal form. 1/749 useless extension candidates. Maximal degree in co-relation 1002. Up to 28 conditions per place. [2020-10-09 15:41:39,253 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/655 dead transitions. [2020-10-09 15:41:39,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 772 places, 655 transitions, 1661 flow [2020-10-09 15:41:39,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:41:39,255 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:41:39,255 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:41:39,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:41:39,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:39,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:41:39,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:39,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:39,257 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:39,257 INFO L185 Difference]: Start difference. First operand has 770 places, 658 transitions, 1666 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:41:39,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 772 places, 655 transitions, 1661 flow [2020-10-09 15:41:39,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 769 places, 655 transitions, 1654 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:41:39,265 INFO L241 Difference]: Finished difference. Result has 769 places, 655 transitions, 1646 flow [2020-10-09 15:41:39,293 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=767, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1646, PETRI_PLACES=769, PETRI_TRANSITIONS=655} [2020-10-09 15:41:39,293 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 77 predicate places. [2020-10-09 15:41:39,293 INFO L481 AbstractCegarLoop]: Abstraction has has 769 places, 655 transitions, 1646 flow [2020-10-09 15:41:39,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:39,293 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:39,293 INFO L255 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:39,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1119 mathsat -unsat_core_generation=3 [2020-10-09 15:41:39,494 INFO L429 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:39,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:39,495 INFO L82 PathProgramCache]: Analyzing trace with hash -277468436, now seen corresponding path program 1 times [2020-10-09 15:41:39,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:39,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139468015] [2020-10-09 15:41:39,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1120 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1120 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:40,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:40,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:41:40,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-09 15:41:40,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139468015] [2020-10-09 15:41:40,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:40,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:40,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288593989] [2020-10-09 15:41:40,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:40,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:40,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:40,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:40,155 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:40,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 769 places, 655 transitions, 1646 flow. Second operand 3 states. [2020-10-09 15:41:40,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:40,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:40,157 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:40,453 INFO L129 PetriNetUnfolder]: 21/793 cut-off events. [2020-10-09 15:41:40,453 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:41:40,504 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 793 events. 21/793 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3507 event pairs, 0 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 1004. Up to 28 conditions per place. [2020-10-09 15:41:40,507 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 8 selfloop transitions, 1 changer transitions 0/653 dead transitions. [2020-10-09 15:41:40,507 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 769 places, 653 transitions, 1659 flow [2020-10-09 15:41:40,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2128 transitions. [2020-10-09 15:41:40,509 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508489722966935 [2020-10-09 15:41:40,509 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2128 transitions. [2020-10-09 15:41:40,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2128 transitions. [2020-10-09 15:41:40,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:40,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2128 transitions. [2020-10-09 15:41:40,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:40,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:40,512 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:40,512 INFO L185 Difference]: Start difference. First operand has 769 places, 655 transitions, 1646 flow. Second operand 3 states and 2128 transitions. [2020-10-09 15:41:40,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 769 places, 653 transitions, 1659 flow [2020-10-09 15:41:40,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 768 places, 653 transitions, 1658 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:40,519 INFO L241 Difference]: Finished difference. Result has 768 places, 653 transitions, 1642 flow [2020-10-09 15:41:40,519 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=766, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1642, PETRI_PLACES=768, PETRI_TRANSITIONS=653} [2020-10-09 15:41:40,519 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 76 predicate places. [2020-10-09 15:41:40,519 INFO L481 AbstractCegarLoop]: Abstraction has has 768 places, 653 transitions, 1642 flow [2020-10-09 15:41:40,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:40,519 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:40,519 INFO L255 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:40,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1120 mathsat -unsat_core_generation=3 [2020-10-09 15:41:40,720 INFO L429 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:40,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:40,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1016178854, now seen corresponding path program 1 times [2020-10-09 15:41:40,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:40,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187374180] [2020-10-09 15:41:40,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1121 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1121 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:41,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:41:41,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:41:41,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:41:41,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187374180] [2020-10-09 15:41:41,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:41,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:41,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182442378] [2020-10-09 15:41:41,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:41,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:41,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:41,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:41,381 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:41:41,382 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 768 places, 653 transitions, 1642 flow. Second operand 3 states. [2020-10-09 15:41:41,382 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:41,382 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:41:41,382 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:41,696 INFO L129 PetriNetUnfolder]: 20/800 cut-off events. [2020-10-09 15:41:41,696 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:41:41,752 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 800 events. 20/800 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3568 event pairs, 0 based on Foata normal form. 1/754 useless extension candidates. Maximal degree in co-relation 1007. Up to 28 conditions per place. [2020-10-09 15:41:41,755 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/653 dead transitions. [2020-10-09 15:41:41,755 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 770 places, 653 transitions, 1652 flow [2020-10-09 15:41:41,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:41:41,757 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:41:41,757 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:41:41,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:41:41,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:41,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:41:41,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:41,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:41,759 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:41,759 INFO L185 Difference]: Start difference. First operand has 768 places, 653 transitions, 1642 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:41:41,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 770 places, 653 transitions, 1652 flow [2020-10-09 15:41:41,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 769 places, 653 transitions, 1651 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:41,767 INFO L241 Difference]: Finished difference. Result has 770 places, 653 transitions, 1646 flow [2020-10-09 15:41:41,767 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=767, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1646, PETRI_PLACES=770, PETRI_TRANSITIONS=653} [2020-10-09 15:41:41,767 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 78 predicate places. [2020-10-09 15:41:41,768 INFO L481 AbstractCegarLoop]: Abstraction has has 770 places, 653 transitions, 1646 flow [2020-10-09 15:41:41,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:41,768 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:41,768 INFO L255 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:41,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1121 mathsat -unsat_core_generation=3 [2020-10-09 15:41:41,977 INFO L429 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:41,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:41,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1016177831, now seen corresponding path program 1 times [2020-10-09 15:41:41,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:41,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659413814] [2020-10-09 15:41:41,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1122 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1122 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:42,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:42,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:41:42,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:41:42,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659413814] [2020-10-09 15:41:42,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:42,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:42,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164500053] [2020-10-09 15:41:42,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:42,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:42,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:42,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:42,644 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:42,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 770 places, 653 transitions, 1646 flow. Second operand 3 states. [2020-10-09 15:41:42,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:42,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:42,645 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:42,967 INFO L129 PetriNetUnfolder]: 18/802 cut-off events. [2020-10-09 15:41:42,967 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:41:43,021 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 802 events. 18/802 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3596 event pairs, 0 based on Foata normal form. 0/755 useless extension candidates. Maximal degree in co-relation 1020. Up to 28 conditions per place. [2020-10-09 15:41:43,024 INFO L132 encePairwiseOnDemand]: 742/746 looper letters, 9 selfloop transitions, 3 changer transitions 0/654 dead transitions. [2020-10-09 15:41:43,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 772 places, 654 transitions, 1672 flow [2020-10-09 15:41:43,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2131 transitions. [2020-10-09 15:41:43,025 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9521894548704201 [2020-10-09 15:41:43,026 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2131 transitions. [2020-10-09 15:41:43,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2131 transitions. [2020-10-09 15:41:43,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:43,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2131 transitions. [2020-10-09 15:41:43,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:43,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:43,028 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:43,028 INFO L185 Difference]: Start difference. First operand has 770 places, 653 transitions, 1646 flow. Second operand 3 states and 2131 transitions. [2020-10-09 15:41:43,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 772 places, 654 transitions, 1672 flow [2020-10-09 15:41:43,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 771 places, 654 transitions, 1671 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:43,035 INFO L241 Difference]: Finished difference. Result has 773 places, 654 transitions, 1663 flow [2020-10-09 15:41:43,036 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=769, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=650, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1663, PETRI_PLACES=773, PETRI_TRANSITIONS=654} [2020-10-09 15:41:43,036 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 81 predicate places. [2020-10-09 15:41:43,036 INFO L481 AbstractCegarLoop]: Abstraction has has 773 places, 654 transitions, 1663 flow [2020-10-09 15:41:43,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:43,036 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:43,036 INFO L255 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:43,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1122 mathsat -unsat_core_generation=3 [2020-10-09 15:41:43,237 INFO L429 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:43,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:43,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1017131143, now seen corresponding path program 1 times [2020-10-09 15:41:43,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:43,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860114830] [2020-10-09 15:41:43,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1123 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1123 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:43,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:43,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:41:43,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:41:43,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860114830] [2020-10-09 15:41:43,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:43,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:43,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490612705] [2020-10-09 15:41:43,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:43,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:43,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:43,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:43,873 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:41:43,875 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 773 places, 654 transitions, 1663 flow. Second operand 3 states. [2020-10-09 15:41:43,875 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:43,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:41:43,875 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:44,174 INFO L129 PetriNetUnfolder]: 18/795 cut-off events. [2020-10-09 15:41:44,174 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:41:44,225 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 795 events. 18/795 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3540 event pairs, 0 based on Foata normal form. 1/752 useless extension candidates. Maximal degree in co-relation 1006. Up to 28 conditions per place. [2020-10-09 15:41:44,228 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 5 selfloop transitions, 1 changer transitions 0/652 dead transitions. [2020-10-09 15:41:44,228 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 775 places, 652 transitions, 1665 flow [2020-10-09 15:41:44,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2020-10-09 15:41:44,229 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9562109025915997 [2020-10-09 15:41:44,229 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2020-10-09 15:41:44,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2020-10-09 15:41:44,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:44,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2020-10-09 15:41:44,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:44,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:44,231 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:44,232 INFO L185 Difference]: Start difference. First operand has 773 places, 654 transitions, 1663 flow. Second operand 3 states and 2140 transitions. [2020-10-09 15:41:44,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 775 places, 652 transitions, 1665 flow [2020-10-09 15:41:44,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 772 places, 652 transitions, 1657 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:41:44,239 INFO L241 Difference]: Finished difference. Result has 773 places, 652 transitions, 1650 flow [2020-10-09 15:41:44,239 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=770, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1650, PETRI_PLACES=773, PETRI_TRANSITIONS=652} [2020-10-09 15:41:44,239 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 81 predicate places. [2020-10-09 15:41:44,239 INFO L481 AbstractCegarLoop]: Abstraction has has 773 places, 652 transitions, 1650 flow [2020-10-09 15:41:44,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:44,239 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:44,239 INFO L255 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:44,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1123 mathsat -unsat_core_generation=3 [2020-10-09 15:41:44,440 INFO L429 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:44,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:44,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1017132166, now seen corresponding path program 1 times [2020-10-09 15:41:44,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:44,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450912000] [2020-10-09 15:41:44,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1124 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1124 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:45,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:45,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:41:45,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-09 15:41:45,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450912000] [2020-10-09 15:41:45,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:45,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:45,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164470689] [2020-10-09 15:41:45,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:45,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:45,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:45,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:45,101 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:45,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 773 places, 652 transitions, 1650 flow. Second operand 3 states. [2020-10-09 15:41:45,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:45,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:45,102 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:45,403 INFO L129 PetriNetUnfolder]: 18/793 cut-off events. [2020-10-09 15:41:45,403 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:41:45,454 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 793 events. 18/793 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3524 event pairs, 0 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 1010. Up to 28 conditions per place. [2020-10-09 15:41:45,457 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 8 selfloop transitions, 1 changer transitions 0/650 dead transitions. [2020-10-09 15:41:45,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 773 places, 650 transitions, 1663 flow [2020-10-09 15:41:45,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2128 transitions. [2020-10-09 15:41:45,459 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508489722966935 [2020-10-09 15:41:45,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2128 transitions. [2020-10-09 15:41:45,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2128 transitions. [2020-10-09 15:41:45,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:45,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2128 transitions. [2020-10-09 15:41:45,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:45,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:45,461 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:45,461 INFO L185 Difference]: Start difference. First operand has 773 places, 652 transitions, 1650 flow. Second operand 3 states and 2128 transitions. [2020-10-09 15:41:45,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 773 places, 650 transitions, 1663 flow [2020-10-09 15:41:45,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 772 places, 650 transitions, 1662 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:45,468 INFO L241 Difference]: Finished difference. Result has 772 places, 650 transitions, 1646 flow [2020-10-09 15:41:45,469 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=770, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1646, PETRI_PLACES=772, PETRI_TRANSITIONS=650} [2020-10-09 15:41:45,469 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 80 predicate places. [2020-10-09 15:41:45,469 INFO L481 AbstractCegarLoop]: Abstraction has has 772 places, 650 transitions, 1646 flow [2020-10-09 15:41:45,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:45,469 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:45,469 INFO L255 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:45,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1124 mathsat -unsat_core_generation=3 [2020-10-09 15:41:45,670 INFO L429 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:45,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:45,670 INFO L82 PathProgramCache]: Analyzing trace with hash -102760632, now seen corresponding path program 1 times [2020-10-09 15:41:45,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:45,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407671506] [2020-10-09 15:41:45,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1125 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1125 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:46,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:41:46,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-10-09 15:41:46,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-10-09 15:41:46,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407671506] [2020-10-09 15:41:46,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:46,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:46,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707752224] [2020-10-09 15:41:46,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:46,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:46,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:46,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:46,325 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:41:46,326 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 772 places, 650 transitions, 1646 flow. Second operand 3 states. [2020-10-09 15:41:46,326 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:46,326 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:41:46,326 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:46,622 INFO L129 PetriNetUnfolder]: 17/800 cut-off events. [2020-10-09 15:41:46,622 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:41:46,674 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 800 events. 17/800 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3584 event pairs, 0 based on Foata normal form. 1/757 useless extension candidates. Maximal degree in co-relation 1013. Up to 28 conditions per place. [2020-10-09 15:41:46,677 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/650 dead transitions. [2020-10-09 15:41:46,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 774 places, 650 transitions, 1656 flow [2020-10-09 15:41:46,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:41:46,678 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:41:46,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:41:46,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:41:46,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:46,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:41:46,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:46,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:46,681 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:46,681 INFO L185 Difference]: Start difference. First operand has 772 places, 650 transitions, 1646 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:41:46,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 774 places, 650 transitions, 1656 flow [2020-10-09 15:41:46,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 773 places, 650 transitions, 1655 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:46,688 INFO L241 Difference]: Finished difference. Result has 774 places, 650 transitions, 1650 flow [2020-10-09 15:41:46,688 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=771, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1650, PETRI_PLACES=774, PETRI_TRANSITIONS=650} [2020-10-09 15:41:46,688 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 82 predicate places. [2020-10-09 15:41:46,688 INFO L481 AbstractCegarLoop]: Abstraction has has 774 places, 650 transitions, 1650 flow [2020-10-09 15:41:46,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:46,688 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:46,689 INFO L255 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:46,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1125 mathsat -unsat_core_generation=3 [2020-10-09 15:41:46,889 INFO L429 AbstractCegarLoop]: === Iteration 86 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:46,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:46,889 INFO L82 PathProgramCache]: Analyzing trace with hash -102759609, now seen corresponding path program 1 times [2020-10-09 15:41:46,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:46,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663356808] [2020-10-09 15:41:46,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1126 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1126 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:47,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:47,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-10-09 15:41:47,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-10-09 15:41:47,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663356808] [2020-10-09 15:41:47,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:47,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:47,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399772590] [2020-10-09 15:41:47,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:47,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:47,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:47,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:47,547 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:47,548 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 774 places, 650 transitions, 1650 flow. Second operand 3 states. [2020-10-09 15:41:47,548 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:47,548 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:47,549 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:47,860 INFO L129 PetriNetUnfolder]: 15/802 cut-off events. [2020-10-09 15:41:47,860 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:41:47,912 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 802 events. 15/802 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3617 event pairs, 0 based on Foata normal form. 0/758 useless extension candidates. Maximal degree in co-relation 1026. Up to 28 conditions per place. [2020-10-09 15:41:47,915 INFO L132 encePairwiseOnDemand]: 742/746 looper letters, 9 selfloop transitions, 3 changer transitions 0/651 dead transitions. [2020-10-09 15:41:47,915 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 776 places, 651 transitions, 1676 flow [2020-10-09 15:41:47,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:47,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2131 transitions. [2020-10-09 15:41:47,916 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9521894548704201 [2020-10-09 15:41:47,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2131 transitions. [2020-10-09 15:41:47,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2131 transitions. [2020-10-09 15:41:47,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:47,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2131 transitions. [2020-10-09 15:41:47,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:47,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:47,918 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:47,918 INFO L185 Difference]: Start difference. First operand has 774 places, 650 transitions, 1650 flow. Second operand 3 states and 2131 transitions. [2020-10-09 15:41:47,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 776 places, 651 transitions, 1676 flow [2020-10-09 15:41:47,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 775 places, 651 transitions, 1675 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:47,926 INFO L241 Difference]: Finished difference. Result has 777 places, 651 transitions, 1667 flow [2020-10-09 15:41:47,926 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1649, PETRI_DIFFERENCE_MINUEND_PLACES=773, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1667, PETRI_PLACES=777, PETRI_TRANSITIONS=651} [2020-10-09 15:41:47,926 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 85 predicate places. [2020-10-09 15:41:47,926 INFO L481 AbstractCegarLoop]: Abstraction has has 777 places, 651 transitions, 1667 flow [2020-10-09 15:41:47,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:47,926 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:47,926 INFO L255 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:48,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1126 mathsat -unsat_core_generation=3 [2020-10-09 15:41:48,127 INFO L429 AbstractCegarLoop]: === Iteration 87 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:48,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:48,128 INFO L82 PathProgramCache]: Analyzing trace with hash -103712921, now seen corresponding path program 1 times [2020-10-09 15:41:48,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:48,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208396267] [2020-10-09 15:41:48,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1127 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1127 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:48,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:48,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-10-09 15:41:48,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-10-09 15:41:48,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208396267] [2020-10-09 15:41:48,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:48,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:48,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582573044] [2020-10-09 15:41:48,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:48,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:48,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:48,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:48,823 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:41:48,824 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 777 places, 651 transitions, 1667 flow. Second operand 3 states. [2020-10-09 15:41:48,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:48,825 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:41:48,825 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:49,127 INFO L129 PetriNetUnfolder]: 15/795 cut-off events. [2020-10-09 15:41:49,127 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:41:49,178 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 795 events. 15/795 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3560 event pairs, 0 based on Foata normal form. 1/755 useless extension candidates. Maximal degree in co-relation 1012. Up to 28 conditions per place. [2020-10-09 15:41:49,181 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 5 selfloop transitions, 1 changer transitions 0/649 dead transitions. [2020-10-09 15:41:49,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 779 places, 649 transitions, 1669 flow [2020-10-09 15:41:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2020-10-09 15:41:49,183 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9562109025915997 [2020-10-09 15:41:49,183 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2020-10-09 15:41:49,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2020-10-09 15:41:49,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:49,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2020-10-09 15:41:49,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:49,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:49,185 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:49,185 INFO L185 Difference]: Start difference. First operand has 777 places, 651 transitions, 1667 flow. Second operand 3 states and 2140 transitions. [2020-10-09 15:41:49,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 779 places, 649 transitions, 1669 flow [2020-10-09 15:41:49,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 776 places, 649 transitions, 1661 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:41:49,192 INFO L241 Difference]: Finished difference. Result has 777 places, 649 transitions, 1654 flow [2020-10-09 15:41:49,192 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1649, PETRI_DIFFERENCE_MINUEND_PLACES=774, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1654, PETRI_PLACES=777, PETRI_TRANSITIONS=649} [2020-10-09 15:41:49,192 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 85 predicate places. [2020-10-09 15:41:49,192 INFO L481 AbstractCegarLoop]: Abstraction has has 777 places, 649 transitions, 1654 flow [2020-10-09 15:41:49,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:49,193 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:49,193 INFO L255 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:49,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1127 mathsat -unsat_core_generation=3 [2020-10-09 15:41:49,393 INFO L429 AbstractCegarLoop]: === Iteration 88 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:49,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:49,394 INFO L82 PathProgramCache]: Analyzing trace with hash -103713944, now seen corresponding path program 1 times [2020-10-09 15:41:49,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:49,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416747406] [2020-10-09 15:41:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1128 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1128 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:50,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:50,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-10-09 15:41:50,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-10-09 15:41:50,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416747406] [2020-10-09 15:41:50,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:50,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:50,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367766680] [2020-10-09 15:41:50,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:50,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:50,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:50,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:50,049 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:50,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 777 places, 649 transitions, 1654 flow. Second operand 3 states. [2020-10-09 15:41:50,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:50,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:50,051 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:50,367 INFO L129 PetriNetUnfolder]: 15/793 cut-off events. [2020-10-09 15:41:50,367 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:41:50,424 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 793 events. 15/793 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3545 event pairs, 0 based on Foata normal form. 0/751 useless extension candidates. Maximal degree in co-relation 1016. Up to 28 conditions per place. [2020-10-09 15:41:50,426 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 8 selfloop transitions, 1 changer transitions 0/647 dead transitions. [2020-10-09 15:41:50,426 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 777 places, 647 transitions, 1667 flow [2020-10-09 15:41:50,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2128 transitions. [2020-10-09 15:41:50,428 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508489722966935 [2020-10-09 15:41:50,428 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2128 transitions. [2020-10-09 15:41:50,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2128 transitions. [2020-10-09 15:41:50,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:50,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2128 transitions. [2020-10-09 15:41:50,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:50,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:50,430 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:50,430 INFO L185 Difference]: Start difference. First operand has 777 places, 649 transitions, 1654 flow. Second operand 3 states and 2128 transitions. [2020-10-09 15:41:50,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 777 places, 647 transitions, 1667 flow [2020-10-09 15:41:50,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 776 places, 647 transitions, 1666 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:50,438 INFO L241 Difference]: Finished difference. Result has 776 places, 647 transitions, 1650 flow [2020-10-09 15:41:50,439 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1648, PETRI_DIFFERENCE_MINUEND_PLACES=774, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=646, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1650, PETRI_PLACES=776, PETRI_TRANSITIONS=647} [2020-10-09 15:41:50,439 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 84 predicate places. [2020-10-09 15:41:50,439 INFO L481 AbstractCegarLoop]: Abstraction has has 776 places, 647 transitions, 1650 flow [2020-10-09 15:41:50,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:50,439 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:50,439 INFO L255 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:50,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1128 mathsat -unsat_core_generation=3 [2020-10-09 15:41:50,640 INFO L429 AbstractCegarLoop]: === Iteration 89 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:50,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:50,640 INFO L82 PathProgramCache]: Analyzing trace with hash -420988873, now seen corresponding path program 1 times [2020-10-09 15:41:50,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:50,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399907864] [2020-10-09 15:41:50,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1129 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1129 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:51,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:41:51,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:51,270 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2020-10-09 15:41:51,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2020-10-09 15:41:51,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399907864] [2020-10-09 15:41:51,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:51,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:51,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72522631] [2020-10-09 15:41:51,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:51,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:51,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:51,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:51,295 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 712 out of 746 [2020-10-09 15:41:51,296 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 776 places, 647 transitions, 1650 flow. Second operand 3 states. [2020-10-09 15:41:51,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:51,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 712 of 746 [2020-10-09 15:41:51,296 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:51,615 INFO L129 PetriNetUnfolder]: 14/800 cut-off events. [2020-10-09 15:41:51,615 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:41:51,669 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 800 events. 14/800 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3603 event pairs, 0 based on Foata normal form. 1/760 useless extension candidates. Maximal degree in co-relation 1019. Up to 28 conditions per place. [2020-10-09 15:41:51,672 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 4 selfloop transitions, 1 changer transitions 0/647 dead transitions. [2020-10-09 15:41:51,672 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 778 places, 647 transitions, 1660 flow [2020-10-09 15:41:51,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2020-10-09 15:41:51,674 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9571045576407506 [2020-10-09 15:41:51,674 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2020-10-09 15:41:51,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2020-10-09 15:41:51,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:51,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2020-10-09 15:41:51,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:51,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:51,676 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:51,676 INFO L185 Difference]: Start difference. First operand has 776 places, 647 transitions, 1650 flow. Second operand 3 states and 2142 transitions. [2020-10-09 15:41:51,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 778 places, 647 transitions, 1660 flow [2020-10-09 15:41:51,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 777 places, 647 transitions, 1659 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:51,684 INFO L241 Difference]: Finished difference. Result has 778 places, 647 transitions, 1654 flow [2020-10-09 15:41:51,684 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1649, PETRI_DIFFERENCE_MINUEND_PLACES=775, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=646, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1654, PETRI_PLACES=778, PETRI_TRANSITIONS=647} [2020-10-09 15:41:51,684 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 86 predicate places. [2020-10-09 15:41:51,684 INFO L481 AbstractCegarLoop]: Abstraction has has 778 places, 647 transitions, 1654 flow [2020-10-09 15:41:51,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:51,684 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:51,684 INFO L255 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:51,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1129 mathsat -unsat_core_generation=3 [2020-10-09 15:41:51,885 INFO L429 AbstractCegarLoop]: === Iteration 90 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:51,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:51,886 INFO L82 PathProgramCache]: Analyzing trace with hash -420987850, now seen corresponding path program 1 times [2020-10-09 15:41:51,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:51,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466052920] [2020-10-09 15:41:51,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1130 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1130 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:52,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:52,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2020-10-09 15:41:52,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:52,521 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2020-10-09 15:41:52,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466052920] [2020-10-09 15:41:52,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:52,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:52,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369107208] [2020-10-09 15:41:52,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:52,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:52,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:52,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:52,541 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:52,542 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 778 places, 647 transitions, 1654 flow. Second operand 3 states. [2020-10-09 15:41:52,542 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:52,542 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:52,543 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:52,872 INFO L129 PetriNetUnfolder]: 12/802 cut-off events. [2020-10-09 15:41:52,872 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:41:52,927 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 802 events. 12/802 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3637 event pairs, 0 based on Foata normal form. 0/761 useless extension candidates. Maximal degree in co-relation 1032. Up to 28 conditions per place. [2020-10-09 15:41:52,929 INFO L132 encePairwiseOnDemand]: 742/746 looper letters, 9 selfloop transitions, 3 changer transitions 0/648 dead transitions. [2020-10-09 15:41:52,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 780 places, 648 transitions, 1680 flow [2020-10-09 15:41:52,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:52,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2131 transitions. [2020-10-09 15:41:52,931 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9521894548704201 [2020-10-09 15:41:52,931 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2131 transitions. [2020-10-09 15:41:52,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2131 transitions. [2020-10-09 15:41:52,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:52,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2131 transitions. [2020-10-09 15:41:52,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:52,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:52,933 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:52,933 INFO L185 Difference]: Start difference. First operand has 778 places, 647 transitions, 1654 flow. Second operand 3 states and 2131 transitions. [2020-10-09 15:41:52,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 780 places, 648 transitions, 1680 flow [2020-10-09 15:41:52,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 779 places, 648 transitions, 1679 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:52,940 INFO L241 Difference]: Finished difference. Result has 781 places, 648 transitions, 1671 flow [2020-10-09 15:41:52,941 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1653, PETRI_DIFFERENCE_MINUEND_PLACES=777, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1671, PETRI_PLACES=781, PETRI_TRANSITIONS=648} [2020-10-09 15:41:52,941 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 89 predicate places. [2020-10-09 15:41:52,941 INFO L481 AbstractCegarLoop]: Abstraction has has 781 places, 648 transitions, 1671 flow [2020-10-09 15:41:52,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:52,941 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:52,941 INFO L255 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:53,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1130 mathsat -unsat_core_generation=3 [2020-10-09 15:41:53,142 INFO L429 AbstractCegarLoop]: === Iteration 91 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:53,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:53,142 INFO L82 PathProgramCache]: Analyzing trace with hash -421941162, now seen corresponding path program 1 times [2020-10-09 15:41:53,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:53,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731021009] [2020-10-09 15:41:53,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1131 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1131 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:53,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:53,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2020-10-09 15:41:53,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2020-10-09 15:41:53,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731021009] [2020-10-09 15:41:53,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:53,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:53,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841147225] [2020-10-09 15:41:53,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:53,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:53,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:53,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:53,785 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 746 [2020-10-09 15:41:53,786 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 781 places, 648 transitions, 1671 flow. Second operand 3 states. [2020-10-09 15:41:53,786 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:53,786 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 746 [2020-10-09 15:41:53,786 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:54,090 INFO L129 PetriNetUnfolder]: 12/795 cut-off events. [2020-10-09 15:41:54,090 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:41:54,141 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 795 events. 12/795 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3574 event pairs, 0 based on Foata normal form. 1/758 useless extension candidates. Maximal degree in co-relation 1018. Up to 28 conditions per place. [2020-10-09 15:41:54,144 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 5 selfloop transitions, 1 changer transitions 0/646 dead transitions. [2020-10-09 15:41:54,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 783 places, 646 transitions, 1673 flow [2020-10-09 15:41:54,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2020-10-09 15:41:54,145 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9562109025915997 [2020-10-09 15:41:54,145 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2020-10-09 15:41:54,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2020-10-09 15:41:54,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:54,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2020-10-09 15:41:54,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:54,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:54,147 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:54,147 INFO L185 Difference]: Start difference. First operand has 781 places, 648 transitions, 1671 flow. Second operand 3 states and 2140 transitions. [2020-10-09 15:41:54,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 783 places, 646 transitions, 1673 flow [2020-10-09 15:41:54,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 780 places, 646 transitions, 1665 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:41:54,155 INFO L241 Difference]: Finished difference. Result has 781 places, 646 transitions, 1658 flow [2020-10-09 15:41:54,155 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1653, PETRI_DIFFERENCE_MINUEND_PLACES=778, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1658, PETRI_PLACES=781, PETRI_TRANSITIONS=646} [2020-10-09 15:41:54,155 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 89 predicate places. [2020-10-09 15:41:54,155 INFO L481 AbstractCegarLoop]: Abstraction has has 781 places, 646 transitions, 1658 flow [2020-10-09 15:41:54,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:54,155 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:54,155 INFO L255 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:54,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1131 mathsat -unsat_core_generation=3 [2020-10-09 15:41:54,356 INFO L429 AbstractCegarLoop]: === Iteration 92 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:54,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:54,356 INFO L82 PathProgramCache]: Analyzing trace with hash -421942185, now seen corresponding path program 1 times [2020-10-09 15:41:54,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:54,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074505518] [2020-10-09 15:41:54,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1132 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1132 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:54,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:54,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2020-10-09 15:41:54,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2020-10-09 15:41:54,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074505518] [2020-10-09 15:41:54,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:54,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:54,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214527576] [2020-10-09 15:41:54,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:54,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:54,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:54,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:55,022 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 746 [2020-10-09 15:41:55,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 781 places, 646 transitions, 1658 flow. Second operand 3 states. [2020-10-09 15:41:55,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:55,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 746 [2020-10-09 15:41:55,024 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:55,330 INFO L129 PetriNetUnfolder]: 12/793 cut-off events. [2020-10-09 15:41:55,330 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:41:55,382 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 793 events. 12/793 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3563 event pairs, 0 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 1022. Up to 28 conditions per place. [2020-10-09 15:41:55,384 INFO L132 encePairwiseOnDemand]: 744/746 looper letters, 8 selfloop transitions, 1 changer transitions 0/644 dead transitions. [2020-10-09 15:41:55,384 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 781 places, 644 transitions, 1671 flow [2020-10-09 15:41:55,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2128 transitions. [2020-10-09 15:41:55,386 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9508489722966935 [2020-10-09 15:41:55,386 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2128 transitions. [2020-10-09 15:41:55,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2128 transitions. [2020-10-09 15:41:55,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:55,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2128 transitions. [2020-10-09 15:41:55,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:55,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:55,388 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:55,388 INFO L185 Difference]: Start difference. First operand has 781 places, 646 transitions, 1658 flow. Second operand 3 states and 2128 transitions. [2020-10-09 15:41:55,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 781 places, 644 transitions, 1671 flow [2020-10-09 15:41:55,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 780 places, 644 transitions, 1670 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:55,395 INFO L241 Difference]: Finished difference. Result has 780 places, 644 transitions, 1654 flow [2020-10-09 15:41:55,395 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=746, PETRI_DIFFERENCE_MINUEND_FLOW=1652, PETRI_DIFFERENCE_MINUEND_PLACES=778, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1654, PETRI_PLACES=780, PETRI_TRANSITIONS=644} [2020-10-09 15:41:55,395 INFO L341 CegarLoopForPetriNet]: 692 programPoint places, 88 predicate places. [2020-10-09 15:41:55,396 INFO L481 AbstractCegarLoop]: Abstraction has has 780 places, 644 transitions, 1654 flow [2020-10-09 15:41:55,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:55,396 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:55,396 INFO L255 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:55,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1132 mathsat -unsat_core_generation=3 [2020-10-09 15:41:55,596 INFO L429 AbstractCegarLoop]: === Iteration 93 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:55,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:55,597 INFO L82 PathProgramCache]: Analyzing trace with hash -598153431, now seen corresponding path program 1 times [2020-10-09 15:41:55,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:55,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981931362] [2020-10-09 15:41:55,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1133 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1133 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:41:56,219 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:41:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 15:41:56,265 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 15:41:56,330 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 15:41:56,330 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 15:41:56,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1133 mathsat -unsat_core_generation=3 [2020-10-09 15:41:56,531 WARN L371 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-09 15:41:56,531 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2020-10-09 15:41:56,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 15:41:56,708 INFO L253 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2020-10-09 15:41:56,708 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 15:41:56,708 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 15:41:56,708 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 15:41:56,708 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 15:41:56,709 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 15:41:56,709 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 15:41:56,709 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 15:41:56,709 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 15:41:56,715 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 717 places, 773 transitions, 2442 flow [2020-10-09 15:41:57,035 INFO L129 PetriNetUnfolder]: 141/1024 cut-off events. [2020-10-09 15:41:57,035 INFO L130 PetriNetUnfolder]: For 4032/4032 co-relation queries the response was YES. [2020-10-09 15:41:57,110 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1515 conditions, 1024 events. 141/1024 cut-off events. For 4032/4032 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4317 event pairs, 0 based on Foata normal form. 0/826 useless extension candidates. Maximal degree in co-relation 1442. Up to 58 conditions per place. [2020-10-09 15:41:57,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 717 places, 773 transitions, 2442 flow [2020-10-09 15:41:57,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 717 places, 773 transitions, 2442 flow [2020-10-09 15:41:57,147 INFO L129 PetriNetUnfolder]: 9/97 cut-off events. [2020-10-09 15:41:57,147 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-09 15:41:57,147 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:57,147 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:57,147 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:57,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:57,147 INFO L82 PathProgramCache]: Analyzing trace with hash -8711186, now seen corresponding path program 1 times [2020-10-09 15:41:57,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:57,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22226886] [2020-10-09 15:41:57,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1134 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1134 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:57,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:57,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:41:57,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:57,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:41:57,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22226886] [2020-10-09 15:41:57,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:57,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:57,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695635725] [2020-10-09 15:41:57,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:57,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:57,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:57,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:57,827 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 773 [2020-10-09 15:41:57,828 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 773 transitions, 2442 flow. Second operand 3 states. [2020-10-09 15:41:57,828 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:57,828 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 773 [2020-10-09 15:41:57,828 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:58,112 INFO L129 PetriNetUnfolder]: 83/830 cut-off events. [2020-10-09 15:41:58,112 INFO L130 PetriNetUnfolder]: For 4033/4033 co-relation queries the response was YES. [2020-10-09 15:41:58,170 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1335 conditions, 830 events. 83/830 cut-off events. For 4033/4033 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3325 event pairs, 0 based on Foata normal form. 120/837 useless extension candidates. Maximal degree in co-relation 1260. Up to 29 conditions per place. [2020-10-09 15:41:58,186 INFO L132 encePairwiseOnDemand]: 738/773 looper letters, 10 selfloop transitions, 3 changer transitions 0/741 dead transitions. [2020-10-09 15:41:58,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 741 transitions, 2404 flow [2020-10-09 15:41:58,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:58,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2271 transitions. [2020-10-09 15:41:58,187 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9793014230271668 [2020-10-09 15:41:58,187 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2271 transitions. [2020-10-09 15:41:58,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2271 transitions. [2020-10-09 15:41:58,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:58,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2271 transitions. [2020-10-09 15:41:58,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:58,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:58,190 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:58,190 INFO L185 Difference]: Start difference. First operand has 717 places, 773 transitions, 2442 flow. Second operand 3 states and 2271 transitions. [2020-10-09 15:41:58,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 741 transitions, 2404 flow [2020-10-09 15:41:58,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 714 places, 741 transitions, 1648 flow, removed 378 selfloop flow, removed 0 redundant places. [2020-10-09 15:41:58,201 INFO L241 Difference]: Finished difference. Result has 716 places, 741 transitions, 1642 flow [2020-10-09 15:41:58,202 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1618, PETRI_DIFFERENCE_MINUEND_PLACES=712, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=736, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1642, PETRI_PLACES=716, PETRI_TRANSITIONS=741} [2020-10-09 15:41:58,202 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, -1 predicate places. [2020-10-09 15:41:58,202 INFO L481 AbstractCegarLoop]: Abstraction has has 716 places, 741 transitions, 1642 flow [2020-10-09 15:41:58,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:58,202 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:58,202 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:58,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1134 mathsat -unsat_core_generation=3 [2020-10-09 15:41:58,403 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:58,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:58,403 INFO L82 PathProgramCache]: Analyzing trace with hash -7756851, now seen corresponding path program 1 times [2020-10-09 15:41:58,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:58,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990751840] [2020-10-09 15:41:58,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1135 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1135 with mathsat -unsat_core_generation=3 [2020-10-09 15:41:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:41:59,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:41:59,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:41:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:41:59,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:41:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:41:59,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990751840] [2020-10-09 15:41:59,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:41:59,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:41:59,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474152092] [2020-10-09 15:41:59,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:41:59,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:41:59,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:41:59,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:41:59,045 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 773 [2020-10-09 15:41:59,046 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 741 transitions, 1642 flow. Second operand 3 states. [2020-10-09 15:41:59,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:41:59,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 773 [2020-10-09 15:41:59,047 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:41:59,320 INFO L129 PetriNetUnfolder]: 81/828 cut-off events. [2020-10-09 15:41:59,320 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2020-10-09 15:41:59,373 INFO L80 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 828 events. 81/828 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3325 event pairs, 0 based on Foata normal form. 2/720 useless extension candidates. Maximal degree in co-relation 912. Up to 29 conditions per place. [2020-10-09 15:41:59,388 INFO L132 encePairwiseOnDemand]: 770/773 looper letters, 10 selfloop transitions, 1 changer transitions 0/739 dead transitions. [2020-10-09 15:41:59,388 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 718 places, 739 transitions, 1652 flow [2020-10-09 15:41:59,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:41:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:41:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2209 transitions. [2020-10-09 15:41:59,389 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9525657611039241 [2020-10-09 15:41:59,389 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2209 transitions. [2020-10-09 15:41:59,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2209 transitions. [2020-10-09 15:41:59,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:41:59,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2209 transitions. [2020-10-09 15:41:59,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:41:59,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:41:59,392 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:41:59,392 INFO L185 Difference]: Start difference. First operand has 716 places, 741 transitions, 1642 flow. Second operand 3 states and 2209 transitions. [2020-10-09 15:41:59,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 718 places, 739 transitions, 1652 flow [2020-10-09 15:41:59,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 717 places, 739 transitions, 1651 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:41:59,399 INFO L241 Difference]: Finished difference. Result has 717 places, 739 transitions, 1631 flow [2020-10-09 15:41:59,399 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=715, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=738, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1631, PETRI_PLACES=717, PETRI_TRANSITIONS=739} [2020-10-09 15:41:59,399 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 0 predicate places. [2020-10-09 15:41:59,399 INFO L481 AbstractCegarLoop]: Abstraction has has 717 places, 739 transitions, 1631 flow [2020-10-09 15:41:59,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:41:59,399 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:41:59,399 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:41:59,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1135 mathsat -unsat_core_generation=3 [2020-10-09 15:41:59,600 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:41:59,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:41:59,600 INFO L82 PathProgramCache]: Analyzing trace with hash -8710163, now seen corresponding path program 1 times [2020-10-09 15:41:59,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:41:59,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566832848] [2020-10-09 15:41:59,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1136 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1136 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:00,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:00,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:42:00,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:42:00,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566832848] [2020-10-09 15:42:00,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:00,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:00,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751933491] [2020-10-09 15:42:00,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:00,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:00,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:00,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:00,239 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 773 [2020-10-09 15:42:00,239 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 739 transitions, 1631 flow. Second operand 3 states. [2020-10-09 15:42:00,239 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:00,240 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 773 [2020-10-09 15:42:00,240 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:00,500 INFO L129 PetriNetUnfolder]: 81/825 cut-off events. [2020-10-09 15:42:00,501 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-09 15:42:00,554 INFO L80 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 825 events. 81/825 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3302 event pairs, 0 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 906. Up to 29 conditions per place. [2020-10-09 15:42:00,568 INFO L132 encePairwiseOnDemand]: 770/773 looper letters, 5 selfloop transitions, 2 changer transitions 0/739 dead transitions. [2020-10-09 15:42:00,568 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 739 transitions, 1643 flow [2020-10-09 15:42:00,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2219 transitions. [2020-10-09 15:42:00,570 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956877964639931 [2020-10-09 15:42:00,570 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2219 transitions. [2020-10-09 15:42:00,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2219 transitions. [2020-10-09 15:42:00,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:00,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2219 transitions. [2020-10-09 15:42:00,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:00,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:00,572 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:00,572 INFO L185 Difference]: Start difference. First operand has 717 places, 739 transitions, 1631 flow. Second operand 3 states and 2219 transitions. [2020-10-09 15:42:00,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 739 transitions, 1643 flow [2020-10-09 15:42:00,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 718 places, 739 transitions, 1640 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:00,579 INFO L241 Difference]: Finished difference. Result has 720 places, 739 transitions, 1638 flow [2020-10-09 15:42:00,579 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=716, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=738, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=736, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1638, PETRI_PLACES=720, PETRI_TRANSITIONS=739} [2020-10-09 15:42:00,579 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 3 predicate places. [2020-10-09 15:42:00,579 INFO L481 AbstractCegarLoop]: Abstraction has has 720 places, 739 transitions, 1638 flow [2020-10-09 15:42:00,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:00,579 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:00,579 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:42:00,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1136 mathsat -unsat_core_generation=3 [2020-10-09 15:42:00,780 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:00,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:00,780 INFO L82 PathProgramCache]: Analyzing trace with hash -7757874, now seen corresponding path program 1 times [2020-10-09 15:42:00,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:00,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41469874] [2020-10-09 15:42:00,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1137 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1137 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:01,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:42:01,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:42:01,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 15:42:01,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41469874] [2020-10-09 15:42:01,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:01,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:01,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320013484] [2020-10-09 15:42:01,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:01,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:01,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:01,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:01,427 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2020-10-09 15:42:01,427 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 739 transitions, 1638 flow. Second operand 3 states. [2020-10-09 15:42:01,427 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:01,428 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2020-10-09 15:42:01,428 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:01,679 INFO L129 PetriNetUnfolder]: 81/822 cut-off events. [2020-10-09 15:42:01,679 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-10-09 15:42:01,729 INFO L80 FinitePrefix]: Finished finitePrefix Result has 952 conditions, 822 events. 81/822 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3282 event pairs, 0 based on Foata normal form. 1/715 useless extension candidates. Maximal degree in co-relation 907. Up to 29 conditions per place. [2020-10-09 15:42:01,743 INFO L132 encePairwiseOnDemand]: 771/773 looper letters, 4 selfloop transitions, 1 changer transitions 0/736 dead transitions. [2020-10-09 15:42:01,743 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 736 transitions, 1636 flow [2020-10-09 15:42:01,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:01,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2220 transitions. [2020-10-09 15:42:01,744 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9573091849935317 [2020-10-09 15:42:01,744 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2220 transitions. [2020-10-09 15:42:01,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2220 transitions. [2020-10-09 15:42:01,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:01,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2220 transitions. [2020-10-09 15:42:01,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:01,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:01,747 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:01,747 INFO L185 Difference]: Start difference. First operand has 720 places, 739 transitions, 1638 flow. Second operand 3 states and 2220 transitions. [2020-10-09 15:42:01,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 736 transitions, 1636 flow [2020-10-09 15:42:01,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 717 places, 736 transitions, 1631 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:42:01,754 INFO L241 Difference]: Finished difference. Result has 717 places, 736 transitions, 1623 flow [2020-10-09 15:42:01,754 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1621, PETRI_DIFFERENCE_MINUEND_PLACES=715, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1623, PETRI_PLACES=717, PETRI_TRANSITIONS=736} [2020-10-09 15:42:01,754 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 0 predicate places. [2020-10-09 15:42:01,754 INFO L481 AbstractCegarLoop]: Abstraction has has 717 places, 736 transitions, 1623 flow [2020-10-09 15:42:01,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:01,755 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:01,755 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:42:01,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1137 mathsat -unsat_core_generation=3 [2020-10-09 15:42:01,955 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:01,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:01,956 INFO L82 PathProgramCache]: Analyzing trace with hash -450024190, now seen corresponding path program 1 times [2020-10-09 15:42:01,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:01,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307665155] [2020-10-09 15:42:01,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1138 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1138 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:02,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:42:02,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:42:02,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:42:02,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307665155] [2020-10-09 15:42:02,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:02,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:02,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555349722] [2020-10-09 15:42:02,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:02,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:02,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:02,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:02,600 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2020-10-09 15:42:02,601 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 736 transitions, 1623 flow. Second operand 3 states. [2020-10-09 15:42:02,601 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:02,601 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2020-10-09 15:42:02,601 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:02,861 INFO L129 PetriNetUnfolder]: 80/829 cut-off events. [2020-10-09 15:42:02,861 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:42:02,914 INFO L80 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 829 events. 80/829 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3341 event pairs, 0 based on Foata normal form. 1/721 useless extension candidates. Maximal degree in co-relation 917. Up to 29 conditions per place. [2020-10-09 15:42:02,929 INFO L132 encePairwiseOnDemand]: 771/773 looper letters, 4 selfloop transitions, 1 changer transitions 0/736 dead transitions. [2020-10-09 15:42:02,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 736 transitions, 1633 flow [2020-10-09 15:42:02,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2220 transitions. [2020-10-09 15:42:02,930 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9573091849935317 [2020-10-09 15:42:02,930 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2220 transitions. [2020-10-09 15:42:02,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2220 transitions. [2020-10-09 15:42:02,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:02,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2220 transitions. [2020-10-09 15:42:02,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:02,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:02,932 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:02,933 INFO L185 Difference]: Start difference. First operand has 717 places, 736 transitions, 1623 flow. Second operand 3 states and 2220 transitions. [2020-10-09 15:42:02,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 736 transitions, 1633 flow [2020-10-09 15:42:02,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 718 places, 736 transitions, 1632 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:02,939 INFO L241 Difference]: Finished difference. Result has 719 places, 736 transitions, 1627 flow [2020-10-09 15:42:02,939 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1622, PETRI_DIFFERENCE_MINUEND_PLACES=716, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1627, PETRI_PLACES=719, PETRI_TRANSITIONS=736} [2020-10-09 15:42:02,939 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 2 predicate places. [2020-10-09 15:42:02,939 INFO L481 AbstractCegarLoop]: Abstraction has has 719 places, 736 transitions, 1627 flow [2020-10-09 15:42:02,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:02,940 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:02,940 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:42:03,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1138 mathsat -unsat_core_generation=3 [2020-10-09 15:42:03,140 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:03,141 INFO L82 PathProgramCache]: Analyzing trace with hash -450023167, now seen corresponding path program 1 times [2020-10-09 15:42:03,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:03,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646012985] [2020-10-09 15:42:03,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1139 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1139 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:03,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:03,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:03,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:42:03,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:42:03,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646012985] [2020-10-09 15:42:03,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:03,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:03,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662605077] [2020-10-09 15:42:03,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:03,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:03,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:03,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:03,798 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 773 [2020-10-09 15:42:03,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 736 transitions, 1627 flow. Second operand 3 states. [2020-10-09 15:42:03,799 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:03,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 773 [2020-10-09 15:42:03,799 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:04,061 INFO L129 PetriNetUnfolder]: 78/831 cut-off events. [2020-10-09 15:42:04,062 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:42:04,112 INFO L80 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 831 events. 78/831 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3373 event pairs, 0 based on Foata normal form. 0/723 useless extension candidates. Maximal degree in co-relation 928. Up to 29 conditions per place. [2020-10-09 15:42:04,126 INFO L132 encePairwiseOnDemand]: 769/773 looper letters, 9 selfloop transitions, 3 changer transitions 0/737 dead transitions. [2020-10-09 15:42:04,126 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 737 transitions, 1653 flow [2020-10-09 15:42:04,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:04,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2209 transitions. [2020-10-09 15:42:04,127 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9525657611039241 [2020-10-09 15:42:04,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2209 transitions. [2020-10-09 15:42:04,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2209 transitions. [2020-10-09 15:42:04,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:04,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2209 transitions. [2020-10-09 15:42:04,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:04,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:04,130 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:04,130 INFO L185 Difference]: Start difference. First operand has 719 places, 736 transitions, 1627 flow. Second operand 3 states and 2209 transitions. [2020-10-09 15:42:04,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 737 transitions, 1653 flow [2020-10-09 15:42:04,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 737 transitions, 1652 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:04,136 INFO L241 Difference]: Finished difference. Result has 722 places, 737 transitions, 1644 flow [2020-10-09 15:42:04,136 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1626, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=733, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1644, PETRI_PLACES=722, PETRI_TRANSITIONS=737} [2020-10-09 15:42:04,136 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 5 predicate places. [2020-10-09 15:42:04,137 INFO L481 AbstractCegarLoop]: Abstraction has has 722 places, 737 transitions, 1644 flow [2020-10-09 15:42:04,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:04,137 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:04,137 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:42:04,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1139 mathsat -unsat_core_generation=3 [2020-10-09 15:42:04,337 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:04,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:04,338 INFO L82 PathProgramCache]: Analyzing trace with hash -450976479, now seen corresponding path program 1 times [2020-10-09 15:42:04,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:04,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051918806] [2020-10-09 15:42:04,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1140 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1140 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:04,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:04,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:42:04,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:04,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:42:04,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051918806] [2020-10-09 15:42:04,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:04,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:04,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63497315] [2020-10-09 15:42:04,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:04,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:04,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:04,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:04,976 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 773 [2020-10-09 15:42:04,977 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 737 transitions, 1644 flow. Second operand 3 states. [2020-10-09 15:42:04,977 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:04,977 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 773 [2020-10-09 15:42:04,977 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:05,243 INFO L129 PetriNetUnfolder]: 78/824 cut-off events. [2020-10-09 15:42:05,243 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-10-09 15:42:05,296 INFO L80 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 824 events. 78/824 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3313 event pairs, 0 based on Foata normal form. 1/720 useless extension candidates. Maximal degree in co-relation 913. Up to 29 conditions per place. [2020-10-09 15:42:05,310 INFO L132 encePairwiseOnDemand]: 771/773 looper letters, 5 selfloop transitions, 1 changer transitions 0/735 dead transitions. [2020-10-09 15:42:05,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 735 transitions, 1646 flow [2020-10-09 15:42:05,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2020-10-09 15:42:05,312 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9564467442863304 [2020-10-09 15:42:05,312 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2020-10-09 15:42:05,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2020-10-09 15:42:05,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:05,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2020-10-09 15:42:05,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:05,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:05,314 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:05,314 INFO L185 Difference]: Start difference. First operand has 722 places, 737 transitions, 1644 flow. Second operand 3 states and 2218 transitions. [2020-10-09 15:42:05,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 735 transitions, 1646 flow [2020-10-09 15:42:05,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 721 places, 735 transitions, 1638 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:42:05,320 INFO L241 Difference]: Finished difference. Result has 722 places, 735 transitions, 1631 flow [2020-10-09 15:42:05,321 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1626, PETRI_DIFFERENCE_MINUEND_PLACES=719, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=735, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=734, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1631, PETRI_PLACES=722, PETRI_TRANSITIONS=735} [2020-10-09 15:42:05,321 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 5 predicate places. [2020-10-09 15:42:05,321 INFO L481 AbstractCegarLoop]: Abstraction has has 722 places, 735 transitions, 1631 flow [2020-10-09 15:42:05,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:05,321 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:05,321 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:42:05,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1140 mathsat -unsat_core_generation=3 [2020-10-09 15:42:05,522 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:05,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:05,522 INFO L82 PathProgramCache]: Analyzing trace with hash -450977502, now seen corresponding path program 1 times [2020-10-09 15:42:05,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:05,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219407980] [2020-10-09 15:42:05,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1141 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1141 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:06,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:06,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:42:06,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-09 15:42:06,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219407980] [2020-10-09 15:42:06,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:06,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:06,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929589677] [2020-10-09 15:42:06,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:06,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:06,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:06,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:06,173 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 773 [2020-10-09 15:42:06,174 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 735 transitions, 1631 flow. Second operand 3 states. [2020-10-09 15:42:06,174 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:06,174 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 773 [2020-10-09 15:42:06,175 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:06,449 INFO L129 PetriNetUnfolder]: 78/822 cut-off events. [2020-10-09 15:42:06,450 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:42:06,503 INFO L80 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 822 events. 78/822 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3299 event pairs, 0 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 918. Up to 29 conditions per place. [2020-10-09 15:42:06,516 INFO L132 encePairwiseOnDemand]: 771/773 looper letters, 8 selfloop transitions, 1 changer transitions 0/733 dead transitions. [2020-10-09 15:42:06,517 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 722 places, 733 transitions, 1644 flow [2020-10-09 15:42:06,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2206 transitions. [2020-10-09 15:42:06,518 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.951272100043122 [2020-10-09 15:42:06,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2206 transitions. [2020-10-09 15:42:06,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2206 transitions. [2020-10-09 15:42:06,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:06,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2206 transitions. [2020-10-09 15:42:06,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:06,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:06,521 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:06,521 INFO L185 Difference]: Start difference. First operand has 722 places, 735 transitions, 1631 flow. Second operand 3 states and 2206 transitions. [2020-10-09 15:42:06,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 722 places, 733 transitions, 1644 flow [2020-10-09 15:42:06,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 721 places, 733 transitions, 1643 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:06,531 INFO L241 Difference]: Finished difference. Result has 721 places, 733 transitions, 1627 flow [2020-10-09 15:42:06,532 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1625, PETRI_DIFFERENCE_MINUEND_PLACES=719, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1627, PETRI_PLACES=721, PETRI_TRANSITIONS=733} [2020-10-09 15:42:06,532 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 4 predicate places. [2020-10-09 15:42:06,532 INFO L481 AbstractCegarLoop]: Abstraction has has 721 places, 733 transitions, 1627 flow [2020-10-09 15:42:06,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:06,532 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:06,533 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:42:06,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1141 mathsat -unsat_core_generation=3 [2020-10-09 15:42:06,746 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:06,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:06,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1475813975, now seen corresponding path program 1 times [2020-10-09 15:42:06,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:06,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241672503] [2020-10-09 15:42:06,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1142 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1142 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:07,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:07,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:42:07,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:42:07,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241672503] [2020-10-09 15:42:07,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:07,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:07,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869853255] [2020-10-09 15:42:07,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:07,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:07,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:07,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:07,446 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 773 [2020-10-09 15:42:07,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 733 transitions, 1627 flow. Second operand 3 states. [2020-10-09 15:42:07,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:07,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 773 [2020-10-09 15:42:07,447 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:07,719 INFO L129 PetriNetUnfolder]: 77/830 cut-off events. [2020-10-09 15:42:07,719 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:42:07,772 INFO L80 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 830 events. 77/830 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3369 event pairs, 0 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 930. Up to 29 conditions per place. [2020-10-09 15:42:07,786 INFO L132 encePairwiseOnDemand]: 768/773 looper letters, 10 selfloop transitions, 3 changer transitions 0/735 dead transitions. [2020-10-09 15:42:07,786 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 735 transitions, 1657 flow [2020-10-09 15:42:07,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:07,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2211 transitions. [2020-10-09 15:42:07,788 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9534282018111255 [2020-10-09 15:42:07,788 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2211 transitions. [2020-10-09 15:42:07,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2211 transitions. [2020-10-09 15:42:07,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:07,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2211 transitions. [2020-10-09 15:42:07,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:07,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:07,790 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:07,790 INFO L185 Difference]: Start difference. First operand has 721 places, 733 transitions, 1627 flow. Second operand 3 states and 2211 transitions. [2020-10-09 15:42:07,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 723 places, 735 transitions, 1657 flow [2020-10-09 15:42:07,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 722 places, 735 transitions, 1656 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:07,797 INFO L241 Difference]: Finished difference. Result has 724 places, 735 transitions, 1650 flow [2020-10-09 15:42:07,797 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1626, PETRI_DIFFERENCE_MINUEND_PLACES=720, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1650, PETRI_PLACES=724, PETRI_TRANSITIONS=735} [2020-10-09 15:42:07,797 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 7 predicate places. [2020-10-09 15:42:07,797 INFO L481 AbstractCegarLoop]: Abstraction has has 724 places, 735 transitions, 1650 flow [2020-10-09 15:42:07,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:07,797 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:07,798 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:42:07,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1142 mathsat -unsat_core_generation=3 [2020-10-09 15:42:07,998 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:07,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:07,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1475814998, now seen corresponding path program 1 times [2020-10-09 15:42:07,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:07,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448870364] [2020-10-09 15:42:07,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1143 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1143 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:08,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:08,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:42:08,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:42:08,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448870364] [2020-10-09 15:42:08,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:08,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:08,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292242874] [2020-10-09 15:42:08,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:08,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:08,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:08,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:08,636 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 773 [2020-10-09 15:42:08,636 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 724 places, 735 transitions, 1650 flow. Second operand 3 states. [2020-10-09 15:42:08,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:08,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 773 [2020-10-09 15:42:08,637 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:08,907 INFO L129 PetriNetUnfolder]: 76/828 cut-off events. [2020-10-09 15:42:08,907 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-10-09 15:42:08,962 INFO L80 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 828 events. 76/828 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3357 event pairs, 0 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 927. Up to 29 conditions per place. [2020-10-09 15:42:08,975 INFO L132 encePairwiseOnDemand]: 770/773 looper letters, 5 selfloop transitions, 2 changer transitions 0/735 dead transitions. [2020-10-09 15:42:08,975 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 726 places, 735 transitions, 1662 flow [2020-10-09 15:42:08,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2219 transitions. [2020-10-09 15:42:08,977 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956877964639931 [2020-10-09 15:42:08,977 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2219 transitions. [2020-10-09 15:42:08,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2219 transitions. [2020-10-09 15:42:08,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:08,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2219 transitions. [2020-10-09 15:42:08,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:08,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:08,979 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:08,979 INFO L185 Difference]: Start difference. First operand has 724 places, 735 transitions, 1650 flow. Second operand 3 states and 2219 transitions. [2020-10-09 15:42:08,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 726 places, 735 transitions, 1662 flow [2020-10-09 15:42:08,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 725 places, 735 transitions, 1657 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:08,986 INFO L241 Difference]: Finished difference. Result has 727 places, 735 transitions, 1655 flow [2020-10-09 15:42:08,986 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=723, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1655, PETRI_PLACES=727, PETRI_TRANSITIONS=735} [2020-10-09 15:42:08,986 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 10 predicate places. [2020-10-09 15:42:08,986 INFO L481 AbstractCegarLoop]: Abstraction has has 727 places, 735 transitions, 1655 flow [2020-10-09 15:42:08,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:08,986 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:08,986 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:42:09,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1143 mathsat -unsat_core_generation=3 [2020-10-09 15:42:09,187 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:09,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:09,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1476767287, now seen corresponding path program 1 times [2020-10-09 15:42:09,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:09,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604919262] [2020-10-09 15:42:09,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1144 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1144 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:09,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:42:09,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:42:09,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:42:09,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604919262] [2020-10-09 15:42:09,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:09,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:09,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738158098] [2020-10-09 15:42:09,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:09,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:09,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:09,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:09,836 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2020-10-09 15:42:09,836 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 727 places, 735 transitions, 1655 flow. Second operand 3 states. [2020-10-09 15:42:09,837 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:09,837 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2020-10-09 15:42:09,837 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:10,103 INFO L129 PetriNetUnfolder]: 75/824 cut-off events. [2020-10-09 15:42:10,104 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2020-10-09 15:42:10,156 INFO L80 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 824 events. 75/824 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3329 event pairs, 0 based on Foata normal form. 1/723 useless extension candidates. Maximal degree in co-relation 923. Up to 29 conditions per place. [2020-10-09 15:42:10,169 INFO L132 encePairwiseOnDemand]: 771/773 looper letters, 4 selfloop transitions, 1 changer transitions 0/732 dead transitions. [2020-10-09 15:42:10,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 729 places, 732 transitions, 1650 flow [2020-10-09 15:42:10,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:10,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2220 transitions. [2020-10-09 15:42:10,171 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9573091849935317 [2020-10-09 15:42:10,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2220 transitions. [2020-10-09 15:42:10,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2220 transitions. [2020-10-09 15:42:10,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:10,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2220 transitions. [2020-10-09 15:42:10,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:10,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:10,174 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:10,174 INFO L185 Difference]: Start difference. First operand has 727 places, 735 transitions, 1655 flow. Second operand 3 states and 2220 transitions. [2020-10-09 15:42:10,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 729 places, 732 transitions, 1650 flow [2020-10-09 15:42:10,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 726 places, 732 transitions, 1643 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:42:10,181 INFO L241 Difference]: Finished difference. Result has 726 places, 732 transitions, 1635 flow [2020-10-09 15:42:10,181 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=724, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=731, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1635, PETRI_PLACES=726, PETRI_TRANSITIONS=732} [2020-10-09 15:42:10,181 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 9 predicate places. [2020-10-09 15:42:10,181 INFO L481 AbstractCegarLoop]: Abstraction has has 726 places, 732 transitions, 1635 flow [2020-10-09 15:42:10,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:10,181 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:10,181 INFO L255 CegarLoopForPetriNet]: trace histogram [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] [2020-10-09 15:42:10,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1144 mathsat -unsat_core_generation=3 [2020-10-09 15:42:10,382 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:10,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:10,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1476768310, now seen corresponding path program 1 times [2020-10-09 15:42:10,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:10,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162851943] [2020-10-09 15:42:10,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1145 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1145 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:11,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:11,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:42:11,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:11,008 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-09 15:42:11,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162851943] [2020-10-09 15:42:11,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:11,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:11,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119263441] [2020-10-09 15:42:11,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:11,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:11,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:11,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:11,028 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 773 [2020-10-09 15:42:11,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 726 places, 732 transitions, 1635 flow. Second operand 3 states. [2020-10-09 15:42:11,029 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:11,029 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 773 [2020-10-09 15:42:11,029 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:11,293 INFO L129 PetriNetUnfolder]: 75/822 cut-off events. [2020-10-09 15:42:11,293 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:42:11,346 INFO L80 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 822 events. 75/822 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3319 event pairs, 0 based on Foata normal form. 0/719 useless extension candidates. Maximal degree in co-relation 925. Up to 29 conditions per place. [2020-10-09 15:42:11,359 INFO L132 encePairwiseOnDemand]: 771/773 looper letters, 8 selfloop transitions, 1 changer transitions 0/730 dead transitions. [2020-10-09 15:42:11,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 726 places, 730 transitions, 1648 flow [2020-10-09 15:42:11,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:11,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:11,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2206 transitions. [2020-10-09 15:42:11,361 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.951272100043122 [2020-10-09 15:42:11,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2206 transitions. [2020-10-09 15:42:11,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2206 transitions. [2020-10-09 15:42:11,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:11,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2206 transitions. [2020-10-09 15:42:11,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:11,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:11,363 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:11,363 INFO L185 Difference]: Start difference. First operand has 726 places, 732 transitions, 1635 flow. Second operand 3 states and 2206 transitions. [2020-10-09 15:42:11,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 726 places, 730 transitions, 1648 flow [2020-10-09 15:42:11,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 725 places, 730 transitions, 1647 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:11,369 INFO L241 Difference]: Finished difference. Result has 725 places, 730 transitions, 1631 flow [2020-10-09 15:42:11,370 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=723, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1631, PETRI_PLACES=725, PETRI_TRANSITIONS=730} [2020-10-09 15:42:11,370 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 8 predicate places. [2020-10-09 15:42:11,370 INFO L481 AbstractCegarLoop]: Abstraction has has 725 places, 730 transitions, 1631 flow [2020-10-09 15:42:11,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:11,370 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:11,370 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:42:11,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1145 mathsat -unsat_core_generation=3 [2020-10-09 15:42:11,571 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:11,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:11,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2020984588, now seen corresponding path program 1 times [2020-10-09 15:42:11,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:11,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414625571] [2020-10-09 15:42:11,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1146 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1146 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:12,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:12,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:42:12,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:12,195 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:42:12,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414625571] [2020-10-09 15:42:12,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:12,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:12,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940299482] [2020-10-09 15:42:12,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:12,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:12,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:12,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:12,214 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 773 [2020-10-09 15:42:12,215 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 725 places, 730 transitions, 1631 flow. Second operand 3 states. [2020-10-09 15:42:12,215 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:12,215 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 773 [2020-10-09 15:42:12,215 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:12,477 INFO L129 PetriNetUnfolder]: 73/827 cut-off events. [2020-10-09 15:42:12,477 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:42:12,528 INFO L80 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 827 events. 73/827 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3366 event pairs, 0 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 928. Up to 29 conditions per place. [2020-10-09 15:42:12,541 INFO L132 encePairwiseOnDemand]: 770/773 looper letters, 5 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2020-10-09 15:42:12,541 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 727 places, 731 transitions, 1647 flow [2020-10-09 15:42:12,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2219 transitions. [2020-10-09 15:42:12,542 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956877964639931 [2020-10-09 15:42:12,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2219 transitions. [2020-10-09 15:42:12,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2219 transitions. [2020-10-09 15:42:12,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:12,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2219 transitions. [2020-10-09 15:42:12,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:12,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:12,545 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:12,545 INFO L185 Difference]: Start difference. First operand has 725 places, 730 transitions, 1631 flow. Second operand 3 states and 2219 transitions. [2020-10-09 15:42:12,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 727 places, 731 transitions, 1647 flow [2020-10-09 15:42:12,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 726 places, 731 transitions, 1646 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:12,551 INFO L241 Difference]: Finished difference. Result has 728 places, 731 transitions, 1644 flow [2020-10-09 15:42:12,552 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=724, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1644, PETRI_PLACES=728, PETRI_TRANSITIONS=731} [2020-10-09 15:42:12,552 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 11 predicate places. [2020-10-09 15:42:12,552 INFO L481 AbstractCegarLoop]: Abstraction has has 728 places, 731 transitions, 1644 flow [2020-10-09 15:42:12,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:12,552 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:12,552 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:42:12,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1146 mathsat -unsat_core_generation=3 [2020-10-09 15:42:12,753 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:12,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:12,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2020983565, now seen corresponding path program 1 times [2020-10-09 15:42:12,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:12,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348147878] [2020-10-09 15:42:12,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1147 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1147 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:13,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:13,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:42:13,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:42:13,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348147878] [2020-10-09 15:42:13,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:13,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:13,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390506541] [2020-10-09 15:42:13,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:13,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:13,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:13,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:13,401 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 773 [2020-10-09 15:42:13,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 728 places, 731 transitions, 1644 flow. Second operand 3 states. [2020-10-09 15:42:13,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:13,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 773 [2020-10-09 15:42:13,402 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:13,674 INFO L129 PetriNetUnfolder]: 73/828 cut-off events. [2020-10-09 15:42:13,674 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:42:13,726 INFO L80 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 828 events. 73/828 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3377 event pairs, 0 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 936. Up to 29 conditions per place. [2020-10-09 15:42:13,738 INFO L132 encePairwiseOnDemand]: 769/773 looper letters, 9 selfloop transitions, 3 changer transitions 0/732 dead transitions. [2020-10-09 15:42:13,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 730 places, 732 transitions, 1670 flow [2020-10-09 15:42:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:13,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:13,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2209 transitions. [2020-10-09 15:42:13,740 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9525657611039241 [2020-10-09 15:42:13,740 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2209 transitions. [2020-10-09 15:42:13,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2209 transitions. [2020-10-09 15:42:13,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:13,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2209 transitions. [2020-10-09 15:42:13,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:13,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:13,742 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:13,742 INFO L185 Difference]: Start difference. First operand has 728 places, 731 transitions, 1644 flow. Second operand 3 states and 2209 transitions. [2020-10-09 15:42:13,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 730 places, 732 transitions, 1670 flow [2020-10-09 15:42:13,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 729 places, 732 transitions, 1668 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:13,749 INFO L241 Difference]: Finished difference. Result has 731 places, 732 transitions, 1660 flow [2020-10-09 15:42:13,749 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1642, PETRI_DIFFERENCE_MINUEND_PLACES=727, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1660, PETRI_PLACES=731, PETRI_TRANSITIONS=732} [2020-10-09 15:42:13,749 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 14 predicate places. [2020-10-09 15:42:13,749 INFO L481 AbstractCegarLoop]: Abstraction has has 731 places, 732 transitions, 1660 flow [2020-10-09 15:42:13,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:13,750 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:13,750 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:42:13,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1147 mathsat -unsat_core_generation=3 [2020-10-09 15:42:13,950 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:13,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:13,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2021937900, now seen corresponding path program 1 times [2020-10-09 15:42:13,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:13,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912400771] [2020-10-09 15:42:13,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1148 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1148 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:14,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:14,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:14,576 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:42:14,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:42:14,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912400771] [2020-10-09 15:42:14,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:14,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:14,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766592321] [2020-10-09 15:42:14,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:14,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:14,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:14,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:14,597 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 773 [2020-10-09 15:42:14,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 731 places, 732 transitions, 1660 flow. Second operand 3 states. [2020-10-09 15:42:14,599 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:14,599 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 773 [2020-10-09 15:42:14,599 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:14,867 INFO L129 PetriNetUnfolder]: 72/825 cut-off events. [2020-10-09 15:42:14,867 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2020-10-09 15:42:14,919 INFO L80 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 825 events. 72/825 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3354 event pairs, 0 based on Foata normal form. 2/727 useless extension candidates. Maximal degree in co-relation 935. Up to 29 conditions per place. [2020-10-09 15:42:14,931 INFO L132 encePairwiseOnDemand]: 770/773 looper letters, 9 selfloop transitions, 1 changer transitions 0/730 dead transitions. [2020-10-09 15:42:14,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 733 places, 730 transitions, 1668 flow [2020-10-09 15:42:14,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2208 transitions. [2020-10-09 15:42:14,932 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9521345407503234 [2020-10-09 15:42:14,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2208 transitions. [2020-10-09 15:42:14,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2208 transitions. [2020-10-09 15:42:14,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:14,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2208 transitions. [2020-10-09 15:42:14,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:14,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:14,935 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:14,935 INFO L185 Difference]: Start difference. First operand has 731 places, 732 transitions, 1660 flow. Second operand 3 states and 2208 transitions. [2020-10-09 15:42:14,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 733 places, 730 transitions, 1668 flow [2020-10-09 15:42:14,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 732 places, 730 transitions, 1667 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:14,941 INFO L241 Difference]: Finished difference. Result has 732 places, 730 transitions, 1649 flow [2020-10-09 15:42:14,942 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=730, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1649, PETRI_PLACES=732, PETRI_TRANSITIONS=730} [2020-10-09 15:42:14,942 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 15 predicate places. [2020-10-09 15:42:14,942 INFO L481 AbstractCegarLoop]: Abstraction has has 732 places, 730 transitions, 1649 flow [2020-10-09 15:42:14,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:14,942 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:14,942 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2020-10-09 15:42:15,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1148 mathsat -unsat_core_generation=3 [2020-10-09 15:42:15,143 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:15,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:15,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2021936877, now seen corresponding path program 1 times [2020-10-09 15:42:15,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:15,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81529879] [2020-10-09 15:42:15,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1149 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1149 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:15,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:42:15,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:42:15,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-09 15:42:15,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81529879] [2020-10-09 15:42:15,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:15,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:15,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510290621] [2020-10-09 15:42:15,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:15,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:15,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:15,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:15,787 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2020-10-09 15:42:15,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 732 places, 730 transitions, 1649 flow. Second operand 3 states. [2020-10-09 15:42:15,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:15,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2020-10-09 15:42:15,788 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:16,052 INFO L129 PetriNetUnfolder]: 72/822 cut-off events. [2020-10-09 15:42:16,052 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:42:16,103 INFO L80 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 822 events. 72/822 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3334 event pairs, 0 based on Foata normal form. 1/724 useless extension candidates. Maximal degree in co-relation 929. Up to 29 conditions per place. [2020-10-09 15:42:16,115 INFO L132 encePairwiseOnDemand]: 771/773 looper letters, 4 selfloop transitions, 1 changer transitions 0/727 dead transitions. [2020-10-09 15:42:16,115 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 732 places, 727 transitions, 1648 flow [2020-10-09 15:42:16,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:16,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2220 transitions. [2020-10-09 15:42:16,116 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9573091849935317 [2020-10-09 15:42:16,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2220 transitions. [2020-10-09 15:42:16,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2220 transitions. [2020-10-09 15:42:16,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:16,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2220 transitions. [2020-10-09 15:42:16,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:16,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:16,119 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:16,119 INFO L185 Difference]: Start difference. First operand has 732 places, 730 transitions, 1649 flow. Second operand 3 states and 2220 transitions. [2020-10-09 15:42:16,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 732 places, 727 transitions, 1648 flow [2020-10-09 15:42:16,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 729 places, 727 transitions, 1643 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:42:16,126 INFO L241 Difference]: Finished difference. Result has 729 places, 727 transitions, 1635 flow [2020-10-09 15:42:16,126 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=727, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1635, PETRI_PLACES=729, PETRI_TRANSITIONS=727} [2020-10-09 15:42:16,126 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 12 predicate places. [2020-10-09 15:42:16,127 INFO L481 AbstractCegarLoop]: Abstraction has has 729 places, 727 transitions, 1635 flow [2020-10-09 15:42:16,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:16,127 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:16,127 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:42:16,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1149 mathsat -unsat_core_generation=3 [2020-10-09 15:42:16,327 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:16,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:16,328 INFO L82 PathProgramCache]: Analyzing trace with hash -134724444, now seen corresponding path program 1 times [2020-10-09 15:42:16,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:16,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260698086] [2020-10-09 15:42:16,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1150 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1150 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:16,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:42:16,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:42:16,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:42:17,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260698086] [2020-10-09 15:42:17,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:17,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:17,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107391870] [2020-10-09 15:42:17,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:17,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:17,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:17,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:17,022 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2020-10-09 15:42:17,023 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 729 places, 727 transitions, 1635 flow. Second operand 3 states. [2020-10-09 15:42:17,023 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:17,023 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2020-10-09 15:42:17,024 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:17,288 INFO L129 PetriNetUnfolder]: 71/829 cut-off events. [2020-10-09 15:42:17,288 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:42:17,339 INFO L80 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 829 events. 71/829 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3393 event pairs, 0 based on Foata normal form. 1/730 useless extension candidates. Maximal degree in co-relation 937. Up to 29 conditions per place. [2020-10-09 15:42:17,351 INFO L132 encePairwiseOnDemand]: 771/773 looper letters, 4 selfloop transitions, 1 changer transitions 0/727 dead transitions. [2020-10-09 15:42:17,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 727 transitions, 1645 flow [2020-10-09 15:42:17,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2220 transitions. [2020-10-09 15:42:17,353 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9573091849935317 [2020-10-09 15:42:17,353 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2220 transitions. [2020-10-09 15:42:17,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2220 transitions. [2020-10-09 15:42:17,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:17,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2220 transitions. [2020-10-09 15:42:17,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:17,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:17,355 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:17,356 INFO L185 Difference]: Start difference. First operand has 729 places, 727 transitions, 1635 flow. Second operand 3 states and 2220 transitions. [2020-10-09 15:42:17,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 731 places, 727 transitions, 1645 flow [2020-10-09 15:42:17,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 730 places, 727 transitions, 1644 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:17,362 INFO L241 Difference]: Finished difference. Result has 731 places, 727 transitions, 1639 flow [2020-10-09 15:42:17,362 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1634, PETRI_DIFFERENCE_MINUEND_PLACES=728, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1639, PETRI_PLACES=731, PETRI_TRANSITIONS=727} [2020-10-09 15:42:17,362 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 14 predicate places. [2020-10-09 15:42:17,362 INFO L481 AbstractCegarLoop]: Abstraction has has 731 places, 727 transitions, 1639 flow [2020-10-09 15:42:17,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:17,363 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:17,363 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:42:17,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1150 mathsat -unsat_core_generation=3 [2020-10-09 15:42:17,563 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:17,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:17,564 INFO L82 PathProgramCache]: Analyzing trace with hash -134723421, now seen corresponding path program 1 times [2020-10-09 15:42:17,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:17,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741840634] [2020-10-09 15:42:17,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1151 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1151 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:18,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:18,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:42:18,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:42:18,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741840634] [2020-10-09 15:42:18,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:18,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:18,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059075896] [2020-10-09 15:42:18,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:18,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:18,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:18,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:18,226 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 773 [2020-10-09 15:42:18,227 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 731 places, 727 transitions, 1639 flow. Second operand 3 states. [2020-10-09 15:42:18,227 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:18,227 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 773 [2020-10-09 15:42:18,227 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:18,499 INFO L129 PetriNetUnfolder]: 69/831 cut-off events. [2020-10-09 15:42:18,499 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:42:18,552 INFO L80 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 831 events. 69/831 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3429 event pairs, 0 based on Foata normal form. 0/732 useless extension candidates. Maximal degree in co-relation 948. Up to 29 conditions per place. [2020-10-09 15:42:18,563 INFO L132 encePairwiseOnDemand]: 769/773 looper letters, 9 selfloop transitions, 3 changer transitions 0/728 dead transitions. [2020-10-09 15:42:18,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 733 places, 728 transitions, 1665 flow [2020-10-09 15:42:18,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:18,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2209 transitions. [2020-10-09 15:42:18,565 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9525657611039241 [2020-10-09 15:42:18,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2209 transitions. [2020-10-09 15:42:18,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2209 transitions. [2020-10-09 15:42:18,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:18,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2209 transitions. [2020-10-09 15:42:18,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:18,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:18,568 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:18,568 INFO L185 Difference]: Start difference. First operand has 731 places, 727 transitions, 1639 flow. Second operand 3 states and 2209 transitions. [2020-10-09 15:42:18,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 733 places, 728 transitions, 1665 flow [2020-10-09 15:42:18,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 732 places, 728 transitions, 1664 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:18,575 INFO L241 Difference]: Finished difference. Result has 734 places, 728 transitions, 1656 flow [2020-10-09 15:42:18,575 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1638, PETRI_DIFFERENCE_MINUEND_PLACES=730, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1656, PETRI_PLACES=734, PETRI_TRANSITIONS=728} [2020-10-09 15:42:18,575 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 17 predicate places. [2020-10-09 15:42:18,575 INFO L481 AbstractCegarLoop]: Abstraction has has 734 places, 728 transitions, 1656 flow [2020-10-09 15:42:18,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:18,575 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:18,575 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:42:18,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1151 mathsat -unsat_core_generation=3 [2020-10-09 15:42:18,776 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:18,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:18,776 INFO L82 PathProgramCache]: Analyzing trace with hash -135676733, now seen corresponding path program 1 times [2020-10-09 15:42:18,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:18,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839041301] [2020-10-09 15:42:18,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1152 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1152 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:19,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:19,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:42:19,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:19,406 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:42:19,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839041301] [2020-10-09 15:42:19,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:19,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:19,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104837170] [2020-10-09 15:42:19,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:19,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:19,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:19,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:19,425 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 773 [2020-10-09 15:42:19,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 734 places, 728 transitions, 1656 flow. Second operand 3 states. [2020-10-09 15:42:19,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:19,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 773 [2020-10-09 15:42:19,426 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:19,692 INFO L129 PetriNetUnfolder]: 69/824 cut-off events. [2020-10-09 15:42:19,692 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-10-09 15:42:19,744 INFO L80 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 824 events. 69/824 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3364 event pairs, 0 based on Foata normal form. 1/729 useless extension candidates. Maximal degree in co-relation 934. Up to 29 conditions per place. [2020-10-09 15:42:19,755 INFO L132 encePairwiseOnDemand]: 771/773 looper letters, 5 selfloop transitions, 1 changer transitions 0/726 dead transitions. [2020-10-09 15:42:19,755 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 736 places, 726 transitions, 1658 flow [2020-10-09 15:42:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2020-10-09 15:42:19,757 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9564467442863304 [2020-10-09 15:42:19,757 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2020-10-09 15:42:19,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2020-10-09 15:42:19,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:19,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2020-10-09 15:42:19,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:19,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:19,759 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:19,759 INFO L185 Difference]: Start difference. First operand has 734 places, 728 transitions, 1656 flow. Second operand 3 states and 2218 transitions. [2020-10-09 15:42:19,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 736 places, 726 transitions, 1658 flow [2020-10-09 15:42:19,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 733 places, 726 transitions, 1650 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:42:19,766 INFO L241 Difference]: Finished difference. Result has 734 places, 726 transitions, 1643 flow [2020-10-09 15:42:19,766 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1638, PETRI_DIFFERENCE_MINUEND_PLACES=731, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=734, PETRI_TRANSITIONS=726} [2020-10-09 15:42:19,766 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 17 predicate places. [2020-10-09 15:42:19,766 INFO L481 AbstractCegarLoop]: Abstraction has has 734 places, 726 transitions, 1643 flow [2020-10-09 15:42:19,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:19,766 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:19,766 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:42:19,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1152 mathsat -unsat_core_generation=3 [2020-10-09 15:42:19,967 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:19,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:19,967 INFO L82 PathProgramCache]: Analyzing trace with hash -135677756, now seen corresponding path program 1 times [2020-10-09 15:42:19,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:19,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333747028] [2020-10-09 15:42:19,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1153 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1153 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:20,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:20,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:42:20,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-09 15:42:20,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333747028] [2020-10-09 15:42:20,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:20,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:20,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721560559] [2020-10-09 15:42:20,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:20,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:20,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:20,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:20,638 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 773 [2020-10-09 15:42:20,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 734 places, 726 transitions, 1643 flow. Second operand 3 states. [2020-10-09 15:42:20,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:20,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 773 [2020-10-09 15:42:20,640 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:20,905 INFO L129 PetriNetUnfolder]: 69/822 cut-off events. [2020-10-09 15:42:20,905 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:42:20,956 INFO L80 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 822 events. 69/822 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3351 event pairs, 0 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 938. Up to 29 conditions per place. [2020-10-09 15:42:20,967 INFO L132 encePairwiseOnDemand]: 771/773 looper letters, 8 selfloop transitions, 1 changer transitions 0/724 dead transitions. [2020-10-09 15:42:20,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 734 places, 724 transitions, 1656 flow [2020-10-09 15:42:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:20,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2206 transitions. [2020-10-09 15:42:20,969 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.951272100043122 [2020-10-09 15:42:20,969 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2206 transitions. [2020-10-09 15:42:20,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2206 transitions. [2020-10-09 15:42:20,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:20,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2206 transitions. [2020-10-09 15:42:20,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:20,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:20,971 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:20,971 INFO L185 Difference]: Start difference. First operand has 734 places, 726 transitions, 1643 flow. Second operand 3 states and 2206 transitions. [2020-10-09 15:42:20,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 734 places, 724 transitions, 1656 flow [2020-10-09 15:42:20,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 733 places, 724 transitions, 1655 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:20,978 INFO L241 Difference]: Finished difference. Result has 733 places, 724 transitions, 1639 flow [2020-10-09 15:42:20,978 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=731, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1639, PETRI_PLACES=733, PETRI_TRANSITIONS=724} [2020-10-09 15:42:20,978 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 16 predicate places. [2020-10-09 15:42:20,978 INFO L481 AbstractCegarLoop]: Abstraction has has 733 places, 724 transitions, 1639 flow [2020-10-09 15:42:20,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:20,978 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:20,978 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:42:21,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1153 mathsat -unsat_core_generation=3 [2020-10-09 15:42:21,179 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:21,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:21,179 INFO L82 PathProgramCache]: Analyzing trace with hash -569755909, now seen corresponding path program 1 times [2020-10-09 15:42:21,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:21,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087805965] [2020-10-09 15:42:21,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1154 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1154 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:21,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:21,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:42:21,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:42:21,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087805965] [2020-10-09 15:42:21,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:21,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:21,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702161702] [2020-10-09 15:42:21,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:21,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:21,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:21,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:21,827 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 773 [2020-10-09 15:42:21,828 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 733 places, 724 transitions, 1639 flow. Second operand 3 states. [2020-10-09 15:42:21,828 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:21,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 773 [2020-10-09 15:42:21,829 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:22,087 INFO L129 PetriNetUnfolder]: 67/827 cut-off events. [2020-10-09 15:42:22,087 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:42:22,137 INFO L80 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 827 events. 67/827 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3403 event pairs, 0 based on Foata normal form. 0/731 useless extension candidates. Maximal degree in co-relation 941. Up to 29 conditions per place. [2020-10-09 15:42:22,148 INFO L132 encePairwiseOnDemand]: 770/773 looper letters, 5 selfloop transitions, 2 changer transitions 0/725 dead transitions. [2020-10-09 15:42:22,148 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 735 places, 725 transitions, 1655 flow [2020-10-09 15:42:22,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:22,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2219 transitions. [2020-10-09 15:42:22,149 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956877964639931 [2020-10-09 15:42:22,149 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2219 transitions. [2020-10-09 15:42:22,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2219 transitions. [2020-10-09 15:42:22,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:22,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2219 transitions. [2020-10-09 15:42:22,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:22,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:22,152 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:22,152 INFO L185 Difference]: Start difference. First operand has 733 places, 724 transitions, 1639 flow. Second operand 3 states and 2219 transitions. [2020-10-09 15:42:22,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 735 places, 725 transitions, 1655 flow [2020-10-09 15:42:22,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 734 places, 725 transitions, 1654 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:22,158 INFO L241 Difference]: Finished difference. Result has 736 places, 725 transitions, 1652 flow [2020-10-09 15:42:22,158 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1638, PETRI_DIFFERENCE_MINUEND_PLACES=732, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1652, PETRI_PLACES=736, PETRI_TRANSITIONS=725} [2020-10-09 15:42:22,158 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 19 predicate places. [2020-10-09 15:42:22,158 INFO L481 AbstractCegarLoop]: Abstraction has has 736 places, 725 transitions, 1652 flow [2020-10-09 15:42:22,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:22,159 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:22,159 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:42:22,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1154 mathsat -unsat_core_generation=3 [2020-10-09 15:42:22,359 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:22,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:22,360 INFO L82 PathProgramCache]: Analyzing trace with hash -569756932, now seen corresponding path program 1 times [2020-10-09 15:42:22,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:22,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4750612] [2020-10-09 15:42:22,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1155 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1155 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:22,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:22,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:22,983 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:42:22,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:42:22,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4750612] [2020-10-09 15:42:22,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:22,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:22,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866889659] [2020-10-09 15:42:22,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:22,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:22,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:22,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:23,014 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 773 [2020-10-09 15:42:23,015 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 736 places, 725 transitions, 1652 flow. Second operand 3 states. [2020-10-09 15:42:23,015 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:23,015 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 773 [2020-10-09 15:42:23,015 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:23,305 INFO L129 PetriNetUnfolder]: 67/828 cut-off events. [2020-10-09 15:42:23,305 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-09 15:42:23,359 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 828 events. 67/828 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3411 event pairs, 0 based on Foata normal form. 0/732 useless extension candidates. Maximal degree in co-relation 949. Up to 29 conditions per place. [2020-10-09 15:42:23,370 INFO L132 encePairwiseOnDemand]: 769/773 looper letters, 9 selfloop transitions, 3 changer transitions 0/726 dead transitions. [2020-10-09 15:42:23,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 738 places, 726 transitions, 1678 flow [2020-10-09 15:42:23,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:23,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:23,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2209 transitions. [2020-10-09 15:42:23,372 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9525657611039241 [2020-10-09 15:42:23,372 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2209 transitions. [2020-10-09 15:42:23,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2209 transitions. [2020-10-09 15:42:23,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:23,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2209 transitions. [2020-10-09 15:42:23,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:23,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:23,374 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:23,374 INFO L185 Difference]: Start difference. First operand has 736 places, 725 transitions, 1652 flow. Second operand 3 states and 2209 transitions. [2020-10-09 15:42:23,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 738 places, 726 transitions, 1678 flow [2020-10-09 15:42:23,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 737 places, 726 transitions, 1676 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:23,381 INFO L241 Difference]: Finished difference. Result has 739 places, 726 transitions, 1668 flow [2020-10-09 15:42:23,381 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1650, PETRI_DIFFERENCE_MINUEND_PLACES=735, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1668, PETRI_PLACES=739, PETRI_TRANSITIONS=726} [2020-10-09 15:42:23,381 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 22 predicate places. [2020-10-09 15:42:23,381 INFO L481 AbstractCegarLoop]: Abstraction has has 739 places, 726 transitions, 1668 flow [2020-10-09 15:42:23,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:23,382 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:23,382 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:42:23,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1155 mathsat -unsat_core_generation=3 [2020-10-09 15:42:23,582 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:23,583 INFO L82 PathProgramCache]: Analyzing trace with hash -568802597, now seen corresponding path program 1 times [2020-10-09 15:42:23,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:23,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488617352] [2020-10-09 15:42:23,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1156 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1156 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:24,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:24,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:42:24,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:24,216 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:42:24,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488617352] [2020-10-09 15:42:24,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:24,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:24,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207992419] [2020-10-09 15:42:24,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:24,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:24,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:24,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:24,246 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 773 [2020-10-09 15:42:24,247 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 739 places, 726 transitions, 1668 flow. Second operand 3 states. [2020-10-09 15:42:24,247 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:24,247 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 773 [2020-10-09 15:42:24,247 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:24,535 INFO L129 PetriNetUnfolder]: 66/825 cut-off events. [2020-10-09 15:42:24,535 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2020-10-09 15:42:24,591 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 825 events. 66/825 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3390 event pairs, 0 based on Foata normal form. 2/733 useless extension candidates. Maximal degree in co-relation 948. Up to 29 conditions per place. [2020-10-09 15:42:24,602 INFO L132 encePairwiseOnDemand]: 770/773 looper letters, 9 selfloop transitions, 1 changer transitions 0/724 dead transitions. [2020-10-09 15:42:24,602 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 741 places, 724 transitions, 1676 flow [2020-10-09 15:42:24,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2208 transitions. [2020-10-09 15:42:24,603 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9521345407503234 [2020-10-09 15:42:24,603 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2208 transitions. [2020-10-09 15:42:24,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2208 transitions. [2020-10-09 15:42:24,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:24,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2208 transitions. [2020-10-09 15:42:24,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:24,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:24,605 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:24,606 INFO L185 Difference]: Start difference. First operand has 739 places, 726 transitions, 1668 flow. Second operand 3 states and 2208 transitions. [2020-10-09 15:42:24,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 741 places, 724 transitions, 1676 flow [2020-10-09 15:42:24,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 740 places, 724 transitions, 1675 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:24,612 INFO L241 Difference]: Finished difference. Result has 740 places, 724 transitions, 1657 flow [2020-10-09 15:42:24,613 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1655, PETRI_DIFFERENCE_MINUEND_PLACES=738, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1657, PETRI_PLACES=740, PETRI_TRANSITIONS=724} [2020-10-09 15:42:24,613 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 23 predicate places. [2020-10-09 15:42:24,613 INFO L481 AbstractCegarLoop]: Abstraction has has 740 places, 724 transitions, 1657 flow [2020-10-09 15:42:24,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:24,613 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:24,613 INFO L255 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:42:24,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1156 mathsat -unsat_core_generation=3 [2020-10-09 15:42:24,814 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:24,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:24,814 INFO L82 PathProgramCache]: Analyzing trace with hash -568803620, now seen corresponding path program 1 times [2020-10-09 15:42:24,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:24,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071860197] [2020-10-09 15:42:24,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1157 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1157 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:25,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:42:25,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:42:25,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-09 15:42:25,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071860197] [2020-10-09 15:42:25,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:25,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:25,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943809814] [2020-10-09 15:42:25,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:25,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:25,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:25,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:25,468 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2020-10-09 15:42:25,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 740 places, 724 transitions, 1657 flow. Second operand 3 states. [2020-10-09 15:42:25,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:25,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2020-10-09 15:42:25,469 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:25,751 INFO L129 PetriNetUnfolder]: 66/822 cut-off events. [2020-10-09 15:42:25,752 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-09 15:42:25,806 INFO L80 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 822 events. 66/822 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3369 event pairs, 0 based on Foata normal form. 1/730 useless extension candidates. Maximal degree in co-relation 942. Up to 29 conditions per place. [2020-10-09 15:42:25,817 INFO L132 encePairwiseOnDemand]: 771/773 looper letters, 4 selfloop transitions, 1 changer transitions 0/721 dead transitions. [2020-10-09 15:42:25,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 740 places, 721 transitions, 1656 flow [2020-10-09 15:42:25,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:25,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2220 transitions. [2020-10-09 15:42:25,818 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9573091849935317 [2020-10-09 15:42:25,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2220 transitions. [2020-10-09 15:42:25,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2220 transitions. [2020-10-09 15:42:25,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:25,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2220 transitions. [2020-10-09 15:42:25,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:25,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:25,821 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:25,821 INFO L185 Difference]: Start difference. First operand has 740 places, 724 transitions, 1657 flow. Second operand 3 states and 2220 transitions. [2020-10-09 15:42:25,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 740 places, 721 transitions, 1656 flow [2020-10-09 15:42:25,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 737 places, 721 transitions, 1651 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:42:25,828 INFO L241 Difference]: Finished difference. Result has 737 places, 721 transitions, 1643 flow [2020-10-09 15:42:25,828 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=735, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=737, PETRI_TRANSITIONS=721} [2020-10-09 15:42:25,828 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 20 predicate places. [2020-10-09 15:42:25,828 INFO L481 AbstractCegarLoop]: Abstraction has has 737 places, 721 transitions, 1643 flow [2020-10-09 15:42:25,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:25,828 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:25,828 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:42:26,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1157 mathsat -unsat_core_generation=3 [2020-10-09 15:42:26,029 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:26,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:26,029 INFO L82 PathProgramCache]: Analyzing trace with hash 925657909, now seen corresponding path program 1 times [2020-10-09 15:42:26,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:26,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773124280] [2020-10-09 15:42:26,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1158 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1158 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:26,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:26,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:42:26,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:42:26,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773124280] [2020-10-09 15:42:26,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:26,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:26,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112435258] [2020-10-09 15:42:26,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:26,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:26,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:26,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:26,760 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 773 [2020-10-09 15:42:26,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 737 places, 721 transitions, 1643 flow. Second operand 3 states. [2020-10-09 15:42:26,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:26,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 773 [2020-10-09 15:42:26,762 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:27,048 INFO L129 PetriNetUnfolder]: 65/830 cut-off events. [2020-10-09 15:42:27,048 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:42:27,102 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 830 events. 65/830 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3439 event pairs, 0 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 959. Up to 29 conditions per place. [2020-10-09 15:42:27,112 INFO L132 encePairwiseOnDemand]: 768/773 looper letters, 10 selfloop transitions, 3 changer transitions 0/723 dead transitions. [2020-10-09 15:42:27,112 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 739 places, 723 transitions, 1673 flow [2020-10-09 15:42:27,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:27,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2211 transitions. [2020-10-09 15:42:27,114 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9534282018111255 [2020-10-09 15:42:27,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2211 transitions. [2020-10-09 15:42:27,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2211 transitions. [2020-10-09 15:42:27,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:27,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2211 transitions. [2020-10-09 15:42:27,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:27,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:27,116 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:27,116 INFO L185 Difference]: Start difference. First operand has 737 places, 721 transitions, 1643 flow. Second operand 3 states and 2211 transitions. [2020-10-09 15:42:27,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 739 places, 723 transitions, 1673 flow [2020-10-09 15:42:27,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 738 places, 723 transitions, 1672 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:27,123 INFO L241 Difference]: Finished difference. Result has 740 places, 723 transitions, 1666 flow [2020-10-09 15:42:27,123 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1642, PETRI_DIFFERENCE_MINUEND_PLACES=736, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=718, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1666, PETRI_PLACES=740, PETRI_TRANSITIONS=723} [2020-10-09 15:42:27,123 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 23 predicate places. [2020-10-09 15:42:27,123 INFO L481 AbstractCegarLoop]: Abstraction has has 740 places, 723 transitions, 1666 flow [2020-10-09 15:42:27,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:27,123 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:27,123 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:42:27,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1158 mathsat -unsat_core_generation=3 [2020-10-09 15:42:27,324 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:27,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:27,325 INFO L82 PathProgramCache]: Analyzing trace with hash 925658932, now seen corresponding path program 1 times [2020-10-09 15:42:27,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:27,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237497332] [2020-10-09 15:42:27,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1159 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1159 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:27,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:27,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:42:27,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:42:27,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237497332] [2020-10-09 15:42:27,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:27,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:27,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897201227] [2020-10-09 15:42:27,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:27,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:27,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:27,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:27,967 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 773 [2020-10-09 15:42:27,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 740 places, 723 transitions, 1666 flow. Second operand 3 states. [2020-10-09 15:42:27,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:27,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 773 [2020-10-09 15:42:27,968 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:28,250 INFO L129 PetriNetUnfolder]: 64/828 cut-off events. [2020-10-09 15:42:28,250 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-10-09 15:42:28,304 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 828 events. 64/828 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3426 event pairs, 0 based on Foata normal form. 0/737 useless extension candidates. Maximal degree in co-relation 954. Up to 29 conditions per place. [2020-10-09 15:42:28,314 INFO L132 encePairwiseOnDemand]: 770/773 looper letters, 5 selfloop transitions, 2 changer transitions 0/723 dead transitions. [2020-10-09 15:42:28,314 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 742 places, 723 transitions, 1678 flow [2020-10-09 15:42:28,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2219 transitions. [2020-10-09 15:42:28,316 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956877964639931 [2020-10-09 15:42:28,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2219 transitions. [2020-10-09 15:42:28,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2219 transitions. [2020-10-09 15:42:28,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:28,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2219 transitions. [2020-10-09 15:42:28,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:28,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:28,318 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:28,318 INFO L185 Difference]: Start difference. First operand has 740 places, 723 transitions, 1666 flow. Second operand 3 states and 2219 transitions. [2020-10-09 15:42:28,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 742 places, 723 transitions, 1678 flow [2020-10-09 15:42:28,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 741 places, 723 transitions, 1673 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:28,325 INFO L241 Difference]: Finished difference. Result has 743 places, 723 transitions, 1671 flow [2020-10-09 15:42:28,325 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1657, PETRI_DIFFERENCE_MINUEND_PLACES=739, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1671, PETRI_PLACES=743, PETRI_TRANSITIONS=723} [2020-10-09 15:42:28,325 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 26 predicate places. [2020-10-09 15:42:28,325 INFO L481 AbstractCegarLoop]: Abstraction has has 743 places, 723 transitions, 1671 flow [2020-10-09 15:42:28,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:28,325 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:28,325 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:42:28,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1159 mathsat -unsat_core_generation=3 [2020-10-09 15:42:28,526 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:28,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:28,527 INFO L82 PathProgramCache]: Analyzing trace with hash 926611221, now seen corresponding path program 1 times [2020-10-09 15:42:28,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:28,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252864213] [2020-10-09 15:42:28,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1160 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1160 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:29,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-09 15:42:29,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:42:29,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:42:29,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252864213] [2020-10-09 15:42:29,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:29,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:29,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181770584] [2020-10-09 15:42:29,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:29,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:29,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:29,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:29,183 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2020-10-09 15:42:29,184 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 743 places, 723 transitions, 1671 flow. Second operand 3 states. [2020-10-09 15:42:29,185 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:29,185 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2020-10-09 15:42:29,185 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:29,469 INFO L129 PetriNetUnfolder]: 63/824 cut-off events. [2020-10-09 15:42:29,469 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2020-10-09 15:42:29,524 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 824 events. 63/824 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3400 event pairs, 0 based on Foata normal form. 1/735 useless extension candidates. Maximal degree in co-relation 950. Up to 29 conditions per place. [2020-10-09 15:42:29,535 INFO L132 encePairwiseOnDemand]: 771/773 looper letters, 4 selfloop transitions, 1 changer transitions 0/720 dead transitions. [2020-10-09 15:42:29,535 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 745 places, 720 transitions, 1666 flow [2020-10-09 15:42:29,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2220 transitions. [2020-10-09 15:42:29,536 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9573091849935317 [2020-10-09 15:42:29,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2220 transitions. [2020-10-09 15:42:29,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2220 transitions. [2020-10-09 15:42:29,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:29,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2220 transitions. [2020-10-09 15:42:29,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:29,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:29,539 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:29,539 INFO L185 Difference]: Start difference. First operand has 743 places, 723 transitions, 1671 flow. Second operand 3 states and 2220 transitions. [2020-10-09 15:42:29,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 745 places, 720 transitions, 1666 flow [2020-10-09 15:42:29,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 742 places, 720 transitions, 1659 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-09 15:42:29,546 INFO L241 Difference]: Finished difference. Result has 742 places, 720 transitions, 1651 flow [2020-10-09 15:42:29,546 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1649, PETRI_DIFFERENCE_MINUEND_PLACES=740, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1651, PETRI_PLACES=742, PETRI_TRANSITIONS=720} [2020-10-09 15:42:29,546 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 25 predicate places. [2020-10-09 15:42:29,546 INFO L481 AbstractCegarLoop]: Abstraction has has 742 places, 720 transitions, 1651 flow [2020-10-09 15:42:29,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:29,546 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:29,546 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:42:29,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1160 mathsat -unsat_core_generation=3 [2020-10-09 15:42:29,747 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:29,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:29,747 INFO L82 PathProgramCache]: Analyzing trace with hash 926612244, now seen corresponding path program 1 times [2020-10-09 15:42:29,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:29,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780666765] [2020-10-09 15:42:29,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1161 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1161 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:30,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:30,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:42:30,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-09 15:42:30,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780666765] [2020-10-09 15:42:30,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:30,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:30,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212690732] [2020-10-09 15:42:30,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:30,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:30,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:30,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:30,401 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 773 [2020-10-09 15:42:30,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 742 places, 720 transitions, 1651 flow. Second operand 3 states. [2020-10-09 15:42:30,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:30,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 773 [2020-10-09 15:42:30,403 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:30,702 INFO L129 PetriNetUnfolder]: 63/822 cut-off events. [2020-10-09 15:42:30,703 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:42:30,759 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 822 events. 63/822 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3387 event pairs, 0 based on Foata normal form. 0/731 useless extension candidates. Maximal degree in co-relation 952. Up to 29 conditions per place. [2020-10-09 15:42:30,769 INFO L132 encePairwiseOnDemand]: 771/773 looper letters, 8 selfloop transitions, 1 changer transitions 0/718 dead transitions. [2020-10-09 15:42:30,770 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 742 places, 718 transitions, 1664 flow [2020-10-09 15:42:30,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2206 transitions. [2020-10-09 15:42:30,771 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.951272100043122 [2020-10-09 15:42:30,771 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2206 transitions. [2020-10-09 15:42:30,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2206 transitions. [2020-10-09 15:42:30,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:30,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2206 transitions. [2020-10-09 15:42:30,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:30,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:30,773 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:30,773 INFO L185 Difference]: Start difference. First operand has 742 places, 720 transitions, 1651 flow. Second operand 3 states and 2206 transitions. [2020-10-09 15:42:30,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 742 places, 718 transitions, 1664 flow [2020-10-09 15:42:30,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 741 places, 718 transitions, 1663 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:30,781 INFO L241 Difference]: Finished difference. Result has 741 places, 718 transitions, 1647 flow [2020-10-09 15:42:30,781 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=739, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=717, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1647, PETRI_PLACES=741, PETRI_TRANSITIONS=718} [2020-10-09 15:42:30,781 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 24 predicate places. [2020-10-09 15:42:30,781 INFO L481 AbstractCegarLoop]: Abstraction has has 741 places, 718 transitions, 1647 flow [2020-10-09 15:42:30,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:30,781 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:30,782 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 15:42:30,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 1161 mathsat -unsat_core_generation=3 [2020-10-09 15:42:30,982 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 15:42:30,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 15:42:30,983 INFO L82 PathProgramCache]: Analyzing trace with hash 126655726, now seen corresponding path program 1 times [2020-10-09 15:42:30,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 15:42:30,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983124784] [2020-10-09 15:42:30,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 1162 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1162 with mathsat -unsat_core_generation=3 [2020-10-09 15:42:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 15:42:31,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-09 15:42:31,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 15:42:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:42:31,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 15:42:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-09 15:42:31,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983124784] [2020-10-09 15:42:31,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 15:42:31,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-09 15:42:31,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084110292] [2020-10-09 15:42:31,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 15:42:31,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 15:42:31,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 15:42:31,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 15:42:31,639 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 773 [2020-10-09 15:42:31,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 741 places, 718 transitions, 1647 flow. Second operand 3 states. [2020-10-09 15:42:31,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 15:42:31,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 773 [2020-10-09 15:42:31,640 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 15:42:31,936 INFO L129 PetriNetUnfolder]: 61/827 cut-off events. [2020-10-09 15:42:31,936 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 15:42:31,993 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 827 events. 61/827 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3439 event pairs, 0 based on Foata normal form. 0/737 useless extension candidates. Maximal degree in co-relation 955. Up to 29 conditions per place. [2020-10-09 15:42:32,004 INFO L132 encePairwiseOnDemand]: 770/773 looper letters, 5 selfloop transitions, 2 changer transitions 0/719 dead transitions. [2020-10-09 15:42:32,004 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 743 places, 719 transitions, 1663 flow [2020-10-09 15:42:32,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 15:42:32,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 15:42:32,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2219 transitions. [2020-10-09 15:42:32,006 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.956877964639931 [2020-10-09 15:42:32,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2219 transitions. [2020-10-09 15:42:32,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2219 transitions. [2020-10-09 15:42:32,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 15:42:32,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2219 transitions. [2020-10-09 15:42:32,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 15:42:32,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 15:42:32,009 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 15:42:32,009 INFO L185 Difference]: Start difference. First operand has 741 places, 718 transitions, 1647 flow. Second operand 3 states and 2219 transitions. [2020-10-09 15:42:32,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 743 places, 719 transitions, 1663 flow [2020-10-09 15:42:32,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 742 places, 719 transitions, 1662 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 15:42:32,017 INFO L241 Difference]: Finished difference. Result has 744 places, 719 transitions, 1660 flow [2020-10-09 15:42:32,017 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=740, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=716, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1660, PETRI_PLACES=744, PETRI_TRANSITIONS=719} [2020-10-09 15:42:32,017 INFO L341 CegarLoopForPetriNet]: 717 programPoint places, 27 predicate places. [2020-10-09 15:42:32,018 INFO L481 AbstractCegarLoop]: Abstraction has has 744 places, 719 transitions, 1660 flow [2020-10-09 15:42:32,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 15:42:32,018 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 15:42:32,018 INFO L255 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]